{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T02:12:55Z","timestamp":1769825575742,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540577669","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48329-2_27","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:25:55Z","timestamp":1186349155000},"page":"319-330","source":"Crossref","is-referenced-by-count":89,"title":["Discreet Solitary Games"],"prefix":"10.1007","author":[{"given":"Claude","family":"Cr\u00e9peau","sequence":"first","affiliation":[]},{"given":"Joe","family":"Kilian","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/S0019-9958(83)80030-8","volume":"59","author":"I. B\u00e1r\u00e1ny","year":"1983","unstructured":"I. B\u00e1r\u00e1ny and Z, F\u00fcredi. Mental poker with three or more players. Information and Control, 59:84\u201393, 1983.","journal-title":"Information and Control"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for fault-tolerant distributed computing. In Proc. 20th ACM Symposium on Theory of Computing, pages 1\u201310, Chicago, 1988. ACM.","DOI":"10.1145\/62212.62213"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd. Multi-party unconditionally secure protocols. In Proc. 20th ACM Symposium on Theory of Computing, Chicago, 1988. ACM.","DOI":"10.1145\/62212.62214"},{"key":"27_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-39799-X_8","volume-title":"Advances in Cryptology: Proceedings of Crypto\u2019 85","author":"C. Cr\u00e9peau","year":"1986","unstructured":"C. Cr\u00e9peau. A secure poker protocol that minimizes the effects of player coalitions. In H. C. Williams, editor, Advances in Cryptology: Proceedings of Crypto\u2019 85, volume 218 of Lecture Notes in Computer Science, pages 73\u201386. Springer-Verlag, 1986."},{"key":"27_CR5","series-title":"Lect Notes Comput Sci","first-page":"239","volume-title":"Advances in Cryptology: Proceedings of Crypto\u2019 86","author":"C. Cr\u00e9peau","year":"1987","unstructured":"C. Cr\u00e9peau. A zero-knowledge poker protocol that achieves confidentiality of the players\u2019 strategy or how to achieve an electronic poker face. In A. M. Odlyzko, editor, Advances in Cryptology: Proceedings of Crypto\u2019 86, volume 263 of Lecture Notes in Computer Science, pages 239\u2013247. Springer-Verlag, 1987."},{"key":"27_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/3-540-46885-4_23","volume-title":"Advances in Cryptology: Proceedings of Eurocrypt\u2019 89","author":"B. denBoer","year":"1990","unstructured":"B. denBoer. More efficient match-making and satisfiability: The five card trick. In Advances in Cryptology: Proceedings of Eurocrypt\u2019 89, volume 434 of Lecture Notes in Computer Science, pages 208\u2013217. Springer-Verlag, 1990."},{"key":"27_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1007\/3-540-39568-7_36","volume-title":"Advances in Cryptology: Proceedings of Crypto\u2019 84","author":"S. Fortune","year":"1985","unstructured":"S. Fortune and M. Merrit. Poker protocols. In G. R. Blakley and D. C. Chaum, editors, Advances in Cryptology: Proceedings of Crypto\u2019 84, volume 196 of Lecture Notes in Computer Science, pages 454\u2013464. Springer-Verlag, 1985."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"M. J. Fischer, M. S. Paterson, and C. Rackoff. Secret bit transmission using a random deal of cards. In Distributed Computing and Cryptography, pages 173\u2013181. American Mathematical Society, 1991.","DOI":"10.1090\/dimacs\/002\/11"},{"key":"27_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-46766-1_10","volume-title":"Advances in Cryptology: Proceedings of Crypto\u2019 91","author":"M. J. Fischer","year":"1992","unstructured":"M. J. Fischer and R. N. Wright. Multiparty secret exchange using a random deal of cards. In Advances in Cryptology: Proceedings of Crypto\u2019 91, volume 576 of Lecture Notes in Computer Science, pages 141\u2013155. Springer-Veilag, 1992."},{"key":"27_CR10","unstructured":"M. J. Fischer and R. N. Wright. An Efficient Protocol for Unconditionally Secure Secret Key Exchange, In Proc. 4th Annual Symposium on Discrete Algorithms, January, 1993, 475\u2013483."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"S. Goldwasser and S. Micali. Probabilistic encryption and how to play mental poker keeping secret all partial information. In Proc. 14th ACM Symposium on Theory of Computing, pages 365\u2013377, San Francisco, 1982. ACM.","DOI":"10.1145\/800070.802212"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game, or: A completeness theorem for protocols with honest majority. In Proc. 19th ACM Symposium on Theory of Computing, pages 218\u2013229, New York City, 1987. ACM.","DOI":"10.1145\/28395.28420"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority, In Proc, 21st ACM Symposium on Theory of Computing, 1989.","DOI":"10.1145\/73007.73014"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"A. Shamir, R. L. Rivest, and L. M. Adleman. Mental poker. In D. Klarner, editor, The Mathematical Gardner, pages 37\u201343. Wadsworth, Belmont, California, 1981.","DOI":"10.1007\/978-1-4684-6686-7_5"},{"key":"27_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/3-540-39568-7_35","volume-title":"Advances in Cryptology: Proceedings of Crypto\u2019 84","author":"M. Yung","year":"1985","unstructured":"M. Yung. Cryptoprotocols: Subscription to a public key, the secret blocking and the multi-player mental poker game. In G. R. Blakley and D. C. Chaum, editors, Advances in Cryptology: Proceedings of Crypto\u2019 84, volume 196 of Lecture Notes in Computer Science, pages 439\u2013453. Springer-Verlag, 1985."},{"key":"27_CR16","unstructured":"P. Winkler. Cryptologic techniques in bidding and defense: Parts I, II, III and IV. In Bridge Magazine, April\u2013July 1981."},{"key":"27_CR17","unstructured":"P. Winkler. My night at the Cryppie club. In Bridge Magazine, 60\u201363, August 1981."},{"issue":"4","key":"27_CR18","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1080\/0161-118391858053","volume":"7","author":"P. Winkler","year":"1983","unstructured":"P. Winkler, The advent of cryptology in the game of bridge. In Cryptologia, 7(4):327\u2013332, October 1983.","journal-title":"Cryptologia"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 93"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48329-2_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:15:37Z","timestamp":1605629737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48329-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540577669"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48329-2_27","relation":{},"subject":[]}}