Re:Fully Homomorphic Encryption Using Ideal Lattices (2009) ...
by throwawaymath on Friday November 15, 2019 @03:47PM
(#21548598)
This came out of Gentry's PhD thesis under Dan Boneh, for which Gentry won the ACM Doctoral Dissertation and Grace Murray Hopper awards, and later the MacArthur Prize. It was the first demonstration of fully homomorphic encryption, and therefore resolved a very large open problem in theoretical cryptography.
Re:Fully Homomorphic Encryption Using Ideal Lattices (2009) ...
by KenoFischer on Friday November 15, 2019 @04:06PM
(#21548771)
Depends on the scheme and your security parameters. The best known ones we have are probably 5-6 orders of magnitude slower than plaintext in the best case (obviously the worst case is much worse).
Re:Fully Homomorphic Encryption Using Ideal Lattices (2009) ...
by badrabbit on Saturday November 16, 2019 @03:09AM
(#21551591)
Also, how much slower both in terms of throughput and latency. Low latency Low throughput is not so bad for some applications as would high latency high throughput for others.
Re:Fully Homomorphic Encryption Using Ideal Lattices (2009) ...
by stuxnet79 on Friday November 15, 2019 @04:27PM
(#21548930)
More than a few. Also, all the benchmark algorithms I've seen in papers have been trivial so this is very much still an active area of research. The idea is tantalizing though, and I'm looking forward to new breakthroughs in this space.