Public communication based on russian cards protocol: a case study

Authors:
Jia He;Zhenhua Duan
Affiliations:
Institute of Computing Theory and Technology, and ISN Laboratory, Xidian University, Xi'an, P.R. China;Institute of Computing Theory and Technology, and ISN Laboratory, Xidian University, Xi'an, P.R. China
Venue:
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Year:
2011

Citing 3
Cited 0

A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Elliptic Curve Public Key Cryptosystems

Elliptic Curve Public Key Cryptosystems
Number-theoretic Algorithms in Cryptography (Translations of Mathematical Monographs)

Number-theoretic Algorithms in Cryptography (Translations of Mathematical Monographs)

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper is concerned with public communication with the Russian Cards protocol. First, a couple of small flaws in [10] are corrected. Then an improved Russian Cards protocol is presented. As a case study, R(6, 31)(6 players and 31 cards) protocol is used to generate a common password for 5 parties who wish to access a shared file over the Internet.