Information Exchange in the Russian Cards Problem

DOI10.1007/978-3-030-91081-5_25zbMath1521.68061MaRDI QIDQ6488451

Sergio Rajsbaum, Unnamed Author, Unnamed Author

Publication date: 21 April 2023

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60)

Related Items (1)

A distributed computing perspective of unconditionally secure information transmission in Russian cards problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Unconditional secure communication: a Russian cards protocol
• The Russian cards problem
• On the chromatic number, colorings, and codes of the Johnson graph
• Combinatorial solutions providing improved security for the generalized Russian cards problem
• A revised transformation protocol for unconditionally secure secret key exchange
• Three Steps
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• One-way communication and error-correcting codes
• Communication Complexity of Wait-Free Computability in Dynamic Networks
• A distributed computing perspective of unconditionally secure information transmission in Russian cards problems

This page was built for publication: Information Exchange in the Russian Cards Problem