Anonymity and Verifiability in Voting: Understanding (Un)Linkability

Langer, Lucie; Jonker, Hugo; Pieters, Wolter

doi:10.1007/978-3-642-17650-0_21

Cited by 13 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are different ways to verify the security aspects in a voting protocol like the modular approach, epistemic logic, probabilistic approaches and probabilistic or nondeterministic approach. One of the best ways to verify whether these requirements are satisfied is by using process calculus.…”

Section: Preliminariesmentioning

confidence: 99%

A new approach to decrease the computational complexity of e‐voting protocols

Mousavi

Ahmadi

Rahimi

2016

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

One of the most important methods of remote e‐voting is based on the ElGamal homomorphic cryptosystems. These systems are secure enough provided that the discrete logarithm problem is secure. However, one of their main challenges is the limitation on the number of voters. In this paper, a new scheme is suggested so as to increase the number of voters by designing parallel voting subprotocols. The required time for the tally computing process for 10 subprotocols decreases to less than 20% of the time in a similar scheme. The necessary memory space and the number of random integers do not show a significant change in comparison with those of similar voting protocols. Also, the communication complexity is of order O(Nt), which seems reasonable. The security comparisons show an acceptable rate of security in a reasonable length of keys for the proposed protocol. Simulations show that the number of covering voters in this protocol is 10 times more than that of a similar protocol.

show abstract

Section: Preliminariesmentioning

confidence: 99%

A new approach to decrease the computational complexity of e‐voting protocols

Mousavi

Ahmadi

Rahimi

2016

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

show abstract

“…e-Voting systems need to assure privacy and integrity so that the balance can be shifted towards the ones who vote. Two important principles need to find their place in such systems: privacy, meaning the votes should be easily verified [13,14], without compromising voter's identity [15], and integrity, meaning once the votes are cast, the systems should not allow for them to be changed.…”

Section: Related Workmentioning

confidence: 99%

Secure and Anonymous Voting D-App with IoT Embedded Device Using Blockchain Technology

et al. 2022

View full text Add to dashboard Cite

The paper presents the construction of a proof-of-concept for a distributed and decentralized e-voting application in an IoT embedded device with the help of blockchain technology. A SoC board was used as an IoT embedded device for testing the PoC. This solution ensures complete voter anonymity and end-to-end security for all entities participating in the electronic voting process. The paper outlines the solution’s two layers. Implementation details are presented for the e-voting application, which was deployed inside of an IoT embedded device. The solution and presented protocols provide two major properties: privacy and verifiability. To ensure privacy, the proposed solution protects the secrecy of each electronic vote. As for implementing verifiability, the solution prevents a corrupt authority from faking in any way the process of counting the votes. Both properties are achieved in the presented solution e-VoteD-App.

show abstract

“…Both approaches are process-oriented and thus, not suitable for a CC evaluation. In Langer (2010), a state-oriented view is given by describing security properties of privacy and receipt-freeness. A different, state-oriented formalization of receipts and receipt-freeness is provided in Jonker and de Vink (2006) by characterizing properties of receipts.…”

Section: Related Workmentioning

confidence: 99%

Development of A Formal Security Model for Electronic Voting Systems

Bräunlich

Grimm

2013

International Journal of Information Security and Privacy

View full text Add to dashboard Cite

Trust that an electronic voting system realizes the security requirements in an adequate manner is an essential premise for electronic elections. Trust in a system can be achieved by controlling the system security. There are two ways to assure system security. One way is the evaluation and certification of the implementation’s security by neutral experts. Another way is the verification of the outcome by the users. Both approaches, verification and certification, should be combined to reasonably justify the voter’s trust in the electronic voting system. In this paper a formal security model with respect to the requirements of Fairness, Eligibility, Secrecy and Receipt-Freeness, Verifiability and Protection against Precipitation is given. This formal model helps to clarify and truly understand these requirements. Furthermore, it can be used for the evaluation and certification of online voting products according to the Common Criteria.

show abstract

Anonymity and Verifiability in Voting: Understanding (Un)Linkability

Cited by 13 publications

References 15 publications

A new approach to decrease the computational complexity of e‐voting protocols

A new approach to decrease the computational complexity of e‐voting protocols

Secure and Anonymous Voting D-App with IoT Embedded Device Using Blockchain Technology

Development of A Formal Security Model for Electronic Voting Systems

Contact Info

Product

Resources

About