I 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.
A Survey on Homomorphic Encryption Schemes: Theory and Implementation
11–20 of 22 posts
Re: A Survey on Homomorphic Encryption Schemes: Theory and Implementation
#12I 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…
Re: A Survey on Homomorphic Encryption Schemes: Theory and Implementation
#13Are 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.
I always thought FHE was only good if you can fully unroll your "fixed-length" computation, and even then you can only use each "program" once without compromising security.
Re: A Survey on Homomorphic Encryption Schemes: Theory and Implementation
#14Earlier 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.
Aren't there MASSIVE (read: showstopper) complications when you want to use FHE for "looping" computations? I always thought FHE was only good if you can fully unroll your "fixed-length" computation, and even then you can only use each "program" once without compromising security.
Re: A Survey on Homomorphic Encryption Schemes: Theory and Implementation
#15Earlier quoted context omitted.
Aren't there MASSIVE (read: showstopper) complications when you want to use FHE for "looping" computations? I always thought FHE was only good if you can fully unroll your "fixed-length" computation, and even then you can only use each "program" once without compromising security.
Hmm so it doesn't work well with variable length data?
Every time you want to run a computation on your FHE-enabled VPS you would need to upload data proportional to the maximum number of operations in the computation. Otherwise, re-running the same computation with a different input gives away information about both of your inputs and about the computation.
Re: A Survey on Homomorphic Encryption Schemes: Theory and Implementation
#16I 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.
this is the weirdest mishmash of hot buzzwords. what does generalized AI have to do with encryption? are you imagining that generalized AI would be magically able to crack RSA or whatever?
Re: A Survey on Homomorphic Encryption Schemes: Theory and Implementation
#17I 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
#18Earlier 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.
Aren't there MASSIVE (read: showstopper) complications when you want to use FHE for "looping" computations? I always thought FHE was only good if you can fully unroll your "fixed-length" computation, and even then you can only use each "program" once without compromising security.
Re: A Survey on Homomorphic Encryption Schemes: Theory and Implementation
#19Earlier quoted context omitted.
Aren't there MASSIVE (read: showstopper) complications when you want to use FHE for "looping" computations? I always thought FHE was only good if you can fully unroll your "fixed-length" computation, and even then you can only use each "program" once without compromising security.
The short answer is yes. There are some (slow) ways to fix this: https://people.csail.mit.edu/nickolai/papers/goldwasser-we.p...
In particular the "Extractable Witness Encryption" conjecture is impossible under a reasonable falsifiable assumption: https://pdfs.semanticscholar.org/8587/dba4ff31e8118e9bd5914a...
Under that assumption, general purpose differing-inputs obfuscation cannot exist.
The way I understand it, FHE being applicable to anything other than "unwrapping a path through a circuit" seems implausible. Any claims of arbitrary encrypted computation should be viewed with the highest dose of skepticism.
Re: A Survey on Homomorphic Encryption Schemes: Theory and Implementation
#20Awesome to see their work getting attention! These guys all put in long hours and love what they do.