{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:23:42Z","timestamp":1725474222345},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540497677"},{"type":"electronic","value":"9783540497691"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11941378_22","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T13:20:35Z","timestamp":1164633635000},"page":"303-316","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Shared-Key Authentication Scheme from Any Weak Pseudorandom Function"],"prefix":"10.1007","author":[{"given":"Ryo","family":"Nojima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazukuni","family":"Kobara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideki","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-48519-8_21","volume-title":"Fast Software Encryption","author":"W. Aiello","year":"1999","unstructured":"Aiello, W., Rajagopalan, S., Venkatesan, R.: High-Speed Pseudorandom Number Generation with Small Memory. In: Knudsen, L.R. (ed.) FSE 1999. LNCS, vol.\u00a01636, pp. 290\u2013304. Springer, Heidelberg (1999)"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M.: New Proofs for NMAC and HMAC: Security without Collision-Resistance (2006), Available from: http:\/\/www-cse.ucsd.edu\/~mihir\/papers\/hmac-new.html","DOI":"10.1007\/11818175_36"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Keying hash functions for message authentication. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 1\u201315. Springer, Heidelberg (1996)"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-45708-9_11","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"M. Bellare","year":"2002","unstructured":"Bellare, M., Palacio, A.: GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 162\u2013177. Springer, Heidelberg (2002)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-48329-2_24","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"A. Blum","year":"1994","unstructured":"Blum, A., Furst, M.L., Kearns, M.J., Lipton, R.J.: Cryptographic Primitives Based on Hard Learning Problems. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 278\u2013291. Springer, Heidelberg (1994)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Damg $\\dot {a}$ rd, I., Nielsen, J.B.: Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 449\u2013464. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-45708-9_29"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/11535218_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"A. Juels","year":"2005","unstructured":"Juels, A., Weis, S.A.: Authenticating Pervasive Devices with Human Protocols. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 293\u2013308. Springer, Heidelberg (2005)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-45682-1_4","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"N.J. Hopper","year":"2001","unstructured":"Hopper, N.J., Blum, M.: Secure Human Identification Protocols. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 52\u201366. Springer, Heidelberg (2001)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/11761679_6","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J. Katz","year":"2006","unstructured":"Katz, J., Shin, J.S.: Parallel and Concurrent Security of the HB and HB+ Protocols. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 73\u201387. Springer, Heidelberg (2006)"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/11761679_24","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"U.M. Maurer","year":"2006","unstructured":"Maurer, U.M., Oswald, Y.A., Pietrzak, K., Sj\u00f6din, J.: Luby-Rackoff Ciphers from Weak Round Functions? In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 391\u2013408. Springer, Heidelberg (2006)"},{"key":"22_CR11","unstructured":"Maurer, U., Sj\u00f6din, J.: From Known-Plaintext to Chosen-Ciphertext Security, Cryptology ePrint Archive, Report 2006\/071 (2006)"},{"issue":"2","key":"22_CR12","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1006\/jcss.1998.1618","volume":"58","author":"M. Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions. J. Comput. Syst. Sci.\u00a058(2), 336\u2013375 (1999)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"22_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/972639.972643","volume":"51","author":"M. Naor","year":"2004","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. J. ACM\u00a051(2), 231\u2013262 (2004)","journal-title":"J. ACM"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BFb0055734","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"M. Naor","year":"1998","unstructured":"Naor, M., Reingold, O.: From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 267\u2013282. Springer, Heidelberg (1998), Available from: http:\/\/www.wisdom.weizmann.ac.il\/~naor\/PAPERS\/mac_abs.html"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","first-page":"17","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","Progress in Cryptology - INDOCRYPT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11941378_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:50:24Z","timestamp":1619509824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11941378_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540497677","9783540497691"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11941378_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}