{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:17:30Z","timestamp":1772893050146,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540140399","type":"print"},{"value":"9783540392002","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-39200-9_31","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T03:35:32Z","timestamp":1187235332000},"page":"491-506","source":"Crossref","is-referenced-by-count":203,"title":["A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications"],"prefix":"10.1007","author":[{"given":"Mihir","family":"Bellare","sequence":"first","affiliation":[]},{"given":"Tadayoshi","family":"Kohno","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1006\/jcss.1999.1694","volume":"61","author":"M. Bellare","year":"2000","unstructured":"M. Bellare, J. Kilian, and P. Rogaway. The security of the cipher block chaining message authentication code. Journal of Computer and System Sciences, 61(3):362\u2013399, 2000.","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR2","unstructured":"M. Bellare and T. Kohno. A theoretical treatment of related-key attacks: RKAPRPs, RKA-PRFs, and applications. Full version of this paper, available at http:\/\/www-cse.ucsd.edu\/users\/tkohno\/papers\/RKA\/ , 2003."},{"key":"31_CR3","series-title":"Lect Notes Comput Sci","first-page":"398","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 93","author":"E. Biham","year":"1993","unstructured":"E. Biham. New types of cryptanalytic attacks using related keys. In T. Helleseth, editor, Advances in Cryptology \u2014 EUROCRYPT\u2019 93, volume 765 of Lecture Notes in Computer Science, pages 398\u2013409. Springer-Verlag, Berlin Germany, 1993."},{"key":"31_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/3-540-44598-6_12","volume-title":"Advances in Cryptology-CRYPTO 2000","author":"J. Black","year":"2000","unstructured":"J. Black and P. Rogaway. CBC MACs for arbitrary-length messages: The threekey construction. In M. Bellare, editor, Advances in Cryptology-CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 197\u2013215. Springer-Verlag, Berlin Germany, 2000."},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"N. Courtois and J. Pieprzyk. Cryptanalysis of block ciphers with overdefined systems of equations. Cryptology ePrint Archive http:\/\/eprint.iacr.org\/ Report 2002\/044, 2002.","DOI":"10.1007\/3-540-36178-2_17"},{"key":"31_CR6","unstructured":"J. Daemen and V. Rijmen. AES proposal: Rijndael. http:\/\/csrc.nist.gov\/encryption\/aes\/rijndael\/Rijndael.pdf , 1999."},{"key":"31_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04722-4","volume-title":"The Design of Rijndael","author":"J. Daemen","year":"2002","unstructured":"J. Daemen and V. Rijmen. The Design of Rijndael. Springer-Verlag, Berlin Germany, 2002."},{"key":"31_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44706-7_15","volume-title":"Fast Software Encryption 2000","author":"N. Ferguson","year":"2000","unstructured":"N. Ferguson, J. Kelsey, S. Lucks, B. Schneier, M. Stay, D. Wagner, and D. Whiting. Improved cryptanalysis of Rijndael. In B. Schneier, editor, Fast Software Encryption 2000, volume 1978 of Lecture Notes in Computer Science, pages 213\u2013230. Springer-Verlag, Berlin Germany, 2000."},{"issue":"4","key":"31_CR9","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):210\u2013217, 1986.","journal-title":"Journal of the ACM"},{"key":"31_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Fast Software Encryption 2003","author":"T. Iwata","year":"2003","unstructured":"T. Iwata and K. Kurosawa. OMAC: One-key CBC MAC. In T. Johansson, editor, Fast Software Encryption 2003, Lecture Notes in Computer Science. Springer-Verlag, Berlin Germany, 2003."},{"key":"31_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-68697-5_19","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 96","author":"J. Kelsey","year":"1996","unstructured":"J. Kelsey, B. Schneier, and D. Wagner. Key-schedule cryptanalysis of IDEA, GDES, GOST, SAFER, and Triple-DES. In N. Koblitz, editor, Advances in Cryptology \u2014 CRYPTO\u2019 96, volume 1109 of Lecture Notes in Computer Science, pages 237\u2013251. Springer-Verlag, Berlin Germany, 1996."},{"key":"31_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Fast Software Encryption 2003","author":"L. Knudsen","year":"2003","unstructured":"L. Knudsen and T. Kohno. Analysis of RMAC. In T. Johansson, editor, Fast Software Encryption 2003, Lecture Notes in Computer Science. Springer-Verlag, Berlin Germany, 2003."},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"K. Kurosawa and T. Iwata. TMAC: Two-key CBC MAC. NIST submission, available at http:\/\/csrc.nist.gov\/CryptoToolkit\/modes\/ , June 2002.","DOI":"10.1007\/3-540-36563-X_3"},{"key":"31_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-45708-9_3","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"M. Liskov","year":"2002","unstructured":"M. Liskov, R. Rivest, and D. Wagner. Tweakable block ciphers. In M. Yung, editor, Advances in Cryptology \u2014 CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 31\u201346. Springer-Verlag, Berlin Germany, 2002."},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Computation, 17(2), Apr. 1988.","DOI":"10.1137\/0217022"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"M. Naor and O. Reingold. Number-theoretic constructions of efficient pseudorandom functions. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pages 458\u2013467. IEEE Computer Society Press, 1997.","DOI":"10.1109\/SFCS.1997.646134"},{"key":"31_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/3-540-45708-9_26","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"J. B. Nielsen","year":"2002","unstructured":"J. B. Nielsen. A threshold pseudorandom function construction and its applications. In M. Yung, editor, Advances in Cryptology \u2014 CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 401\u2013416. Springer-Verlag, Berlin Germany, 2002."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-39200-9_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:09:29Z","timestamp":1556755769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39200-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540140399","9783540392002"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-39200-9_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}