Abstract
In this work, we study the problem of designing efficient password-based encrypted key agreement protocol in multi-party scenario. Recently, Dutta-Barua proposed a constant round group key agreement DB, which is a simple variant of Burmester-Desmedt protocol BD. In this paper, we present a simple and elegant contributory group key agreement in password-based setting, derived from the protocol DB. We have made several modifications in the protocol DB and then enhance it to password-based setting. The security of the proposed scheme against dictionary attacks is in the ideal cipher model under decision Diffie-Hellman (DDH) assumption. We analyze our protocol in the security framework formalized by Bellare et al. Our proposed scheme achieves efficiency over the work of Bresson et al. in terms of both computation and communication power
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
