{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T02:43:05Z","timestamp":1747104185015},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429876"},{"type":"electronic","value":"9783540456827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45682-1_23","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T02:31:48Z","timestamp":1180146708000},"page":"385-401","source":"Crossref","is-referenced-by-count":11,"title":["Mutually Independent Commitments"],"prefix":"10.1007","author":[{"given":"Moses","family":"Liskov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Lysyanskaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvio","family":"Micali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonid","family":"Reyzin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,20]]},"reference":[{"issue":"6","key":"23_CR1","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M. Blum","year":"1991","unstructured":"Manuel Blum, Alfredo De Santis, Silvio Micali, and Giuseppe Persiano. Noninteractive zero-knowledge. SIAM Journal on Computing, 20(6):1084\u20131118, December 1991.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"23_CR2","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13(4):850\u2013863, November 1984.","journal-title":"SIAM Journal on Computing"},{"key":"23_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-48405-1_6","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 99","author":"A. Beimel","year":"1999","unstructured":"A. Beimel, T. Malkin, and S. Micali. The all-or-nothing nature of two-party secure computation. In Michael Wiener, editor, Advances in Cryptology\u2014CRYPTO\u2019 99, volume 1666 of Lecture Notes in Computer Science, pages 80\u201397. Springer-Verlag, 15\u201319 August 1999."},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Ronald Cramer, Ivan Damg\u00e5rd, and Philip MacKenzie. Efficient zeroknowledge proofs of knowledge without intractability assumptions. In Public Key Cryptography (PKC 2000), pages 354\u2013372. Springer-Verlag, 2000.","DOI":"10.1007\/978-3-540-46588-1_24"},{"key":"23_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2014CRYPTO 2001","author":"R. Canetti","year":"2001","unstructured":"R. Canetti and M. Fischlin. Universally composable commitments. In Joe Kilian, editor, Advances in Cryptology\u2014CRYPTO 2001, Lecture Notes in Computer Science. Springer-Verlag, 19\u201323 August 2001."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. In 26th IEEE Symposium on Foundations of Computer Science, pages 383\u2013395, 1985.","DOI":"10.1109\/SFCS.1985.64"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Benny Chor and Michael Rabin. Achieving independence in logarithmic number of rounds. In Principles of Distributed Computing (PODC 87), pages 260\u2013268. ACM, 1987.","DOI":"10.1145\/41840.41862"},{"key":"23_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 98","author":"R. Cramer","year":"1998","unstructured":"R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against chosen ciphertext attack. In Hugo Krawczyk, editor, Advances in Cryptology\u2014CRYPTO\u2019 98, volume 1462 of Lecture Notes in Computer Science. Springer-Verlag, 23\u201427 August 1998."},{"key":"23_CR9","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. Nonmalleable cryptography. SIAM, 30:391\u2013437, 2000.","journal-title":"SIAM"},{"key":"23_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-45022-X_38","volume-title":"Automata Languages and Programming: 27th International Colloquim (ICALP 2000)","author":"A. Santis De","year":"2000","unstructured":"Alfredo De Santis, Giovanni Di Crescenzo, and Giuseppe Persiano. Necessary and suficient assumptions for non-interactive zero-knowledge proofs of knowledge for all np relations. In U. Montanari, J. D. P. Rolim, and E. Welzl, editors, Automata Languages and Programming: 27th International Colloquim (ICALP 2000), volume 1853 of Lecture Notes in Computer Science, pages 451\u2013462. Springer-Verlag, July 9\u201315 2000."},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"G. Di Crescenzo, Y. Ishai, and R. Ostrovsky. Non-interactive and nonmalleable commitment. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, Dallas, Texas, 23\u201326 May 1998.","DOI":"10.1145\/276698.276722"},{"key":"23_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-44987-6_4","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2001","author":"G. Crescenzo Di","year":"2001","unstructured":"G. Di Crescenzo, J. Katz, R. Ostrovsky, and A. Smith. Efficient and noninteractive non-malleable commitment. In Birgit Pfitzmann, editor, Advances in Cryptology\u2014EUROCRYPT 2001, volume 2045 of Lecture Notes in Computer Science, pages 40\u201359. Springer-Verlag, 6\u201310 May 2001."},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Alfredo De Santis and Giuseppe Persiano. Zero-knowledge proofs of knowledge without interaction. 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":"23_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44598-6_26","volume-title":"Advances in Cryptology\u2014CRYPTO 2000","author":"M. Fischlin","year":"2000","unstructured":"M. Fischlin and R. Fischlin. Efficient non-malleable commitment schemes. In Mihir Bellare, editor, Advances in Cryptology\u2014CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science. Springer-Verlag, 20\u201324 August 2000."},{"issue":"2","key":"23_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"Uriel Feige, Amos Fiat, and Adi Shamir. Zero-knowledge proofs of identity. Journal of Cryptology, 1(2):77\u201394, 1988.","journal-title":"Journal of Cryptology"},{"key":"23_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/0-387-34805-0_46","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 89","author":"U. Feige","year":"1990","unstructured":"Uriel Feige and Adi Shamir. Zero knowledge proofs of knowledge in two rounds. In G. Brassard, editor, Advances in Cryptology\u2014CRYPTO\u2019 89, volume 435 of Lecture Notes in Computer Science, pages 526\u2013545. Springer-Verlag, 1990, 20\u201324 August 1989."},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro. Achieving independence efficiently and securely. In Principles of Distributed Computing (PODC 95), pages 130\u2013136. ACM, 1995.","DOI":"10.1145\/224964.224979"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 25\u201332, Seattle, Washington, 15\u201317 May 1989.","DOI":"10.1145\/73007.73010"},{"issue":"2","key":"23_CR19","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. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270\u2013299, April 1984.","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Sha. Goldwasser, Silvio Micali, and Charles Rackoff. Knowledge complexity of interactive proofs. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pages 291\u2013304, Providence, Rhode Island, 6\u20138 May 1985.","DOI":"10.1145\/22145.22178"},{"issue":"2","key":"23_CR21","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"Sha. Goldwasser","year":"1988","unstructured":"Sha. Goldwasser, Silvio Micali, and Ronald L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281\u2013308, April 1988.","journal-title":"SIAM Journal on Computing"},{"key":"23_CR22","unstructured":"J. Katz, R. Ostrovsky, and A. Smith. Personal Communication."},{"issue":"2","key":"23_CR23","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Moni Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):151\u2013158, 1991.","journal-title":"Journal of Cryptology"},{"key":"23_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 91","author":"T. P. Pedersen","year":"1992","unstructured":"Torben Pryds Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In J. Feigenbaum, editor, Advances in Cryptology\u2014CRYPTO\u2019 91, volume 576 of Lecture Notes in Computer Science, pages 129\u2013140. Springer-Verlag, 1992, 11\u201315 August 1991."},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Amit Sahai. Non-malleable non-interactive zero-knowledge and adaptive chosen-ciphertext security. In 40th Annual Symposium on Foundations of Computer Science, New York, October 1999. IEEE.","DOI":"10.1109\/SFFCS.1999.814628"},{"key":"23_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1007\/3-540-46885-4_68","volume-title":"Advances in Cryptology\u2014EUROCRYPT 89","author":"C. P. Schnorr","year":"1990","unstructured":"C. P. Schnorr. Efficient identification and signatures for smart cards. In J.-J. Quisquater and J. Vandewalle, editors, Advances in Cryptology\u2014EUROCRYPT 89, volume 434 of Lecture Notes in Computer Science, pages 688\u2013689. Springer-Verlag, 1990, 10\u201313 April 1989."},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Martin Tompa and Heather Woll. Random self-reducibility and zero knowledge interactive proofs of possession of information. In 28th Annual Symposium on Foundations of Computer Science, pages 472\u2013482, Los Angeles, California, 12\u201314 October 1987. IEEE.","DOI":"10.1109\/SFCS.1987.49"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45682-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T06:47:54Z","timestamp":1556434074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45682-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429876","9783540456827"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-45682-1_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}