Computational Security of Quantum Encryption
arXiv:1602.01441 · doi:10.1007/978-3-319-49175-2_3
Abstract
Quantum-mechanical devices have the potential to transform cryptography. Most research in this area has focused either on the information-theoretic advantages of quantum protocols or on the security of classical cryptographic schemes against quantum attacks. In this work, we initiate the study of another relevant topic: the encryption of quantum data in the computational setting. In this direction, we establish quantum versions of several fundamental classical results. First, we develop natural definitions for private-key and public-key encryption schemes for quantum data. We then define notions of semantic security and indistinguishability, and, in analogy with the classical work of Goldwasser and Micali, show that these notions are equivalent. Finally, we construct secure quantum encryption schemes from basic primitives. In particular, we show that quantum-secure one-way functions imply IND-CCA1-secure symmetric-key quantum encryption, and that quantum-secure trapdoor one-way permutations imply semantically-secure public-key quantum encryption.
arXiv comment31 pages, 3 figures
References in corpus (13)
- Universal blind quantum computation
- Random Oracles in a Quantum World
- Randomizing quantum states: Constructions and applications
- Optimal Encryption of Quantum Bits
- Quantum Cryptography Beyond Quantum Key Distribution
- Quantum Copy-Protection and Quantum Money
- Universally Composable Quantum Multi-Party Computation
- Quantum homomorphic encryption for circuits of low -gate complexity
- Quantum one-time programs
- Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
- Delegating Private Quantum Computations
- Secure two-party quantum evaluation of unitaries against specious adversaries
- Quantum entropic security and approximate quantum encryption