{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T13:03:04Z","timestamp":1772024584603,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540545088","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-38424-3_6","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T13:05:56Z","timestamp":1196687156000},"page":"77-93","source":"Crossref","is-referenced-by-count":121,"title":["Fair Computation of General Functions in Presence of Immoral Majority"],"prefix":"10.1007","author":[{"given":"Shafi","family":"Goldwasser","sequence":"first","affiliation":[]},{"given":"Leonid","family":"Levin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Goldwasser. Multi Party Fault Tolerant Computation with Faulty Majority, proceedings of Crypto89, Santa Barbara, CA, August 1989.","DOI":"10.1109\/SFCS.1989.63520"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Goldwasser. Multi Party Fault Tolerant Computation with Faulty Majority Based on Oblivious Transfer, proceedings of FOCS89, Duke, NC, October 1989, pp. 468\u2013473.","DOI":"10.1109\/SFCS.1989.63520"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. Proc. of 20th STOC 1988, pp. 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"6_CR4","unstructured":"Ben-Or, Michael, Oded Goldreich, Shafi Goldwasser, Johan Hastad, Joe Kilian, Silvio Micali, Phillip Rogaway, \u201cIP is in Zero-Knowledge,\u201d Proceedings, Advances in Cryptology, Crypto 1988."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Rabin, T. and M. Ben-Or. \u201cVerifiable Secret Sharing and Multiparty Protocols with Honest Majority.\u201d Proc. of 2lst STOC, ACM, 1989.","DOI":"10.1145\/73007.73014"},{"key":"6_CR6","first-page":"79","volume-title":"Proceedings of the 1980 Symposium on Security and Privacy","author":"T. Blakely","year":"1981","unstructured":"Blakely, T.. Security Proofs for Information Protection Systems. Proceedings of the 1980 Symposium on Security and Privacy, IEEE Computer Society Press, NY, pp. 79\u201388, 1981."},{"key":"6_CR7","unstructured":"Brassard, Gilles, Claude Cr\u00e9peau, and David Chaum, \u201cMinimum Disclosure Proofs of Knowledge,\u201d manuscript."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Brassard, Gilles, Claude Cr\u00e9peau, and Jean-Marc Robert. \u201cInformation Theoritic Reductions Among Disclosure Problems,\u201d Proceedings of the 27th FOCS, IEEE, 1986, 168\u2013173.","DOI":"10.1109\/SFCS.1986.26"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"E. Brickell, D. Chaum, I. Damgaard, J. van de Graaf. Gradual and Verifiable Release of A Secret. CRYPTO 1987.","DOI":"10.1007\/3-540-48184-2_11"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepeau, I. Damgaard. Multiparty Unconditionally Secure Protocols. Proc. of 20th STOC 1988, pp. 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"6_CR11","unstructured":"Chaum, David, Ivan Damgard, and Jeroen van de Graaf. \u201cMultiparty Computations Ensuring Secrecy of Each Party\u2019s Input and Correctness of the Output,\u201d Proceedings of CRYPTO\u2019 85, Springer-Verlag, 1986, 477\u2013488."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"R. Cleve. Limits on the Security of Coin Flips When Half the Processors are Faulty. STOC 1986.","DOI":"10.1145\/12130.12168"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Cohen, Fischer. A Robust and Verifiable Cryptographically Secure Election. FOCS 1985.","DOI":"10.1109\/SFCS.1985.2"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"C. Crepeau and J. Kilian. Achieving Oblivious Transfer Using Weakened Security Assumptions. FOCS 1988.","DOI":"10.1109\/SFCS.1988.21920"},{"key":"6_CR15","unstructured":"Cr\u00e9peau Claude, \u201cOn the Equivalence of Two Types of Oblivious Transfer\u201d, Crypto87."},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"B. Chor, S. Goldwasser, S. Micali, B. Awerbuch. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. FOCS 1985.","DOI":"10.1109\/SFCS.1985.64"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"B. Chor, M. Rabin. Achieving Independence in Logarithmic Number of Rounds. PODC 1986.","DOI":"10.1145\/41840.41862"},{"issue":"6","key":"6_CR18","first-page":"637","volume":"28","author":"E. S","year":"1985","unstructured":"Even S., Goldreich O., and A. Lempel, A Randomized Protocol for Signing Contracts, CACM, vol. 28, no. 6, 1985, pp. 637\u2013647.","journal-title":"A Randomized Protocol for Signing Contracts"},{"key":"6_CR19","unstructured":"Fischer M., Micali S., and Rackoff C. Oblivious Transfer Based in Quadratic Residuosity, Unpublished."},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Z. Gali1, S. Haber, M. Yung. Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public Key Model. Proc. CRYPTO 1987.","DOI":"10.1007\/3-540-48184-2_10"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson. How to Play Any Mental Game, or A Completeness Theorem for Protocols with Honest Majority. Proc. of 19th STOC 1987, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"6_CR22","unstructured":"Goldreich, O., Vainish, R. \u201cHow to Solve any Protocol Problem: An Efficiency Improvement\u201d, Crypto 87."},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Goldwasser, Micali, Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM J. of Comp 1989.","DOI":"10.1090\/psapm\/038\/1020812"},{"key":"6_CR24","unstructured":"S. Haber. Multi-Party Cryptographic Computation: Techniques and Applications. Ph.D. Thesis, Columbia University, 1988."},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Impagliazzo, Russell and Moti Yung, \u201cDirect Minimum Knowledge Computations,\u201d Proceedings, Advances in Cryptology, Crypto 1987.","DOI":"10.1007\/3-540-48184-2_4"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Kilian, Joe, \u201cOn The Power of Oblivious Transfer,\u201d Proceedings of the 20th STOC, ACM, 1988, pp. 20\u201329. Also appeared in Uses of Randomness In Algorithms and Protocols, An ACM Distinguished Dissertation 1989.","DOI":"10.1145\/62212.62215"},{"key":"6_CR27","unstructured":"J. Kilian. S. Micali. P. Rogaway Security Definitions for Multi Party Protocols. In Preparation."},{"key":"6_CR28","unstructured":"Micali Luby Rackoff 83. The Miraculous Exchange of a Secret bit, Proc. of FOCS 1983."},{"key":"6_CR29","first-page":"612","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to Share a Secret. CACM 22, 612\u2013613, 1979.","journal-title":"How to Share a Secret"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Yao, Andrew C. \u201cProtocols for Secure Computations,\u201d Proceedings of the 23rd FOCS, IEEE, 1982, 160\u2013164.","DOI":"10.1109\/SFCS.1982.38"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Yao, Andrew C. \u201cHow to Generate and Exchange Secrets,\u201d Proceedings of the 27th FOCS, IEEE, 1986, 162\u2013167.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology-CRYPT0\u2019 90"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-38424-3_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T05:11:08Z","timestamp":1737609068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-38424-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540545088"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-38424-3_6","relation":{},"subject":[]}}