{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T12:10:36Z","timestamp":1725624636161},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642251405"},{"type":"electronic","value":"9783642251412"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25141-2_10","type":"book-chapter","created":{"date-parts":[[2011,10,22]],"date-time":"2011-10-22T13:30:01Z","timestamp":1319290201000},"page":"144-160","source":"Crossref","is-referenced-by-count":0,"title":["A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators"],"prefix":"10.1007","author":[{"given":"Koji","family":"Nuida","sequence":"first","affiliation":[]},{"given":"Takuro","family":"Abe","sequence":"additional","affiliation":[]},{"given":"Shizuo","family":"Kaji","sequence":"additional","affiliation":[]},{"given":"Toshiaki","family":"Maeno","sequence":"additional","affiliation":[]},{"given":"Yasuhide","family":"Numata","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM J. Comput.\u00a015, 364\u2013383 (1986)","journal-title":"SIAM J. Comput."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions (extended abstract). In: Proc. STOC 1977, pp. 106\u2013112 (1977)","DOI":"10.1145\/800105.803400"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Dubrov, B., Ishai, Y.: On the randomness complexity of efficient sampling. In: Proc. STOC 2006, pp. 711\u2013720 (2006)","DOI":"10.1145\/1132516.1132615"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-71677-8_28","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"R.R. Farashahi","year":"2007","unstructured":"Farashahi, R.R., Schoenmakers, B., Sidorenko, A.: Efficient Pseudorandom Generators Based on the DDH Assumption. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 426\u2013441. Springer, Heidelberg (2007)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/3-540-45961-8_39","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"T. Matsumoto","year":"1988","unstructured":"Matsumoto, T., Imai, H.: Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 419\u2013453. Springer, Heidelberg (1988)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-14496-7_6","volume-title":"Information Theoretic Security","author":"K. Nuida","year":"2010","unstructured":"Nuida, K., Hanaoka, G.: On the Security of Pseudorandomized Information-Theoretically Secure Schemes. In: Kurosawa, K. (ed.) ICITS 2009. LNCS, vol.\u00a05973, pp. 56\u201373. Springer, Heidelberg (2010)"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11958239_14","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"P. Rogaway","year":"2006","unstructured":"Rogaway, P.: Formalizing human ignorance \u2013 collision-resistant hashing without the keys. In: Nguy\u00ean, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol.\u00a04341, pp. 211\u2013228. Springer, Heidelberg (2006)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11535218_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yin, Y.L., Yu, H.: Finding Collisions in the Full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 17\u201336. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25141-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:00:37Z","timestamp":1555189237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25141-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642251405","9783642251412"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25141-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}