{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,3]],"date-time":"2026-11-03T22:49:09Z","timestamp":1793746149503,"version":"4.6.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540420705","type":"print"},{"value":"9783540449874","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44987-6_18","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T13:46:47Z","timestamp":1186840007000},"page":"280-300","source":"Crossref","is-referenced-by-count":344,"title":["Multiparty Computation from Threshold Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jesper B.","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,4,15]]},"reference":[{"key":"18_CR1","unstructured":"Proceedings of the Twentieth Annual ACM STOC, Chicago, Illinois, 2\u20134 May 1988."},{"key":"18_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 Proc. ACM PODC'89, pages 201\u2013209, 1989.","DOI":"10.1145\/72981.72995"},{"key":"18_CR3","series-title":"Lect Notes Comput Sci","first-page":"377","volume-title":"Advances in Cryptology-Crypto '91","author":"D. Beaver","year":"1991","unstructured":"D. Beaver. Foundations of secure interactive computing. In Joan Feigenbaum, editor, Advances in Cryptology-Crypto '91, pages 377\u2013391, Berlin, 1991. Springer-Verlag. LNCS Vol. 576."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In ACM [ACM88], pages 1\u201310.","DOI":"10.1145\/62212.62213"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Ran Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143\u2013202, winter 2000.","journal-title":"Journal of Cryptology"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"David Chaum, Claude Cr\u00e9peau, and Ivan Damg\u00e5rd. Multiparty unconditionally secure protocols (extended abstract). In ACM [ACM88], pages 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"18_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/BFb0055745","volume-title":"Advances in Cryptology-Crypto '98","author":"R. Cramer","year":"1998","unstructured":"Ronald Cramer and Ivan Damgaard. Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free. In Hugo Krawczyk, editor, Advances in Cryptology-Crypto '98, pages 424\u2013441, Berlin, 1998. Springer-Verlag. LNCS Vol. 1462."},{"key":"18_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology-EuroCrypt 2000","author":"R. Cramer","year":"2000","unstructured":"Ronald Cramer, Ivan Damg\u00e5rd, and Ueli Maurer. General secure multiparty computation from any linear secret-sharing scheme. In Bart Preneel, editor, Advances in Cryptology-EuroCrypt 2000, pages 316\u2013334, Berlin, 2000. Springer-Verlag. LNCS Vol. 1807."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Ronald Cramer, Ivan B. Damg\u00e5rd, and Jesper B. Nielsen. Multiparty computation from threshold homomorphic encryption. Research Series RS-00-14, BRICS, Department of Computer Science, University of Aarhus, June 2000. Updated version available at Cryptology ePrint Archive, record http:\/\/www.eprint.iacr.org\/ .","DOI":"10.7146\/brics.v7i14.20141"},{"key":"18_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology-Crypto '94","author":"R. Cramer","year":"1994","unstructured":"R. Cramer, I. B. Damg\u00e5rd, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Yvo Desmedt, editor, Advances in Cryptology-Crypto '94, pages 174\u2013187, Berlin, 1994. Springer-Verlag. LNCS Vol. 839."},{"key":"18_CR11","series-title":"Lect Notes Comput Sci","volume-title":"A generalisation,a simplification and some applications of paillier\u2019s probabilistic public-key system","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Ivan Damg\u00e5rd and Mads Jurik. A generalisation,a simplification and some applications of paillier\u2019s probabilistic public-key system. In Public Key Cryptography, Fourth International Workshop on Practice and Theory in Public Key Cryptography, PKC 2001, Proceedings, 2001. LNCS. Obtainable from http:\/\/www.daimi.au.dk\/~ivan ."},{"key":"18_CR12","unstructured":"Ivan Damg\u00e5rd and Maciej Koprowski. Practical threshold RSA signatures without a trusted dealer. In these proceedings."},{"issue":"4","key":"18_CR13","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s001459900013","volume":"9","author":"M. Franklin","year":"1996","unstructured":"Matthew Franklin and Stuart Haber. Joint encryption and message-efficient secure computation. Journal of Cryptology, 9(4): 217\u2013232, Autumn 1996.","journal-title":"Journal of Cryptology"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"P. Fouque, G. Poupard, and J. Stern. Sharing decryption in the context of voting or lotteries. In Proceedings of Financial Crypto 2000, 2000.","DOI":"10.1007\/3-540-45472-1_7"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In Proceedings of the Nineteenth Annual ACM STOC, pages 218\u2013229, New York City, 25\u201327 May 1987.","DOI":"10.1145\/28395.28420"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"R. Gennaro, M. Rabin, and T. Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In Proc. ACM PODC'98, 1998.","DOI":"10.1145\/277697.277716"},{"key":"18_CR17","series-title":"Lect Notes Comput Sci","first-page":"73","volume-title":"Advances in Cryptology-Crypto '87","author":"O. Goldreich","year":"1987","unstructured":"O. Goldreich and R. Vainish. How to solve any protocol problem \u2014 an efficiency improvement. In Carl Pomerance, editor, Advances in Cryptology-Crypto '87, pages 73\u201386, Berlin, 1987. Springer-Verlag. LNCS Vol. 293."},{"key":"18_CR18","unstructured":"Kaoru Kurosawa and Motoo Kotera. A multiparty protocol for modulo operations. Technical Report SCIS 91-3B, 1991."},{"key":"18_CR19","first-page":"2124","volume":"E74","author":"Kur91.-K. Kurosawa","year":"1991","unstructured":"Kur91.-Kaoru Kurosawa. Zero knowledge interactive proof system for modulo operations. In IEICE Trans., volume E74, pages 2124\u20132128, 1991.","journal-title":"IEICE Trans."},{"key":"18_CR20","series-title":"Lect Notes Comput Sci","first-page":"143","volume-title":"Advances in Cryptology-ASIACRYPT 2000","author":"B. Przydatek","year":"2000","unstructured":"Bartosz Przydatek, Martin Hirt, and Ueli M. Maurer. Efficient secure multiparty computation. In Tatsuaki Okamoto, editor, Advances in Cryptology-ASIACRYPT 2000, pages 143\u2013161, Berlin, 2000. Springer. LNCS Vol. 1976."},{"key":"18_CR21","series-title":"Lect Notes Comput Sci","first-page":"162","volume-title":"Advances in Cryptology-ASIACRYPT 2000","author":"A. Juels","year":"2000","unstructured":"Ari Juels and Markus Jakobsson. Mix and match: Secure function evaluation via ciphertexts. In Tatsuaki Okamoto, editor, Advances in Cryptology-ASIACRYPT 2000, pages 162\u2013177, Berlin, 2000. Springer. LNCS Vol. 1976."},{"key":"18_CR22","series-title":"Lect Notes Comput Sci","first-page":"392","volume-title":"Advances in Cryptology-Crypto '91","author":"S. Micali","year":"1991","unstructured":"S. Micali and P. Rogaway. Secure computation. In Joan Feigenbaum, editor, Advances in Cryptology-Crypto '91, pages 392\u2013404, Berlin, 1991. Springer-Verlag. LNCS Vol. 576."},{"key":"18_CR23","unstructured":"Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996."},{"key":"18_CR24","series-title":"Lect Notes Comput Sci","first-page":"223","volume-title":"Advances in Cryptology-EuroCrypt '99","author":"P. Paillier","year":"1999","unstructured":"P. Paillier. Public-key cryptosystems based on composite degree residue classes. In Jacques Stern, editor, Advances in Cryptology-EuroCrypt '99, pages 223\u2013238, Berlin, 1999. Springer-Verlag. LNCS Vol. 1592."},{"key":"18_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-45539-6_15","volume-title":"Advances in Cryptology-EuroCrypt 2000","author":"V. Shoup","year":"2000","unstructured":"Victor Shoup. Practical threshold signatures. In Bart Preneel, editor, Advances in Cryptology-EuroCrypt 2000, pages 207\u2013220, Berlin, 2000. Springer-Verlag. LNCS Vol. 1807."},{"key":"18_CR26","first-page":"160","volume-title":"23rd Annual Symposium on Foundations of Computer Science","author":"A. C. Yao","year":"1982","unstructured":"Andrew C. Yao. Protocols for secure computations (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science,pages 160\u2013164, Chicago, Illinois, 3\u20135 November 1982. IEEE."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44987-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T08:21:51Z","timestamp":1737361311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44987-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540420705","9783540449874"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-44987-6_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}