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

DOI10.1016/j.tcs.2023.113761OpenAlexW3091268486MaRDI QIDQ5925684

Publication date: 24 March 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113761

zbMATH Keywords

constant weight codes Johnson graphs Russian cards problem information theoretic security combinatorial cryptography

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
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
The renaming problem in shared memory systems: an introduction
A geometric protocol for cryptography with cards
A case study in almost-perfect security for unconditionally secure communication
Distinct solution to a linear congruence
Some new distance-4 constant weight codes
Unconditional secure communication: a Russian cards protocol
The Russian cards problem
Bounds on secret key exchange using a random deal of cards
On the chromatic number, colorings, and codes of the Johnson graph
Arithmetic-progression-weighted subsequence sums
Combinatorial solutions providing improved security for the generalized Russian cards problem
A note on coloring vertex-transitive graphs
A revised transformation protocol for unconditionally secure secret key exchange
A new table of constant weight codes of length greater than 28
Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects
Three Steps
The Automorphism Group of a Johnson Graph
The topological structure of asynchronous computability
A new table of constant weight codes
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Erdős–Ko–Rado Theorems: Algebraic Approaches
Renaming in an asynchronous environment
A combinatorial characterization of the distributed 1-solvable tasks
One-way communication and error-correcting codes
Impossibility of distributed consensus with one faulty process
Reaching Agreement in the Presence of Faults
Lower bounds for constant weight codes
The zero-error side information problem and chromatic numbers (Corresp.)
Cyclic Spaces for Grassmann Derivatives and Additive Theory
Additive group theory—A progress report
Asynchronous Agreement and Its Relation with Error-Correcting Codes
Unconditionally secure key agreement and the intrinsic conditional information
Communication Complexity of Wait-Free Computability in Dynamic Networks
The Complexity Gap between Consensus and Safe-Consensus
On the addition of residue classes mod p
A distributed computing perspective of unconditionally secure information transmission in Russian cards problems

This page was built for publication: A distributed computing perspective of unconditionally secure information transmission in Russian cards problems