Fetching the paper…
Reading the bibliography…
We present the first leveled fully homomorphic encryption scheme for quantum circuits with classical keys.
Pseudo-random generation from one-way functions
Russell Impagliazzo, Leonid A. Levin, and Michael Luby · 1989
Earlier work this paper cites.
New bounds in some transference theorems in the geometry of numbers
Wojciech Banaszczyk · 1993
Earlier work this paper cites.
Private quantum channels
Andris Ambainis, Michele Mosca, Alain Tapp, and Ronald de Wolf · 2000
Earlier work this paper cites.
Creating superpositions that correspond to efficiently integrable probability distributions, 2002
Lov Grover and Terry Rudolph · 2002
Earlier work this paper cites.
Secure assisted quantum computation
Andrew M. Childs · 2005
Earlier work this paper cites.
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev · 2005
Earlier work this paper cites.
Trapdoors for hard lattices and new cryptographic constructions
Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan · 2007
Earlier work this paper cites.
Universal blind quantum computation
Anne Broadbent, Joseph F. Fitzsimons, and Elham Kashefi · 2008
Earlier work this paper cites.
A fully homomorphic encryption scheme
Craig Gentry · 2009
Earlier work this paper cites.
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
Chris Peikert · 2009
Earlier work this paper cites.
Interactive proofs for quantum computations
Dorit Aharonov, Michael Ben-Or, and Elad Eban · 2010
Earlier work this paper cites.
Trapdoors for lattices: Simpler, tighter, faster, smaller
Daniele Micciancio and Chris Peikert · 2011
Cited alongside, same era.
Classical hardness of learning with errors
Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, and Damien Stehl · 2013
Cited alongside, same era.
Lattice-based fhe as secure as pke
Zvika Brakerski and Vinod Vaikuntanathan · 2013
Cited alongside, same era.
Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based
Craig Gentry, Amit Sahai, and Brent Waters · 2013
Cited alongside, same era.
Efficient fully homomorphic encryption from (standard) lwe
Zvika Brakerski and Vinod Vaikuntanathan · 2014
Cited alongside, same era.
Quantum homomorphic encryption for circuits of low t t -gate complexity
Anne Broadbent and Stacey Jeffery · 2015
Cited alongside, same era.
On statistically-secure quantum homomorphic encryption, 2017
Ching-Yi Lai and Kai-Min Chung · 2017
Closest in time.
Flow ambiguity: A path towards classically driven blind quantum computation
Atul Mantri, Tommaso F. Demarie, Nicolas C. Menicucci, and Joseph F. Fitzsimons · 2017
Closest in time.
Limitations on transversal computation through quantum homomorphic encryption, 2017
Michael Newman and Yaoyun Shi · 2017
Closest in time.
Pseudorandomness of ring-lwe for any ring and modulus
Chris Peikert, Oded Regev, and Noah Stephens-Davidowitz · 2017
Closest in time.
Certifiable randomness from a single quantum device
Zvika Brakerski, Paul Christiano, Urmila Mahadev, Umesh Vazirani, and Thomas Vidick · 2018
Closest in time.
Quantum fhe (almost) as secure as classical
Zvika Brakerski · 2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Quantum homomorphic encryption from quantum codes, 2015
Yingkai Ouyang, Si-Hui Tan, and Joseph F. Fitzsimons · 2015
Cited alongside, same era.
A decade of lattice cryptography
Chris Peikert · 2015
Cited alongside, same era.
Quantum Homomorphic Encryption for Polynomial-Sized Circuits
Yfke Dulek, Christian Schaffner, and Florian Speelman · 2016
Cited alongside, same era.
A quantum approach to homomorphic encryption. scientific reports
Si-Hui Tan, Joshua A. Kettlewell, Yingkai Ouyang, Lin Chen, and Joseph F. Fitzsimons · 2016
Cited alongside, same era.
Interactive proofs for quantum computations
Dorit Aharonov, Michael Ben-Or, Elad Eban, and Urmila Mahadev · 2017
Cited alongside, same era.
Fully homomorphic encryption
Zvika Brakerski
Cited in the paper.
Delegated pseudo-secret random qubit generator, 2018
Alexandru Cojocaru, Leo Colisson, Elham Kashefi, and Petros Wallden · 2018
Closest in time.
Classical verification of quantum computations
Urmila Mahadev · 2018
Closest in time.
Trace distance — Wikipedia, the free encyclopedia, 2018
Wikipedia · 2018
Closest in time.
Postquantum zero knowledge in constant rounds
Nir Bitansky and Omri Shmueli · 2019
Closest in time.