Group Diffie-Hellman schemes for password-based key exchange are designed to provide a pool of players communicating over a public network, and sharing just a human-memorable password, with a session key (e.g, the key is used for multicast data integrity and confidentiality). The fundamental security goal to achieve in this scenario is security against dictionary attacks. While solutions have been proposed to solve this problem no formal treatment has ever been suggested. In this paper, we define a security model and then present a protocol with its security proof in both the random oracle model and the ideal-cipher model.
CITATION STYLE
Bresson, E., Chevassut, O., & Pointcheval, D. (2002). Group diffie-hellman key exchange secure against dictionary attacks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2501, pp. 497–514). Springer Verlag. https://doi.org/10.1007/3-540-36178-2_31
Mendeley helps you to discover research relevant for your work.