Live data from Hacker News

The Beginner's Textbook for Fully Homomorphic Encryption

arxiv.org

11–20 of 51 posts

Re: The Beginner's Textbook for Fully Homomorphic Encryption

#15
post #11

Funny thing is Since neural networks are differentiable, they can be homomorphically encrypted! That’s right, your LLM can be made to secretly produce stuff hehe

That's pretty cool, but isn't any computable function can be computed via FHE, so I'm not sure the differentiable part is necessary.

Re: The Beginner's Textbook for Fully Homomorphic Encryption

#16
post #13
post #12

Is the title broken? I see “Unified Line and Paragraph Detection by Graph Convolutional Networks (2022)”

I see the same, and there is a posting of that title (and linking to the correct paper) also on HN frontpage. wondering what's going on.

You're not alone. I saw that FHE paper earlier, so... what's going on?

Re: The Beginner's Textbook for Fully Homomorphic Encryption

#18
post #12

Is the title broken? I see “Unified Line and Paragraph Detection by Graph Convolutional Networks (2022)”

Sorry about this. That was my screwup.

There were (at least) two posts from arxiv.org on the front page at the time, and when I was updating the title on the other one I must have applied it to this one instead. I've fixed it now and re-upped it onto the front page so I can have its full exposure on the front page with its correct title.

Re: The Beginner's Textbook for Fully Homomorphic Encryption

#19
post #3

I was under the impression that, for any FHE scheme with "good" security, (a) there was a finite and not very large limit to the number of operations you could do on encrypted data before the result became undecryptable, and (b) each operation on the encrypted side was a lot more expensive than the corresponding operation on plaintext numbers or whatever. Am I wrong? I freely admit I don't know how it's supposed to w…

Both of these are correct-ish. You can do a renornalization that resets the operation counter without decrypting on FHE schemes, so in that sense there is no strict limit on operation count. However, FHE operations are still about 6 orders of magnitude more expensive than normal, so you are not going to be running an LLM, for instance, any time soon. A small classifier maybe.

Does this mean, according to Moore's Law, FHE can operate at speeds from 6 years ago?

Re: The Beginner's Textbook for Fully Homomorphic Encryption

#20
post #19

Earlier quoted context omitted.

Both of these are correct-ish. You can do a renornalization that resets the operation counter without decrypting on FHE schemes, so in that sense there is no strict limit on operation count. However, FHE operations are still about 6 orders of magnitude more expensive than normal, so you are not going to be running an LLM, for instance, any time soon. A small classifier maybe.

Does this mean, according to Moore's Law, FHE can operate at speeds from 6 years ago?

Moore's Law roughly states that we get a doubling of speed every 2 years.

If we're 6 orders of magnitude off, then we need to double our speed 20 times (2^20 = 1,048,576), which would give us speeds approximately in line with 40 years ago. Unless my understanding is completely off.

Post reply on HN