{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:46:13Z","timestamp":1764132373619,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679073"},{"type":"electronic","value":"9783540445982"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44598-6_7","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T10:15:21Z","timestamp":1178014521000},"page":"112-130","source":"Crossref","is-referenced-by-count":59,"title":["A Cryptographic Solution to a Game Theoretic Problem"],"prefix":"10.1007","author":[{"given":"Yevgeniy","family":"Dodis","sequence":"first","affiliation":[]},{"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[]},{"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"M. Abe. Universally Verifiable Mix-net with Verification Work Independent on the number of Mix-centers. In Proceedings of EUROCRYPT\u2019 98, pp. 437\u2013447, 1998.","DOI":"10.1007\/BFb0054144"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-4068(74)90037-8","volume":"1","author":"R. Aumann","year":"1974","unstructured":"R. Aumann. Subjectivity and Correlation in Randomized Strategies. In Journal of Mathematical Economics, 1, pp. 67\u201395, 1974","journal-title":"Journal of Mathematical Economics"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"I. Barany. Fair distribution protocols or how the players replace fortune. Mathematics of Operations Research, 17(2):327\u2013340, May 1992.","DOI":"10.1287\/moor.17.2.327"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare, R. Impagliazzo, and M. Naor. Does parallel repetition lower the error in computationally sound protocols? In 38th Annual Symposium on Foundations of Computer Science, pages 374\u2013383. IEEE, 1997.","DOI":"10.1109\/SFCS.1997.646126"},{"key":"7_CR5","unstructured":"J. Benaloh. Dense Probabilistic Encryption. In Proc. of the Workshop on Selected Areas in Cryptography, pp. 120\u2013128, 1994."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"7_CR7","unstructured":"M. Blum. Coin flipping by telephone: A protocol for solving impossible problems. In CRYPTO\u2019 81 ECE Report 82-04, ECE Dept., UCSB, 1982."},{"issue":"2","key":"7_CR8","first-page":"156","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, and C. Cr\u00e9peau. Minimum disclosure proofs of knowledge. JCSS, 37(2):156\u2013189, 1988.","journal-title":"JCSS"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"R. Canetti, Security and Composition of Multi-parti Cryptographic Protocols. Journal of Cryptology, 13(1):143\u2013202.","DOI":"10.1007\/s001459910006"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"D. Chaum. Blind signatures for untraceable payment. In Advances in Cryptology-CRYPTO\u2019 82, pages 199\u2013203. Plenum Press, 1982.","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and E. Damg\u00e5rd. Multiparty unconditionally secure protocols. In Advances in Cryptology-CRYPTO\u2019 87, volume 293 of 99 Lecture Notes in Computer Science, pages 462\u2013462. Springer-Verlag, 1988.","DOI":"10.1007\/3-540-48184-2_43"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damgard, and P. MacKenzie. Efficient zero-knowledge proofs of knowledge without intractability assumptions. Proceedings of PKC 2000 January 2000, Melbourne, Australia.","DOI":"10.1007\/978-3-540-46588-1_24"},{"key":"7_CR13","unstructured":"Y. Dodis and S. Halevi and T. Rabin. Cryptographic Solutions to a Game Theoretic Problem. http:\/\/www.research.ibm.com\/security\/DHR00.ps ."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"C. Dwork, M. Naor, and A. Sahai. Concurrent zero knowledge. In Proceedings of the 30th Annual ACM STOC, pages 409\u2013418. ACM Press, 1998.","DOI":"10.1145\/276698.276853"},{"key":"7_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"CRYPTO\u2019 84","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In CRYPTO\u2019 84, LNCS 196, pages 10\u201318. Springer-Verlag, 1985."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"U. Feige and A. Shamir. Witness indistinguishable and witness hiding protocols. In Proceedings of the 22nd Annual ACM STOC, pages 416\u2013426. ACM Press, 1990.","DOI":"10.1145\/100216.100272"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"M. Fischer, R. Wright. An Application of Game-Theoretic Techniques to Cryptography. In Advances in Computational Complexity Theory, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 13, pp. 99\u2013118, 1993.","DOI":"10.1090\/dimacs\/013\/06"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0304-4068(88)90017-1","volume":"17","author":"F. Forges","year":"1988","unstructured":"F. Forges. Can sunspots repalce the mediator? In J. of Math. Economics, 17:347\u2013368, 1988.","journal-title":"J. of Math. Economics"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.2307\/2938319","volume":"58","author":"F. Forges","year":"1990","unstructured":"F. Forges. Universal Mechanisms, In Econometrica, 58:1341\u20131364, 1990.","journal-title":"Econometrica"},{"key":"7_CR20","unstructured":"D. Fudenberg, J. Tirole. Game Theory. MIT Press, 1992."},{"key":"7_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BFb0030690","volume-title":"Proc. 11th International Workshop on Distributed Algorithms (WDAG\u2019 97)","author":"J. Garay","year":"1997","unstructured":"J. Garay, R. Gennaro, C. Jutla, and T. Rabin. Secure distributed storage and retrieval. In Proc. 11th International Workshop on Distributed Algorithms (WDAG\u2019 97), LNCS 1320, pages 275\u2013289. Springer-Verlag, 1997."},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270\u2013299, April 1984.","DOI":"10.1016\/0022-0000(84)90070-9"},{"issue":"1","key":"7_CR24","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186\u2013208, 1989.","journal-title":"SIAM Journal on Computing"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"M. Jakobsson. A Practical Mix. In Proceedings of EUROCRYPT\u2019 98, pp. 448\u2013461, 1998.","DOI":"10.1007\/BFb0054145"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"J. Kilian. (More) Completeness Theorems for Secure Two-Party Computation In Proc. of STOC, 2000.","DOI":"10.1145\/335305.335342"},{"key":"7_CR27","unstructured":"E. Lehrer and S. Sorin. One-shot public mediated talk. Discussion Paper 1108, Northwestern University, 1994."},{"key":"7_CR28","unstructured":"P. MacKenzie. Efficient ZK Proofs of Knowledge. Unpublished manuscript, 1998."},{"key":"7_CR29","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/BF01213855","volume":"9","author":"G. Mailath","year":"1997","unstructured":"G. Mailath, L. Samuelson and A. Shaked. Correlated Equilibria and Local Interaction In Economic Theory, 9, pp. 551\u2013556, 1997.","journal-title":"Economic Theory"},{"key":"7_CR30","first-page":"827","volume-title":"Handbook of Game Theory","author":"R. Myerson","year":"1994","unstructured":"R. Myerson. Communication, correlated equilibria and incentive compatibility. In Handbook of Game Theory, Vol. II, Elsevier, Amsterdam, pp. 827\u2013847, 1994."},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"J.F. Nash. Non-Cooperative Games. Annals of Mathematics, 54 pages 286\u2013295.","DOI":"10.2307\/1969529"},{"key":"7_CR32","unstructured":"M. Osborne, A. Rubinstein. A Course in Game Theory. The MIT Press, 1994."},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"T. Sander, A. Young, and M. Yung. Non-interactive CryptoComputing for NC1. In 40th Annual Symposium on Foundations of Computer Science, pages 554\u2013567. IEEE, 1999.","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"A. C. Yao. Protocols for secure computations (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science, pages 160\u2013164. IEEE, Nov. 1982.","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44598-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T00:06:45Z","timestamp":1736986005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44598-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679073","9783540445982"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/3-540-44598-6_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}