{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:20:01Z","timestamp":1743002401150,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020254"},{"type":"electronic","value":"9783642020261"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02026-1_8","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T16:31:23Z","timestamp":1245256283000},"page":"85-97","source":"Crossref","is-referenced-by-count":1,"title":["Generalized Russian Cards Problem"],"prefix":"10.1007","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","reference":[{"key":"8_CR1","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":"8_CR2","unstructured":"Cyriac, A., Krishnan, K.M.: Lower Bound for the Communication Complexity of the Russian Cards Problem. CoRR, vol. abs\/0805.1974 (2008), \n                      www.arxiv.org"},{"key":"8_CR3","first-page":"333","volume":"19","author":"Z. Duan","year":"2004","unstructured":"Duan, Z., Koutny, M.: A Framed Temporal Logic Programming Language. J. Comput. Sci. Technol.\u00a019, 333\u2013344 (2004)","journal-title":"J. Comput. Sci. Technol."},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00236-007-0062-z","volume":"45","author":"Z. Duan","year":"2008","unstructured":"Duan, Z., Tian, C., Li, Z.: A Decision Procedure for Propositional Projection Temporal Logic with Infinite Models. Acta Informatica\u00a045(1), 43\u201378 (2008)","journal-title":"Acta Informatica"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.scico.2007.09.001","volume":"70","author":"Z. Duan","year":"2008","unstructured":"Duan, Z., Yang, X., Koutny, M.: Frammed Temporal Logic Programming. Science of Computer Programming\u00a070(1), 31\u201361 (2008)","journal-title":"Science of Computer Programming"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s001459900004","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 Cryptology\u00a09(2), 71\u201399 (1996)","journal-title":"Journal of Cryptology"},{"key":"8_CR7","volume-title":"The Spin Model Checker: Primer and Reference Manual","author":"G.J. Holzmann","year":"2003","unstructured":"Holzmann, G.J.: The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, Reading (2003)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-27798-9_12","volume-title":"Computing and Combinatorics","author":"K. Koichi","year":"2004","unstructured":"Koichi, K., Takaaki, M., Takao, N.: Necessary and Sufficient Numbers of Cards for the Transformation Protocol. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 92\u2013101. Springer, Heidelberg (2004)"},{"key":"8_CR9","unstructured":"Makarychev, K.: Logicheskie Voprosy Peredachi Informacii (Logical Issues of Information Transmission). Master\u2019s Thesis, Moscow State University, Diplomnaja rabota, part 1 (2001)"},{"issue":"1","key":"8_CR10","first-page":"89","volume":"55","author":"R. Ramanujam","year":"2001","unstructured":"Ramanujam, R., Suresh, S.P.: Information based Reasoning about Security Protocols. Electronic Notes in Theoretical Computer Science\u00a055(1), 89\u2013104 (2001)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"2","key":"8_CR11","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":"8_CR12","unstructured":"Roehling, S.: Cards and Cryptography. Report in Partial Fulfilment of MSc in Computer Science. University of Otago (2005)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-76650-6_15","volume-title":"Formal Methods and Software Engineering","author":"C. Tian","year":"2007","unstructured":"Tian, C., Duan, Z.: Model Checking Propositional Projection Temporal Logic Based on SPIN. In: Butler, M., Hinchey, M.G., Larrondo-Petrie, M.M. (eds.) ICFEM 2007. LNCS, vol.\u00a04789, pp. 246\u2013265. Springer, Heidelberg (2007)"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1026168632319","volume":"75","author":"H.P. van Ditmarsch","year":"2003","unstructured":"van Ditmarsch, H.P.: The Russian Cards Problem. Studia Logica\u00a075, 31\u201362 (2003)","journal-title":"Studia Logica"},{"issue":"4","key":"8_CR15","doi-asserted-by":"publisher","first-page":"437","DOI":"10.3166\/jancl.15.437-452","volume":"15","author":"H.P. van Ditmarsch","year":"2005","unstructured":"van Ditmarsch, H.P.: The Case of the Hidden Hand. Journal of Applied Non-Classical Logics\u00a015(4), 437\u2013452 (2005)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"8_CR16","first-page":"335","volume":"5","author":"H.P. van Ditmarsch","year":"2005","unstructured":"van Ditmarsch, H.P., van der Hoek, W., Kooi, B.P.: Public Announcements and Belief Expansion. Advances in Modal Logic\u00a05, 335\u2013346 (2005)","journal-title":"Advances in Modal Logic"},{"issue":"2","key":"8_CR17","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.entcs.2005.07.029","volume":"149","author":"H.P. van Ditmarsch","year":"2006","unstructured":"van Ditmarsch, H.P., van der Hoek, W., van der Meyden, R., Ruan, J.: Model Checking Russian Cards. Electronic Notes in Theoretical Computer Science\u00a0149(2), 105\u2013123 (2006)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"8_CR18","unstructured":"Vasilenko, O.: Number-Theoretic Algorithms in Cryptography (Translations of Mathematical Monographs). American Mathematical Society, Boston (2006)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02026-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:54:44Z","timestamp":1714622084000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02026-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020254","9783642020261"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02026-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}