News for hackers. Stuff that matters.
Re:Fully Homomorphic Encryption (FHE) by ganafagol on Tuesday June 15, 2021 @07:39AM (#27513825)
These are all the same paradigm, in priciple. 2 is a special case of 3 and 1 is a special case of 2. All circuits differing in how powerful the processing nodes are.
Re:Fully Homomorphic Encryption (FHE) by rhindi on Tuesday June 15, 2021 @01:26PM (#27518569)
Yes, in practice however it makes a difference. Consider for example computing the ReLu function for a neural network:

- With boolean circuits you need to run dozens of boolean gates, which means a lot of underlying crypto ops. Works but expensive.

- with arithmetic circuits, you would approximate it using polynomials. Works but not with high precision.

- with functional circuits, you encore the function as a single “bootstrapping” operation. Works in a single crypto op.

Performance / precision tradeoffs will be very different in these 3 cases