Abstract

Conference Key Distribution Systems (CKDS) are well-analyzed systems for the computation and distribution of a symmetric key shared amongst a session's participants. We focus on previous CKDS with user anonymity and we propose modifications from the perspective of anonymity, dynamicity, efficiency and security crystallized in a novel CKDS design. The security of the proposed anonymous CKDS is based on the difficulty of computing discrete logarithms over Elliptic Curves, the intractability of inverting one-way hash functions and the creation of random, however disjoint, pseudonyms by the group members. Under these modifications, our proposed dynamic CKDS can be ported to clustered Mobile Ad Hoc Networks so that the members of a mobile group can rapidly establish a shared Conference Key. We demonstrate the effectiveness of the proposed scheme through performance comparisons and security analysis that covers passive and active attack scenarios.

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 call

Disclaimer: 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.