{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:04:56Z","timestamp":1765112696907},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540629757"},{"type":"electronic","value":"9783540690535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-69053-0_13","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:24:05Z","timestamp":1186349045000},"page":"163-192","source":"Crossref","is-referenced-by-count":99,"title":["A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost"],"prefix":"10.1007","author":[{"given":"Mihir","family":"Bellare","sequence":"first","affiliation":[]},{"given":"Daniele","family":"Micciancio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"M. Ajtai, \u201cGenerating hard instances of lattice problems,\u201d Proceedings of the 28th Annual Symposium on Theory of Computing, ACM, 1996.","DOI":"10.1145\/237814.237838"},{"key":"13_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 Crypto 94 Proceedings","author":"M. Bellare","year":"1994","unstructured":"M. Bellare, O. Goldreich and S. Goldwasser, \u201cIncremental cryptography: The case of hashing and signing,\u201d Advances in Cryptology \u2014 Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, O. Goldreich and S. Goldwasser, \u201cIncremental cryptography with application to virus protection,\u201d Proceedings of the 27th Annual Symposium on Theory of Computing, ACM, 1995.","DOI":"10.1145\/225058.225080"},{"key":"13_CR4","unstructured":"M. Bellare and D. Micciancio, \u201cA new paradigm for collision-free hashing: Incrementality at reduced cost,\u201d full version of this paper, available at http:\/\/www-cse.ucsd.edu\/users\/mihir ."},{"key":"13_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 Crypto 95 Proceedings","author":"M. Bellare","year":"1995","unstructured":"M. Bellare, R. Gu\u00e9rin and P. Rogaway, \u201cXOR MAcs: New methods for message authentication using finite pseudorandom functions,\u201d Advances in Cryptology \u2014 Crypto 95 Proceedings, Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed., Springer-Verlag, 1995."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway, \u201cRandom oracles are practical: A paradigm for designing efficient protocols,\u201d Proceedings of the First Annual Conference on Computer and Communications Security, ACM, 1993.","DOI":"10.1145\/168588.168596"},{"key":"13_CR7","series-title":"IBM Research Report","volume-title":"Two Broken Hash Functions","author":"D. Coppersmith","year":"1992","unstructured":"D. Coppersmith, \u201cTwo Broken Hash Functions,\u201d IBM Research Report RC-18397, IBM Research Center, Yorktown Heights, NY, October 1992."},{"key":"13_CR8","unstructured":"D. Coppersmith and B. Preneel, \u201cComments on MASH-1 and MASH-1,\u201d Manuscript, February 1995."},{"key":"13_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 Crypto 91 Proceedings","author":"D. Chaum","year":"1991","unstructured":"D. Chaum, E. Heijst and B. Pfitzmann, \u201cCryptographically strong undeniable signatures, unconditionally secure for the signer,\u201d Advances in Cryptology \u2014 Crypto 91 Proceedings, Lecture Notes in Computer Science Vol. 576, J. Feigenbaum ed., Springer-Verlag, 1991."},{"key":"13_CR10","unstructured":"T. Cormen, C. Leiserson and R. Rivest, \u201cIntroduction to Algorithms,\u201d McGraw-Hill, 1992."},{"key":"13_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 Eurocrypt 87 Proceedings","author":"I. Damgard","year":"1987","unstructured":"I. Damgard \u201cCollision Free Hash Functions and Public Key Signature Schemes,\u201d Advances in Cryptology \u2014 Eurocrypt 87 Proceedings, Lecture Notes in Computer Science Vol. 304, D. Chaum ed., Springer-Verlag, 1987."},{"key":"13_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 Crypto 89 Proceedings","author":"I. Damgard","year":"1989","unstructured":"I. Damgard \u201cA Design Principle for Hash Functions,\u201d Advances in Cryptology \u2014 Crypto 89 Proceedings, Lecture Notes in Computer Science Vol. 435, G. Brassard ed., Springer-Verlag, 1989."},{"key":"13_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Fast Software Encryption","author":"H. Dobbertin","year":"1996","unstructured":"H. Dobbertin, A. Bosselaers and B. Preneel, \u201cRIPEMD-160: A strengthened version of RIPEMD,\u201d Fast Software Encryption, Lecture Notes in Computer Science 1039, D. Gollmann, ed., Springer-Verlag, 1996."},{"key":"13_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 Eurocrypt 87 Proceedings","author":"M. Girault","year":"1987","unstructured":"M. Girault, \u201cHash functions using modulo-N operations,\u201d Advances in Cryptology \u2014 Eurocrypt 87 Proceedings, Lecture Notes in Computer Science Vol. 304, D. Chaum ed., Springer-Verlag, 1987."},{"key":"13_CR15","unstructured":"O. Goldreich, S. Goldwasser and S. Halevi, \u201cCollision-Free Hashing from Lattice Problems,\u201d Theory of Cryptography Library ( http:\/\/theory.lcs.mit.edu\/~tcryptol\/ ) 96\u201309, July 1996."},{"issue":"2","key":"13_CR16","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, \u201cA digital signature scheme secure against adaptive chosen-message attacks,\u201d SIAM Journal of Computing, Vol. 17, No. 2, pp. 281\u2013308, April 1988.","journal-title":"SIAM Journal of Computing"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and M. Naor, \u201cEfficient cryptographic schemes provably as secure as subset sum,\u201d Proceedings of the 30th Symposium on Foundations of Computer Science, IEEE, 1989.","DOI":"10.1109\/SFCS.1989.63484"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and M. Naor, \u201cEfficient cryptographic schemes provably as secure as subset sum,\u201d Journal of Cryptology, Vol. 9, No. 4, Autumn 1996.","DOI":"10.1007\/BF00189260"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. Lenstra","year":"1982","unstructured":"A. Lenstra, H. Lenstra and L. Lov\u00e1sz, \u201cFactoring polynomials with rational coefficients,\u201d Mathematische Annalen Vol. 261, pp. 515\u2013534, 1982.","journal-title":"Mathematische Annalen"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"A. Menezes, P. Van Oorschot and S. Vanstone, \u201cHandbook of Applied Cryptography,\u201d CRC Press, 1996.","DOI":"10.1201\/9781439821916"},{"key":"13_CR21","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 Crypto 89 Proceedings","author":"R. Merkle","year":"1989","unstructured":"R. Merkle \u201cOne Way Hash Functions and DES,\u201d Advances in Cryptology \u2014 Crypto 89 Proceedings, Lecture Notes in Computer Science Vol. 435, G. Brassard ed., Springer-Verlag, 1989."},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"D. Micciancio, \u201cOblivious data structures: applications to cryptography,\u201d Proceedings of the 29th Annual Symposium on Theory of Computing, ACM, 1997.","DOI":"10.1145\/258533.258638"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung, \u201cUniversal one-way hash functions and their cryptographic applications,\u201d Proceedings of the 21st Annual Symposium on Theory of Computing, ACM, 1989.","DOI":"10.1145\/73007.73011"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"A. Odlyzko, \u201cThe rise and fall of knapsack cryptosystems,\u201d Advances in computational number theory, C. Pomerance ed., Proc. Symp. Applied Math No. 42, pp. 75\u201388, AMS, 1990.","DOI":"10.1090\/psapm\/042\/1095552"},{"key":"13_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-57341-0","volume-title":"Advances in Cryptology \u2014 Crypto 93 Proceedings","author":"B. Preneel","year":"1993","unstructured":"B. Preneel, R. Govaerts and J. Vandewalle, \u201cHash functions based on block ciphers: a synthetic approach,\u201d Advances in Cryptology \u2014 Crypto 93 Proceedings, Lecture Notes in Computer Science Vol. 773, D. Stinson ed., Springer-Verlag, 1993."},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"R. Rivest, \u201cThe MD5 Message-Digest Algorithm,\u201d IETF RFC 1321, April 1992.","DOI":"10.17487\/rfc1321"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"J. Rosser and L. Schoenfeld, \u201cApproximate formulas for some functions of prime numbers,\u201d Illinois Journal of Math Vol. 6, 1962.","DOI":"10.1215\/ijm\/1255631807"},{"key":"13_CR28","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 Eurocrypt 95 Proceedings","author":"C. Schnorr","year":"1995","unstructured":"C. Schnorr and H. H\u00f6rner, \u201cAttacking the Chor-Rivest cryptosystem with improved lattice reduction,\u201d Advances in Cryptology \u2014 Eurocrypt 95 Proceedings, Lecture Notes in Computer Science Vol. 921, L. Guillou and J. Quisquater ed., Springer-Verlag, 1995."},{"key":"13_CR29","volume-title":"Federal Information Processing Standard (FIPS)","author":"FIPS 180-1","year":"1995","unstructured":"FIPS 180-1. \u201cSecure Hash Standard,\u201d Federal Information Processing Standard (FIPS), Publication 180-1, National Institute of Standards and Technology, US Department of Commerce, Washington D.C., April 1995."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69053-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T15:32:01Z","timestamp":1556724721000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69053-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540629757","9783540690535"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-69053-0_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1997]]}}}