{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:38Z","timestamp":1759638458978},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,11,13]],"date-time":"2012-11-13T00:00:00Z","timestamp":1352764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10623-012-9770-7","type":"journal-article","created":{"date-parts":[[2012,11,12]],"date-time":"2012-11-12T07:38:02Z","timestamp":1352705882000},"page":"345-367","source":"Crossref","is-referenced-by-count":14,"title":["Combinatorial solutions providing improved security for the generalized Russian cards problem"],"prefix":"10.1007","volume":"72","author":[{"given":"C. M.","family":"Swanson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,13]]},"reference":[{"key":"9770_CR1","unstructured":"Albert M., Aldred R., Atkinson M., van Ditmarsch H., Handley C.: Safe communication for card players by combinatorial designs for two-step protocols. Australas. J. Comb. 33, 33\u201346 (2005)."},{"key":"9770_CR2","unstructured":"Albert M., Cord\u00f3n-Franco A., van Ditmarsch H., Fern\u00e1ndez-Duque D., Joosten J., Soler-Toscano F.: Secure communication of local states in interpreted systems. In: International Symposium on Distributed Computing and Artificial Intelligence. Advances in Intelligent and Soft Computing, vol. 91, pp. 117\u2013124. Springer, Berlin (2011)."},{"key":"9770_CR3","unstructured":"Atkinson M., van Ditmarsch H.: Avoiding bias in cards cryptography. Australas. J. Comb. 44, 3\u201318 (2009)."},{"key":"9770_CR4","unstructured":"Chouinard II L.: Partitions of the 4-subsets of a 13-set into disjoint projective planes. Discret. Math. 45, 297\u2013300 (1983)."},{"key":"9770_CR5","doi-asserted-by":"crossref","unstructured":"Colbourn C., Dinitz J.: The CRC Handbook of Combinatorial Designs. CRC Press, New York (1996).","DOI":"10.1201\/9781420049954"},{"key":"9770_CR6","unstructured":"Cord\u00f3n-Franco A., Ditmarsch H., Fern\u00e1ndez-Duque D., Joosten J., Soler-Toscano F.: A secure additive protocol for card players. Australas. J. Comb. 54, 163\u2013176 (2012)."},{"key":"9770_CR7","unstructured":"Cord\u00f3n-Franco A., van Ditmarsch H., Fern\u00e1ndez-Duque D., Soler-Toscano F.: A geometric protocol for cryptography with cards. arXiv:1207.5216. http:\/\/arxiv.org\/abs\/1207.5216 ."},{"key":"9770_CR8","unstructured":"Cyriac A., Krishnan K.M., Lower bound for the communication complexity of the Russian cards problem. arXiv:0805.1974. http:\/\/arxiv.org\/abs\/0805.1974 ."},{"key":"9770_CR9","doi-asserted-by":"crossref","unstructured":"Dembowski P.: Finite Geometries. Springer, New York (1968).","DOI":"10.1007\/978-3-642-62012-6"},{"key":"9770_CR10","doi-asserted-by":"crossref","unstructured":"Duan Z., Yang C.: Unconditional secure communication: a Russian cards protocol. J. Comb. Optim. 19, 501\u2013530 (2010).","DOI":"10.1007\/s10878-009-9252-7"},{"key":"9770_CR11","unstructured":"Fischer M., Wright R.: Multiparty secret key exchange using a random deal of cards. Adv. Cryptol. (Crypto \u201991). LNCS 576, 141\u2013155 (1992)."},{"key":"9770_CR12","unstructured":"Fischer M., Wright R.: An application of game-theoretic techniques to cryptography. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 13, pp. 99\u2013118. AMS, Providence (1993)."},{"key":"9770_CR13","unstructured":"Fischer M., Wright R.: An efficient protocol for unconditional secure secret key exchange. In: Proceedings of 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201993), pp. 475\u2013483. Society for Industrial and Applied Mathematics, New Orleans (1993)."},{"key":"9770_CR14","doi-asserted-by":"crossref","unstructured":"Fischer M., Wright R.: Bounds on secret key exchange using a random deal of cards. J. Cryptol. 9, 71\u201399 (1996).","DOI":"10.1007\/s001459900004"},{"key":"9770_CR15","unstructured":"Fischer M., Paterson M., Rackoff C.: Secret bit transmission using a random deal of cards. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 2, pp. 173\u2013181. AMS, Providence (1991)."},{"key":"9770_CR16","unstructured":"He J., Duan Z.: Public Communication Based on Russian Cards Protocol: A Case Study. LNCS, vol. 6831, pp. 192\u2013206. Springer, Berlin (2011)."},{"key":"9770_CR17","unstructured":"Koizumi K., Mizuki T., Nishizeki T.: Necessary and sufficient numbers of cards for the transformation protocol. In: Computing and Combinatorics 10th Annual International Conference (COCOON 2004). LNCS, vol. 3106, pp. 92\u2013101. Springer, Heidelberg (2004)."},{"key":"9770_CR18","unstructured":"Mizuki T., Shizuya H., Nishizeki T.: A complete characterization of a family of key exchange protocols. Int. J. Inf. Secur. 1, 131\u2013142 (2002)."},{"key":"9770_CR19","doi-asserted-by":"crossref","unstructured":"van Ditmarsch H.: The Russian cards problem. The dynamics of knowledge. Studia Logica 75, 31\u201362 (2003).","DOI":"10.1023\/A:1026168632319"},{"key":"9770_CR20","doi-asserted-by":"crossref","unstructured":"van Ditmarsch H.: The case of the hidden hand. J. Appl. Non-Classical Log. 15(4), 437\u2013452 (2005).","DOI":"10.3166\/jancl.15.437-452"},{"key":"9770_CR21","unstructured":"van Ditmarsch H., SolerToscano F.: Three steps. In: 12th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA XII). LNCS, vol. 6814, pp. 41\u201357. Springer, Heidelberg (2011)."},{"key":"9770_CR22","unstructured":"van Ditmarsch H., van der Hoek W., van der Meyden R., Ruan J.: Model checking Russian cards. Electron. Notes Theor. Comput. Sci. 149, 105\u2013123 (2006)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9770-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9770-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9770-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T14:12:37Z","timestamp":1562335957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9770-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,13]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["9770"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9770-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,13]]}}}