{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:05:19Z","timestamp":1765112719292},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131899"},{"type":"electronic","value":"9783642131905"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13190-5_31","type":"book-chapter","created":{"date-parts":[[2010,5,19]],"date-time":"2010-05-19T13:16:46Z","timestamp":1274275006000},"page":"616-637","source":"Crossref","is-referenced-by-count":19,"title":["Universal One-Way Hash Functions via Inaccessible Entropy"],"prefix":"10.1007","author":[{"given":"Iftach","family":"Haitner","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Holenstein","sequence":"additional","affiliation":[]},{"given":"Omer","family":"Reingold","sequence":"additional","affiliation":[]},{"given":"Salil","family":"Vadhan","sequence":"additional","affiliation":[]},{"given":"Hoeteck","family":"Wee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-74143-5_15","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"R. Canetti","year":"2007","unstructured":"Canetti, R., Rivest, R.L., Sudan, M., Trevisan, L., Vadhan, S.P., Wee, H.: Amplifying collision resistance: A complexity-theoretic treatment. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 264\u2013283. Springer, Heidelberg (2007)"},{"key":"31_CR2","volume-title":"Elements of information theory","author":"T.M. Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of information theory, 2nd edn. Wiley-Interscience, New York (2006)","edition":"2"},{"issue":"1","key":"31_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R. Cramer","year":"2003","unstructured":"Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM Journal on Computing\u00a033(1), 167\u2013226 (2003) (electronic)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"31_CR4","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1137\/080725404","volume":"39","author":"I. Haitner","year":"2009","unstructured":"Haitner, I., Nguyen, M., Ong, S.J., Reingold, O., Vadhan, S.: Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function. SIAM Journal on Computing\u00a039(3), 1153\u20131218 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR5","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC)","author":"I. Haitner","year":"2009","unstructured":"Haitner, I., Reingold, O., Vadhan, S., Wee, H.: Inaccessible entropy. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC). ACM Press, New York (2009)"},{"key":"31_CR6","volume-title":"Proceedings of the 42th Annual ACM Symposium on Theory of Computing (STOC)","author":"I. Haitner","year":"2010","unstructured":"Haitner, I., Reingold, O., Vadhan, S.: Efficiency improvements in constructions of pseudorandom generators. In: Proceedings of the 42th Annual ACM Symposium on Theory of Computing (STOC). ACM Press, New York (2010)"},{"issue":"4","key":"31_CR7","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal on Computing\u00a028(4), 1364\u20131396 (1999); Preliminary versions in STOC 1989 and STOC 1990","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS), pp. 230\u2013235 (1989)","key":"31_CR8","DOI":"10.1109\/SFCS.1989.63483"},{"unstructured":"Katz, J., Koo, C.: On constructing universal one-way hash functions from arbitrary one-way functions. Technical Report 2005\/328, Cryptology ePrint Archive (2005)","key":"31_CR9"},{"key":"31_CR10","first-page":"33","volume-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC)","author":"M. Naor","year":"1989","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC), pp. 33\u201343. ACM Press, New York (1989)"},{"doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC), pp. 387\u2013394 (1990)","key":"31_CR11","DOI":"10.1145\/100216.100269"},{"unstructured":"Rompel, J.: Techniques for computing with low-independence randomness. PhD thesis, Massachusetts Institute of Technology (1990), \n                    \n                      http:\/\/dspace.mit.edu\/handle\/1721.1\/7582","key":"31_CR12"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/3-540-45539-6_32","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"V. Shoup","year":"2000","unstructured":"Shoup, V.: A composition theorem for universal one-way hash functions. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 445\u2013452. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13190-5_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:57:15Z","timestamp":1619783835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13190-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131899","9783642131905"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13190-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}