{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:00:20Z","timestamp":1725796820101},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662443705"},{"type":"electronic","value":"9783662443712"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-662-44371-2_2","type":"book-chapter","created":{"date-parts":[[2014,7,13]],"date-time":"2014-07-13T23:28:15Z","timestamp":1405294095000},"page":"20-38","source":"Crossref","is-referenced-by-count":15,"title":["The Security of Multiple Encryption in the Ideal Cipher Model"],"prefix":"10.1007","author":[{"given":"Yuanxi","family":"Dai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jooyoung","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Mennink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Steinberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/BFb0055743","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"W. Aiello","year":"1998","unstructured":"Aiello, W., Bellare, M., Di Crescenzo, G., Venkatesan, R.: Security amplification by composition: the case of doubly-iterated, ideal ciphers. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 390\u2013407. Springer, Heidelberg (1998)"},{"key":"2_CR2","unstructured":"ANSI X9.52: Triple Data Encryption Algorithm Modes of Operation, withdrawn (1998)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-25385-0_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"F. Armknecht","year":"2011","unstructured":"Armknecht, F., Fleischmann, E., Krause, M., Lee, J., Stam, M., Steinberger, J.: The preimage security of double-block length compression functions. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 233\u2013251. Springer, Heidelberg (2011)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M. Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework\u00a0for\u00a0code-based\u00a0game-playing\u00a0proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 409\u2013426. Springer, Heidelberg (2006)"},{"key":"2_CR5","unstructured":"Bellare, M., Rogaway, P.: Code-based game-playing proofs and the security of triple encryption. IACR eprint report, \n                    \n                      http:\/\/eprint.iacr.org\/2004\/331"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-45708-9_21","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J.A. Black","year":"2002","unstructured":"Black, J.A., Rogaway, P., Shrimpton, T.: Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 320\u2013335. Springer, Heidelberg (2002)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-29011-4_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A. Bogdanov","year":"2012","unstructured":"Bogdanov, A., Knudsen, L.R., Leander, G., Standaert, F.-X., Steinberger, J., Tischhauser, E.: Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 45\u201362. Springer, Heidelberg (2012)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-55220-5_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S. Chen","year":"2014","unstructured":"Chen, S., Steinberger, J.: Tight security bounds for key-alternating ciphers. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol.\u00a08441, pp. 327\u2013350. Springer, Heidelberg (2014)"},{"key":"2_CR9","unstructured":"Dai, Y., Steinberger, J.: Tight security bounds for multiple encryption. IACR Cryptology ePrint Archive, 2014\/096, \n                    \n                      http:\/\/eprint.iacr.org\/2014\/096.pdf"},{"key":"2_CR10","unstructured":"Dai, Y., Lee, J., Mennink, B., Steinberger, J.: The security of multiple encryption in the ideal cipher model (Full version of this paper.) IACR Cryptology ePrint Archive"},{"issue":"6","key":"2_CR11","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/C-M.1977.217750","volume":"10","author":"W. Diffie","year":"1997","unstructured":"Diffie, W., Hellman, M.: Exhaustive cryptanalysis of the NBS data encryption standard. Computer\u00a010(6), 74\u201384 (1997)","journal-title":"Computer"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-32009-5_42","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I. Dinur","year":"2012","unstructured":"Dinur, I., Dunkelman, O., Keller, N., Shamir, A.: Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 719\u2013740. Springer, Heidelberg (2012)"},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/214438.214442","volume":"3","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O.: On the power of cascade ciphers. ACM Transactions on Computer Systems\u00a03(2), 108\u2013116 (1985)","journal-title":"ACM Transactions on Computer Systems"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/3-540-57332-1_17","volume-title":"Advances in Cryptology - ASIACRYPT \u201991","author":"S. Even","year":"1993","unstructured":"Even, S., Mansour, Y.: A Construction of a Cipher From a Single Pseudorandom Permutation. In: Matsumoto, T., Imai, H., Rivest, R.L. (eds.) ASIACRYPT 1991. LNCS, vol.\u00a0739, pp. 210\u2013224. Springer, Heidelberg (1993)"},{"key":"2_CR15","unstructured":"FIPS46-3: Data Encryption Standard. National Institute of Standards and Technology, withdrawn (1999)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-642-40041-4_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"P. Ga\u017ei","year":"2013","unstructured":"Ga\u017ei, P.: Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol.\u00a08042, pp. 551\u2013570. Springer, Heidelberg (2013)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-10366-7_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"P. Ga\u017ei","year":"2009","unstructured":"Ga\u017ei, P., Maurer, U.: Cascade encryption revisited. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 37\u201351. Springer, Heidelberg (2009)"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-642-29011-4_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"P. Ga\u017ei","year":"2012","unstructured":"Ga\u017ei, P., Tessaro, S.: Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 63\u201380. Springer, Heidelberg (2012)"},{"issue":"1","key":"2_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s001450010015","volume":"14","author":"J. Kilian","year":"2001","unstructured":"Kilian, J., Rogaway, P.: How to protect DES against exhaustive key search (an analysis of DESX). Journal of Cryptology\u00a014(1), 17\u201335 (2001)","journal-title":"Journal of Cryptology"},{"key":"2_CR20","unstructured":"Krause, M., Armknecht, F., Fleischmann, E.: Preimage resistance beyond the birthday bound: Double-length hashing revisited. IACR eprint report, \n                    \n                      http:\/\/eprint.iacr.org\/2010\/519.pdf"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-34961-4_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"R. Lampe","year":"2012","unstructured":"Lampe, R., Patarin, J., Seurin, Y.: An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol.\u00a07658, pp. 278\u2013295. Springer, Heidelberg (2012)"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-38348-9_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"J. Lee","year":"2013","unstructured":"Lee, J.: Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 405\u2013425. Springer, Heidelberg (2013)"},{"key":"2_CR23","unstructured":"Lee, J.: Tight Security for Triple Encryption. IACR Cryptology ePrint Archive, 2014\/015, \n                    \n                      http:\/\/eprint.iacr.org\/2014\/015.pdf"},{"key":"2_CR24","unstructured":"Lee, J., Steinberger, J., Stam, M.: The preimage security of double-block-length compression functions. IACR eprint report, \n                    \n                      http:\/\/eprint.iacr.org\/2011\/210.pdf"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Luby, M., Rackoff, C.: Pseudo-random permutation generators and cryptographic composition. In: STOC 1986: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pp. 356\u2013363 (1986)","DOI":"10.1145\/12130.12167"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-69710-1_16","volume-title":"Fast Software Encryption","author":"S. Lucks","year":"1998","unstructured":"Lucks, S.: Attacking triple encryption. In: Vaudenay, S. (ed.) FSE 1998. LNCS, vol.\u00a01372, pp. 239\u2013253. Springer, Heidelberg (1998)"},{"issue":"1","key":"2_CR27","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. Journal of Cryptology\u00a06(1), 55\u201361 (1993)","journal-title":"Journal of Cryptology"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-74143-5_8","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"U. Maurer","year":"2007","unstructured":"Maurer, U., Pietrzak, K., Renner, R.: Indistinguishability amplification. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 130\u2013149. Springer, Heidelberg (2007)"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-03356-8_21","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"U. Maurer","year":"2009","unstructured":"Maurer, U., Tessaro, S.: Computational indistinguishability amplification: Tight product theorems for system composition. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 355\u2013373. Springer, Heidelberg (2009)"},{"key":"2_CR30","unstructured":"Mennink, B., Preneel, B.: Triple and Quadruple Encryption: Bridging the Gap. IACR Cryptology ePrint Archive, 2014\/016, \n                    \n                      http:\/\/eprint.iacr.org\/2014\/016.pdf"},{"key":"#cr-split#-2_CR31.1","doi-asserted-by":"crossref","unstructured":"Merkle, R., Hellman, M.: On the Security of Multiple Encryption. Communications of the ACM\u00a024(7), 465-467 (1981)","DOI":"10.1145\/358699.358718"},{"key":"#cr-split#-2_CR31.2","doi-asserted-by":"crossref","unstructured":"See also: Communications of the ACM 24(11), 776 (1981)","DOI":"10.1145\/358790.383432"},{"key":"2_CR32","unstructured":"Myers, S.: On the development of block-ciphers and pseudo-random function generators using the composition and XOR operators. Master\u2019s thesis, University of Toronto (1999)"},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/3-540-68697-5_18","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"P.C. Oorschot van","year":"1996","unstructured":"van Oorschot, P.C., Wiener, M.: Improving implementable meet-in-the-middle attacks by orders of magnitude. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 229\u2013236. Springer, Heidelberg (1996)"},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-46877-3_29","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"P.C. Oorschot van","year":"1991","unstructured":"van Oorschot, P.C., Wiener, M.: A Known-Plaintext Attack on Two-Key Triple Encryption. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 318\u2013325. Springer, Heidelberg (1991)"},{"key":"2_CR35","unstructured":"NIST SP 800-67, Revision 1: Recommendation for the Triple Data Encryption Algorithm (TDEA) Block Cipher. National Institute of Standards and Technology (2012)"},{"key":"2_CR36","unstructured":"Patarin, J.: Etude de G\u00e9nerateurs de Permutations Bases sur les Schemas du DES. In Ph.D. Thesis. Inria, Domaine de Voluceau, France (1991)"},{"key":"2_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-04159-4_21","volume-title":"Selected Areas in Cryptography","author":"J. Patarin","year":"2009","unstructured":"Patarin, J.: The \u201cCoefficients H\u201d Technique. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol.\u00a05381, pp. 328\u2013345. Springer, Heidelberg (2009)"},{"key":"2_CR38","unstructured":"Steinberger, J.: Improved Security Bounds for Key-Alternating Ciphers via Hellinger Distance, \n                    \n                      http:\/\/eprint.iacr.org\/2012\/481.pdf"},{"key":"2_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-19571-6_3","volume-title":"Theory of Cryptography","author":"S. Tessaro","year":"2011","unstructured":"Tessaro, S.: Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 37\u201354. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44371-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T05:15:02Z","timestamp":1558934102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44371-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662443705","9783662443712"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44371-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}