City Research Online

Abstract

In this paper we review previous works done with respect to Conference Key Distribution Systems (CKDS). We focus on the system proposed by Kim et al. and we propose improvements on that scheme a) from the perspective of security and anonymity, b) from the perspective of efficient calculation of the Lagrange polynomial coefficients, and c) from the perspective of adaptation into the dynamic wireless ad hoc network. The security of the proposed scheme is based on the difficulty of computing discrete logarithms over elliptic curves, the intractability of inverting a one-way hash function and the pseudo-randomness of user coordinates. We demonstrate the effectiveness of the proposed scheme through the analysis of characteristic attack scenarios.

Publication Type:	Article
Additional Information:	© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
Publisher Keywords:	Shared secret; Lagrange interpolation; elliptic curves
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments:	School of Science & Technology > Computer Science > Software Reliability

Export

Downloads