{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T12:41:04Z","timestamp":1782996064444,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540615125","type":"print"},{"value":"9783540686972","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-68697-5_16","type":"book-chapter","created":{"date-parts":[[2007,11,8]],"date-time":"2007-11-08T17:10:00Z","timestamp":1194541800000},"page":"201-215","source":"Crossref","is-referenced-by-count":113,"title":["Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing"],"prefix":"10.1007","author":[{"given":"Shai","family":"Halevi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Silvio","family":"Micali","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"16_CR1","unstructured":"C.H. Bennett and G. Brassard Quantum Cryptography: Public Key Distribution and Coin Tossing. In Proc. of IEEE International Conf. on Computers, Systems, and Signal Processing, IEEE, 1984, pages 175\u2013179."},{"key":"16_CR2","series-title":"Lect Notes Comput Sci","first-page":"441","volume-title":"Proc. of Eurocrypt\u201990","author":"G. Bleumer","year":"1990","unstructured":"G. Bleumer, B. Pfitzmann and M. Waidner. A Remark on a Signature Scheme where Forgery can be Proved. In I.B. Damg\u00e5rd, editor, Proc. of Eurocrypt\u201990, Lecture Notes in Computer Science, volume 473, Springer-Verlag, 1990. pages 441\u2013445."},{"key":"16_CR3","unstructured":"M. Blum. Coin flipping by telephone. In Proc. IEEE Spring COMPCOM, pages 133\u2013137. IEEE, 1982."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"G. Brassard and C. Cr\u00e8peau. Nontransitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond. In Proc. 27th IEEE Symp. on Foundations of Comp. Science, IEEE, 1986, pages 188\u2013195.","DOI":"10.1109\/SFCS.1986.33"},{"key":"16_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/3-540-38424-3_4","volume-title":"Proc. Crypto\u2019 90","author":"G. Brassard","year":"1991","unstructured":"G. Brassard and C. Cr\u00e8peau. Quantum bit commitment and coin tossing protocols. In A.J. Menezes and S.A. Vanstone, editors, Proc. Crypto\u2019 90, Lecture Notes in Computer Science, volume 537. Springer-Verlag, 1991, pages 49\u201361."},{"key":"16_CR6","unstructured":"G. Brassard, C. Cr\u00e8peau, R. Jozsa and D. Langlois. A Quantum Bit Commitment Scheme Provably Unbreakable by Both Parties. In Proc. 34th IEEE Symp. on Foundations of Comp. Science, IEEE, 1993."},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L. Carter","year":"1979","unstructured":"L. Carter and M. Wegman. Universal Hash Functions. J. of Computer and System Science 18, 143\u2013154 (1979).","journal-title":"J. of Computer and System Science"},{"key":"16_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1007\/3-540-46766-1_38","volume-title":"Proc. Crypto\u2019 91","author":"D. Chaum","year":"1992","unstructured":"D. Chaum, E. van Heijst and B. Pfitzmann. Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer. In J. Feigenbaum, editor, Proc. Crypto\u2019 91, Lecture Notes in Computer Science, volume 576, Springer-Verlag, 1992. pages 470\u2013484."},{"key":"16_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-48285-7_17","volume-title":"Proc. EuroCrypt\u2019 93","author":"I.B. Damg\u00e5rd","year":"1994","unstructured":"I.B. Damg\u00e5rd, Practical and Provably Secure Release of a Secret and Exchange of Signatures. T. Helleseth, editor, Proc. EuroCrypt\u2019 93, Lecture Notes in Computer Science, volume 765, Springer-Verlag, 1994, pages 200\u2013217."},{"key":"16_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-48329-2_22","volume-title":"Proc. Crypto\u2019 93","author":"I.B. Damg\u00e5rd","year":"1994","unstructured":"I.B. Damg\u00e5rd, T.P. Pedersen, and B. Pfitzmann. On the existence of statistically hiding bit commitment schemes and fail-stop signatures. In D.R. Stinson, editor, Proc. Crypto\u2019 93, Lecture Notes in Computer Science, volume 773. Springer, 1994. pages 250\u2013265."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"O. Goldreich and A. Kahan. How to Construct Constant-Round Zero-Knowledge Proofs Systems for NP. Journal of Cryptology, Vol. 9, No. 2, 1996.","DOI":"10.1007\/BF00208001"},{"issue":"2","key":"16_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17(2):281\u2013308, April 1988.","journal-title":"SIAM J. Computing"},{"key":"16_CR13","series-title":"Lect Notes Comput Sci","first-page":"40","volume-title":"Proc. Crypto\u2019 87","author":"M. Yung","year":"1988","unstructured":"Moti Yung and Russell Impagliazzo. Direct minimum-knowledge computations. In C. Pomerance, editor, Proc. Crypto\u2019 87, Lecture Notes in Computer Science, volume 293, Springer-Verlag, 1988. Pages 40\u201351."},{"key":"16_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/3-540-44750-4_7","volume-title":"Proc. Crypto\u2019 95","author":"S. Halevi","year":"1995","unstructured":"S. Halevi, Efficient commitment with bounded sender and unbounded receiver. In D. Coppersmith, editor, Proc. Crypto\u2019 95. Lecture Notes in Computer Science, volume 963, Springer-Verlag, 1995. pages 84\u201396."},{"key":"16_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/0-387-34805-0_13","volume-title":"Proc. Crypto\u2019 89","author":"M. Naor","year":"1990","unstructured":"M. Naor. Bit commitment using pseudo-randomness. In G. Brassard, editor, Proc. Crypto\u2019 89, Lecture Notes in Computer Science, volume 435. Springer-Verlag, 1990. pages 128\u2013137."},{"key":"16_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-48071-4_14","volume-title":"Proc. Crypto\u2019 92","author":"M. Naor","year":"1993","unstructured":"M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments for NP can be based on general complexity assumptions. In Ernest F. Brickell, editor, Proc. Crypto\u2019 92, Lecture Notes in Computer Science, volume 740, Springer-Verlag, 1993. pages 196\u2013214."},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung. Universal One-Way Hash Functions and their Cryptographic Applications. In Proc. 21st ACM Symp. on Theory of Computing, ACM, 1989. pages 33\u201343.","DOI":"10.1145\/73007.73011"},{"key":"16_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Proc. Crypto\u2019 91","author":"T.P. Pedersen","year":"1992","unstructured":"T.P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In J. Feigenbaum, editor, Proc. Crypto\u2019 91, Lecture Notes in Computer Science, volume 576, Springer-Verlag, 1992. pages 129\u2013140."},{"key":"16_CR19","unstructured":"Federal Information Processing Standards, Publication 180. Specifications for a Secure Hash Standard (SHS)."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68697-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T04:27:51Z","timestamp":1556944071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68697-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615125","9783540686972"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-68697-5_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1996]]}}}