A homomorphic encryption-based secure electronic voting scheme

Huszti, Andrea

doi:10.5486/pmd.2011.5142

Cited by 13 publications

(8 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the election of the protocols, we looked for protocols whose description comprises enough information on cryptographic operations carried out. Unfortunately, we found that many authors do not specify step by step all the cryptographic operations of the protocols (such as: [7] [19] [20] [21]) or use a complicated notation that is difficult to understand (such as: [10] [12] [22]). In addition, we wanted to include the three types of e-voting protocols found literature, that is to say: based on blind signatures (Li, Hwang and Lai protocol [5]), based on mix-nets (Meng protocol [8]) and based on homomorphic encryption (EVIV protocol [11]).…”

Section: Notation and Methodsmentioning

confidence: 99%

“…There are basically three types of e-voting protocols. Some of them use blind signatures (this term is defined in [2]) to protect anonymity of votes, such as: [3] [4] [5]; other use mix-nets (this term is defined in [6]) to implement an anonymous channel or to cut the voter-vote link, such as: [7] [8]; and another use homomorphic encryption (this term is defined in [9]) to protect vote's privacy and increase the speed of vote tallying, such as: [10] [11] [12]. Many authors test specific security features of the e-voting protocols.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Internet Voting Protocols: An Analysis of the Cryptographic Operations per Phase

Satizábal

Páez

2022

Int. j. commun. netw. inf. secur.

View full text Add to dashboard Cite

Internet voting is a good option for Colombia thanks to the expansion of mobile technology throughout the country and the interest of the government to implement the e-voting. For this reason, we study the e-voting protocols to establish if any of them is suitable for Colombian elections. However some of them imply a great number of cryptographic operations and therefore a great computational cost for the devices, which sometimes exceed their capacity. In this paper, we determine the number of cryptographic operations per phase of four e-voting protocols: one based on blind signatures (Li, Hwang and Lai protocol), one based on mix nets (Meng protocol), one based on homomorphic encryption (EVIV protocol) and one used in real electoral processes (I-Voting for Estonian Elections). Then, we analyze the changes in the number of operations when the number of voters, number of votes, number of authorities and number of candidates increase for small, medium and large elections. Finally, we establish the protocol that imply a less number of cryptographic operations and is suitable for big electoral processes, such as congress elections in Colombia.

show abstract

Section: Notation and Methodsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Internet Voting Protocols: An Analysis of the Cryptographic Operations per Phase

Satizábal

Páez

2022

Int. j. commun. netw. inf. secur.

View full text Add to dashboard Cite

show abstract

“…[3] Compute n=qp and λ = lcm(q − 1, p − 1). Randomly select g as integer where g∈ Z * n 2 The existence of multiplicative inverse ensure that the order of g is divisible by n by the following equation: µ = (L(g λ modn 2 )) −1 modn, [18] where function L(x)=x-1 n . Note that this a b does not mean the multiplication of a times the multiplicative inverse of b, i.e., the biggest integer value v≥ 0 to satisfy the relation a≥ vb.…”

Section: Key Generationmentioning

confidence: 99%

Online Voting System using Homomorphic Encryption

Saproo¹,

Warke²,

Pote³

et al. 2020

ITM Web Conf.

View full text Add to dashboard Cite

An important part of a democratically fair society are elections. The conventional democratic framework becomes hard for the individuals who can’t visit the polling stall for casting their votes. With quick advancement of data innovation, online Internet voting framework is all the more intriguing to use for the nations where vote casting cooperation is low and it is too helpful for people living far off from their homes. Security is a major worry for Internet voting system. The proposed framework guarantees security prerequisites for example, validation, precision, secrecy, receipt-freeness, unwavering quality, obviousness and reasonableness in the political race.

show abstract

“…On the other hand, due to its privacy features, homomorphic encryption has been used in other studies [16][17][18][19][20]. Operations such as adding and multiplying on the message encrypted with homomorphic encryption can be done using the Paillier algorithm [20].…”

Section: Introductionmentioning

confidence: 99%

A Manipulation Prevention Model for Blockchain-Based E-Voting Systems

Taş

Tanrıöver

2021

Security and Communication Networks

View full text Add to dashboard Cite

Security and trust are seen as the most important issues in electronic voting systems. Therefore, it is necessary to use cryptographic procedures to ensure anonymity, security, privacy, and reliability in these systems. In recent years, blockchain has become one of the most commonly used methods for securing data storage and transmission through decentralized applications. E-voting is one of these application areas. However, data manipulation is still seen as a major potential problem in e-voting systems. In theproposed model, administrators or miners are prevented from previewing election results which are normally accessible data due to the blockchain structure. A double-layer encryption model is proposed and tested to prevent manipulations that may occur with the election results. It is ensured that the election results can be counted after the participation of all stakeholders at the end. In this way, potential manipulations may be prevented during the election period. As a result of the model, the privacy of voters is ensured, no central authority is needed, and the recorded votes are kept in a distributed structure.

show abstract

A homomorphic encryption-based secure electronic voting scheme

Cited by 13 publications

References 20 publications

Internet Voting Protocols: An Analysis of the Cryptographic Operations per Phase

Internet Voting Protocols: An Analysis of the Cryptographic Operations per Phase

Online Voting System using Homomorphic Encryption

A Manipulation Prevention Model for Blockchain-Based E-Voting Systems

Contact Info

Product

Resources

About