{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:27:15Z","timestamp":1752229635170,"version":"3.34.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,4,16]],"date-time":"2008-04-16T00:00:00Z","timestamp":1208304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s10623-008-9208-4","type":"journal-article","created":{"date-parts":[[2008,4,15]],"date-time":"2008-04-15T14:08:41Z","timestamp":1208268521000},"page":"293-305","source":"Crossref","is-referenced-by-count":13,"title":["A synthetic indifferentiability analysis of some block-cipher-based hash functions"],"prefix":"10.1007","volume":"48","author":[{"given":"Zheng","family":"Gong","sequence":"first","affiliation":[]},{"given":"Xuejia","family":"Lai","sequence":"additional","affiliation":[]},{"given":"Kefei","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,4,16]]},"reference":[{"key":"9208_CR1","doi-asserted-by":"crossref","unstructured":"Bellare M., Rogaway P.: Random oracle are practical: a paradigm for designing efficient protocols. In: ACM CCS\u201993, ACM, pp. 62\u201373 (1993).","DOI":"10.1145\/168588.168596"},{"key":"9208_CR2","doi-asserted-by":"crossref","unstructured":"Black J., Rogaway P., Shrimpton T.: Black-box analysis of the black-cipher-based hash-function constructions from PGV. In: Advances in Cryptology\u2013CRYPTO\u201902. LNCS 2442, pp. 320\u2013335 (2002).","DOI":"10.1007\/3-540-45708-9_21"},{"issue":"3","key":"9208_CR3","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. SIAM J Comput. 32(3), 586\u2013615 (2003)","journal-title":"SIAM J Comput."},{"key":"9208_CR4","unstructured":"Brachtl B.O., Coppersmith D., Hyden M.M., Matyas S.M., Meyer C.H., Oseas J., Pilpel S., Schilling M.: Data authentication using modification detection codes based on a public one way encryption function. US Patent Number 4,908,861, 13 March 1990."},{"key":"9208_CR5","unstructured":"Brown D.: Generic groups, collision resistance, and ECDSA. http:\/\/eprint.iacr.org\/2002\/026 (2002) Accessed 27 Feb 2002."},{"key":"9208_CR6","unstructured":"Canetti R., Goldreich O., Halevi S.: The randoom oracle methodology, revisited. In: Proceedings of 30th ACM Symposium on the Theory of Computing. ACM Press, pp. 209\u2013218 (1998)."},{"key":"9208_CR7","doi-asserted-by":"crossref","unstructured":"Chang D.H., Lee S.J., Nandi M., Yung M.: Indifferentiable security analysis of popular hash functions with prefix-free padding. In: Lai X., Chen K. (eds.), ASIACRYPT 2006, LNCS 4284, pp. 283\u2013298 (2006).","DOI":"10.1007\/11935230_19"},{"key":"9208_CR8","doi-asserted-by":"crossref","unstructured":"Coron J.S., Dodis Y., Malinaud C., Puniya P.: Merkle-damgard revisited: how to construct a hash function. In: Advances in Cryptology\u2013CRYPTO\u201905, LNCS 3621, pp. 21\u201339 (2005).","DOI":"10.1007\/11535218_26"},{"key":"9208_CR9","unstructured":"Damgard I.: A design principle for hash functions. In: Advances in Cryptology, Cyrpto\u201989, LNCS 435, pp. 416\u2013427 (1989)."},{"key":"9208_CR10","unstructured":"Dent A.: Adapting the weakness of the random oracle to the generic model. In: ASIACRYPT 2002, LNCS 2501, pp. 101\u2013109 (2002)."},{"key":"9208_CR11","unstructured":"Fujisaki E., Okamoto T.: Secure integration of asymmetric and symmetric encryption schemes. In: CRYPTO\u201999, LNCS 1666, pp. 537\u2013554 (1999)."},{"key":"9208_CR12","doi-asserted-by":"crossref","unstructured":"Goldwasser S., Tauman Y.: On the (In) security of the Fiat-Shamir paradigm. In: FOCS 2003, IEEE Computer Society, pp. 102\u2013122 (2003).","DOI":"10.1109\/SFCS.2003.1238185"},{"key":"9208_CR13","doi-asserted-by":"crossref","unstructured":"Hirose S.: Some plausible constructions of double-block-length hash functions. In: FSE 2006, LNCS 4047, pp. 210\u2013225 (2006).","DOI":"10.1007\/11799313_14"},{"key":"9208_CR14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s001459900035","volume":"11","author":"L.R. Knudsen","year":"1998","unstructured":"Knudsen, L.R., Lai, X., Preneel, B.: Attacks on fast double block length hash functions. J. Cryptol. 11, 59\u201372 (1998)","journal-title":"J. Cryptol."},{"key":"9208_CR15","doi-asserted-by":"crossref","unstructured":"Lai X., Massey J.L.: Hash functions based on block ciphers. In: Advances in Cryptology-Eurocrypt\u201992, LNCS 658, pp. 55\u201370 (1993).","DOI":"10.1007\/3-540-47555-9_5"},{"key":"9208_CR16","doi-asserted-by":"crossref","unstructured":"Lucks S.: A failure-friendly design principle for hash functions. In: ASIACRYPT 2005, LNCS 3788, pp. 474\u2013494 (2005).","DOI":"10.1007\/11593447_26"},{"key":"9208_CR17","doi-asserted-by":"crossref","unstructured":"Maurer U., Renner R., Holenstein C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In: Theory of Cryptography\u2014TCC 2004, LNCS 2951, pp. 21\u201339 (2004).","DOI":"10.1007\/978-3-540-24638-1_2"},{"key":"9208_CR18","unstructured":"Merkle R.C.: One way hash functions and DES. In: Advances in Cryptology, Crypto\u201989, LNCS 435, pp. 428\u2013446 (1989)."},{"key":"9208_CR19","doi-asserted-by":"crossref","unstructured":"Nielsen J.B.: Separating random oracle proofs from complexity theoretic proofs: the non-committing encryption case. In: CRYPTO\u201998, LNCS 2442, pp. 111\u2013126 (2002).","DOI":"10.1007\/3-540-45708-9_8"},{"key":"9208_CR20","doi-asserted-by":"crossref","unstructured":"Paillier P., Vergnaud D.: Discrete-log-based signatures may not be equivalent to discrete log. In: ASIACRYPT 2005, LNCS 3788, pp. 1\u201320 (2005).","DOI":"10.1007\/11593447_1"},{"key":"9208_CR21","doi-asserted-by":"crossref","unstructured":"Preneel B., Bosselaers A., Govaerts R., Vandewalle J.: Collision-free hash-functions based on blockcipher algorithms. In: Proceedings of 1989 International Carnahan Conference on Security Technology, pp. 203\u2013210 (1989).","DOI":"10.1109\/CCST.1989.751980"},{"key":"9208_CR22","doi-asserted-by":"crossref","unstructured":"Preneel B., Govaerts R., Vandewalle J.: Hash functions based on block ciphers: a synthetic approach. In: Advances in Cryptology-CRYPTO\u201993, LNCS 773, pp. 368\u2013378 (1994).","DOI":"10.1007\/3-540-48329-2_31"},{"key":"9208_CR23","unstructured":"Rogaway P., Shrimpton T.: Cryptographic hash-function basics: definitions, implications, and separations for preimage resistance, second-preimage resistance and collision resistance. In: FSE 2004, LNCS 3017, pp. 371\u2013388 (2004)."},{"issue":"4","key":"9208_CR24","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C. Shannon","year":"1949","unstructured":"Shannon, C.: Communication theory of secrecy systems. Bell Syst. Tech. J 28(4), 656\u2013715 (1949)","journal-title":"Bell Syst. Tech. J"},{"key":"9208_CR25","doi-asserted-by":"crossref","unstructured":"Wang X., Yin Y., Yu H.: Finding collision in the Full SHA-1. In: CRYPTO\u201905, LNCS 3621, pp. 17\u201336 (2005).","DOI":"10.1007\/11535218_2"},{"key":"9208_CR26","doi-asserted-by":"crossref","unstructured":"Wang X., Yu H.: How to break MD5 and other hash functions. In: EUROCRYPT\u201905, LNCS 3494, pp. 19\u201335 (2005).","DOI":"10.1007\/11426639_2"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9208-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-008-9208-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9208-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T18:46:53Z","timestamp":1738176413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-008-9208-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,16]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["9208"],"URL":"https:\/\/doi.org\/10.1007\/s10623-008-9208-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2008,4,16]]}}}