Date: 2018-04-10 03:50:18Cryptography Post-quantum cryptography Lattice-based cryptography Models of computation Homeomorphisms Homomorphic encryption Quantum computing Lattice Learning with errors RSA One-time pad Quantum circuit | | Quantum FHE (Almost) As Secure as Classical Zvika Brakerski∗ Abstract Fully homomorphic encryption schemes (FHE) allow to apply arbitrary efficient computation to encrypted data without decrypting it first. In Quantum Add to Reading ListSource URL: eprint.iacr.orgDownload Document from Source Website File Size: 489,28 KBShare Document on Facebook
|