Unconditional secure communication: a Russian cards protocol

DOI10.1007/S10878-009-9252-7zbMATH Open1195.94053OpenAlexW2027785398MaRDI QIDQ987501FDOQ987501

Authors Zhenhua Duan, Chen Yang 

Publication date 13 August 2010

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-009-9252-7

zbMATH Keywords

deleting rulepicking ruleRussian Cards problem

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• 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
• scientific article; zbMATH DE number 437574
• A case study in almost-perfect security for unconditionally secure communication
• Unconditionally Secure Key Agreement Protocol
• scientific article; zbMATH DE number 2230917
• On perfectly secure communication over arbitrary networks
• UNCONDITIONALLY SECURE CONFERENCE KEY DISTRIBUTION: SECURITY NOTIONS, BOUNDS AND CONSTRUCTIONS
• Cryptography for Unconditionally Secure Message Transmission in Networks (Invited Talk)
• Unconditionally secure rational secret sharing in standard communication networks

Cites work

• scientific article; zbMATH DE number 5575521 (Why is no real title available?)
• scientific article; zbMATH DE number 2123741 (Why is no real title available?)
• scientific article; zbMATH DE number 2230917 (Why is no real title available?)
• A decision procedure for propositional projection temporal logic with infinite models
• A method for obtaining digital signatures and public-key cryptosystems
• Bounds on secret key exchange using a random deal of cards
• Computations with a deck of cards
• Computing and Combinatorics
• Framed temporal logic programming
• The Russian cards problem
• The case of the hidden hand

Cited in

(16)

• Combinatorial solutions providing improved security for the generalized Russian cards problem
• Information Exchange in the Russian Cards Problem
• The Russian cards problem
• Erotetic epistemic logic in private communication protocol
• A colouring protocol for the generalized Russian cards problem
• Additional constructions to solve the generalized Russian cards problem using combinatorial designs
• Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy
• Public communication based on Russian cards protocol: a case study
• 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
• Generalized Russian Cards Problem
• A case study in almost-perfect security for unconditionally secure communication
• The case of the hidden hand
• Linear time-dependent constraints programming with MSVL
• Crossing hands in the Russian cards problem
• Efficient card-based protocols for generating a hidden random permutation without fixed points

Describes a project that uses

Uses Software

• SPIN

This page was built for publication: Unconditional secure communication: a Russian cards protocol

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