{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:50:08Z","timestamp":1778064608951,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":50,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540551881","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-46766-1_32","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T15:03:27Z","timestamp":1186844607000},"page":"392-404","source":"Crossref","is-referenced-by-count":155,"title":["Secure Computation"],"prefix":"10.1007","author":[{"given":"Silvio","family":"Micali","sequence":"first","affiliation":[]},{"given":"Phillip","family":"Rogaway","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"D. Beaver, \u201cFormal Definitions for Secure Distributed Protocols,\u201d in Distributed Computing and Cryptography \u2014 Proceedings of a DIMACS Workshop, October 1989. (Paper not presented at workshop but invited to appear in proceedings.)"},{"key":"32_CR2","unstructured":"D. Beaver, \u201cFoundations of Secure Interactive Computing,\u201d these proceedings."},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"D. Beaver and S. Goldwasser, \u201cMultiparty Computations with Faulty Majority,\u201d Proc. of the 30th FOCS (1989), 468\u2013473.","DOI":"10.1109\/SFCS.1989.63520"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali and P. Rogaway, \u201cThe Round Complexity of Secure Protocols,\u201d Proc. of the 22nd FOCS (1990), 503\u2013513.","DOI":"10.1145\/100216.100287"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"J. Benaloh (Cohen) and M. Fischer, \u201cA Robust and Verifiable Cryptographically Secure Election Scheme,\u201d Proc. of the 26th FOCS (1985), 372\u2013381.","DOI":"10.1109\/SFCS.1985.2"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser and A. Wigderson, \u201cCompleteness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation,\u201d Proc. of the 20th STOC (1988), 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"32_CR7","unstructured":"M. Blum, Coin Flipping by Telephone, IEEE COMPCON, (1982) 133\u2013137."},{"issue":"4","key":"32_CR8","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali, \u201cHow to Generate Cryptographically Strong Sequences of Pseudo-Random Bits,\u201d SIAM J. of Computing, Vol. 13, No. 4, 1984, 850\u2013864. Earlier version in Proc. of the 23rd FOCS (1982).","journal-title":"SIAM J. of Computing"},{"issue":"2","key":"32_CR9","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"D. Chaum. \u201cUntraceable Electronic Mail, Return Addresses, and Digital Pseudonyms,\u201d Comm. of the ACM 24(2) February 1981, 84\u201388.","journal-title":"Comm. of the ACM"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum and C. Cr\u00e9peau, \u201cMinimum disclosure proofs of knowledge,\u201d Journal of Computer and System Science, Vol. 37, No. 2, October 1988, 156\u2013189.","journal-title":"Journal of Computer and System Science"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau and I. Damg\u00e1rd, \u201cMultiparty Unconditionally Secure Protocols,\u201d Proc. of the 20th STOC (1988), 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"D. Chaum, I. Damg\u00e5rd and J. van de Graff, \u201cMultiparty Computations Ensuring the Privacy of Each Party\u2019s Input and Correctness of the Result,\u201d CRYPTO-87 Proceedings, 87\u2013119.","DOI":"10.1007\/3-540-48184-2_7"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"B. Chor and E. Kushilevitz, \u201cA Zero-One Law for Boolean Privacy,\u201d Proc. of the 21st STOC (1989), 62\u201372.","DOI":"10.1145\/73007.73013"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"B. Chor, M. Ger\u00e9b-Graus and E. Kushilevitz, \u201cPrivate Computations over the Integers,\u201d Proc. of the 31st FOCS (1990), 325\u2013344. Earlier version by Chor and Kushilevitz, \u201cSharing over Infinite Domains,\u201d CRYPTO-89 Proceedings, Springer-Verlag, 299\u2013306.","DOI":"10.1109\/FSCS.1990.89552"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"B. Chor, O. Goldwasser, S. Micali and B. Awerbuch, \u201cVerifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults,\u201d Proc. of the 26th FOCS (1985), 383\u201395.","DOI":"10.1109\/SFCS.1985.64"},{"key":"32_CR16","unstructured":"C. Cr\u00e9peau, \u201cCorrect and Private Reductions Among Oblivious Transfers,\u201d MIT Ph.D. Thesis, February 1990."},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"R. DeMillo, N. Lynch, and M. Meritt, \u201cCryptographic Protocols,\u201d Proc. of the 14th STOC (1982) 383\u2013400.","DOI":"10.1145\/800070.802214"},{"issue":"6","key":"32_CR18","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. Hellman, \u201cNew Directions in Cryptography,\u201d IEEE Transactions on Information Theory, 22(6) (November 1976). 644\u2013654.","journal-title":"IEEE Transactions on Information Theory"},{"key":"32_CR19","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cPaths, Trees, and Flowers,\u201d Canadian J. of Mathematics, 17:449\u2013467, 1965.","journal-title":"Canadian J. of Mathematics"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"U. Feige, A. Fiat, and A. Shamir, \u201cZero Knowledge Proofs of Identity,\u201d Proc. of the 19th STOC (1987), 210\u2013217.","DOI":"10.1145\/28395.28419"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"U. Feige and A. Shamir, \u201cWitness indistinguishability and witness hiding protocols,\u201d Proc. of the 22nd STOC (1990), 416\u2013426.","DOI":"10.1145\/100216.100272"},{"key":"32_CR22","unstructured":"U. Feige and A. Shamir, \u201cOn Expected Polynomial Time Simulation of Zero Knowledge Protocols,\u201d in Distributed Computing and Cryptography \u2014 Proceedings of a DIMACS Workshop, October 1989."},{"key":"32_CR23","unstructured":"P. Feldman, \u201cOne Can Always Assume Private Channels,\u201d unpublished manuscript (1988)."},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"P. Feldman and S. Micali, \u201cAn Optimal Algorithms for Synchronous Byzantine Agreement,\u201d MIT\/LCS Technical Report TM-425 (June 1990). Previous version in Proc. of the 20th STOC (1988), 148\u2013161.","DOI":"10.1145\/62212.62225"},{"key":"32_CR25","doi-asserted-by":"crossref","unstructured":"Z. Galil, S. Haber and M. Yung, \u201cCryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model,\u201d CRYPTO-87 Proceedings, 135\u2013155.","DOI":"10.1007\/3-540-48184-2_10"},{"key":"32_CR26","volume-title":"Foundations of Cryptography \u2014 Class Notes","author":"O. Goldreich","year":"1989","unstructured":"O. Goldreich, \u201cFoundations of Cryptography \u2014 Class Notes,\u201d Spring 1989, Technion University, Haifa, Israel."},{"key":"32_CR27","doi-asserted-by":"crossref","unstructured":"S. Goldwasser and L. Levin, \u201cFair Computation of General Functions in Presence of Immoral Majority,\u201d CRYPTO-90 Proceedings, 75\u201384.","DOI":"10.1007\/3-540-38424-3_6"},{"issue":"2","key":"32_CR28","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali, \u201cProbabilistic Encryption,\u201d Journal of Computer and System Sciences, Vol. 28, No. 2 (1984), 270\u2013299. Earlier version in Proc. of the 14th STOC (1982).","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"32_CR29","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"O. Goldwasser","year":"1989","unstructured":"O. Goldwasser, S. Micali, and C. Rackoff, \u201cThe Knowledge Complexity of Interactive Proof Systems,\u201d SIAM J. of Comp., Vol. 18, No. 1, 186\u2013208 (February 1989). Earlier version in Proc. of the 17th STOC (1985), 291\u2013305.","journal-title":"SIAM J. of Comp."},{"issue":"2","key":"32_CR30","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, and R. Rivest, \u201cA Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks,\u201d SIAM Journal on Computing, 17(2):281\u2013308, April 1988.","journal-title":"SIAM Journal on Computing"},{"key":"32_CR31","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Mmicali and A. Wigderson, \u201cHow to Play Any Mental Game,\u201d Proc. of the 19th STOC (1987), 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"32_CR32","unstructured":"O. Goldreich and R. Vainish, \u201cHow to Solve any Protocol Problem\u2014An Efficiency Improvement,\u201d CRYPTO-87 Proceedings, 76\u201386."},{"key":"32_CR33","unstructured":"S. Haber, \u201cMulti-Party Cryptographic Computation: Techniques and Applications,\u201d Columbia University Ph.D. Thesis (1988)."},{"key":"32_CR34","unstructured":"J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979."},{"key":"32_CR35","unstructured":"J. Kilian, \u201cUses of Randomness in Algorithms and Protocols,\u201d MIT Ph.D. Thesis, April 1989."},{"key":"32_CR36","unstructured":"J. Kilian, S. Micali, and P. Rogaway, \u201cThe Notion of Secure Computation,\u201d manuscript, 1990."},{"key":"32_CR37","first-page":"357","volume":"17","author":"L. Levin","year":"1988","unstructured":"L. Levin, \u201cOne-Way Functions and Pseudorandom Generators,\u201d Combinatorica, Vol. 17, 1988, 357\u2013363. Earlier version in Proc. of the 17th STOC (1985).","journal-title":"Combinatorica"},{"key":"32_CR38","doi-asserted-by":"crossref","unstructured":"M. Luby, S. Micali and C. Rackoff, \u201cHow to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically Biased Coin,\u201d Proc of the 24th FOCS (1983).","DOI":"10.1109\/SFCS.1983.25"},{"key":"32_CR39","unstructured":"M. Meritt, \u201cCryptographic Protocols.\u201d Georgia Institute of Technology Ph.D. Thesis, Feb. 1983."},{"issue":"2","key":"32_CR40","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1137\/0217025","volume":"17","author":"S. Micali","year":"1988","unstructured":"S. Micali, C. Rackoff and B. Sloan, \u201cThe Notion of Security for Probabilistic Cryptosystems,\u201d SIAM J. of Computing, 17(2):412\u201326, April 1988.","journal-title":"SIAM J. of Computing"},{"key":"32_CR41","unstructured":"S. Micali and P. Rogaway, \u201cSecure Computation,\u201d manuscript, August 1991."},{"key":"32_CR42","doi-asserted-by":"crossref","unstructured":"Y. Oren, \u201cOn the Cunning Power of Cheating Verifiers: Some Observations about Zero Knowledge Proofs,\u201d Proc. of the 28th FOCS (1987), 462\u2013471.","DOI":"10.1109\/SFCS.1987.43"},{"key":"32_CR43","doi-asserted-by":"crossref","unstructured":"M. Pease, R. Shostak and L. Lamport, \u201cReaching Agreement in the Presence of Faults,\u201d J. of the ACM Vol. 27, No. 2, 1980.","DOI":"10.1145\/322186.322188"},{"key":"32_CR44","unstructured":"M. Rabin, \u201cHow to Exchange Secrets by Oblivious Transfer,\u201d Technical Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981."},{"key":"32_CR45","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or, \u201cVerifiable Secret Sharing and Multiparty Protocols with Honest Majority,\u201d Proc. of the 21st STOC (1989), 73\u201385.","DOI":"10.1145\/73007.73014"},{"key":"32_CR46","doi-asserted-by":"crossref","unstructured":"A. Shamir, R. Rivest, and L. Adleman, \u201cMental Poker,\u201d in Mathematical Gardener, D. D. Klarner, editor, Wadsworth International (1981) pp 37\u201343.","DOI":"10.1007\/978-1-4684-6686-7_5"},{"key":"32_CR47","doi-asserted-by":"crossref","unstructured":"M. Tompa and H. Woll, \u201cRandom Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information,\u201d Proc. of the 28th FOCS (1987), 472\u2013482.","DOI":"10.1109\/SFCS.1987.49"},{"key":"32_CR48","doi-asserted-by":"crossref","unstructured":"A. Yao, \u201cProtocols for Secure Computation,\u201d Proc. of the 23 FOCS (1982), 160\u2013164.","DOI":"10.1109\/SFCS.1982.38"},{"key":"32_CR49","doi-asserted-by":"crossref","unstructured":"A. Yao, \u201cTheory and Applications of Trapdoor Functions,\u201d Proc. of the 23 FOCS (1982) 80\u201391.","DOI":"10.1109\/SFCS.1982.45"},{"key":"32_CR50","doi-asserted-by":"crossref","unstructured":"A. Yao, \u201cHow to Generate and Exchange Secrets,\u201d Proc. of the 27 FOCS (1986).","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201991"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46766-1_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T08:29:38Z","timestamp":1737361778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46766-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540551881"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/3-540-46766-1_32","relation":{},"subject":[]}}