How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\)

DOI10.1007/s11047-014-9454-5zbMath1334.94071OpenAlexW2048812146MaRDI QIDQ268461

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

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

unconditional securityquantum cryptographykey-recyclingprivate-key encryption

Mathematics Subject Classification ID

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

Related Items (4)

Block encryption of quantum messages ⋮ Optimal attacks on qubit-based quantum key recycling ⋮ Quantum Authentication and Encryption with Key Recycling ⋮ Quantum Authentication with Key Recycling

Cites Work

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

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