{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:26:56Z","timestamp":1778128016205,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424567","type":"print"},{"value":"9783540446477","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44647-8_2","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T14:28:14Z","timestamp":1194964094000},"page":"19-40","source":"Crossref","is-referenced-by-count":367,"title":["Universally Composable Commitments"],"prefix":"10.1007","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[]},{"given":"Marc","family":"Fischlin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF00196771","volume":"4","author":"D. Beaver","year":"1991","unstructured":"D. Beaver, \u201cSecure Multi-party Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority\u201d, J. Cryptology, Springer-Verlag, (1991) 4: 75\u2013122.","journal-title":"J. Cryptology"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"D. Beaver, \u201cAdaptive Zero-Knowledge and Computational Equivocation\u201d, 28th Symposium on Theory of Computing (STOC), ACM, 1996.","DOI":"10.1145\/237814.238014"},{"key":"2_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-45539-6_18","volume-title":"Eurocrypt 2000","author":"M. Bellare","year":"2000","unstructured":"M. Bellare, A. Boldyreva and S. Micali, \u201cPublic-Key Encryption in a Multiuser Setting: Security Proofs and Improvements,\u201d Eurocrypt 2000, pp. 259\u2013274, Springer LNCS1807, 2000."},{"key":"2_CR4","unstructured":"M Bellare, A. Desai, E. Jokipii and P. Rogaway, \u201cA concrete security treatment of symmetric encryption: Analysis of the DES modes of operations,\u201d 38th Annual Symp. on Foundations of Computer Science (FOCS), IEEE, 1997."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Desai, D. Pointcheval and P. Rogaway, \u201cRelations among notions of security for public-key encryption schemes\u201d, CRYPTO\u2019 98, 1998, pp. 26\u201340.","DOI":"10.1007\/BFb0055718"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum, S. Micali: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits, SIAM Journal on Computation, Vol. 13, pp. 850\u2013864, 1984.","journal-title":"SIAM Journal on Computation"},{"key":"2_CR7","first-page":"156","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum and C. Cr\u00e9peau. Minimum Disclosure Proofs of Knowledge. JCSS, Vol. 37, No. 2, pages 156\u2013189, 1988.","journal-title":"JCSS"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"R. Canetti, \u201cSecurity and composition of multi-party cryptographic protocols\u201d, Journal of Cryptology, Vol. 13, No. 1, winter 2000.","DOI":"10.1007\/s001459910006"},{"key":"2_CR9","unstructured":"R. Canetti, \u201cA unified framework for analyzing security of Protocols\u201d, manuscript, 2000. Available at http:\/\/eprint.iacr.org\/2000\/067 ."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"R. Canetti and M. Fischlin, \u201cUniversally Composable Commitments\u201d. Available at http:\/\/eprint.iacr.org\/2001 .","DOI":"10.1007\/3-540-44647-8_2"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"R. Cramer and V. Shoup, \u201cA paractical public-key cryptosystem provably secure against adaptive chosen ciphertext attack\u201d, CRYPTO\u2019 98, 1998.","DOI":"10.1007\/BFb0055717"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"I. Damgard, On the existence of bit commitment schemes and zero-knowledge proofs, Advances in Cryptology-Crypto\u2019 89, pp. 17\u201329, 1989.","DOI":"10.1007\/0-387-34805-0_3"},{"key":"2_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Eurocrypt 00","author":"I. Damgard","year":"2000","unstructured":"I. Damgard. Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. Eurocrypt 00, LNCS, 2000."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"G. Di Crescenzo, Y. Ishai and R. Ostrovsky, Non-interactive and non-malleable commitment, 30th STOC, 1998, pp. 141\u2013150.","DOI":"10.1145\/276698.276722"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"G. Di Crecenzo, J. Katz, R. Ostrovsky and A. Smith. Efficient and Perfectly-Hiding Non-Interactive, Non-Malleable Commitment. Eurocrypt\u2019 01, 2001.","DOI":"10.1007\/3-540-44987-6_4"},{"key":"2_CR16","unstructured":"Y. Dodis and S. Micali, \u201cSecure Computation\u201d, CRYPTO\u2019 00, 2000."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"D. Dolev, C. Dwork and M. Naor, Non-malleable cryptography, SIAM.. J. Computing, Vol. 30, No. 2, 2000, pp. 391\u2013437. Preliminary version in 23rd Symposium on Theory of Computing (STOC), ACM, 1991.","journal-title":"SIAM.. J. Computing"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"C. Dwork, M. Naor, O. Reingold, and L. Stockmeyer. Magic functions. In 40th Annual Symposium on Foundations of Computer Science, pages 523\u2013534. IEEE, 1999.","DOI":"10.1109\/SFFCS.1999.814626"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"U. Feige and A. Shamir. Witness Indistinguishability and Witness Hiding Protocols. In 22nd STOC, pages 416\u2013426, 1990.","DOI":"10.1145\/100216.100272"},{"key":"2_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/3-540-44598-6_26","volume-title":"CRYPTO\u2019 00","author":"M. Fischlin","year":"2000","unstructured":"M. Fischlin and R. Fischlin, \u201cEfficient non-malleable commitment schemes\u201d, CRYPTO\u2019 00, LNCS 1880, 2000, pp. 413\u2013428."},{"key":"2_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-48184-2_10","volume-title":"CRYPTO\u2019 87","author":"Z. Galil","year":"1988","unstructured":"Z. Galil, S. Haber and M. Yung, Cryptographic computation: Secure fauttolerant protocols and the public-key model, CRYPTO\u2019 87, LNCS 293, Springer-Verlag, 1988, pp. 135\u2013155."},{"key":"2_CR22","unstructured":"O. Goldreich, \u201cFoundations of Cryptography (Fragments of a book)\u201d, Weizmann Inst. of Science, 1995. (Avaliable at http:\/\/philby.ucsd.edu )"},{"key":"2_CR23","unstructured":"O. Goldreich. \u201cSecure Multi-Party Computation\u201d, 1998. (Avaliable at http:\/\/philby.ucsd.edu )"},{"issue":"1","key":"2_CR24","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"O. Goldreich, S. Micali and A. Wigderson, \u201cProofs that yield nothing but their validity or All Languages in NP Have Zero-Knowledge Proof Systems\u201d, Journal of the ACM, Vol 38, No. 1, ACM, 1991, pp. 691\u2013729. Preliminary version in 27th Symp. on Foundations of Computer Science (FOCS), IEEE, 1986, pp. 174\u2013187.","journal-title":"Journal of the ACM"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson, \u201cHow to Play any Mental Game\u201d, 19th Symposium on Theory of Computing (STOC), ACM, 1987, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"2_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-34799-2","volume-title":"CRYPTO\u2019 90","author":"S. Goldwasser","year":"1990","unstructured":"S. Goldwasser, and L. Levin, \u201cFair Computation of General Functions in Presence of Immoral Majority\u201d, CRYPTO\u2019 90, LNCS 537, Springer-Verlag, 1990."},{"issue":"1","key":"2_CR27","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali and C. Rackoff, \u201cThe Knowledge Complexity of Interactive Proof Systems\u201d, SIAM Journal on Comput., Vol. 18, No. 1, 1989, pp. 186\u2013208.","journal-title":"SIAM Journal on Comput."},{"issue":"2","key":"2_CR28","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, R. Rivest: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks, SIAM Journal on Computing, Vol. 17, No. 2, pp. 281\u2013308, 1988.","journal-title":"SIAM Journal on Computing"},{"key":"2_CR29","unstructured":"Y. Lindell, private communication, 2000."},{"key":"2_CR30","series-title":"Lect Notes Comput Sci","volume-title":"CRYPTO\u2019 91","author":"S. Micali","year":"1992","unstructured":"S. Micali and P. Rogaway, \u201cSecure Computation\u201d, unpublished manuscript, 1992. Preliminary version in CRYPTO\u2019 91, LNCS 576, Springer-Verlag, 1991."},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"M. Naor: Bit Commitment Using Pseudo-Randomness, Journal of Cryptology, vol. 4, pp. 151\u2013158, 1991.","journal-title":"Journal of Cryptology"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung, Perfect zero-knowledge arguments for NP can be based on general complexity assumptions, Advances in Cryptology-Crypto\u2019 92, pp. 196\u2013214, 1992.","DOI":"10.1007\/3-540-48071-4_14"},{"key":"2_CR33","unstructured":"B. Pfitzmann and M. Waidner, \u201cA general framework for formal notions of secure systems\u201d, Hildesheimer Informatik-Berichte 11\/94, Universit\u00e4t Hildesheim, 1994. Available at http:\/\/www.semper.org\/sirene\/lit ."},{"key":"2_CR34","volume-title":"IEEE Symposium on Security and Privacy","author":"B. Pfitzmann","year":"2001","unstructured":"B. Pfitzmann and M. Waidner, \u201cA model for asynchronous reactive systems and its application to secure message transmission\u201d, IEEE Symposium on Security and Privacy, 2001. See also IBM Research Report RZ 3304 (#93350), IBM Research, Zurich, December 2000."},{"key":"2_CR35","unstructured":"C. Rackoff and D. Simon, \u201cNon-interactive zero-knowledge proof of knowledge and chosen ciphertext attack\u201d, CRYPTO\u2019 91, 1991."},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"A. Yao, Theory and applications of trapdoor functions, In Proc. 23rd Annual Symp. on Foundations of Computer Science (FOCS), pages 80\u201391. IEEE, 1982.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44647-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T06:22:13Z","timestamp":1556950933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44647-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424567","9783540446477"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/3-540-44647-8_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}