How to re-use a one-time pad safely and almost optimally even if P=NP

DOI10.1007/S11047-014-9454-5MaRDI QIDQ268461zbMATHOpenAlexFDO

Authors Louis Salvail, Ivan B. Damgård, Thomas Brochmann Pedersen

Publication date 15 April 2016

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-014-9454-5

zbMATH Keywords

quantum cryptographyunconditional securitykey-recyclingprivate-key encryption

Mathematics Subject Classification ID

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

Recommendations

• A Quantum Cipher with Near Optimal Key-Recycling
• 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 key recycling with 8-state encoding (The quantum one-time pad is more interesting than we thought)
• SOFSEM 2005: Theory and Practice of Computer Science

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• A Quantum Cipher with Near Optimal Key-Recycling
• A transform of complementary aspects with applications to entropic uncertainty relations
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in cryptology -- EUROCRYPT 2004. International conference on the theory and applications of cryptographic techniques, Interlaken, Switzerland, May 2--6, 2004. Proceedings.
• Constructing locally computable extractors and cryptosystems in the bounded-storage model
• Encryption against storage-bounded adversaries from on-line strong extractors
• Quantum Vernam cipher
• Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\)
• Theory of Cryptography
• Theory of Cryptography
• Theory of cryptography. Second theory of cryptography conference, TCC 2005, Cambridge, MA, USA, February 10--12, 2005. Proceedings.

Cited in

(10)

• Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\)
• Optimal attacks on qubit-based quantum key recycling
• One-time pads cannot be used to improve the efficiency of quantum communication
• Quantum authentication with key recycling
• One-time pads without prior encounter
• Automata, Languages and Programming
• On the feasibility of unclonable encryption, and more
• A Quantum Cipher with Near Optimal Key-Recycling
• Block encryption of quantum messages
• Quantum authentication and encryption with key recycling. Or: how to re-use a one-time pad even if \(\mathsf{P}= \mathsf{NP}\) -- safely \& feasibly

This page was built for publication: How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\)

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