{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:45:29Z","timestamp":1725795929685},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662438251"},{"type":"electronic","value":"9783662438268"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43826-8_2","type":"book-chapter","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T23:50:01Z","timestamp":1403653801000},"page":"10-23","source":"Crossref","is-referenced-by-count":0,"title":["A Security Analysis of Key Expansion Functions Using Pseudorandom Permutations"],"prefix":"10.1007","author":[{"given":"Ju-Sung","family":"Kang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nayoung","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wangho","family":"Ju","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ok-Yeon","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1006\/jcss.1999.1694","volume":"61","author":"M. Bellare","year":"2000","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The security of the cipher block chaining message authentication code. J. Computer and System Sciences\u00a061(3), 362\u2013399 (2000)","journal-title":"J. Computer and System Sciences"},{"key":"2_CR2","unstructured":"Bellare, M., Rogaway, P.: Introduction to Mordern Cryptography, \n                    \n                      http:\/\/cseweb.ucsd.edu\/~mihir\/cse207\/classnotes.html"},{"key":"2_CR3","unstructured":"FIPS 198-1, The Keyed-Hash Message Authentication Code, HMAC (2008)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-540-39887-5_27","volume-title":"Fast Software Encryption","author":"H. Gilbert","year":"2003","unstructured":"Gilbert, H.: The security of one-block-to-many modes of operation. In: Johansson, T. (ed.) FSE 2003. LNCS, vol.\u00a02887, pp. 376\u2013395. Springer, Heidelberg (2003)"},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. of the ACM\u00a033(4), 210\u2013217 (1986)","journal-title":"J. of the ACM"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/978-3-642-14623-7_34","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"H. Krawczyk","year":"2010","unstructured":"Krawczyk, H.: Cryptographic extraction and key derivation: The HKDF scheme. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 631\u2013648. Springer, Heidelberg (2010)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations and pseudorandom functions. SIAM J. Comput.\u00a017, 373\u2013386 (1988)","journal-title":"SIAM J. Comput."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/PL00003817","volume":"12","author":"M. Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: On the construction of pseudorandom permutations: Luby-Rackoff revisited. J. Cryptology\u00a012, 29\u201366 (1999)","journal-title":"J. Cryptology"},{"key":"2_CR9","unstructured":"NIST Special Publication 800-108, Recommendation for Block Cipher Modes of Operation - The CMAC Mode for Authentication (May 2005)"},{"key":"2_CR10","unstructured":"NIST Special Publication 800-56C, Recommendation for Key Derivation through Extraction-then-Expansion (November 2011)"},{"key":"2_CR11","unstructured":"NIST Special Publication 800-108, Recommendation for Key Derivation Using Pseudorandom Functions (October 2009)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Patarin, J.: How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function. In: Rueppel, R.A. (ed.) Advances in Cryptology - EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 256\u2013266. Springer, Heidelberg (1993)","DOI":"10.1007\/3-540-47555-9_22"},{"key":"2_CR13","unstructured":"3rd Generation Partnership Project, Specification of the MILENAGE algorithm set: An example algorithm set for the 3GPP authentication and key generation functions f1, f1*, f2, f3, f4, f5 and f5*, \n                    \n                      http:\/\/www.3gpp.org"}],"container-title":["Lecture Notes in Computer Science","Information Security Theory and Practice. Securing the Internet of Things"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43826-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T00:42:17Z","timestamp":1558917737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43826-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662438251","9783662438268"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43826-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}