{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:52:49Z","timestamp":1725598369796},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226151"},{"type":"electronic","value":"9783642226168"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22616-8_16","type":"book-chapter","created":{"date-parts":[[2011,7,29]],"date-time":"2011-07-29T21:25:42Z","timestamp":1311974742000},"page":"192-206","source":"Crossref","is-referenced-by-count":0,"title":["Public Communication Based on Russian Cards Protocol: A Case Study"],"prefix":"10.1007","author":[{"given":"Jia","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenhua","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Cryriac, A., Murali Krishnan, K.: Lower Bound for the Communication Complexity of the Russian Cards Problem. CoRR abs\/0805.1974 (2008)"},{"key":"16_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3198-2","volume-title":"Elliptic Curve Public Key Cryptosystems","author":"A.J. Menezes","year":"1993","unstructured":"Menezes, A.J.: Elliptic Curve Public Key Cryptosystems. Springer, Heidelberg (1993) ISBN: 9780792393689"},{"issue":"2","key":"16_CR3","first-page":"71","volume":"9","author":"M.J. Fischer","year":"1996","unstructured":"Fischer, M.J., Wright, R.N.: Bounds on Secret Key Exchange Using a Random Deal of Cards. Journal of Cryptography\u00a09(2), 71\u201399 (1996)","journal-title":"Journal of Cryptography"},{"key":"16_CR4","unstructured":"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)"},{"key":"16_CR5","unstructured":"Makarychev, K.: Logicheskie Voprosy Peredachi Informacii (Logical Issues of Information Transmission). Master\u2019s thesis, Moscow State University, Diplomnaja rabota, part1 (2001)"},{"key":"16_CR6","first-page":"33","volume":"33","author":"M.H. Albert","year":"2005","unstructured":"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\u00a033, 33\u201346 (2005)","journal-title":"Australasian Journal of Combinatorics"},{"key":"16_CR7","unstructured":"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)"},{"issue":"2","key":"16_CR8","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-key Cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"16_CR9","doi-asserted-by":"crossref","DOI":"10.1090\/mmono\/232","volume-title":"Number-theoretic Algorithms in Cryptography (Translations of Mathematical Monographs)","author":"O. Vasilenko","year":"2006","unstructured":"Vasilenko, O.: Number-theoretic Algorithms in Cryptography (Translations of Mathematical Monographs). American Mathematical Society, Boston (2006)"},{"issue":"4","key":"16_CR10","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10878-009-9252-7","volume":"19","author":"Z. Duan","year":"2010","unstructured":"Duan, Z., Yang, C.: Unconditional Secure Communication: a Russian Cards Protocol. Journal of Combinatorial Optimization\u00a019(4), 501\u2013530 (2010)","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22616-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T16:47:34Z","timestamp":1554223654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22616-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226151","9783642226168"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22616-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}