Asynchronous perfectly secure communication over one-time pads

DOI10.1007/11523468_18MaRDI QIDQ5716775zbMATH OpenOpenAlexFDO

Authors Giovanni Di Crescenzo, Aggelos Kiayias

Publication date 10 January 2006

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

Full work available at URL https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Distributed systems (68M14) Data encryption (aspects in computer science) (68P25)

Recommendations

• On the security and composability of the one time pad
• ONE-TIME PAD CRYPTOGRAPHY
• One-time pads without prior encounter
• How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\)
• Asynchronous secure communication tolerating mixed adversaries

Cited in

(5)

• Cryptography with One-Way Communication
• Solving the at-most-once problem with nearly optimal effectiveness
• Asynchronous secure communication tolerating mixed adversaries
• On the security and composability of the one time pad
• One-time pads without prior encounter

This page was built for publication: Asynchronous perfectly secure communication over one-time pads

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