Quantum authentication and encryption with key recycling. Or: how to re-use a one-time pad even if P= NP -- safely \& feasibly

DOI10.1007/978-3-319-56617-7_11zbMATH Open1415.94429OpenAlexW2534327730MaRDI QIDQ5270366FDOQ5270366

Louis Salvail, Serge Fehr

Publication date: 23 June 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-319-56617-7_11

Recommendations

• How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\)
• A Quantum Cipher with Near Optimal Key-Recycling
• Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\)
• Quantum authentication with key recycling
• Quantum key recycling with 8-state encoding (The quantum one-time pad is more interesting than we thought)

Mathematics Subject Classification ID

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

Cites Work

• Quantum cryptography: public key distribution and coin tossing
• 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 Vernam cipher
• A Quantum Cipher with Near Optimal Key-Recycling
• The Operational Meaning of Min- and Max-Entropy
• SECURITY OF QUANTUM KEY DISTRIBUTION
• Randomness is linear in space
• Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
• Correcting errors without leaking partial information
• Secure Identification and QKD in the Bounded-Quantum-Storage Model
• Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker
• New security notions and feasibility results for authentication of quantum data
• One-Sided Device-Independent QKD and Position-Based Cryptography from Monogamy Games

Cited In (13)

• Block encryption of quantum messages
• Title not available (Why is that?)
• Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\)
• A Quantum Cipher with Near Optimal Key-Recycling
• Quantum Vernam cipher
• Quantum Authentication with Key Recycling
• Study on the security of the authentication scheme with key recycling in QKD
• Quantum key distribution scheme with key recycling in integrated optical network
• Secure mutual authentication quantum key agreement scheme for two-party setting with key recycling
• Uncloneable encryption
• Optimal attacks on qubit-based quantum key recycling
• Two-way unclonable encryption with a vulnerable sender
• Quantum Key Recycling with 8-state encoding (The Quantum One-Time Pad is more interesting than we thought)

This page was built for publication: Quantum authentication and encryption with key recycling. Or: how to re-use a one-time pad even if \(\mathsf{P}= \mathsf{NP}\) -- safely \& feasibly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270366)