Bounds on secret key exchange using a random deal of cards
From MaRDI portal
Publication:1916027
zbMath0851.94018MaRDI QIDQ1916027
Rebecca N. Wright, Michael J. Fischer
Publication date: 28 August 1996
Published in: Journal of Cryptology (Search for Journal in Brave)
Related Items (18)
AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT ⋮ Six-Card Secure AND and Four-Card Secure XOR ⋮ Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points ⋮ A colouring protocol for the generalized Russian cards problem ⋮ Additional constructions to solve the generalized Russian cards problem using combinatorial designs ⋮ To know or not to know: Epistemic approaches to security protocol verification ⋮ Unnamed Item ⋮ Characterization of optimal key set protocols ⋮ Unnamed Item ⋮ A geometric protocol for cryptography with cards ⋮ A case study in almost-perfect security for unconditionally secure communication ⋮ Combinatorial solutions providing improved security for the generalized Russian cards problem ⋮ A revised transformation protocol for unconditionally secure secret key exchange ⋮ Unconditional secure communication: a Russian cards protocol ⋮ Positive announcements ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems ⋮ Three Steps ⋮ The case of the hidden hand
This page was built for publication: Bounds on secret key exchange using a random deal of cards
