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

First Page		Document Content
Date: 2018-04-10 03:50:18 Cryptography 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 List Source URL: eprint.iacr.org Download Document from Source Website File Size: 489,28 KB Share Document on Facebook

	An improved compression technique for signatures based on learning with errors Shi Bai and Steven D. Galbraith Department of Mathematics, University of Auckland, New Zealand. DocID: 1xTLZ - View Document
	Practical post-quantum key exchange from the Learning with Errors Problem DocID: 1vdCU - View Document
	Quantum computers and factoring Learning with errors Cryptography from LWE From linear algebra to post-quantum cryptography DocID: 1uiVi - View Document
	FrodoKEM Learning With Errors Key Encapsulation Algorithm Specifications And Supporting Documentation November 30, DocID: 1tCj6 - View Document
	Interpolating Predicate and Functional Encryption from Learning With Errors Shweta Agrawal ∗ DocID: 1taPr - View Document