{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T06:56:02Z","timestamp":1769842562311,"version":"3.49.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"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":[[2003,9]]},"DOI":"10.1016\/s0304-3975(03)00210-x","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"69-84","source":"Crossref","is-referenced-by-count":32,"title":["Private computation using a PEZ dispenser"],"prefix":"10.1016","volume":"306","author":[{"given":"J\u00f3zsef","family":"Balogh","sequence":"first","affiliation":[]},{"given":"J\u00e1nos A","family":"Csirik","sequence":"additional","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00210-X_BIB1","doi-asserted-by":"crossref","unstructured":"D. Beaver, Precomputing oblivious transfer, in: D. Coppersmith (Ed.), Proc. 15th Annu. Internat. Cryptology Conf., Advances in Cryptology\u2014CRYPTO \u201995, Santa Barbara, CA, 1995, Lecture Notes in Computer Science, Vol. 963, Springer, Berlin, 1995, pp. 97\u2013109.","DOI":"10.1007\/3-540-44750-4_8"},{"key":"10.1016\/S0304-3975(03)00210-X_BIB2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in: Proc. 20th Annu. ACM Symp. on Theory of Computing (STOC \u201988), Chicago, IL, 1988, pp. 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"10.1016\/S0304-3975(03)00210-X_BIB3","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd, Multiparty unconditionally secure protocols (extended abstract), in: Proc. 20th Annu. ACM Symp. on Theory of Computing (STOC \u201988), Chicago, IL, 1988, pp. 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"10.1016\/S0304-3975(03)00210-X_BIB4","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau, J. Kilian, Discreet solitary games, in: D.R. Stinson (Ed.), Proc. 13th Annu. Internat. Cryptology Conf., Advances in Cryptology\u2014CRYPTO \u201993, Santa Barbara, CA, 1993, Lecture Notes in Computer Science, Vol. 773, Springer, Berlin, 1994, pp. 319\u2013330.","DOI":"10.1007\/3-540-48329-2_27"},{"key":"10.1016\/S0304-3975(03)00210-X_BIB5","doi-asserted-by":"crossref","unstructured":"R. Fagin, M. Naor, P. Winkler, Comparing information without leaking it, Commun. ACM Vol. 39 (5) (1996) pp. 77\u201385.","DOI":"10.1145\/229459.229469"},{"key":"10.1016\/S0304-3975(03)00210-X_BIB6","doi-asserted-by":"crossref","unstructured":"M.J. Fischer, R.N. Wright, Multiparty secret key exchange using a random deal of cards, in: J. Feigenbaum (Ed.), Proc. 11th Annu. Internat. Cryptology Conf., Advances in Cryptology\u2014CRYPTO \u201991, Santa Barbara, CA, 1992, Lecture Notes in Computer Science, Vol. 576, Springer, 1992, pp. 141\u2013155.","DOI":"10.1007\/3-540-46766-1_10"},{"key":"10.1016\/S0304-3975(03)00210-X_BIB7","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game (extended abstract), in: Proc. 19th Annu. ACM Symp. on Theory of Computing (STOC \u201987), New York, NY, 1987, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"10.1016\/S0304-3975(03)00210-X_BIB8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1137\/S089548019427634X","article-title":"A randomness-rounds tradeoff in private computation","volume":"11","author":"Kushilevitz","year":"1998","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(03)00210-X_BIB9","unstructured":"M. Naor, Y. Naor, O. Reingold, Applied Kid Cryptography or How to convince your children you are not cheating, available online at http:\/\/www.wisdom.weizmann.ac.il\/~naor\/onpub.html."},{"key":"10.1016\/S0304-3975(03)00210-X_BIB10","unstructured":"M. Naor, A. Shamir, Visual cryptography, in: A. De Santis (Ed.), Proc. Workshop on the Theory and Application of Cryptographic Techniques, Advances in Cryptology\u2014EUROCRYPT \u201994, Perugia, Italy, 1994, Lecture Notes in Computer Science, Vol. 950, Springer, 1995, pp. 1\u201312."},{"key":"10.1016\/S0304-3975(03)00210-X_BIB11","unstructured":"R. Rivest, Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer, Manuscript, 1999."},{"key":"10.1016\/S0304-3975(03)00210-X_BIB12","doi-asserted-by":"crossref","unstructured":"A.C. Yao, How to generate and exchange secrets, in: Proc. 27th Annu. Symp. on Foundations of Computer Science (FOCS \u201986), Toronto, Canada, 1986, pp. 162\u2013167.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750300210X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750300210X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T13:47:01Z","timestamp":1584625621000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750300210X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S030439750300210X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00210-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}