Unconditional secure communication: a Russian cards protocol
From MaRDI portal
Publication:987501
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
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
- A method for obtaining digital signatures and public-key cryptosystems
- Framed temporal logic programming
- The Russian cards problem
- Bounds on secret key exchange using a random deal of cards
- A decision procedure for propositional projection temporal logic with infinite models
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computations with a deck of cards
- The case of the hidden hand
- Computing and Combinatorics
- Title not available (Why is that?)
Cited In (16)
- Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy
- Additional constructions to solve the generalized Russian cards problem using combinatorial designs
- 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
- Efficient card-based protocols for generating a hidden random permutation without fixed points
- The Russian cards problem
- Linear time-dependent constraints programming with MSVL
- A colouring protocol for the generalized Russian cards problem
- Public communication based on Russian cards protocol: a case study
- Combinatorial solutions providing improved security for the generalized Russian cards problem
- Information Exchange in the Russian Cards Problem
- Crossing hands in the Russian cards problem
- Erotetic epistemic logic in private communication protocol
- Generalized Russian Cards Problem
- The case of the hidden hand
- A case study in almost-perfect security for unconditionally secure communication
Uses Software
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)
