Additional constructions to solve the generalized Russian cards problem using combinatorial designs
From MaRDI portal
Publication:406700
zbMath1408.94965arXiv1401.1526MaRDI QIDQ406700
Colleen M. Swanson, Douglas R. Stinson
Publication date: 9 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.1526
Related Items (7)
Perfectly secure data aggregation via shifted projections ⋮ Crossing hands in the Russian cards problem ⋮ Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy ⋮ Unnamed Item ⋮ A case study in almost-perfect security for unconditionally secure communication ⋮ 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
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
- Unconditional secure communication: a Russian cards protocol
- Partitions of sets of designs on seven, eight and nine points
- The Russian cards problem
- Bounds on secret key exchange using a random deal of cards
- Covering all triples on n marks by disjoint Steiner systems
- A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
- Three Steps
- The case of the hidden hand
- Combinatorial Designs
- Computing and Combinatorics
- Public Communication Based on Russian Cards Protocol: A Case Study
This page was built for publication: Additional constructions to solve the generalized Russian cards problem using combinatorial designs
