{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:49:32Z","timestamp":1764132572072},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245735"},{"type":"electronic","value":"9783540305767"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30576-7_24","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T19:03:26Z","timestamp":1278270206000},"page":"445-456","source":"Crossref","is-referenced-by-count":38,"title":["Sufficient Conditions for Collision-Resistant Hashing"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to Go Beyond the Black-Box Simulation Barrier. In: Proc. of 42nd FOCS, pp. 106\u2013115 (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O.: Universal Arguments and their Applications. In: Proc. of 17th Conference on Computational Complexity, pp. 194\u2013203 (2002)","DOI":"10.1109\/CCC.2002.1004355"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Beimel, A., Ishai, Y., Kushilevitz, E., Malkin, T.: One-Way Functions Are Essential for Single-Server Private Information Retrieval. In: Proc. of 31st STOC, pp. 89\u201398 (1999)","DOI":"10.1145\/301250.301277"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"C. Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.A.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 402. Springer, Heidelberg (1999)"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-48329-2_22","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"I.B. Damg\u00e5rd","year":"1994","unstructured":"Damg\u00e5rd, I.B., Pedersen, T.P., Pfitzmann, B.: On the existence of statistically hiding bit commitment schemes and fail-stop sigantures. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 250\u2013265. Springer, Heidelberg (1994)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Fischlin, M.: On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function. In: Proc. of CT-RSA, pp. 79\u201395 (2002)","DOI":"10.1007\/3-540-45760-7_7"},{"key":"24_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography. Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Tools, vol.\u00a0I. Cambridge University Press, Cambridge (2001)"},{"key":"24_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography. Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Applications, vol.\u00a0II. Cambridge University Press, Cambridge (2004)"},{"key":"24_CR10","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Collision-Free Hashing from Lattice Problems. ECCC TR-42 (1996)"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic Encryption. Journal of Computer and systems sciences\u00a028, 270\u2013299 (1984)","journal-title":"Journal of Computer and systems sciences"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-68697-5_16","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"S. Halevi","year":"1996","unstructured":"Halevi, S., Micali, S.: Practical and provably-secure commitment schemes from collision-free hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 201\u2013215. Springer, Heidelberg (1996)"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/978-3-540-28628-8_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"C.-Y. Hsiao","year":"2004","unstructured":"Hsiao, C.-Y., Reyzin, L.: Finding collisions on a public road, or do secure hash functions need secret coins? In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 92\u2013105. Springer, Heidelberg (2004)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A Note on Efficient Zero-Knowledge Proofs and Arguments. In: Proc. of 24th STOC, pp. 723\u2013732 (1992)","DOI":"10.1145\/129712.129782"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is Not Needed: Single Database, Computationally-Private Information Retrieval. In: Proc. of 38th FOCS, pp. 364\u2013373 (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"key":"24_CR16","unstructured":"Mann, E.: Private access to distributed information. Master\u2019s thesis, Technion \u2013 Israel Institute of Technology, Haifa (1998)"},{"issue":"4","key":"24_CR17","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S. Micali","year":"2000","unstructured":"Micali, S.: CS Proofs. SIAM J. Computing\u00a030(4), 1253\u20131298 (2000); Early version appeared in FOCS 1994","journal-title":"SIAM J. Computing"},{"key":"#cr-split#-24_CR18.1","unstructured":"Ogata, W., Kurosawa, K.: On Claw Free Families. IEICE Trans.??E77-A(1), 72???80 (1994);"},{"key":"#cr-split#-24_CR18.2","unstructured":"Matsumoto, T., Imai, H., Rivest, R.L. (eds.): ASIACRYPT 1991. LNCS, vol.??739, pp. 72???80. Springer, Heidelberg (1993)"},{"key":"#cr-split#-24_CR19.1","doi-asserted-by":"crossref","unstructured":"Russell, A.: Necessary and Sufficient Conditions for Collision-Free Hashing. J. Cryptology??8(2), 87???100 (1995);","DOI":"10.1007\/BF00190757"},{"key":"#cr-split#-24_CR19.2","unstructured":"Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.??740, pp. 433???441. Springer, Heidelberg (1993)"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D.R. Simon","year":"1998","unstructured":"Simon, D.R.: Findings collisions on a one-way street: Can secure hash functions be based on general assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 334\u2013345. Springer, Heidelberg (1998)"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-49649-1_28","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"J.P. Stern","year":"1998","unstructured":"Stern, J.P.: A new and efficient all-or-nothing disclosure of secrets protocol. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 357\u2013371. Springer, Heidelberg (1998)"},{"key":"24_CR22","unstructured":"Wang, X., Feng, D., Lai, X., Yu, H.: Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD. Cryptology ePrint Archive TR-199 (2004)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30576-7_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:23:51Z","timestamp":1605759831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30576-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245735","9783540305767"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30576-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}