On the security of multiple encryption or CCA-security+CCA-security=CCA- security?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2947, Issue , 2004, Pages 360-374

  Zhang, Rui ^a   Hanaoka, Goichiro ^a   Shikata, Junji ^b   Imai, Hideki ^a  

^a INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

^b YOKOHAMA NATIONAL UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

CCA SECURITIES; CHOSEN CIPHERTEXT ATTACK; CRYPTOGRAPHIC PRIMITIVES; EXTENDED MODEL; IND-CCA; PRACTICAL SYSTEMS;

CRYPTOGRAPHY;

EID: 33745822106     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24632-9_26     Document Type: Article

References (36)

1. M. Abe and H. Imai. Flaws in some robust optimistic mix-nets. In ACISP'03, volume 2727 of LNCS, pages 39 - 50. Springer-Verlag, 2003.
2. B. Aiello, M. Bellare, G. Di Crescenzo, and R. Venkatesan. Security amplification by composition: the case of doubly-iterated, ideal ciphers. In Crypto'98, volume 1462 of LNCS, pages 390-407. Springer-Verlag, 1998.
3. J.H. An, Y. Dodis, and T. Rabin. On the security of joint signature and encryption. In Eurocrypt'02, volume 2332 of LNCS, pages 83-107, Springer-Verlag, 2002.
4. M. Bellare, A. Desai, D. Pointcheval, and P. Rogway. Relations among notions of security for public-key encryption schemes. In Crypto'98, volume 1462 of LNCS. Springer-Verlag, 1998.
5. R. Canetti. Composable security: A new paradigm for cryptographic protocols. In 42nd FOCS, pages 136-145, 2001.
6. R. Canetti, H. Krawczyk, and J. Nielsen. Relaxing chosen-ciphertext security. In Crypto'03. Full version available: http://eprint.iacr.org/2003/174/ , 2003.
7. D. Chaum. Untraceable electronic mail, return address, and digitalpseudonyms. Communication of the ACM, 24:84-88, 1981.
8. Y. Desmedt and Y. Frankel. Threshold cryptosystems. In Crypto'89, volume 435 of LNCS, pages 307-315. Springer-Verlag, 1989.
9. W. Diffie and M.E. Hellman. Exhaustive cryptananlysis of NBS data encryption standard. IEEE Computer Magazine, 10(6):74-84, June 1977.
10. Y. Dodis and J. Katz. On the chosen ciphertext security of multiple encryption. In Rump session of Crypto'03, manuscript available from the authors, 2003.
11. Y. Dodis, J. Katz, S. Xu, and M. Yung. Key-insulated public key cryptosystems. In Eurocrypt'02, volume 2332 of LNCS, pages 65-82. Springer-Verlag, 2002.
12. D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. In 23rd STOC, pages 542-552. ACM, 1991.
13. D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. In SIAM Journal of Computing, volume 30. ACM, 2000.
14. G. Frey and H.G. Rück. A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Mathematics of Computation, 62(206):865-874, 1994.
15. O. Goldreich. Foundations of Cryptography, volume 2 (third posted version). Aavailable at: http://www.wisdom.weizmann.ac.il/~oded/PSBookFrag/enc. ps.
16. O. Goldreich. Foundations of Cryptography, volume 1. Cambridge University Press: New York, 2001.
17. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Science, (28):270-299, 1984.
18. P. Golle, S. Zhong, D. Boneh, M. Jakobsson, and A. Juels. Optimistic mixing for exit-polls. In Asiacrypt'02, volume 2501, pages 451-465. Springer-Verlag, 2002.
19. M. Jakobsson. A practical mix. In Eurocrypt'98, volume 1403 of LNCS, pages 448-461. Springer-Verlag, 1998.
20. M. Juels and M. Jakobsson. An optimally robust hybrid mix network. In 20th annual ACM Symposium on Principles of Distributed Computation, 2001.
21. R. Kumar, S. Rajagopalan, and A. Sahai. Coding constructions for blacklisting problems. In Crypto'99, volume 1666 of LNCS, pages 609-623. Springer-Verlag, 1999.
22. U.M. Maurer and J.L. Massey. Cascade ciphers: The importance of being first. Journal of Cryptology: the journal of the International Association for Cryptologic Research, 6(1):55-61, 1993.
23. A. Menezes, T. Okamoto, and S. Vanstone. Reducing elliptic curve logarithms to Igarithms in a finite field. IEEE Trans. on Information Theory, 39:1639-1646, 1993.
24. R. Merkle and M. Hellman. On the security of multiple encryption. Communications of the ACM, 24(7):465-467, 1981.
25. NESSIE. NESSIE Portfolio of recommended cryptographic primitives (Latest version: Feb. 2003). Available at: https://www.cosic.esat.kuleuven.ac.be/nessie/ deliverables/decision-final.pdf.
26. C. Rackoff and D. Simon. Noninteractive zero-knowledge proof of knowledge and chosen ciphertext attack. In Crypto'91, volume 576 of LNCS, pages 433-444. Springer-Verlag, 1991.
27. T. Satoh and K. Araki. Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves. Commentarii Mathematici Universitatis Sancti Pauli, (47):81-92, 1998.
28. I. Semaev. Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p. Mathematics of Computation, (67):353-356, 1998.
29. C. Shannon. Communication theory of secrecy systems. In Bell System Technical Journal, volume 28, 1949.
30. V. Shoup. OAEP reconsidered. In Crypto'01, volume 2139 of LNCS, pages 239-259, 2001.
31. V. Shoup. A proposal for an iso standard for public key encryption (version 2.1). Manuscript, 2001.
32. V. Shoup and R. Gennaro. Securing threshold cryptosystems against chosen ciphertext attack. Journal of Cryptology, 15(2):75-96, 2002.
33. N. Smart. The discrete logarithm problems on elliptic curves of trace one. Journal of Cryptology, 12:193-196, 1999.
34. Y. Watanabe, J. Shikata, and H. Imai. Equivalence between semantic security and indistinguishability against chosen ciphertext attacks. In PKC 2003, volume 2567 of LNCS, pages 71-84, 2003.
35. R. Zhang, G. Hanaoka, J. Shikata, and H. Imai. Full version of this paper. Available at: http://eprint.iacr.org/2003/181/.
36. R. Zhang, G. Hanaoka, J. Shikata, and H. Imai. On the security of multi-layered encryption or CCA-security+CCA-security=CCA-security? In SCIS'03, January, 2003.