{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:56:55Z","timestamp":1725544615353},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540333548"},{"type":"electronic","value":"9783540333555"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11734727_21","type":"book-chapter","created":{"date-parts":[[2006,7,10]],"date-time":"2006-07-10T15:57:27Z","timestamp":1152547047000},"page":"242-260","source":"Crossref","is-referenced-by-count":3,"title":["Hybrid Symmetric Encryption Using Known-Plaintext Attack-Secure Components"],"prefix":"10.1007","author":[{"given":"Kazuhiko","family":"Minematsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yukiyasu","family":"Tsunoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_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":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/3-540-60865-6_48","volume-title":"Fast Software Encryption","author":"R. Anderson","year":"1996","unstructured":"Anderson, R., Biham, E.: Two Practical and Provably Secure Block Ciphers: BEAR and LION. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol.\u00a01039, pp. 113\u2013120. Springer, Heidelberg (1996)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A Concrete Security Treatment of Symmetric Encryption. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, pp. 394\u2013403 (1997)","DOI":"10.1109\/SFCS.1997.646128"},{"key":"21_CR4","unstructured":"Biryukov, A.: New 128-bit Key Stream Cipher LEX. ECRYPT Stream Cipher Project Report, available from: \n                    \n                      http:\/\/www.ecrypt.eu.org\/stream\/"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/3-540-48285-7_14","volume-title":"Advances in Cryptology - EUROCRYPT 1993","author":"J. Daemen","year":"1994","unstructured":"Daemen, J., Govaerts, R., Vandewalle, J.: Resynchronization Weaknesses in Synchronous Stream Ciphers. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 159\u2013167. Springer, Heidelberg (1994)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/3-540-45708-9_29","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Nielsen, J.: 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)"},{"issue":"4","key":"21_CR7","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to Construct Random Functions. Journal of the ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"Journal of the ACM"},{"key":"21_CR8","unstructured":"Goldreich, O.: Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Springer, Heidelberg"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/BFb0052345","volume-title":"Fast Software Encryption","author":"S. Halevi","year":"1997","unstructured":"Halevi, S., Krawczyk, H.: MMH:Software Message Authentication in the Gbit\/second rates. In: Biham, E. (ed.) FSE 1997. LNCS, vol.\u00a01267, pp. 172\u2013189. Springer, Heidelberg (1997)"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-45146-4_28","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"S. Halevi","year":"2003","unstructured":"Halevi, S., Rogaway, P.: A Tweakable Enciphering Mode. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 482\u2013499. Springer, Heidelberg (2003)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-24660-2_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"S. Halevi","year":"2004","unstructured":"Halevi, S., Rogaway, P.: A Parallelizable Enciphering Mode. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol.\u00a02964, pp. 292\u2013304. Springer, Heidelberg (2004)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/3-540-36552-4_16","volume-title":"Information Security and Cryptology - ICISC 2002","author":"T. Iwata","year":"2003","unstructured":"Iwata, T., Kurosawa, K.: On the Universal Hash Functions in Luby-Rackoff Cipher. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 226\u2013236. Springer, Heidelberg (2003)"},{"issue":"2","key":"21_CR13","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 Pseudo-random Permutations from Pseudo-random functions. SIAM J. Computing\u00a017(2), 373\u2013386 (1988)","journal-title":"SIAM J. Computing"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-60865-6_53","volume-title":"Fast Software Encryption","author":"S. Lucks","year":"1996","unstructured":"Lucks, S.: Faster Luby-Rackoff Ciphers. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol.\u00a01039, pp. 189\u2013203. Springer, Heidelberg (1996)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/3-540-47555-9_21","volume-title":"Advances in Cryptology - EUROCRYPT 1992","author":"U. Maurer","year":"1993","unstructured":"Maurer, U.: A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generators. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 239\u2013255. Springer, Heidelberg (1993)"},{"issue":"1","key":"21_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF02620231","volume":"6","author":"U. Maurer","year":"1993","unstructured":"Maurer, U., Massey, J.L.: Cascade Ciphers: The Importance of Being First. J. Cryptology\u00a06(1), 55\u201361 (1993)","journal-title":"J. Cryptology"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-46035-7_8","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"U. Maurer","year":"2002","unstructured":"Maurer, U.: Indistinguishability of Random Systems. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 110\u2013132. Springer, Heidelberg (2002)"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-540-24638-1_23","volume-title":"Theory of Cryptography","author":"U. Maurer","year":"2004","unstructured":"Maurer, U., Pietrzak, K.: Composition of Random Systems: When Two Weak Make One Strong. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 410\u2013427. Springer, Heidelberg (2004)"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-45473-X_21","volume-title":"Fast Software Encryption","author":"M. Minier","year":"2002","unstructured":"Minier, M., Gilbert, H.: New Results on the Pseudorandomness of Some Blockcipher Constructions. In: Matsui, M. (ed.) FSE 2001. LNCS, vol.\u00a02355, pp. 248\u2013266. Springer, Heidelberg (2002)"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-44448-3_22","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"S. Moriai","year":"2000","unstructured":"Moriai, S., Vaudenay, S.: On the Pseudorandomness of Top-Level Schemes of Block Ciphers. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 289\u2013302. Springer, Heidelberg (2000)"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-24676-3_12","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"S. Myers","year":"2004","unstructured":"Myers, S.: Black-Box Composition Does Not Imply Adaptive Security. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 189\u2013206. Springer, Heidelberg (2004)"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Naor, M., Reingold, O.: Number-theoretic Constructions of Efficient Pseudo-random Functions. In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, pp. 458\u2013467 (1997)","DOI":"10.1109\/SFCS.1997.646134"},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BFb0055734","volume-title":"Advances in Cryptology - CRYPTO 1998","author":"M. Naor","year":"1998","unstructured":"Naor, M., Reingold, O.: From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract). In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 267\u2013282. Springer, Heidelberg (1998)"},{"issue":"2","key":"21_CR24","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. of Computer and Systems Sciences\u00a058(2), 336\u2013375 (1999)","journal-title":"J. of Computer and Systems Sciences"},{"issue":"1","key":"21_CR25","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. Journal of Cryptology\u00a012(1), 29\u201366 (1999)","journal-title":"Journal of Cryptology"},{"key":"21_CR26","unstructured":"Naor, M., Reingold, O.: The NR Mode of Operation (manuscript), available from: \n                    \n                      http:\/\/www.wisdom.weizmann.ac.il\/~naor\/PAPERS\/nr-mode.ps"},{"key":"21_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-48519-8_13","volume-title":"Fast Software Encryption","author":"S. Patel","year":"1999","unstructured":"Patel, S., Ramzan, Z., Sundaram, G.: Towards Making Luby-Rackoff Ciphers Optimal and Practical. In: Knudsen, L.R. (ed.) FSE 1999. LNCS, vol.\u00a01636, pp. 171\u2013185. Springer, Heidelberg (1999)"},{"key":"21_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-540-28628-8_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J. Patarin","year":"2004","unstructured":"Patarin, J.: Security of Random Feistel Schemes with 5 or More Rounds. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 106\u2013122. Springer, Heidelberg (2004)"},{"key":"21_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48892-8_1","volume-title":"Selected Areas in Cryptography","author":"S. Vaudenay","year":"1999","unstructured":"Vaudenay, S.: Feistel Ciphers with L\n                           2-Decorrelation. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol.\u00a01556, pp. 1\u201314. Springer, Heidelberg (1999)"},{"key":"21_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BFb0028566","volume-title":"STACS 1998","author":"S. Vaudenay","year":"1998","unstructured":"Vaudenay, S.: Provable Security for Block Ciphers by Decorrelation. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 249\u2013275. Springer, Heidelberg (1998)"},{"key":"21_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-46513-8_4","volume-title":"Selected Areas in Cryptography","author":"S. Vaudenay","year":"2000","unstructured":"Vaudenay, S.: Adaptive-Attack Norm for Decorrelation and Super-Pseudorandomness. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol.\u00a01758, pp. 49\u201361. Springer, Heidelberg (2000)"},{"key":"21_CR32","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. Wegman","year":"1981","unstructured":"Wegman, M., Carter, L.: New Hash Functions and Their Use in Authentication and Set Equality. Journal of Computer and System Sciences\u00a022, 265\u2013279 (1981)","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/0-387-34805-0_42","volume-title":"Advances in Cryptology - CRYPTO 1989","author":"Y. Zheng","year":"1990","unstructured":"Zheng, Y., Matsumoto, T., Imai, H.: On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 461\u2013480. Springer, Heidelberg (1990)"},{"key":"21_CR34","unstructured":"ECRYPT Stream Cipher Project, \n                    \n                      http:\/\/www.ecrypt.eu.org\/stream\/"},{"key":"21_CR35","unstructured":"Security in Storage Working Group, An IEEE Information Assurance Activity, \n                    \n                      http:\/\/www.siswg.org"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11734727_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T04:24:09Z","timestamp":1552364649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11734727_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540333548","9783540333555"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/11734727_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}