Generalized Russian Cards Problem

Authors:
Zhenhua Duan;Chen Yang
Affiliations:
Institute of Computing Theory and Technology, Xidian University, Xi'an, China 710071;Institute of Computing Theory and Technology, Xidian University, Xi'an, China 710071
Venue:
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Year:
2009

Citing 8
Cited 1

A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
A framed temporal logic programming language

Journal of Computer Science and Technology
Number-theoretic Algorithms in Cryptography (Translations of Mathematical Monographs)

Number-theoretic Algorithms in Cryptography (Translations of Mathematical Monographs)
Framed temporal logic programming

Science of Computer Programming
A decision procedure for propositional projection temporal logic with infinite models

Acta Informatica
Spin model checker, the: primer and reference manual

Spin model checker, the: primer and reference manual
Model Checking Russian Cards

Electronic Notes in Theoretical Computer Science (ENTCS)
Model checking propositional projection temporal logic based on SPIN

ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering

Compositional verification with stutter-invariant propositional projection temporal logic

ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates Russian Cards problem for the purpose of unconditional secured communication. First, a picking rule and deleting rule as well as safe communication condition are given to deal with the problem with 3 players and 7 cards. Further, the problem is generalized to tackle n players and n (n *** 1) + 1 cards. A new picking rule for constructing the announcement is presented, and a new deleting rule for players to determine each other's cards is formalized. In addition, the safe communication condition is also proved.