Information Exchange in the Russian Cards Problem

DOI10.1007/978-3-030-91081-5_25MaRDI QIDQ6488451zbMATH OpenFDO

Authors Sergio Rajsbaum

Publication date 21 April 2023

Full work available at URL https://doi.org/10.1007/978-3-030-91081-5_25

Mathematics Subject Classification ID

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

Recommendations

• The Russian cards problem
• Generalized Russian Cards Problem
• 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
• Crossing hands in the Russian cards problem
• A colouring protocol for the generalized Russian cards problem
• Combinatorial solutions providing improved security for the generalized Russian cards problem
• scientific article; zbMATH DE number 438542
• Bounds on secret key exchange using a random deal of cards
• Model checking Russian cards

Cites work

• A case study in almost-perfect security for unconditionally secure communication
• A colouring protocol for the generalized Russian cards problem
• A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
• A geometric protocol for cryptography with cards
• A revised transformation protocol for unconditionally secure secret key exchange
• A secure additive protocol for card players
• Additional constructions to solve the generalized Russian cards problem using combinatorial designs
• Combinatorial solutions providing improved security for the generalized Russian cards problem
• Communication Complexity of Wait-Free Computability in Dynamic Networks
• Erdős-Ko-Rado theorems. Algebraic approaches
• scientific article; zbMATH DE number 437574 (Why is no real title available?)
• scientific article; zbMATH DE number 1925555 (Why is no real title available?)
• scientific article; zbMATH DE number 2230917 (Why is no real title available?)
• On the chromatic number, colorings, and codes of the Johnson graph
• One-way communication and error-correcting codes
• The Russian cards problem
• Three steps
• Unconditional secure communication: a Russian cards protocol

Cited in

(9)

• The Russian cards problem
• Crossing hands in the Russian cards problem
• Model checking Russian cards
• A colouring protocol for the generalized Russian cards problem
• A geometric protocol for cryptography with cards
• Who holds the best card? Secure communication of optimal secret bits
• Erotetic epistemic logic in private communication protocol
• 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

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

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