원문정보
초록
영어
In open decentralized networks, it is important to make certain data available to only a selected group of users. For example, in a secure e-mail system, a user may send an e-mail to multiple receivers at once. Recently, Chen proposed a secure multicast key protocol for e-mail system based on Chinese Remainder Theorem. They claimed that their protocol provide perfect forward secrecy and ensure confidentiality and authentication. But, in this paper, we show that Chen’s protocol suffers from the sender and the e-mail server impersonation attacks and mail content confidentiality attack. Moreover, we give an improvement to Chen’s protocol. To contribute a secure multireceiver e-mail protocol, we propose a novel protocol by adopting Lagrange polynomial interpolation. We also discuss the security of the novel multireceiver e-mail protocol. Our protocol provides the perfect forward secrecy and resists unknown key-share attack, replay attack, sender impersonation attack, e-mail server impersonation attack and mail content confidentiality attack.
목차
1. Introduction
2. Review of Chen’s Secure Multireceivers E-mail Protocol
3. The Weaknesses of Chen’s Protocol
3.1. The Sender and the E-Mail Server Impersonation Attacks
3.2. Mail Content Confidentiality Attack
4. The Improved Protocol
5. The Proposed Multireceive E-Mail Protocol
6. Security Analysis of the Proposed Protocol
6.1. Perfect Forward Secrecy
6.2. Unknown Key-Share Attack
6.3. Replay Attack
6.4. Sender Impersonation Attack
6.5. E-Mail Server Impersonation Attack
6.6. Mail Content Confidentiality Attack
7. Conclusion
References