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.
This research is supported by the NSFC Grant No. 60910004, 60873018, 91018010, 61003078 and 61003079, 973 Program Grant No.2010CB328102 and SRFDP Grant No.200807010012 and ISN1102001.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cryriac, A., Murali Krishnan, K.: Lower Bound for the Communication Complexity of the Russian Cards Problem. CoRR abs/0805.1974 (2008)
Menezes, A.J.: Elliptic Curve Public Key Cryptosystems. Springer, Heidelberg (1993) ISBN: 9780792393689
Fischer, M.J., Wright, R.N.: Bounds on Secret Key Exchange Using a Random Deal of Cards. Journal of Cryptography 9(2), 71–99 (1996)
van Ditmarsch, H.: The Russian Cards Problem: a Case Study in Cryptography with Public Announcements. In: Proceedings of AWCL 2002 (Australasian Workshop on Computational Logic) Canberra, pp. 47-67. Technical Report TR2002/6, Department of Computer Science, University of Melbourne (2002)
Makarychev, K.: Logicheskie Voprosy Peredachi Informacii (Logical Issues of Information Transmission). Master’s thesis, Moscow State University, Diplomnaja rabota, part1 (2001)
Albert, M.H., Aldred, R.E.L., Atkinson, M.D., van Ditmarsch, H.P., Handley, C.C.: Safe Communication for Card Players by Combinatorial Designs for Two-step Protocols. Australasian Journal of Combinatorics 33, 33–46 (2005)
National Institute of Standards and Technology, A Proposed Federal Information Processing Standard for Digital Signature Standard (DSS), Federal Register, vol. 56(169), pp. 42.980-42.982, (August 30,1991)
Rivest, R., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-key Cryptosystems. Communications of the ACM 21(2), 120–126 (1978)
Vasilenko, O.: Number-theoretic Algorithms in Cryptography (Translations of Mathematical Monographs). American Mathematical Society, Boston (2006)
Duan, Z., Yang, C.: Unconditional Secure Communication: a Russian Cards Protocol. Journal of Combinatorial Optimization 19(4), 501–530 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, J., Duan, Z. (2011). Public Communication Based on Russian Cards Protocol: A Case Study. In: Wang, W., Zhu, X., Du, DZ. (eds) Combinatorial Optimization and Applications. COCOA 2011. Lecture Notes in Computer Science, vol 6831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22616-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-22616-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22615-1
Online ISBN: 978-3-642-22616-8
eBook Packages: Computer ScienceComputer Science (R0)