Bounds on secret key exchange using a random deal of cards

zbMath0851.94018MaRDI QIDQ1916027

Rebecca N. Wright, Michael J. Fischer

Publication date: 28 August 1996

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

perfect secrecy; multiparty protocols; secret key exchange

Mathematics Subject Classification ID

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

Related Items

Unnamed Item, Unnamed Item, Six-Card Secure AND and Four-Card Secure XOR, A distributed computing perspective of unconditionally secure information transmission in Russian cards problems, A colouring protocol for the generalized Russian cards problem, Additional constructions to solve the generalized Russian cards problem using combinatorial designs, A geometric protocol for cryptography with cards, A case study in almost-perfect security for unconditionally secure communication, To know or not to know: Epistemic approaches to security protocol verification, Unconditional secure communication: a Russian cards protocol, Characterization of optimal key set protocols, Positive announcements, Combinatorial solutions providing improved security for the generalized Russian cards problem, A revised transformation protocol for unconditionally secure secret key exchange, Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points, Three Steps, AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT, The case of the hidden hand