Privacy and verifiability in voting systems: Methods, developments and trends

Jonker, Hugo; Mauw, Sjouke; Pang, Jun

doi:10.1016/j.cosrev.2013.08.002

Cited by 30 publications

(23 citation statements)

References 62 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Receipt Freeness, it's about how the voting system can avoid giving details to the voter where he/she can use it in bribery way to a third party to prove that he/she voted as needed [7] [8].…”

Section: What Should Be Included To Keep Voter Privacymentioning

confidence: 99%

Transparent E-Voting dApp Based on Waves Blockchain and RIDE Language

Faour

2019

2019 XVI International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY)

View full text Add to dashboard Cite

show abstract

Section: What Should Be Included To Keep Voter Privacymentioning

confidence: 99%

Transparent E-Voting dApp Based on Waves Blockchain and RIDE Language

Faour

2019

2019 XVI International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY)

View full text Add to dashboard Cite

show abstract

“…Since the focus of this paper is on verifiability notions that have been formally defined, we excluded those verifiability notions from our analysis which do not fulfill this requirement ( [46], [30], [51], [43], [41], [42]). An important paper is the one by Sako and Kilian [46] who were the first to propose the concept of individual and universal verifiability.…”

Section: Further Related Workmentioning

confidence: 99%

SoK: Verifiability Notions for E-Voting Protocols

Cortier

Galindo

Küsters

et al. 2016

2016 IEEE Symposium on Security and Privacy (SP)

View full text Add to dashboard Cite

There have been intensive research efforts in the last two decades or so to design and deploy electronic voting (e-voting) protocols/systems which allow voters and/or external auditors to check that the votes were counted correctly. This security property, which not least was motivated by numerous problems in even national elections, is called verifiability. It is meant to defend against voting devices and servers that have programming errors or are outright malicious. In order to properly evaluate and analyze e-voting protocols w.r.t. verifiability, one fundamental challenge has been to formally capture the meaning of this security property. While the first formal definitions of verifiability were devised in the late 1980s already, new verifiability definitions are still being proposed. The definitions differ in various aspects, including the classes of protocols they capture and even their formulations of the very core of the meaning of verifiability. This is an unsatisfying state of affairs, leaving the research on the verifiability of e-voting protocols in a fuzzy state. In this paper, we review all formal definitions of verifiability proposed in the literature and cast them in a framework proposed by Küsters, Truderung, and Vogt (the KTV framework), yielding a uniform treatment of verifiability. This enables us to provide a detailed comparison of the various definitions of verifiability from the literature. We thoroughly discuss advantages and disadvantages, and point to limitations and problems. Finally, from these discussions and based on the KTV framework, we distill a general definition of verifiability, which can be instantiated in various ways, and provide precise guidelines for its instantiation. The concepts for verifiability we develop should be widely applicable also beyond the framework used here. Altogether, our work offers a well-founded reference point for future research on the verifiability of e-voting systems.

show abstract

“…Atsushi Fujioktaet.al.in [3], Jonker et. alin [4] explained the very fundamental definitions that the voting is secure only when all the following properties of E-Voting exists a) Completeness b) Soundness c) Privacy d) Eligibility e) Fairness f) Unreusability f) Verifiability. "CORE BANKING SOLUTION: Evaluation of Security and Controls" titled by Sriram, M. Revathy in [5] elaborateshow core banking solutions are being managed by Simple Network Management Protocol.…”

Section: IImentioning

confidence: 99%

E-Voting For Large Scale Elections Using Simple Network Management Protocol

Pandit¹

2017

IJRASET

View full text Add to dashboard Cite

Democratic process world-over is a very important referendum, which elects or removes governments. Elections are held in countries where large number of voters vote to elect their favourite candidate. This paper proposes an E-Voting through Internet, which uses Simple Network Management Protocol (SNMP) for large-scale elections to be held on decentralised servers. The proposal of using Simple Network Management Protocol is a unique one because SNMP based NMS (Network Management System) could be implemented during voting, which manages, monitors and get the accurate data of voters ballots from the decentralised servers in regular intervals for compilation of data at a centralised server that can be much accurate, authenticated, authorized and coercion free. SNMP operating server can be easily managed as wecan compile data for the number of voters from a particular region or state who had voted on the voting day, and the results or data cannot be tampered with. Devices being used in casting ballots on election day can also be managed well. Numerous advantages could be achieved if SNMP implemented systems are being implemented by the election commission in the online e-voting system. Main objective of this paper is to propose a solution to monitor and manage the large-scale elections with secrecy,and curtail coercion, which is necessary to get hundred-per-cent accurate results for effective democracy. Keyword: EVM, Coercion, MIB, SNMP, UDP, NMS. I.INTRODUCTION To provide additional channel for voting apart from conventional is necessary to augment voter count for a fair democracy.To use the existing infrastructure more efficiently, Election identity cards enable secure online-authentication and the use of digital channels is steadily widening. It is time consuming to change voters' practices and approaches and to increase the voter turnout. Internet voting that is also known as e-voting brings people closer to the information society. Integrated functioning of public sector IT systems raises the cost-efficiency. Internet voting is there to stay. On the voting day, e-voter votes through any electronic device e.g. Mobile device, Laptop etc… with a valid identity number given to him/her by the election commission. This paper proposes the use of Simple Network Management Protocol (SNMP) in e-voting infrastructure / architecture, which will help to keep track of devices e.g. election servers, databases containing ballots and how they function during election-day.Dealing with problems and emergencies in the network (router stops routing, server loses power, machines are being tampered with, mobile devices, systems etc.). E-Voting can be through any device e.g. any voter who votes through any mobile device can cast her/his vote and the ballot is stored in the nearest local server of the election commission. These local servers are managed and guarded by the Centralized servers which can be done by loading SNMP based Network Management System (NMS) in all the managed systems. If the electronic devices are so inte...

show abstract

Privacy and verifiability in voting systems: Methods, developments and trends

Cited by 30 publications

References 62 publications

Transparent E-Voting dApp Based on Waves Blockchain and RIDE Language

Transparent E-Voting dApp Based on Waves Blockchain and RIDE Language

SoK: Verifiability Notions for E-Voting Protocols

E-Voting For Large Scale Elections Using Simple Network Management Protocol

Contact Info

Product

Resources

About