{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:51:54Z","timestamp":1778496714100,"version":"3.51.4"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4460,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s0304-3975(00)00409-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"671-678","source":"Crossref","is-referenced-by-count":67,"title":["Computations with a deck of cards"],"prefix":"10.1016","volume":"259","author":[{"given":"Anton","family":"Stiglic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00409-6_BIB1","first-page":"87","article-title":"Multiparty computations ensuring privacy of each party's input, correctness of the result","volume":"Vol. 293","author":"Chaum","year":"1988"},{"key":"10.1016\/S0304-3975(00)00409-6_BIB2","unstructured":"R. Cramer, I. Damg\u00e5rd, S. Dziembowski, M. Hirt, T. Rabin, Efficient multiparty computations with dishonest minority, Advances in Cryptology \u2013 EUROCRYPT 99, Lecture Notes in Computer Science, vol. 1561, Springer, Berlin, March 1999, pp. 311\u2013326."},{"key":"10.1016\/S0304-3975(00)00409-6_BIB3","first-page":"319","article-title":"Discreet solitary games","volume":"vol. 773","author":"Cr\u00e9peau","year":"1994"},{"key":"10.1016\/S0304-3975(00)00409-6_BIB4","doi-asserted-by":"crossref","unstructured":"B. den Boer, More efficient match-making and satisfiability: the five card trick. in: J.-J. Quisquater, J. Vandewalle (Eds.) Advances in Cryptology \u2013 EUROCRYPT 89, Lecture Notes in Computer Science, vol. 434, Springer, Verlag, 1990, 10\u201313 April 1989, pp. 208\u2013217.","DOI":"10.1007\/3-540-46885-4_23"},{"key":"10.1016\/S0304-3975(00)00409-6_BIB5","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game \u2013 A completeness theorem for protocols with honest majority, in: ACM (Ed.), Proc. nineteenth Ann. ACM Symp. on Theory of Computing, New York City, May 25\u201327, 1987, ACM Press, New York, NY 10036, USA, 1987, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(00)00409-6_BIB6","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0304-3975(97)00107-2","article-title":"Secure multiparty computations without computers","volume":"191","author":"Niemi","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00409-6_BIB7","doi-asserted-by":"crossref","unstructured":"A. Yao, Protocols for secure computation, in: IEEE (Ed.), 23rd Ann. Symp. on Foundations of Computer Science, November 3\u20135, 1982, Chicago, IL, IEEE Computer Society Press, Silver Spring, MD, USA, 1982, pp. 160\u2013164.","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500004096?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500004096?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T17:33:29Z","timestamp":1733247209000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500004096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0304397500004096"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00409-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}