A secure electronic voting protocol with a simple ballot's encryption function
by Wafa Neji; Kaouther Blibech; Narjes Ben Rajeb
International Journal of Security and Networks (IJSN), Vol. 13, No. 1, 2018

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.

Online publication date: Sun, 25-Mar-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Security and Networks (IJSN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com