Authors: Yang Liu, Debiao He, Min Luo, Lianhai Wang, Cong Peng

 

Title: k-TEVS: A k-Times E-Voting Scheme on

Blockchain with Supervision

 

Journal:  IEEE Transactions on Dependable and Secure Computing

 

Abstract: The e-vote is regarded as a way to express the opinion that the voters ask for. Actually, the e-vote could be applied wildly

like questionnaire, survey and feedback. Moreover, the coexistences of efficiency and security as well as transparency and privacy

could be considered as building blocks in the e-vote system. The blockchain could provide a public access board to reduce the storage

costs for the field consisted of the vote group manager (GM) with its vote assistants (VA). Particularly the k-times anonymous

authentication (k-TAA) could also be a practical approach to preserve voters’ privacy and reduce the computation costs during the vote

process. However, the e-vote scheme with pure k-TAA strategy could damage either the supervision of voting or the efficiency and

consistency of authentication process. What’s more, the impacts of dishonest voters couldn’t be stopped until the vote end. To tackle

these problems, we apply the accumulator technology to add or revoke the voters at any time and extend the framework of k-TAA with

the update process for the e-vote on blockchain for supervision (k-TEVS). In our scheme, the voter updates his membership witness

and proves the fact that he is still a valid member with respective VA under the latest accumulator value. What’s more, this witness

update operation is not contained in the authentication process, which means that the authentication process is still constant and

efficient. Moreover, our add or delete update process with signature of knowledge needs only one pairing operation. For the security,

we prove that the relaxed anonymity still holds in the k-TEVS framework. Finally, We implement k-TEVS scheme and two latest schems for comparison. Then we make time cost and communication cost experime