{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:17:20Z","timestamp":1772893040930,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642026195","type":"print"},{"value":"9783642026201","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02620-1_12","type":"book-chapter","created":{"date-parts":[[2009,6,20]],"date-time":"2009-06-20T05:46:36Z","timestamp":1245476796000},"page":"171-184","source":"Crossref","is-referenced-by-count":5,"title":["Characterizing Padding Rules of MD Hash Functions Preserving Collision Security"],"prefix":"10.1007","author":[{"given":"Mridul","family":"Nandi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Andreeva, E., Preneel, B.: A Three-Property-Preserving Hash Function. To appear in: Selected Areas in Cryptography (2008)","DOI":"10.1007\/978-3-642-04159-4_15"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/BFb0052256","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Rogaway, P.: Collision-Resistant Hashing: Towards Making UOWHFs Practical. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 470\u2013484. Springer, Heidelberg (1997)"},{"key":"12_CR3","unstructured":"Bellare, M., Rogaway, P.: Introduction to Modern Cryptography, http:\/\/www-cse.ucsd.edu\/~mihir\/cse207\/classnotes.html"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45539-6_19","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"V. Shoup","year":"2000","unstructured":"Shoup, V.: Using Hash Functions as a Hedge against Chosen Ciphertext Attack. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 275\u2013288. Springer, Heidelberg (2000)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"I.B. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: A Design Principle for Hash Functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 416\u2013427. Springer, Heidelberg (1990)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/3-540-39118-5_19","volume-title":"Advances in Cryptology - EUROCRYPT \u201987","author":"I.B. Damg\u00e5rd","year":"1988","unstructured":"Damg\u00e5rd, I.B.: Collision Free Hash Functions and Public Key Signature Schemes. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol.\u00a0304, pp. 203\u2013216. Springer, Heidelberg (1988)"},{"key":"12_CR7","first-page":"407","volume":"138","author":"J.K. Gibson","year":"1991","unstructured":"Gibson, J.K.: Discrete logarithm hash function that is collision free and one-way. IEE Proceedings-E\u00a0138, 407\u2013410 (1991)","journal-title":"IEE Proceedings-E"},{"key":"12_CR8","unstructured":"Don., B.J.: Improving Hash Function Padding. NIST hash workshop (2005), http:\/\/csrc.nist.gov\/groups\/ST\/hash\/documents\/Johnson_Padding.pdf"},{"key":"12_CR9","unstructured":"Kelsey, J., Schneier, B.: Second Preimages on n-bit Hash Functions for Much Less than 2n Work. Cryptology ePrint Archive (2004), http:\/\/eprint.iacr.org\/2004\/304"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/0-387-34805-0_40","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"R. Merkle","year":"1990","unstructured":"Merkle, R.: One Way Hash Functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 428\u2013446. Springer, Heidelberg (1990)"},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/73007.73011","volume-title":"Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing","author":"M. Naor","year":"1989","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pp. 33\u201343. ACM Press, New York (1989)"},{"key":"12_CR12","unstructured":"NIST\/NSA. FIPS 180-2 Secure Hash Standard (August 2002), http:\/\/csrc.nist.gov\/publications\/fips\/fips180-2\/fips180-2.pdf"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Rogaway, P.: Formalizing Human Ignorance: Collision-Resistant Hashing without the Keys. Eprint archive (2006), http:\/\/eprint.iacr.org\/2006\/281.pdf","DOI":"10.1007\/11958239_14"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-25937-4_24","volume-title":"Fast Software Encryption","author":"P. Rogaway","year":"2004","unstructured":"Rogaway, P., Shrimpton, T.: Cryptographic Hash Function Basics: Definitions, Implications, and Separations for Pre-image Resistance, Second Pre-image Resistance, and Collision Resistance. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol.\u00a03017, pp. 371\u2013388. Springer, Heidelberg (2004)"},{"issue":"5","key":"12_CR15","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1016\/j.dam.2008.03.038","volume":"157","author":"P. Sarkar","year":"2009","unstructured":"Sarkar, P.: Domain Extender for Collision Resistant Hash Functions: Improving Upon Merkle-Damgard Iteration. Discrete Applied Mathematics\u00a0157(5), 1086\u20131097 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR16","unstructured":"Stinson, D.R.: Cryptography: Theory and Practice, 2nd edn. CRC Press, Inc., Boca Raton"},{"key":"12_CR17","unstructured":"Stinson, D.R.: Some observations on the theory of cryptographic hash functions. ePrint Archive Report (2001), http:\/\/eprint.iacr.org\/2001\/020\/"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02620-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T18:52:39Z","timestamp":1685040759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02620-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642026195","9783642026201"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02620-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}