Pseudo-voter identity (PVID) scheme for e-voting protocols

Date

2007-04-13

Author

Cetinkaya, Orhan
Doğanaksoy, Ali

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

228
views

0
downloads

Voter anonymity, also known as unlinkability, is the primary requirement to satisfy privacy in e-voting protocols. Up until now, e-voting protocols have tried to make communication channels anonymous in order to keep voter's identity hidden and many protocols have been proposed to construct anonymous communication channels. On the other hand, instead of making channel anonymous if we provide anonymous credentials to voter, we can easily hide voter's identity without any need of anonymous channels. This paper introduces Pseudo-Voter Identity (PVID) scheme based on blind signature in order to achieve anonymity in e-voting protocols. Blind signature is applied on pseudo identities selected by voter. Therefore voter obtains blindly signed pseudo identities namely PVIDs and uses them throughout the entire communication with the authorities. By using PVID scheme, e-voting protocols do not need anonymous channels anymore. This work aims at bringing unlinkable pseudo-voter identities based on blind signature bear on anonymous e-voting protocols.

Subject Keywords

Electronic voting, Privacy, Cryptography, Communication channels, Cryptographic protocols, Mathematics, Electronic voting systems, Availability, Communication system security, Costs

URI

https://hdl.handle.net/11511/44047

DOI

https://doi.org/10.1109/ares.2007.119

Collections

Department of Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

Auditable and verifiable electronic voting with homomorphic RSA tallying Yücel, Okan; Baykal, Nazife; Department of Information Systems (2010) In this work, we investigate the general structure and the concepts behind the contemporary electronic voting schemes, with special emphasis on voter verifiable preferential voting, homomorphic tallying and voter privacy. We firstly propose a modification in the Single Transferable Voting (STV) method to be applied to large scale elections with electoral barriers. Our proposal prevents the loss of votes and distributes them securely to the second or higher choices of their voters. This method is most suitab...
Analysis of security requirements for cryptographic voting protocols (extended abstract) Cetinkaya, Orhan (2008-03-07) Electronic voting refers to the use of computers or computerized voting equipment to cast ballots in an election and it is not an easy task due to the need of achieving electronic voting security requirements. The cryptographic voting protocols use advanced cryptography to make electronic voting secure and applicable.
Trusted3Ballot: Improving Security and Usability of ThreeBallot Voting System using Trusted Computing Uzunay, Yusuf; BIÇAKCI, KEMAL (2014-01-29) The main goal in the design of ThreeBallot system was to provide an end-to-end auditable voting system in a simple way without use of cryptography to bolster voter confidence in the system. However, later it was shown that this system has significant security and usability problems. To solve these problems, in this work we propose Trusted3Ballot; an electronic ThreeBallot based voting system which uses trusted computing technology. One notable feature of the proposed system is the use of TPM remote attestat...
Reflections on Turkish Personal Data Protection Law and Genetic Data in Focus Group Discussions Özkan, Özlem; Şahinol, Melike; Aydınoğlu, Arsev Umur; Aydın Son, Yeşim (2022-12-01) Since the 1970s and more rigorously since the 1990s, many countries have regulated data protection and privacy laws in order to ensure the safety and privacy of personal data. First, a comparison is made of different acts regarding genetic information that are in force in the EU, the USA, and China. In Turkey, changes were adopted only recently following intense debates. This study aims to explore the experts’ opinions on the regulations of the health information systems, data security, privacy, and confide...
An Improved Range Proof with Base-3 Construction Günsay, Esra; Onur, Cansu Betin; Cenk, Murat (2021-01-01) Zero-knowledge protocols (ZKPs) allow a party to prove the validation of secret information to some other party without revealing any information about the secret itself. Appropriate, effective, and efficient use of cryptographic ZKPs contributes to many novel advances in real-world privacy-preserving frameworks. One of the most important type of cryptographic ZKPs is the zero-knowledge range proofs (ZKRPs). Such proofs have wide range of applications such as anonymous credentials, cryptocurrencies, e-cash ...

Citation Formats

O. Cetinkaya and A. Doğanaksoy, “Pseudo-voter identity (PVID) scheme for e-voting protocols,” 2007, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/44047.