{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T22:28:33Z","timestamp":1784068113452,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540679073","type":"print"},{"value":"9783540445982","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44598-6_27","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T10:15:21Z","timestamp":1178014521000},"page":"432-450","source":"Crossref","is-referenced-by-count":109,"title":["Improved Non-committing Encryption Schemes Based on a General Complexity Assumption"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Damg\u00e5rd","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jesper Buus","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"27_CR1","unstructured":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, Chicago, Illinois, 2\u20134 May 1988."},{"issue":"2","key":"27_CR2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1137\/0217012","volume":"17","author":"Eric Bach","year":"1988","unstructured":"Eric Bach. How to generate factored random numbers. SIAM Journal on Computing, 17(2):179\u2013193, April 1988.","journal-title":"SIAM Journal on Computing"},{"key":"27_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-46766-1_31","volume-title":"Advances in Cryptology-Crypto\u2019 91","author":"D. Beaver","year":"1991","unstructured":"D. Beaver. Foundations of secure interactive computing. In Joan Feigenbaum, editor, Advances in Cryptology-Crypto\u2019 91, pages 377\u2013391, Berlin, 1991. Springer-Verlag. Lecture Notes in Computer Science Volume 576."},{"key":"27_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BFb0052228","volume-title":"Advances in Cryptology-Crypto\u2019 97","author":"D. Beaver","year":"1997","unstructured":"D. Beaver. Plug and play encryption. In Burt Kaliski, editor, Advances in Cryptology-Crypto\u2019 97, pages 75\u201389, Berlin, 1997. Springer-Verlag. Lecture Notes in Computer Science Volume 1294."},{"key":"27_CR5","series-title":"Lect Notes Comput Sci","first-page":"307","volume-title":"Advances in Cryptology-EuroCrypt\u201992","author":"D. Beaver","year":"1992","unstructured":"D. Beaver and S. Haber. Cryptographic protocols provably secure against dynamic adversaries. In Rainer A. Rueppel, editor, Advances in Cryptology-EuroCrypt\u201992, pages 307\u2013323, Berlin, 1992. Springer-Verlag. Lecture Notes in Computer Science Volume 658."},{"key":"27_CR6","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 [1], pages 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"27_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/3-540-39568-7_23","volume-title":"Advances in Cryptology: Proceedings of Crypto\u2019 84","author":"M. Blum","year":"1985","unstructured":"M. Blum and S. Goldwasser. An efficient probabilistic public key encryption scheme which hides all partial information. In G. R. Blakley and David Chaum, editors, Advances in Cryptology: Proceedings of Crypto\u2019 84, pages 289\u2013302, Berlin, 1985. Springer-Verlag. Lecture Notes in Computer Science Volume 196."},{"key":"27_CR8","unstructured":"Ran Canetti. Security and composition of multi-party cryptographic protocols. Obtainable from the Theory of Cryptography Library, august 1999."},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Ran Canetti, Uri Feige, Oded Goldreich, and Moni Naor. Adaptively secure multiparty computation. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 639\u2013648, Philadelphia, Pennsylvania, 22\u201324 May 1996.","DOI":"10.1145\/237814.238015"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"David Chaum, Claude Cr\u00e9peau, and Ivan Damg\u00e5rd. Multiparty unconditionally secure protocols (extended abstract). In [1], pages 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Ivan B. Damg\u00e5rd and Jesper Buus Nielsen. Improved non-committing encryption schemes based on a general complexity assumption. Research Series RS-00-6, BRICS, Department of Computer Science, University of Aarhus, March 2000.","DOI":"10.7146\/brics.v7i6.20134"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Alfredo De Santis and Giuseppe Persiano. Zero-knowledge proofs of knowledge without interaction (extended abstract). In 33rd Annual Symposium on Foundations of Computer Science, pages 427\u2013436, Pittsburgh, Pennsylvania, 24\u201327 October 1992. IEEE.","DOI":"10.1109\/SFCS.1992.267809"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Oded Goldreich, Russell Impagliazzo, Leonid Levin, Ramarathnam Venkatesan, and David Zuckerman. Security preserving amplification of hardness. In 31st Annual Symposium on Foundations of Computer Science, volume I, pages 318\u2013326, St. Louis, Missouri, 22\u201324 October 1990. IEEE.","DOI":"10.1109\/FSCS.1990.89550"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design (extended abstract). In 27th Annual Symposium on Foundations of Computer Science, pages 174\u2013187, Toronto, Ontario, Canada, 27\u201329 October 1986. IEEE.","DOI":"10.1109\/SFCS.1986.47"},{"key":"27_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 Symposium on Theory of Computing, pages 218\u2013229, New York City, 25\u201327 May 1987.","DOI":"10.1145\/28395.28420"},{"key":"27_CR16","unstructured":"IEEE. 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, 3\u20135 November 1982."},{"key":"27_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-45539-6_16","volume-title":"Advances in Cryptology-EuroCrypt 2000","author":"S. Jarecki","year":"2000","unstructured":"Stanislaw Jarecki and Anna Lysyanskaya. Adaptively secure threshold cryptography: introducing concurrency, removing erasures. In Bart Preneel, editor, Advances in Cryptology-EuroCrypt 2000, pages 221\u2013242, Berlin, 2000. Springer-Verlag. Lecture Notes in Computer Science Volume 1807."},{"issue":"3","key":"27_CR18","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(76)90050-5","volume":"3","author":"D. E. Knuth","year":"1976","unstructured":"D. E. Knuth and L. Trabb Pardo. Analysis of a simple factorization algorithm. Theoretical Computer Science, 3(3):321\u2013348, 1976.","journal-title":"Theoretical Computer Science"},{"key":"27_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"Advances in Cryptology-Crypto\u2019 91","author":"S. Micali","year":"1991","unstructured":"S. Micali and P. Rogaway. Secure computation. In Joan Feigenbaum, editor, Advances in Cryptology-Crypto\u2019 91, pages 392\u2013404, Berlin, 1991. Springer-Verlag. Lecture Notes in Computer Science Volume 576."},{"key":"27_CR20","unstructured":"Andrew C. Yao. Protocols for secure computations (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science [16], pages 160\u2013164."},{"key":"27_CR21","unstructured":"Andrew C. Yao. Theory and applications of trapdoor functions (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science [16], pages 80\u201391."}],"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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T00:06:37Z","timestamp":1736985997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44598-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679073","9783540445982"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44598-6_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}