A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
From MaRDI portal
Publication:5918638
DOI10.1007/978-3-030-79527-6_16OpenAlexW3173369058MaRDI QIDQ5918638
Publication date: 22 March 2022
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.13644
constant weight codesJohnson graphsRussian cards probleminformation theoretic securitycombinatorial cryptography
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Related Items (1)
Cites Work
- 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
- A geometric protocol for cryptography with cards
- A case study in almost-perfect security for unconditionally secure communication
- Some new distance-4 constant weight codes
- 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
- Three Steps
- The Automorphism Group of a Johnson Graph
- The topological structure of asynchronous computability
- Erdős–Ko–Rado Theorems: Algebraic Approaches
- Renaming in an asynchronous environment
- 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
- Communication Complexity of Wait-Free Computability in Dynamic Networks
- Constant factor approximation for balanced cut in the PIE model
- The Complexity Gap between Consensus and Safe-Consensus
This page was built for publication: A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
