Quantum Homomorphic Encryption for Polynomial-Sized Circuits
- 21 July 2016
- book chapter
- Published by Springer Nature
- p. 3-32
Abstract
No abstract availableKeywords
All Related Versions
This publication has 40 references indexed in Scilit:
- Quantum computing on encrypted dataNature Communications, 2014
- Symmetric quantum fully homomorphic encryption with perfect securityQuantum Information Processing, 2013
- Quantum Walks with Encrypted DataPhysical Review Letters, 2012
- BLIND QUANTUM COMPUTATIONInternational Journal of Quantum Information, 2006
- Evaluating 2-DNF Formulas on Ciphertexts2005
- Private information retrievalJournal of the ACM, 1998
- Theory of fault-tolerant quantum computationPhysical Review A, 1998
- Bounded-width polynomial-size branching programs recognize exactly those languages in NC1Journal of Computer and System Sciences, 1989
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978