Quantum authentication with key recycling
arXiv:1610.03422 · doi:10.1007/978-3-319-56617-7_12
Abstract
We show that a family of quantum authentication protocols introduced in [Barnum et al., FOCS 2002] can be used to construct a secure quantum channel and additionally recycle all of the secret key if the message is successfully authenticated, and recycle part of the key if tampering is detected. We give a full security proof that constructs the secure channel given only insecure noisy channels and a shared secret key. We also prove that the number of recycled key bits is optimal for this family of protocols, i.e., there exists an adversarial strategy to obtain all non-recycled bits. Previous works recycled less key and only gave partial security proofs, since they did not consider all possible distinguishers (environments) that may be used to distinguish the real setting from the ideal secure quantum channel and secret key resource.
38+17 pages, 13 figures. v2: constructed ideal secure channel and secret key resource have been slightly redefined; also added a proof in the appendix for quantum authentication without key recycling that has better parameters and only requires weak purity testing codes
References in corpus (8)
- Evenly distributed unitaries: on the structure of unitary designs
- Multiqubit Clifford groups are unitary 3-designs
- Interactive Proofs For Quantum Computations
- Cryptographic security of quantum key distribution
- Efficient Simulation for Quantum Message Authentication
- Universally composable privacy amplification against quantum adversaries
- New security notions and feasibility results for authentication of quantum data
- Quantum Authentication and Encryption with Key Recycling
Cited by in corpus (16)
- Advances in Quantum Cryptography
- Security in Quantum Cryptography
- A quantum network stack and protocols for reliable entanglement-based networks
- Modular architectures for quantum networks
- Unforgeable Quantum Encryption
- Catalytic quantum randomness
- The Universal Composable Security of Quantum Message Authentication with Key Recyling
- Entanglement generation secure against general attacks
- Authenticated teleportation and verification in a noisy network
- Composable and Finite Computational Security of Quantum Message Transmission
- Composable secure multi-client delegated quantum computation
- Can you sign a quantum state?
- Simple proof of confidentiality for private quantum channels in noisy environments
- Quantum Authentication and Encryption with Key Recycling
- Qubit-based Unclonable Encryption with Key Recycling
- On the Security of Password-Authenticated Quantum Key Exchange