{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:35:45Z","timestamp":1771702545030,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_26","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T10:15:21Z","timestamp":1178014521000},"page":"413-431","source":"Crossref","is-referenced-by-count":57,"title":["Efficient Non-malleable Commitment Schemes"],"prefix":"10.1007","author":[{"given":"Marc","family":"Fischlin","sequence":"first","affiliation":[]},{"given":"Roger","family":"Fischlin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"26_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/3-540-48071-4_28","volume-title":"Advances in Cryptology \u2014 Proceedings Crypto\u2019 92","author":"M. Bellare","year":"1993","unstructured":"M. Bellare AND O. Goldreich: On Defining Proofs of Knowledge, Advances in Cryptology \u2014 Proceedings Crypto\u2019 92, Lecture Notes in Computer Science, vol. 740, pp. 390\u2013420, Springer Verlag, 1993."},{"key":"26_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology \u2014 Proceedings Eurocrypt\u2019 94","author":"M. Bellare","year":"1993","unstructured":"M. Bellare AND P. Rogaway: Optimal Asymmetric Encryption, Advances in Cryptology \u2014 Proceedings Eurocrypt\u2019 94, Lecture Notes in Computer Science, vol. 950, pp. 92\u2013111, Springer Verlag, 1993."},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare AND P. Rogaway: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols, First ACM Conference on Computer and Communication Security, ACM Press, pp. 62\u201373, 1993.","DOI":"10.1145\/168588.168596"},{"key":"26_CR4","unstructured":"D. Boneh: Finding Smooth Integers Using CRT Decoding, to appear in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), ACM Press, 2000."},{"issue":"2","key":"26_CR5","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum AND C. Cr\u00e9peau: Minimum Disclosure Proofs of Knowledge, Journal of Computer and Systems Science, vol. 37(2), pp. 156\u2013189, 1988.","journal-title":"Journal of Computer and Systems Science"},{"key":"26_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology \u2014 Proceedings Crypto\u2019 98","author":"R. Cramer","year":"1998","unstructured":"R. Cramer AND V. Houp: A Practical Public Key Cryptosystem Provable Secure Against Adaptive Chosen Ciphertext Attack, Advances in Cryptology \u2014 Proceedings Crypto\u2019 98, Lecture Notes in Computer Science, vol. 1492, pp. 13\u201325, Springer Verlag, 1998."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"R. Cramer AND V. Shoup: Signature Schemes Based on the Strong RSA Assumption, ACM Conference on Computer and Communication Security, ACM Press, 1999.","DOI":"10.1145\/319709.319716"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"G. Di Crescenzo, Y. Ishai AND R. Ostrovsky: Non-interactive and Non-Malleable Commitment, Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), pp. 141\u2013150, ACM Press, 1998.","DOI":"10.1145\/276698.276722"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork AND M. Naor: Non-Malleable Cryptography, manuscript, to appear in SIAM Jornal on Computing, January 2000. Preliminary version in Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC), pp. 542\u2013552, ACM Press, 1991.","DOI":"10.1145\/103418.103474"},{"issue":"2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat AND A. Shamir: Zero-Knowledge Proofs of Identity, Journal of Cryptology, vol. 1(2), pp. 77\u201394, Springer-Verlag, 1988.","journal-title":"Journal of Cryptology"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"A. Fiat AND A. Shamir: Witness Indistinguishable and Witness Hiding Protocols Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing (STOC), pp. 416\u2013426, ACM Press, 1990.","DOI":"10.1145\/100216.100272"},{"key":"26_CR12","unstructured":"O. Goldreich: Foundations of Cryptography, Fragments of a Book, Version 2.03, 1998."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"O. Goldreich, D. Ron AND M. Sudan: Chinese Remainder With Errors, Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), pp. 225\u2013234, ACM Press, 1999.","DOI":"10.1145\/301250.301309"},{"key":"26_CR14","unstructured":"D.E. Knuth: Seminumerical Algorithms, The Art of Computer Programming, vol. 2, 3rd edition, Addison Wesley, 1998."},{"key":"26_CR15","unstructured":"Y. Lindell: Personal communication, based on work on authenticated key-exchange with Oded Goldreich. May 2000."},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00202269","volume":"8","author":"U. Maurer","year":"1995","unstructured":"U. Maurer: Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters, Journal of Cryptology, vol. 8, pp. 123\u2013155, Springer-Verlag, 1995.","journal-title":"Journal of Cryptology"},{"key":"26_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-48071-4_3","volume-title":"Advances in Cryptology \u2014 Proceedings Crypto\u2019 92","author":"T. Okamoto","year":"1993","unstructured":"T. Okamoto: Provable Secure and Practical Identification Schemes and Corresponding Signature Schemes, Advances in Cryptology \u2014 Proceedings Crypto\u2019 92, Lecture Notes in Computer Science, vol. 740, pp. 31\u201353, Springer Verlag, 1993."},{"key":"26_CR18","series-title":"Lect Notes Comput Sci","first-page":"129","volume-title":"Crypto\u2019 91","author":"T.P. Pedersen","year":"1991","unstructured":"T.P. Pedersen: Non-Interactive and Information-Theoretical Secure Verifiable Secret Sharing, Crypto\u2019 91, Lecture Notes in Computer Science, Vol. 576, Springer-Verlag, pp. 129\u2013140, 1991."},{"issue":"2","key":"26_CR19","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 Cryptoystems, Communication of the ACM, vol. 21(2), pp. 120\u2013126, 1978.","journal-title":"Communication of the ACM"}],"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_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T00:06:29Z","timestamp":1736985989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44598-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679073","9783540445982"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44598-6_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}