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

	Hash-based signatures Joost Rijneveld Radboud University, Nijmegen, The Netherlands Post-quantum cryptography DocID: 1xVpf - View Document
	Tenth International Conference on Post-Quantum Cryptography PQCrypto 2019 Chongqing, China, May 8–10, 2019 pqcrypto2019.org DocID: 1xVmD - View Document
	Implementing Post-Quantum Cryptography on the Cortex M4 Matthias Kannwischer, Joost Rijneveld, Peter Schwabe, and Ko Stoffelen Radboud University, Nijmegen, The Netherlands DocID: 1xVaG - View Document
	Practical Post-Quantum Cryptography for Trusted Computing Matthias J. Kannwischer, PhD Student Workshop on Trusted Computing and its Applications 25 January 2018 DocID: 1xTFq - View Document
	F R A U N H O F E R I N S T I T U T E F O R S E C U R E I N F O R M AT I O N T E C H N O L O G Y White Paper Practical Post-Quantum Cryptography DocID: 1vqNn - View Document