Combinatorial solutions providing improved security for the generalized Russian cards problem

DOI10.1007/s10623-012-9770-7zbMath1293.05021arXiv1207.1336MaRDI QIDQ2248647

Douglas R. Stinson, Colleen M. Swanson

Publication date: 27 June 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.1336

zbMATH Keywords

protocols; combinatorial designs; information-theoretic cryptography; Russian cards problem

Mathematics Subject Classification ID

05B05: Combinatorial aspects of block designs

94A60: Cryptography

Related Items

Unnamed Item, 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, A colouring protocol for the generalized Russian cards problem, A case study in almost-perfect security for unconditionally secure communication, Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy, Perfectly secure data aggregation via shifted projections, Large sets with multiplicity, Crossing hands in the Russian cards problem, Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points, Coloured and Directed Designs

Cites Work

• A geometric protocol for cryptography with cards
• Unconditional secure communication: a Russian cards protocol
• The Russian cards problem
• Partitions of the 4-subsets of a 13-set into disjoint projective planes
• Bounds on secret key exchange using a random deal of cards
• Three Steps
• The case of the hidden hand
• Computing and Combinatorics
• Public Communication Based on Russian Cards Protocol: A Case Study
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item