Quantum authentication with key recycling

DOI10.1007/978-3-319-56617-7_12zbMATH Open1415.94470arXiv1610.03422OpenAlexW2530225612MaRDI QIDQ5270367FDOQ5270367

Authors: Christopher Portmann 

Publication date: 23 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1610.03422

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

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Quantum cryptography: public key distribution and coin tossing
• New hash functions and their use in authentication and set equality
• Key Recycling in Authentication
• Communication Theory of Secrecy Systems*
• Generalized privacy amplification
• Theory of Cryptography
• Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\)
• How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\)
• 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
• Authentication Theory/Coding Theory
• Universal hashing and authentication codes
• Actively secure two-party evaluation of any quantum operation
• The combinatorics of authentication and secrecy codes
• Quantum one-time programs. (Extended abstract)
• Uncloneable encryption
• Universally composable quantum multi-party computation
• Unconditionally Secure Key Distribution in Higher Dimensions by Depolarization
• Constructive cryptography -- a new paradigm for security definitions and proofs
• Quantum non-malleability and authentication
• New security notions and feasibility results for authentication of quantum data
• Title not available (Why is that?)
• From Indifferentiability to Constructive Cryptography (and Back)
• Efficient simulation for quantum message authentication

Cited In (23)

• Qubit authentication
• 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-dimensional quantum threshold anonymous identity authentication scheme
• Comment on ``A novel quantum deniable authentication protocol without entanglement
• Block encryption of quantum messages
• A Quantum Cipher with Near Optimal Key-Recycling
• Robust message authentication over a collective-noise channel
• Quantum authentication with unitary coding sets
• Dispelling myths on superposition attacks: formal security model and attack analyses
• Security Aspects of the Authentication Used in Quantum Cryptography
• Efficient simulation for quantum message authentication
• Quantum Vernam cipher
• 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 ciphertext authentication and key recycling with the trap code
• Verifiable quantum key exchange with authentication
• High-efficient quantum key agreement protocol with entanglement measure
• Study on the security of the authentication scheme with key recycling in QKD
• Composable and finite computational security of quantum message transmission
• Unconditionally-secure and reusable public-key authentication
• Pseudorandom isometries
• New security notions and feasibility results for authentication of quantum data
• Optimal attacks on qubit-based quantum key recycling

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)