{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T09:11:49Z","timestamp":1761988309534},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642147111"},{"type":"electronic","value":"9783642147128"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14712-8_2","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T05:17:50Z","timestamp":1280380670000},"page":"20-39","source":"Crossref","is-referenced-by-count":8,"title":["Security of Sequential Multiple Encryption"],"prefix":"10.1007","author":[{"given":"Atsushi","family":"Fujioka","sequence":"first","affiliation":[]},{"given":"Yoshiaki","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Taiichi","family":"Saito","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/168588.168596","volume-title":"1st ACM Conference on Computer and Communications Security","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In: 1st ACM Conference on Computer and Communications Security, pp. 62\u201373. ACM, New York (1993)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among Notions of Security for Public-Key Encryption Schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 26\u201345. Springer, Heidelberg (1998)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding Cryptographic Keys. In: 1979 AFIPS National Computer Conference, vol.\u00a048, pp. 313\u2013317. AFIPS Press (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/11535218_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"J. Camenisch","year":"2005","unstructured":"Camenisch, J., Lysyanskaya, A.: A Formal Treatment of Onion Routing. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 169\u2013187. Springer, Heidelberg (2005)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-45539-6_33","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Canetti","year":"2000","unstructured":"Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., Sahai, A.: Exposure-Resilient Functions and All-Or-Nothing Transforms. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 453\u2013469. Springer, Heidelberg (2000)"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. ACM Commun.\u00a024(2), 84\u201388 (1981)","journal-title":"ACM Commun."},{"key":"2_CR8","unstructured":"Cui, Y., Kobara, K., Imai, H.: Efficient Multiple Encryption from OW-PCA Primitives. In: 2006 International Symposium on Information Theory and its Applications, SITA, pp. 502\u2013506 (2006)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/3-540-48184-2_8","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"Y. Desmedt","year":"1988","unstructured":"Desmedt, Y.: Society and Group Oriented Cryptography: A New Concept. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 120\u2013127. Springer, Heidelberg (1988)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"Y. Desmedt","year":"1990","unstructured":"Desmedt, Y., Frankel, Y.: Threshold Cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 307\u2013315. Springer, Heidelberg (1990)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-44993-5_5","volume-title":"Digital Rights Management","author":"Y. Dodis","year":"2003","unstructured":"Dodis, Y., Fazio, N.: Public Key Broadcast Encryption for Stateless Receivers. In: Feigenbaum, J. (ed.) DRM 2002. LNCS, vol.\u00a02696, pp. 61\u201380. Springer, Heidelberg (2003)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-30576-7_11","volume-title":"Theory of Cryptography","author":"Y. Dodis","year":"2005","unstructured":"Dodis, Y., Katz, J.: Chosen-Ciphertext Security of Multiple Encryption. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 188\u2013209. Springer, Heidelberg (2005)"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-46035-7_5","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"Y. Dodis","year":"2002","unstructured":"Dodis, Y., Katz, J., Xu, S., Yung, M.: Key-Insulated Public Key Cryptosystems. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 65\u201382. Springer, Heidelberg (2002)"},{"issue":"2","key":"2_CR14","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 Trans. Computer Systems\u00a03(2), 108\u2013116 (1985)","journal-title":"ACM Trans. Computer Systems"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/3-540-46885-4_8","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"Y. Frankel","year":"1990","unstructured":"Frankel, Y.: A Practical Protocol for Large Group Oriented Networks. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 56\u201361. Springer, Heidelberg (1990)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-49162-7_5","volume-title":"Public Key Cryptography","author":"E. Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: How to Enhance the Security of Public-Key Encryption at Minimum Cost. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol.\u00a01560, pp. 53\u201368. Springer, Heidelberg (1999)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"E. Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: Secure Integration of Asymmetric and Symmetric Encryption Schemes. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 537\u2013554. Springer, Heidelberg (1999)"},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic Encryption. J. Comput. Syst. Sci.\u00a028(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"2_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/293411.293443","volume":"42","author":"D. Goldschlag","year":"1999","unstructured":"Goldschlag, D., Reed, M., Syverson, P.: Onion Routing. ACM Commun.\u00a042(2), 39\u201341 (1999)","journal-title":"ACM Commun."},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-36178-2_28","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"P. Golle","year":"2002","unstructured":"Golle, P., Zhong, S., Boneh, D., Jakobsson, M., Juels, A.: Optimistic Mixing for Exit-Polls. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 451\u2013465. Springer, Heidelberg (2002)"},{"key":"2_CR21","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1145\/383962.384046","volume-title":"20th Annual ACM Symposium on Principles of Distributed Computing","author":"M. Jakobsson","year":"2001","unstructured":"Jakobsson, M., Juels, A.: An Optimally Robust Hybrid Mix Network. In: 20th Annual ACM Symposium on Principles of Distributed Computing, pp. 284\u2013292. ACM, New York (2001)"},{"issue":"1","key":"2_CR22","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF02620231","volume":"6","author":"U.M. Maurer","year":"1993","unstructured":"Maurer, U.M., Massey, J.L.: Cascade Ciphers: The Importance of Being First. J. Cryptology\u00a06(1), 55\u201361 (1993)","journal-title":"J. Cryptology"},{"issue":"7","key":"2_CR23","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/358699.358718","volume":"24","author":"R.C. Merkle","year":"1981","unstructured":"Merkle, R.C., Hellman, M.E.: On the Security of Multiple Encryption. ACM Commun.\u00a024(7), 465\u2013467 (1981)","journal-title":"ACM Commun."},{"key":"2_CR24","first-page":"427","volume-title":"22nd Annual ACM Symposium on Theory of Computing","author":"M. Naor","year":"1990","unstructured":"Naor, M., Yung, M.: Public-Key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. In: 22nd Annual ACM Symposium on Theory of Computing, pp. 427\u2013437. ACM, New York (1990)"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"C. Rackoff","year":"1992","unstructured":"Rackoff, C., Simon, D.: Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 433\u2013444. Springer, Heidelberg (1992)"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0052348","volume-title":"Fast Software Encryption","author":"R.L. Rivest","year":"1997","unstructured":"Rivest, R.L.: All-Or-Nothing Encryption and the Package Transform. In: Biham, E. (ed.) FSE 1997. LNCS, vol.\u00a01267, pp. 210\u2013218. Springer, Heidelberg (1997)"},{"issue":"11","key":"2_CR27","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to Share a Secret. ACM Commun.\u00a022(11), 612\u2013613 (1979)","journal-title":"ACM Commun."},{"key":"2_CR28","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C.E. Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication Theory of Secrecy Systems. Bell Systems Technical Journal\u00a028, 656\u2013715 (1949)","journal-title":"Bell Systems Technical Journal"},{"key":"2_CR29","unstructured":"Zhang, R.: private communication, August 5 (2009)"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/978-3-540-24632-9_26","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"R. Zhang","year":"2004","unstructured":"Zhang, R., Hanaoka, G., Shikata, J., Imai, H.: On the Security of Multiple Encryption or CCA-security+CCA-security=CCA-security? In: Bao, F., Deng, R.H., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 360\u2013374. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14712-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T04:18:42Z","timestamp":1635826722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14712-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642147111","9783642147128"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14712-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}