3 ms·
You can think of FHE as just "you can compute arbitrary polynomials over ciphertexts". You can't exactly get conditional execution using polynomials. Most peopl
by doomrobo 6y ago
You can think of FHE as just "you can compute arbitrary polynomials over ciphertexts". You can't exactly get conditional execution using polynomials. Most people instead think of FHE computation as "arithmetic circuits".
Also, some schemes offer extra stuff for free. BFV (https://eprint.iacr.org/2012/078 https://eprint.iacr.org/2012/078) for example lets you compute Frobenius endomorphisms very cheaply. That is, given ciphertext c, you can compute c^q without having to do log(q) many squarings, where q is the characteristic of your ring.
- h0l0cube 6y agoCan you think of a practical use for something like this? Perhaps there's a need to keep an algorithm secret, but also the client wishes to keep their inputs secret?
- bawolff 6y ago> Perhaps there's a need to keep an algorithm secret, but also the client wishes to keep their inputs secret? That is basically the problem statement that FHE is trying to solve.
- doomrobo 6y agoYup that's the idea. I give an example in another comment https://news.ycombinator.com/item?id=26421172 https://news.ycombinator.com/item?id=26421172