Unconditional secure communication: a Russian cards protocol

DOI10.1007/s10878-009-9252-7zbMath1195.94053OpenAlexW2027785398MaRDI QIDQ987501

Chen Yang, Zhenhua Duan

Publication date: 13 August 2010

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-009-9252-7

zbMATH Keywords

deleting rulepicking ruleRussian Cards problem

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

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 ⋮ Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy ⋮ A case study in almost-perfect security for unconditionally secure communication ⋮ Combinatorial solutions providing improved security for the generalized Russian cards problem ⋮ Linear time-dependent constraints programming with MSVL ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems

Uses Software

• SPIN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Russian cards problem
• Bounds on secret key exchange using a random deal of cards
• Framed temporal logic programming
• A decision procedure for propositional projection temporal logic with infinite models
• The case of the hidden hand
• A method for obtaining digital signatures and public-key cryptosystems
• Computing and Combinatorics
• Computations with a deck of cards

This page was built for publication: Unconditional secure communication: a Russian cards protocol