{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:46Z","timestamp":1759637746363},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T00:00:00Z","timestamp":1246320000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1007\/s10878-009-9252-7","type":"journal-article","created":{"date-parts":[[2009,6,29]],"date-time":"2009-06-29T20:14:42Z","timestamp":1246306482000},"page":"501-530","source":"Crossref","is-referenced-by-count":13,"title":["Unconditional secure communication: a Russian Cards protocol"],"prefix":"10.1007","volume":"19","author":[{"given":"Zhenhua","family":"Duan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,6,30]]},"reference":[{"key":"9252_CR1","first-page":"33","volume":"33","author":"MH Albert","year":"2005","unstructured":"Albert MH, Aldred REL, Atkinson MD, van Ditmarsch HP, Handley CC (2005) Safe communication for card players by combinatorial designs for two-step protocols. Australasian J Comb 33:33\u201346","journal-title":"Australasian J Comb"},{"key":"9252_CR2","unstructured":"Atkinson MD, van Ditmarsch HP, Roehling S (2007) Avoiding bias in cards cryptography. CoRR. cs\/0702097"},{"key":"9252_CR3","unstructured":"Cyriac A, Krishnan KM (2008) Lower Bound for the Communication Complexity of the Russian Cards Problem. CoRR. 0805.1974"},{"key":"9252_CR4","series-title":"Lecture Notes in Computer Science","first-page":"246","volume-title":"Proceedings of ICFEM07","author":"T Cong","year":"2007","unstructured":"Cong T, Zhenhua D (2007) Model checking propositional projection temporal logic based on SPIN. In: Proceedings of ICFEM07. Lecture Notes in Computer Science, vol 4789. Springer, Berlin, pp 246\u2013265"},{"issue":"2","key":"9252_CR5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s001459900004","volume":"9","author":"MJ Fischer","year":"1996","unstructured":"Fischer MJ, Wright RN (1996) Bounds on secret key exchange using a random deal of cards. J Cryptol 9(2):71\u201399","journal-title":"J Cryptol"},{"key":"9252_CR6","volume-title":"The spin model checker: Primer and reference manual","author":"GJ Holzmann","year":"2003","unstructured":"Holzmann GJ (2003) The spin model checker: Primer and reference manual. Addison-Wesley, Berlin"},{"key":"9252_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/b99180","volume-title":"Necessary and sufficient numbers of cards for the transformation protocol","author":"K Koichi","year":"2004","unstructured":"Koichi K, Takaaki M, Takao N (2004) Necessary and sufficient numbers of cards for the transformation protocol. Lecture Notes in Computer Science, vol\u00a03106. Springer, Berlin, pp\u00a092\u2013101"},{"issue":"1","key":"9252_CR8","first-page":"89","volume":"55","author":"R Ramanujam","year":"2001","unstructured":"Ramanujam R, Suresh SP (2001) Information based reasoning about security protocols. Electron Notes Theor Comput Sci 55(1):89\u2013104","journal-title":"Electron Notes Theor Comput Sci"},{"issue":"2","key":"9252_CR9","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R Rivest","year":"1978","unstructured":"Rivest R, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120\u2013126","journal-title":"Commun ACM"},{"key":"9252_CR10","unstructured":"Roehling S (2005) Cards and cryptography. Report in partial fulfilment of MSc in Computer Science, University of Otago"},{"key":"9252_CR11","unstructured":"Makarychev K (2001) Logicheskie voprosy peredachi informacii (logical issues of information transmission). Master\u2019s thesis, Moscow State University, Diplomnaja rabota, Part\u00a01"},{"issue":"1\u20132","key":"9252_CR12","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/S0304-3975(00)00409-6","volume":"259","author":"A Stiglic","year":"2001","unstructured":"Stiglic A (2001) Computations with a deck of cards. Theor Comput Sci 259(1\u20132):671\u2013678","journal-title":"Theor Comput Sci"},{"key":"9252_CR13","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1023\/A:1026168632319","volume":"75","author":"HP Ditmarsch van","year":"2003","unstructured":"van Ditmarsch HP (2003) The Russian Cards problem. Stud Log 75:31\u201362","journal-title":"Stud Log"},{"issue":"4","key":"9252_CR14","doi-asserted-by":"crossref","first-page":"437","DOI":"10.3166\/jancl.15.437-452","volume":"15","author":"HP Ditmarsch van","year":"2005","unstructured":"van Ditmarsch HP (2005) The case of the hidden hand. J Appl Non-Class Log 15(4):437\u2013452","journal-title":"J Appl Non-Class Log"},{"key":"9252_CR15","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.entcs.2005.07.029","volume":"149","author":"HP Ditmarsch van","year":"2006","unstructured":"van Ditmarsch HP, van der Hoek W, van der Meyden R, Ruan J (2006) Model checking Russian Cards. Electron Notes Theor Comput Sci 149:105\u2013123","journal-title":"Electron Notes Theor Comput Sci"},{"key":"9252_CR16","doi-asserted-by":"crossref","DOI":"10.1090\/mmono\/232","volume-title":"Number-theoretic algorithms in cryptography","author":"O Vasilenko","year":"2006","unstructured":"Vasilenko O (2006) Number-theoretic algorithms in cryptography. American Mathematical Society, Boston. (Translations of Mathematical Monographs)"},{"key":"9252_CR17","first-page":"333","volume":"19","author":"D Zhenhua","year":"2004","unstructured":"Zhenhua D, Koutny M (2004) A framed temporal logic programming language. J Comput Sci Technol 19:333\u2013344","journal-title":"J Comput Sci Technol"},{"issue":"1","key":"9252_CR18","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s00236-007-0062-z","volume":"45","author":"D Zhenhua","year":"2008","unstructured":"Zhenhua D, Cong T, Li Z (2008a) A decision procedure for propositional projection temporal logic with infinite models. Acta Inform 45(1):43\u201378","journal-title":"Acta Inform"},{"key":"9252_CR19","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.scico.2007.09.001","volume":"70","author":"D Zhenhua","year":"2008","unstructured":"Zhenhua D, Xiaoxiao Y, Koutny M (2008b) Framed temporal logic programming. Sci Comput Program 70:31\u201361","journal-title":"Sci Comput Program"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9252-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9252-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9252-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:14Z","timestamp":1559276294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9252-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,30]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["9252"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9252-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,30]]}}}