Classical Homomorphic Encryption for Quantum Circuits
Author:
- Urmila MahadevUMUrmila Mahadev
- 15 December 2020
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 52 (6) , FOCS18-189
Abstract
We present the first leveled fully homomorphic encryption scheme for quantum circuits with classical keys. The scheme allows a classical client to blindly delegate a quantum computation to a quantu...Keywords
Funding Information
- Multidisciplinary University Research Initiative (FA9550-18-1-0161)
- Army Research Office (W911NF-12-1-0541)
- John Templeton Foundation (52536)
- National Science Foundation (W911NF-12-1-0541)
This publication has 20 references indexed in Scilit:
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity2015
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$SIAM Journal on Computing, 2014
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based2013
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller2012
- Fully homomorphic encryption using ideal lattices2009
- Trapdoors for hard lattices and new cryptographic constructions2008
- On lattices, learning with errors, random linear codes, and cryptography2005
- Private quantum channels2002
- New bounds in some transference theorems in the geometry of numbersMathematische Annalen, 1993
- Pseudo-random generation from one-way functions1989