How to re-use a one-time pad safely and almost optimally even if P=NP
DOI10.1007/S11047-014-9454-5zbMATH Open1334.94071OpenAlexW2048812146MaRDI QIDQ268461FDOQ268461
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
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
Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- Theory of Cryptography
- Theory of Cryptography
- 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.
- Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\)
- Quantum Vernam cipher
- 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
Cited In (10)
- Block encryption of quantum messages
- 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 authentication and encryption with key recycling. Or: how to re-use a one-time pad even if \(\mathsf{P}= \mathsf{NP}\) -- safely \& feasibly
- Automata, Languages and Programming
- One-time pads without prior encounter
- On the feasibility of unclonable encryption, and more
- Optimal attacks on qubit-based quantum key recycling
- Quantum authentication with key recycling
- One-time pads cannot be used to improve the efficiency of quantum communication
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)
