{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:49Z","timestamp":1759638649308,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642199332"},{"type":"electronic","value":"9783642199349"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19934-9_15","type":"book-chapter","created":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T09:28:09Z","timestamp":1301304489000},"page":"117-124","source":"Crossref","is-referenced-by-count":4,"title":["Secure Communication of Local States in Interpreted Systems"],"prefix":"10.1007","author":[{"given":"Michael","family":"Albert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9s","family":"Cord\u00f3n-Franco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"van Ditmarsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Fern\u00e1ndez-Duque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joost J.","family":"Joosten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Soler-Toscano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","first-page":"33","volume":"33","author":"M. Albert","year":"2005","unstructured":"Albert, M., Aldred, R., Atkinson, M., van Ditmarsch, H., Handley, 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":"15_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1026168632319","volume":"75","author":"H. Ditmarsch van","year":"2003","unstructured":"van Ditmarsch, H.: The Russian cards problem. Studia Logica\u00a075, 31\u201362 (2003)","journal-title":"Studia Logica"},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.4064\/aa-9-2-149-159","volume":"9","author":"P. Erd\u00f6s","year":"1964","unstructured":"Erd\u00f6s, P., Heilbronn, H.: On the addition of residue classes modulo p. Acta Arithmetica\u00a09, 149\u2013159 (1964)","journal-title":"Acta Arithmetica"},{"key":"15_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning about Knowledge","author":"R. Fagin","year":"1995","unstructured":"Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning about Knowledge. MIT Press, Cambridge (1995)"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-46766-1_10","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"M. Fischer","year":"1992","unstructured":"Fischer, M., Wright, R.: Multiparty secret key exchange using a random deal of cards. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 141\u2013155. Springer, Heidelberg (1992)"},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s001459900004","volume":"9","author":"M. Fischer","year":"1996","unstructured":"Fischer, M., Wright, R.: 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":"15_CR7","first-page":"191","volume":"2","author":"T. Kirkman","year":"1847","unstructured":"Kirkman, T.: On a problem in combinations. Camb. and Dublin Math. J.\u00a02, 191\u2013204 (1847)","journal-title":"Camb. and Dublin Math. J."},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF03024516","volume":"23","author":"K. Makarychev","year":"2001","unstructured":"Makarychev, K., Makarychev, Y.: The importance of being formal. Mathematical Intelligencer\u00a023(1), 41\u201342 (2001)","journal-title":"Mathematical Intelligencer"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1112\/blms\/26.2.140","volume":"26","author":"J.D. Silva da","year":"1994","unstructured":"da Silva, J.D., Hamidourne, Y.: Cyclic spaces for Grassmann derivatives and additive theory. Bull. London Math. Soc.\u00a026, 140\u2013146 (1994)","journal-title":"Bull. London Math. Soc."},{"key":"15_CR10","volume-title":"Combinatorial Designs \u2013 Constructions and Analysis","author":"D. Stinson","year":"2004","unstructured":"Stinson, D.: Combinatorial Designs \u2013 Constructions and Analysis. Springer, Heidelberg (2004)"},{"key":"15_CR11","unstructured":"Wang, Y.: Epistemic modelling and protocol dynamics. Ph.D. thesis, University of Amsterdam, ILLC Dissertation Series DS-2010-06 (2010)"}],"container-title":["Advances in Intelligent and Soft Computing","International Symposium on Distributed Computing and Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19934-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T18:25:55Z","timestamp":1741112755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19934-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642199332","9783642199349"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19934-9_15","relation":{},"ISSN":["1867-5662","1867-5670"],"issn-type":[{"type":"print","value":"1867-5662"},{"type":"electronic","value":"1867-5670"}],"subject":[],"published":{"date-parts":[[2011]]}}}