A Review of Cryptographic Electronic Voting

Kho, Yun-Xing; Heng, Swee-Huay; Chin, Ji-Jian

doi:10.3390/sym14050858

Cited by 13 publications

(8 citation statements)

References 141 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The example of identifying an element 𝛼 9 of the Galois field 𝐺𝐹(2 8 ) with an irreducible polynomial 𝑥 8 + 𝑥 4 + 𝑥 3 + 𝑥 2 + 1: α 9 = α. α 8 = α. (α 4 + α 3 + α 2 + 1) = (𝛼 5 + 𝛼 4 + 𝛼 3…”

Section: Implementation Of the Proposed Authentication Scheme In An O...mentioning

confidence: 99%

“…The number of proper subfields of GF(2 8 ) are: q = (Number of positive divisors of 8) − 1 = 3 , which are F 2 , F 2 2 and F 2 4 .…”

Section: + 𝛼)mentioning

confidence: 99%

“…Finally, the encrypted votes are transferred to the counting officer over a secure channel for results. The entire framework of a secure Voting system is designed to achieve total secrecy and individual, eligible and universal verifiability [4,5]. Internet Voting apply mathematical algorithms in software to establish the framework of a voting system [4,6].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Enhancing Security in Online Voting Systems: A Cryptographic Approach Utilizing Galois Fields

Kandikatla,

Jayanti,

Chaganti

et al. 2024

MMEP

View full text Add to dashboard Cite

Ensuring information security is indispensable during data communication among a collective of entities. This requirement is exemplified in the context of online voting systems (OVS), which necessitate the conduction of fair and transparent elections. A pivotal aspect of securing the OVS involves authenticating authorized voters prior to vote casting and encrypting the votes before their transfer over a secure channel for tallying. The present study centers on the development of a mathematical model for an authentication scheme that can be implemented in an OVS to facilitate impartial elections. The devised model integrates mathematical and cryptographic principles of Galois fields, group codes, and pseudo-random key stream generators to formulate individual voter passcodes, thereby providing two-factor authentication. The proposed scheme is exemplified through a scenario suitable for orchestrating a medium-scale election involving 65,536 voters via an OVS. Furthermore, with the appropriate selection of inputs, the model exhibits the capacity to support large-scale elections.

show abstract

Section: Implementation Of the Proposed Authentication Scheme In An O...mentioning

confidence: 99%

“…The number of proper subfields of GF(2 8 ) are: q = (Number of positive divisors of 8) − 1 = 3 , which are F 2 , F 2 2 and F 2 4 .…”

Section: + 𝛼)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Enhancing Security in Online Voting Systems: A Cryptographic Approach Utilizing Galois Fields

Kandikatla,

Jayanti,

Chaganti

et al. 2024

MMEP

View full text Add to dashboard Cite

show abstract

“…This is because additional cryptographic arrangements must be established to prevent linking a voter's identity to the contents of their vote. Blind signatures and mixed-nets are among the techniques that can be applied to remove the connection between the voter and their ballot [4]. These arrangements may clash with voter-usability requirements, which can negatively affect voter turn-out.…”

Section: Motivationmentioning

confidence: 99%

PVPBC: Privacy and Verifiability Preserving E-Voting Based on Permissioned Blockchain

2023

View full text Add to dashboard Cite

Privacy and verifiability are crucial security requirements in e-voting systems and combining them is considered to be a challenge given that they seem to be contradictory. On one hand, privacy means that cast votes cannot be traced to the corresponding voters. On the other hand, linkability of voters and their votes is a requirement of verifiability which has the consequence that a voter is able to check their vote in the election result. These two contradictory features can be addressed by adopting privacy-preserving cryptographic primitives, which at the same time as achieving privacy, achieve verifiability. Many end-to-end schemes that support verifiability and privacy have the need for some voter action. This makes ballot casting more complex for voters. We propose the PVPBC voting system, which is an e-voting system that preserves privacy and verifiability without affecting voter usability. The PVPBC voting system uses an effective and distributed method of authorization, which is based on revocable anonymity, by making use of a permissioned distributed ledger and smart contract. In addition, the underlying PVPBC voting system satisfies election verifiability using the Selene voting scheme. The Selene protocol is a verifiable e-voting protocol. It publishes votes in plaintext accompanied by tracking numbers. This enables voters to confirm that their votes have been captured correctly by the system. Numerical experiments support the claim that PVPBC scales well as a function of the number of voters and candidates. In particular, PVPBC’s authorization time increases linearly as a function of the population size. The average latency associated with accessing the system also increases linearly with the voter population size. The latency incurred when a valid authentication transaction is created and sent on the DLT network is 6.275 ms. Empirical results suggest that the cost in GBP for casting and storing an encrypted ballot alongside a tracker commitment is a linear function of the number of candidates, which is an attractive aspect of PVPBC.

show abstract

“…12. Resistance to coercion: capacity of an e-voting system to shield voters from potential manipulations or coercions [36,63].…”

mentioning

confidence: 99%

Blockchain-Based E-Voting Systems: A Technology Review

Hajian Berenjestanaki,

Barzegar,

El Ioini

et al. 2023

Electronics

View full text Add to dashboard Cite

The employment of blockchain technology in electronic voting (e-voting) systems is attracting significant attention due to its ability to enhance transparency, security, and integrity in digital voting. This study presents an extensive review of the existing research on e-voting systems that rely on blockchain technology. The study investigates a range of key research concerns, including the benefits, challenges, and impacts of such systems, together with technologies and implementations, and an identification of future directions of research in this domain. We use a hybrid review approach, applying systematic literature review principles to select and categorize scientific papers and reviewing the technology used in these in terms of the above key concerns. In the 252 selected papers, aspects such as security, transparency, and decentralization are frequently emphasized as the main benefits. In contrast, although aspects like privacy, verifiability, efficiency, trustworthiness, and auditability receive significant attention, they are not the primary focus. We observed a relative lack of emphasis on aspects such as accessibility, compatibility, availability, and usability in the reviewed literature. These aspects, although acknowledged, are not as thoroughly discussed as the aforementioned key benefits in the proposed solutions for blockchain-based e-voting systems, whereas the considered studies have proposed well-structured solutions for blockchain-based e-voting systems focusing on how blockchain can strengthen security, transparency, and privacy, in particular, the crucial aspect of scalability needs attention.

show abstract

A Review of Cryptographic Electronic Voting

Cited by 13 publications

References 141 publications

Enhancing Security in Online Voting Systems: A Cryptographic Approach Utilizing Galois Fields

Enhancing Security in Online Voting Systems: A Cryptographic Approach Utilizing Galois Fields

PVPBC: Privacy and Verifiability Preserving E-Voting Based on Permissioned Blockchain

Blockchain-Based E-Voting Systems: A Technology Review

Contact Info

Product

Resources

About