Title: A secure electronic voting protocol with a simple ballot's encryption function

Authors: Wafa Neji; Kaouther Blibech; Narjes Ben Rajeb

Addresses: Laboratory LIP2, The General Directorate of Technological Studies, Higher Institute of Technological Studies of Beja, TN, Tunisia ' Laboratory LIP2, Higher Institute of the Environment, Town planning and Building Technologies, Tunisia University of Carthage, TN, Tunisia ' Laboratory LIP2, National Institute of Applied Science and Technology, University of Carthage, TN, Tunisia

Abstract: In this paper, we present a new electronic voting protocol. It is based on the ballot's encryption function defined by Schoenmakers in 1999.We use this encryption function in a different way such that we reduce time, communication and computational complexity. In addition, compared to Schoenmakers' protocol, we satisfy the receipt-freeness property. For this, we rely on the protocol defined by Lee and Kim in 2002 and we use a secure hardware engine called SE. This engine re-encrypts ballots through the use of randomisation technique. Our protocol uses a simple encryption function which requires less computational costs than the one used by Lee and Kim. Our protocol becomes then more secure than the protocol of Lee and Kim. Moreover, an extended version with a multi-way election is provided to allow voters to choose between a number of several candidates.

Keywords: electronic voting; receipt-freeness; secret sharing; zero-knowledge proofs.

DOI: 10.1504/IJSN.2018.090649

International Journal of Security and Networks, 2018 Vol.13 No.1, pp.10 - 26

Received: 22 Nov 2016
Accepted: 15 Sep 2017

Published online: 14 Mar 2018 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article