SAnoVS: Secure anonymous voting scheme for clustered ad hoc networks

Abstract

Abstract-In this paper we propose a secure anonymous voting scheme (SAnoVS) for re-clustering in the ad-hoc network. SAnoVS extends our previous work of degree-based clustering algorithms by achieving anonymity and confidentiality of the voting procedure applied to select new cluster heads. The security of SAnoVS is based on the difficulty of computing discrete logarithms over elliptic curves, the intractability of inverting a one-way hash function and the fact that only neighboring nodes contribute to the generation of a shared secret. Furthermore, we achieve anonymity since our scheme does not require any identification information as we make use of a polynomial equation system combined with pseudo-random coordinates. The security analysis of our scheme is demonstrated with several attacks scenarios.examined with several attack scenarios and experimental results.

Adaptation of a Conference Key Distribution System for the wireless ad hoc network

“…The elegant work done by Kim et al [6] was a strong incentive for us to optimize the ECDLP-based Lagrange polynomial interpolation method utilized in CKDS. In addition, we are extending our work of [17] to anonymise and optimize further the calculation and distribution of a CK in the MANET environment.…”

“…Finally, our work in [17] incorporated the polynomial interpolation approach into ad hoc cluster head selection procedure implemented with voting among the members.…”