{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T09:14:59Z","timestamp":1672737299994},"publisher-location":"Berlin, Heidelberg","reference-count":75,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540657576","type":"print"},{"value":"9783540489696","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48969-x_2","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T14:06:54Z","timestamp":1178374014000},"page":"16-62","source":"Crossref","is-referenced-by-count":28,"title":["Introduction to Secure Computation"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,3,29]]},"reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"W. Alexi, B. Chor, O. Goldreich and C.P. Schnorr: RSA and Rabin functions: Certain parts are as hard as the whole, SIAM Journal on Computing, 17(2):194\u2013209, April 1988.","journal-title":"SIAM Journal on Computing"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"J. Bar-Ilan and D. Beaver: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, pages 201\u2013209, Edmonton, Alberta, Canada, 14\u201316 August 1989.","DOI":"10.1145\/72981.72995"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"D. Beaver and S. Goldwasser: Multiparty computation with faulty majority (extended announcement), In 30th Annual Symposium on Foundations of Computer Science, pages 468\u2013473, Research Triangle Park, North Carolina, 30 October-1 November 1989. IEEE","DOI":"10.1109\/SFCS.1989.63520"},{"key":"2_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Proceedings of Crypto 91","author":"D. Beaver","year":"1992","unstructured":"D. Beaver: Foundations of Secure Interactive Computing, Proceedings of Crypto 91, Springer Verlag LNCS, vol. 576, pp. 420\u2013432, Springer-Verlag, 1992."},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF00196771","volume":"42","author":"D. Beaver","year":"1991","unstructured":"D. Beaver: Secure Multiparty Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority, J. Cryptology 4:2 (1991), 75\u2013122.","journal-title":"J. Cryptology"},{"key":"2_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Proceedings of Crypto\u2019 91","author":"D. Beaver","year":"1992","unstructured":"D. Beaver: Efficient Multiparty Protocols Using Circuit Randomization, Proceedings of Crypto\u2019 91, Springer-Verlag LNCS, 1992, 420\u2013432."},{"key":"2_CR7","series-title":"Lect Notes Comput Sci","first-page":"285","volume-title":"Eurocrypt\u2019 92","author":"D. Beaver","year":"1992","unstructured":"D. Beaver: How to break a \u201csecure\u201d oblivious transfer protocol., Eurocrypt\u2019 92, volume 658 of Lecture Notes in Computer Science, pages 285\u2013296. Springer-Verlag, 24\u201328 May 1992."},{"key":"2_CR8","series-title":"Lect Notes Comput Sci","first-page":"307","volume-title":"Cryptographic protocols provably secure against dynamic adversaries","author":"D. Beaver","year":"1992","unstructured":"D. Beaver and S. Haber: Cryptographic protocols provably secure against dynamic adversaries, volume 658 of Lecture Notes in Computer Science, pages 307\u2013323, Springer-Verlag, 24\u201328 May 1992."},{"key":"2_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-68339-9_11","volume-title":"Proceedings of Eurocrypt\u2019 96","author":"D. Beaver","year":"1996","unstructured":"D. Beaver: Equivocable Oblivious Transfer, Proceedings of Eurocrypt\u2019 96, Springer-Verlag LNCS 1070, 1996, 119\u2013130."},{"key":"2_CR10","unstructured":"D. Beaver: Adaptively Secure Oblivious Transfer, to appear in the Proceedings of Asiacrypt\u2019 98."},{"key":"2_CR11","series-title":"Lect Notes Comput Sci","first-page":"25","volume-title":"Proc. of Crypto\u2019 88","author":"J. B. J. Leichter","year":"1990","unstructured":"J. Benaloh, J. Leichter: Generalized Secret Sharing and Monotone Functions, Proc. of Crypto\u2019 88, Springer Verlag LNCS series, pp. 25\u201335."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, R. Canetti, O. Goldreich: Asynchronous Secure Computations, Proc. ACM STOC\u2019 93, pp. 52\u201361.","DOI":"10.1145\/167088.167109"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson: Completeness theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proc. ACM STOC\u2019 88, pp. 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"2_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Proc. AUSCRYPT\u2019 92","author":"M. Bertilsson","year":"1993","unstructured":"M. Bertilsson, I. Ingemarsson: A Construction of Practical Secret Sharing Schemes using Linear Block Codes, Proc. AUSCRYPT\u2019 92, LNCS 718 (1993)"},{"key":"2_CR15","first-page":"313","volume":"48","author":"G. R. Blakley","year":"1979","unstructured":"G. R. Blakley: Safeguarding Cryptographic Keys, Proceedings of AFIPS 1979 National Computer Conference, vol. 48, N.Y., 1979, pp. 313\u2013317.","journal-title":"Proceedings of AFIPS 1979 National Computer Conference"},{"key":"2_CR16","volume-title":"Technical report","author":"M. Blum","year":"1981","unstructured":"M. Blum: Three Applications of the Oblivious Transfer, Technical report, Dept. EECS, University of California, Berkeley, CA, 1981."},{"issue":"6","key":"2_CR17","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1109\/18.556673","volume":"42","author":"G. Brassard","year":"1996","unstructured":"G. Brassard, C. Cr\u00e9peau and M. S\u00e1ntha: Oblivious Transfers and Intersecting Codes, IEEE Transaction on Information Theory, special issue on coding and complexity, Volume 42, Number 6, pp. 1769\u20131780, November 1996.","journal-title":"IEEE Transaction on Information Theory, special issue on coding and complexity"},{"key":"2_CR18","first-page":"105","volume":"9","author":"E. F. Brickell","year":"1989","unstructured":"E. F. Brickell: Some Ideal Secret Sharing Schemes, J. Combin. Maths. & Combin. Comp. 9 (1989), pp. 105\u2013113.","journal-title":"J. Combin. Maths. & Combin. Comp."},{"key":"2_CR19","unstructured":"R. Canetti: Studies in Secure Multiparty Computation and Applications, Ph. D. thesis, Weizmann Institute of Science, 1995."},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"R. Canetti, U. Feige, O. Goldreich, M. Naor: Adaptively Secure Multi-Party Computation, Proc. ACM STOC\u2019 96, pp. 639\u2013648.","DOI":"10.1145\/237814.238015"},{"key":"2_CR21","volume-title":"1998 Weizmann Workshop on Cryptography","author":"R. Canetti","year":"1998","unstructured":"R. Canetti: Security and Composition of Multiparty Cryptographic Protocols, draft, presented at the 1998 Weizmann Workshop on Cryptography, Weizmann Institute of Science, Rehovot, Israel, June 1998."},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"D. Chaum: Achieving Electronic Privacy, Scientific American, August 1992.","DOI":"10.1038\/scientificamerican0892-96"},{"key":"2_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-48184-2_7","volume-title":"Proceedings of Crypto\u201987","author":"D. Chaum","year":"1988","unstructured":"D. Chaum, I. Damg\u00e5rd and J. vd Graaf: Multi-Party Computations Ensuring Secrecy of Each Party\u2019s Input and Correctness of the Output, Proceedings of Crypto\u201987 volume 293 of Lecture Notes in Computer Science, pages 87\u2013119, 16\u201320, Springer-Verlag, 1988."},{"key":"2_CR24","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd: Multi-Party Unconditionally Secure Protocols, Proc. of ACM STOC\u2019 88, pp. 11\u201319."},{"issue":"10","key":"2_CR25","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1145\/4372.4373","volume":"28","author":"D. Chaum","year":"1985","unstructured":"D. Chaum: Transaction Systems to make Big Brother Obsolete, Communications of the ACM, vol. 28, no. 10, October 1985, pp. 1030\u20131044.","journal-title":"Communications of the ACM"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1985","unstructured":"D. Chaum: Untraceable Electroic Mail, Return Addresses, and Digital Pseudonyms, Communications of the ACM, vol. 24, no.2, 1985, pp. 84\u201388.","journal-title":"Communications of the ACM"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"B. Chor, S. Goldwasser, S. Micali, B. Awerbuch: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults, Proc. IEEE FOCS\u2019 85, pp. 383\u2013395.","DOI":"10.1109\/SFCS.1985.64"},{"key":"2_CR28","volume-title":"1998 Weizmann Workshop on Cryptography","author":"R. Cramer","year":"1998","unstructured":"R. Cramer, I. Damg\u00e5rd and U. Maurer: Span Programs and Secure Multi-Party Computation, draft, presented at the 1998 Weizmann Workshop on Cryptography, Weizmann Institute of Science, Rehovot, Israel, June 1998. Completely revised version available from http:\/\/www.inf.ethz.ch\/personal\/cramer ."},{"key":"2_CR29","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of CRYPTO\u201998","author":"R. Cramer","year":"1998","unstructured":"R. Cramer, I. Damg\u00e5rd: Zero Knowledge for Finite Field Arithmetic or: Can Zero Knowledge be for Free?, Proc. of CRYPTO\u201998, Springer Verlag LNCS series."},{"key":"2_CR30","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of Eurocrypt\u2019 99","author":"R. Cramer","year":"1999","unstructured":"R. Cramer, I. Damg\u00e5rd, S. Dziembowski, M. Hirt and T. Rabin: Efficient Multi-Party Computations with Dishonest Minority, Proceedings of Eurocrypt\u2019 99, Springer Verlag LNCS. To appear."},{"key":"2_CR31","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Proceedings of EUROCRYPT\u2019 97","author":"R. Cramer","year":"1997","unstructured":"R. Cramer, R. Gennaro and B. Schoenmakers: A Secure and Optimally Efficient Multi-Authority Election Scheme, Proceedings of EUROCRYPT\u2019 97, Konstanz, Germany, Springer Verlag LNCS, vol. 1233, pp. 103\u2013118, May 1997. Journal version: Eur. Trans. Telecom, Vol. 8, No. 5, Sept.\/Oct. 1997."},{"key":"2_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-68339-9_7","volume-title":"Proceedings of EUROCRYPT\u2019 96","author":"R. Cramer","year":"1996","unstructured":"R. Cramer, M. Franklin, B. Schoenmakers, M. Yung: Secure Secret Ballot Election Schemes with Linear Work, Proceedings of EUROCRYPT\u2019 96, Zaragoza, Spain, Springer Verlag LNCS, vol. 1070, pp. 72\u201383, May 1996."},{"key":"2_CR33","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-48184-2_30","volume-title":"Proceedings of Crypto\u2019 87","author":"C. Cr\u00e9peau","year":"1988","unstructured":"C. Cr\u00e9peau: Equivalence between two flavours of oblivious transfers (abstract), Proceedings of Crypto\u2019 87, volume 293 of Lecture Notes in Computer Science, pages 350\u2013354. Springer-Verlag, 1988."},{"key":"2_CR34","unstructured":"C. Cr\u00e9peau: Correct and Private Reductions among Oblivious Transfers PhD thesis, Department of Elec. Eng. and Computer Science, Massachusetts Institute of Technology, 1990."},{"key":"2_CR35","series-title":"Lect Notes Comput Sci","volume-title":"proc. of Crypto 95","author":"C. Cr\u00e9peau","year":"1995","unstructured":"C. Cr\u00e9peau, J.vd. Graaf and A. Tapp: Committed Oblivious Transfer and Private Multiparty Computation, proc. of Crypto 95, Springer Verlag LNCS series."},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau and J. Kilian: Achieving oblivious transfer using weakened security assumptions, In 29th Symp. on Found. of Computer Sci., pages 42\u201352. IEEE, 1988.","DOI":"10.1109\/SFCS.1988.21920"},{"key":"2_CR37","unstructured":"C. Cr\u00e9peau and L. Salvail: Oblivious Verification of Common String, CWI Quarterly (Special Issue on Cryptography), 8(2), June 1995."},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"A. De Santis, Y. Frankel, Y. Desmedt and M. Yung: How to Share a Function Securely, Proceedings of 26th Annual ACM STOC, pp. 522\u2013522, 1994.","DOI":"10.1145\/195058.195405"},{"key":"2_CR39","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1002\/ett.4460050407","volume":"5","author":"Y. Desmedt","year":"1994","unstructured":"Y. Desmedt: Threshold Cryptography, European Transactions in Telecommunication, 5 (1994), 449\u2013457.","journal-title":"European Transactions in Telecommunication"},{"key":"2_CR40","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"S. Even, O. Goldreich and A. Lempel: A Randomized Protocol for Signing Contracts, Communications of the ACM, vol. 28, 1985, pp. 637\u2013647.","journal-title":"Communications of the ACM"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"R. Fagin, M. Naor and P. Winkler: Comparing Common Secret Information without Leaking it, Communications of the ACM, vol 39, May 1996, pp. 77\u201385.","DOI":"10.1145\/229459.229469"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"P. Feldman: A practical scheme for non-interactive verifiable secret sharing, Proceedings of 28th Annual Symposium on Foundations of Computer Science, pages 427\u2013437, Los Angeles, California, 12-14 October 1987. IEEE.","DOI":"10.1109\/SFCS.1987.4"},{"issue":"4","key":"2_CR43","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P. Feldman","year":"1997","unstructured":"P. Feldman, S. Micali: An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement, SIAM J. Comp. Vol. 26, No. 4, pp. 873\u2013933, August 1997.","journal-title":"SIAM J. Comp"},{"issue":"3","key":"2_CR44","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s001459900011","volume":"9","author":"M. Fischer","year":"1996","unstructured":"M. Fischer, S. Micali and C. Rackoff: A Secure Protocol for Oblivious Transfer (extended abstract), presented at Eurocrypt\u2019 84. First published in Journal of Cryptology, 9(3):191\u2013195, Summer 1996.","journal-title":"First published in Journal of Cryptology"},{"key":"2_CR45","doi-asserted-by":"crossref","unstructured":"M. Fitzi and U. Maurer: Efficient Byzantine Agreement Secure Against General Adversaries, Proceedings of 12th International Symposium on Distributed Computing (DISC\u2019 98).","DOI":"10.1007\/BFb0056479"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. Gemmell, P. MacKenzie, M. Yung: Optimal-resilience proactive public-key cryptosystems, Proceedings of 38th Annual Symposium IEEE FOCS pages 384\u2013393, 1997.","DOI":"10.1109\/SFCS.1997.646127"},{"key":"2_CR47","volume-title":"Ph.D. thesis","author":"M. Franklin","year":"1992","unstructured":"M. Franklin: Complexity and Security of Distributed Protocols, Ph.D. thesis, Columbia University, New York, 1992."},{"key":"2_CR48","series-title":"Lect Notes Comput Sci","first-page":"135","volume-title":"Proceedings of Crypto\u2019 87","author":"Z. Galil","year":"1987","unstructured":"Z. Galil, S. Haber and M. Yung: Cryptographic computation: Secure fault-tolerant protocols and the public-key model, Proceedings of Crypto\u2019 87, volume 293 of Lecture Notes in Computer Science, pages 135\u2013155, 16\u201320 August 1987. Springer-Verlag, 1988."},{"issue":"1","key":"2_CR49","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1137\/S0097539794265232","volume":"27","author":"J.A. Garay","year":"1998","unstructured":"J.A. Garay and Y. Moses: Fully polynomial Byzantine agreement for n \u00bf 3t processors int + 1 rounds, SIAM Journal on Computing, 27(1):247\u2013290, February 1998.","journal-title":"SIAM Journal on Computing"},{"key":"2_CR50","unstructured":"R. Gennaro: Theory and Practice of Verifiable Secret Sharing, Ph.D.-thesis, MIT, 1995."},{"key":"2_CR51","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-68697-5_13","volume-title":"Proceedings of CRYPTO\u2019 96","author":"R. Gennaro","year":"1996","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin: Robust and efficient sharing of RSA functions, Proceedings of CRYPTO\u2019 96, volume 1109 of Lecture Notes in Computer Science, pages 157\u2013172, 18\u201322, 1996."},{"key":"2_CR52","unstructured":"R. Gennaro, M. Rabin, T. Rabin, Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography, Proceedings of ACM PODC\u201998."},{"key":"2_CR53","unstructured":"O. Goldreich, S. Micali and A. Wigderson: Proofs that Yield Nothing but the Validity of the Assertion, and a Methodology of Cryptographic Protocol Design, Proceedings IEEE FOCS\u201986, pp. 174\u2013187."},{"key":"2_CR54","unstructured":"O. Goldreich, S. Micali and A. Wigderson: How to Play Any Mental Game or a Completeness Theorem for Protocols with Honest Majority, Proc. of ACM STOC\u2019 87, pp. 218\u2013229."},{"key":"2_CR55","series-title":"Lect Notes Comput Sci","first-page":"73","volume-title":"Proceedings of Crypt0\u201987","author":"O. Goldreich","year":"1987","unstructured":"O. Goldreich and R. Vainish: How to Solve any Protocol Problem: An Efficiency Improvement, Proceedings of Crypt0\u201987, volume 293 of Lecture Notes in Computer Science, pages 73\u201386, 16\u201320 August 1987."},{"key":"2_CR56","doi-asserted-by":"crossref","unstructured":"O. Goldreich: Modern Cryptography, Probabilistic Proofs and Pseudorandomness, ISBN 3-540-64766-x, Springer-Verlag, Algorithms and Combinatorics, Vol. 17, 1998.","DOI":"10.1007\/978-3-662-12521-2"},{"key":"2_CR57","unstructured":"O. Goldreich: Secure Multi-Party Computation (working draft), Weizman Institute of Science, Rehovot, Israel, June 1998. Avaliable through the author\u2019s homepage http:\/\/theory.lcs.mit.edu\/ oded\/ ."},{"key":"2_CR58","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali and C. Rackoff: The Knowledge Complexity of Interactive Proof Systems, Proceedings of ACM STOC\u201985, pp. 291\u2013304.","DOI":"10.1145\/22145.22178"},{"key":"2_CR59","unstructured":"M. Hirt, U. Maurer: Complete Characterization of Adversaries Tolerable in General Multiparty Computations, Proc. ACM PODC\u201997, pp. 25\u201334."},{"key":"2_CR60","unstructured":"M. Ito, A. Saito and T. Nishizeki: Secret Sharing Scheme Realizing General Access Structures, Proceedings IEEE Globecom\u2019 87, pp. 99\u2013102, 1987."},{"key":"2_CR61","doi-asserted-by":"crossref","unstructured":"M. Karchmer, A. Wigderson: On Span Programs, Proc. of Structure in Complexity, 1993.","DOI":"10.1109\/SCT.1993.336536"},{"key":"2_CR62","unstructured":"J. Kilian: Founding Cryptography on Oblivious Transfer, ACM STOC\u2019 88, pp. 20\u201331."},{"key":"2_CR63","doi-asserted-by":"crossref","unstructured":"J. Kilian, S. Micali and R. Ostrovsky: Minimum resource zero-knowledge proofs (extended abstract), Proceedings of 30th Annual IEEE Symposium on Foundations of Computer Science, pages 474\u2013479, November 1989, IEEE.","DOI":"10.1109\/SFCS.1989.63521"},{"key":"2_CR64","doi-asserted-by":"crossref","unstructured":"L. Lamport, R.E. Shostak and M.C. Pease: The Byzantine generals problem, ACM Transactions on Programming Languages and Systems, 4(3):382\u2013401, July 1982.","DOI":"10.1145\/357172.357176"},{"key":"2_CR65","unstructured":"S. Micali and P. Rogaway:Secure Computation, Manuscript, Preliminary version in Proceedings of Crypto 91."},{"key":"2_CR66","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky and M. Yung: How to withstand mobile virus attacks, Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, pages 51\u201359, 1991","DOI":"10.1145\/112600.112605"},{"key":"2_CR67","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Proc. CRYPTO\u2019 91","author":"T. P. Pedersen","year":"1992","unstructured":"T. P. Pedersen: Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing, Proc. CRYPTO\u2019 91, Springer Verlag LNCS, vol. 576, pp. 129\u2013140."},{"key":"2_CR68","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BFb0055722","volume-title":"Proceedings of Crypto\u2019 98","author":"T. Rabin","year":"1998","unstructured":"T. Rabin: A Simplified Approach to Threshold and Proactive RSA, Proceedings of Crypto\u2019 98, Springer Verlag LNCS, vol. 1462, pp. 89\u2013104, 1998."},{"issue":"6","key":"2_CR69","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1145\/195613.195621","volume":"41","author":"T. Rabin","year":"1994","unstructured":"T. Rabin: Robust Sharing of Secrets when the Dealer is Honest or Cheating, J. ACM, 41(6):1089\u20131109, November 1994.","journal-title":"J. ACM"},{"key":"2_CR70","doi-asserted-by":"crossref","unstructured":"T. Rabin, M. Ben-Or: Verifiable Secret Sharing and Multiparty Protocols with Honest majority, Proc. ACM STOC\u2019 89, pp. 73\u201385.","DOI":"10.1145\/73007.73014"},{"key":"2_CR71","unstructured":"M. Rabin: How to Exchange Secrets by Oblivious Transfer, Technical Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981."},{"key":"2_CR72","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir and L. Adleman: A Method for Obtaining Digital Signatures and Public Key Cryptosystems, Communications of ACM, 21 (1978), pp. 120\u2013126.","journal-title":"Communications of ACM"},{"key":"2_CR73","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir: How to Share a Secret, Communications of the ACM 22 (1979) 612\u2013613.","journal-title":"Communications of the ACM"},{"issue":"1","key":"2_CR74","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S. Wiesner","year":"1983","unstructured":"S. Wiesner: Conjugate Coding, SIGACT News, vol. 15, no. 1, 1983, pp. 78\u201388; Manuscript written circa 1970, unpublished until it appeared in SIGACT News.","journal-title":"SIGACT News"},{"key":"2_CR75","doi-asserted-by":"crossref","unstructured":"A. Yao: Protocols for Secure Computation, Proc. IEEE FOCS\u2019 82, pp. 160\u2013164.","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lectures on Data Security","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48969-X_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T19:17:00Z","timestamp":1587496620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48969-X_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657576","9783540489696"],"references-count":75,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-48969-x_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[1999]]}}}