Quantum authentication with key recycling
From MaRDI portal
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.
Recommendations
- A Quantum Cipher with Near Optimal Key-Recycling
- Improving classical authentication over a quantum channel
- New security notions and feasibility results for authentication of quantum data
- Quantum Authenticated Key Distribution
- Quantum authentication and encryption with key recycling. Or: how to re-use a one-time pad even if \(\mathsf{P}= \mathsf{NP}\) -- safely \& feasibly
Cites work
- A Quantum Cipher with Near Optimal Key-Recycling
- Actively secure two-party evaluation of any quantum operation
- Authentication Theory/Coding Theory
- Communication Theory of Secrecy Systems*
- Constructive cryptography -- a new paradigm for security definitions and proofs
- Efficient simulation for quantum message authentication
- From Indifferentiability to Constructive Cryptography (and Back)
- Generalized privacy amplification
- How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\)
- scientific article; zbMATH DE number 6765508 (Why is no real title available?)
- Key Recycling in Authentication
- New hash functions and their use in authentication and set equality
- New security notions and feasibility results for authentication of quantum data
- Quantum authentication and encryption with key recycling. Or: how to re-use a one-time pad even if \(\mathsf{P}= \mathsf{NP}\) -- safely \& feasibly
- Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\)
- Quantum cryptography: public key distribution and coin tossing
- Quantum non-malleability and authentication
- Quantum one-time programs. (Extended abstract)
- The combinatorics of authentication and secrecy codes
- Theory of Cryptography
- Uncloneable encryption
- Unconditionally Secure Key Distribution in Higher Dimensions by Depolarization
- Universal hashing and authentication codes
- Universally composable quantum multi-party computation
Cited in
(25)- New security notions and feasibility results for authentication of quantum data
- Optimal attacks on qubit-based quantum key recycling
- Qubit authentication
- High-dimensional quantum threshold anonymous identity authentication scheme
- Comment on ``A novel quantum deniable authentication protocol without entanglement
- A short review on quantum identity authentication protocols: how would Bob know that he is talking with Alice?
- Quantum key distribution using universal hash functions over finite fields
- High-efficient quantum key agreement protocol with entanglement measure
- Composable and finite computational security of quantum message transmission
- Verifiable quantum key exchange with authentication
- Block encryption of quantum messages
- Efficient simulation for quantum message authentication
- Study on the security of the authentication scheme with key recycling in QKD
- Unconditionally-secure and reusable public-key authentication
- Quantum Vernam cipher
- Security Aspects of the Authentication Used in Quantum Cryptography
- Quantum authentication with unitary coding sets
- Robust message authentication over a collective-noise channel
- Quantum authentication and encryption with key recycling. Or: how to re-use a one-time pad even if \(\mathsf{P}= \mathsf{NP}\) -- safely \& feasibly
- A Quantum Cipher with Near Optimal Key-Recycling
- Quantum ciphertext authentication and key recycling with the trap code
- Dispelling myths on superposition attacks: formal security model and attack analyses
- Pseudorandom isometries
- Authentication of continuous-variable quantum messages
- An efficient combination of quantum error correction and authentication
This page was built for publication: Quantum authentication with key recycling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270367)
