A Survey on Homomorphic Encryption Schemes: Theory and Implementation
1–10 of 22 posts
Re: A Survey on Homomorphic Encryption Schemes: Theory and Implementation
#2I implemented a Paillier encryption library in Clojure a few months back (which I am currently unable to open-source due to an NDA), and in researching it, I was astounded by the elegance of some of these schemes. I really hope that HE research continues and becomes the standard in the near-ish future.
Whenever I get a free couple weekends, I want to port IBM's HELib to Clojure, so that I can more easily use it for a Java project.
Re: A Survey on Homomorphic Encryption Schemes: Theory and Implementation
#3I think if anything's going to save us from a generalised AI takeover it's this. Even if encrypting the world doesn't stop them it'll make computation too slow for world domination.
Re: A Survey on Homomorphic Encryption Schemes: Theory and Implementation
#4Are there any known PHE or FHE schemes that can run a full blown virtual machine ?
Re: A Survey on Homomorphic Encryption Schemes: Theory and Implementation
#5Are there any known PHE or FHE schemes that can run a full blown virtual machine ?
All FHE schemes can run a full-blown virtual machine, but you might not live long enough to see Ubuntu finish booting up.
Re: A Survey on Homomorphic Encryption Schemes: Theory and Implementation
#6Are there any known PHE or FHE schemes that can run a full blown virtual machine ?
All FHE schemes can run a full-blown virtual machine, but you might not live long enough to see Ubuntu finish booting up.
What are the time complexities like?
Do they actually do better than "factor the RSA key, then compute the output, then re-encrypt"?
Re: A Survey on Homomorphic Encryption Schemes: Theory and Implementation
#7I think if anything's going to save us from a generalised AI takeover it's this. Even if encrypting the world doesn't stop them it'll make computation too slow for world domination.
If I had $$$$ to fund one scientific endeavor, it'd certainly be HE hands down.
There are a million different ways we're imminently hurtling down an empty abyss, and obviously if I was an inundated Texan or a general I might be more concerned about the environmental or nuclear apocalypse, but as a programmer the Cloud apocalypse is what concerns me the most.
Re: A Survey on Homomorphic Encryption Schemes: Theory and Implementation
#8Earlier quoted context omitted.
All FHE schemes can run a full-blown virtual machine, but you might not live long enough to see Ubuntu finish booting up.
What are the time complexities like? Do they actually do better than "factor the RSA key, then compute the output, then re-encrypt"?
The paper at http://www.shoup.net/papers/helib.pdf should give you an idea of what goes in a HE scheme. They also report performance of multiplying two 1024x1024 matrices: 473 seconds.
Re: A Survey on Homomorphic Encryption Schemes: Theory and Implementation
#9is one of these used by Numerai ? https://medium.com/numerai/encrypted-data-for-efficient-mark...
Re: A Survey on Homomorphic Encryption Schemes: Theory and Implementation
#10I think if anything's going to save us from a generalised AI takeover it's this. Even if encrypting the world doesn't stop them it'll make computation too slow for world domination.
Can you help a newcomer to this understand how HE could help prevent a generalised AI takeover? If it's generalized AI that is optimizing efficiency, wouldn't it quickly realize the large gain to be made by turning off HE? Or is that not possible?