Unforgeable quantum encryption
From MaRDI portal
Abstract: We study the problem of encrypting and authenticating quantum data in the presence of adversaries making adaptive chosen plaintext and chosen ciphertext queries. Classically, security games use string copying and comparison to detect adversarial cheating in such scenarios. Quantumly, this approach would violate no-cloning. We develop new techniques to overcome this problem: we use entanglement to detect cheating, and rely on recent results for characterizing quantum encryption schemes. We give definitions for (i.) ciphertext unforgeability , (ii.) indistinguishability under adaptive chosen-ciphertext attack, and (iii.) authenticated encryption. The restriction of each definition to the classical setting is at least as strong as the corresponding classical notion: (i) implies INT-CTXT, (ii) implies IND-CCA2, and (iii) implies AE. All of our new notions also imply QIND-CPA privacy. Combining one-time authentication and classical pseudorandomness, we construct schemes for each of these new quantum security notions, and provide several separation examples. Along the way, we also give a new definition of one-time quantum authentication which, unlike all previous approaches, authenticates ciphertexts rather than plaintexts.
Recommendations
Cited in
(24)- scientific article; zbMATH DE number 7651031 (Why is no real title available?)
- On security notions for encryption in a quantum world
- IND-secure quantum symmetric encryption based on point obfuscation
- Block encryption of quantum messages
- Quantum encryption with certified deletion
- Quantum-access-secure message authentication via blind-unforgeability
- scientific article; zbMATH DE number 7087308 (Why is no real title available?)
- Public-key encryption with quantum keys
- QCB is blindly unforgeable
- On the post-quantum security of classical authenticated encryption schemes
- Efficient simulation of random states and random unitaries
- Nonmalleable encryption of quantum information
- Semantic security and indistinguishability in the quantum world
- Composable and finite computational security of quantum message transmission
- ENCRYPTION OF QUANTUM INFORMATION
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- Pseudorandom isometries
- Quantum indistinguishability for public key encryption
- Quantum non-malleability and authentication
- Unclonable encryption, revisited
- Quantum security of grain-128/grain-128a stream cipher against HHL algorithm
- Relationships between quantum IND-CPA notions
- On the feasibility of unclonable encryption, and more
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
This page was built for publication: Unforgeable quantum encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653105)
