HSE-Voting: A secure high-efficiency electronic voting scheme based on homomorphic signcryption

Fan, Xingyue; Wu, Ting; Zheng, Qiuhua; Chen, Yuanfang; Alam, M. S.; Xiao, Xiaodong

doi:10.1016/j.future.2019.10.016

Cited by 24 publications

(23 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Meantime, we also solve the abstention from voting. Additionally, through theoretical analysis and data simulation, we indicate that our proposed e-voting scheme can solve the shortcoming in [35] and has higher time efficiency compared with [32,33]. Our contributions are shown in details as follows:…”

Section: Introductionmentioning

confidence: 94%

“…However, it cannot achieve the security requirement of coercion resistance in e-voting. Although the improved e-voting scheme increases the total [35] e scheme [32] e scheme [33] e proposed scheme e number of candidates e total time cost comparision of 10000 voters e scheme [35] e scheme [32] e scheme [33] e proposed scheme time cost, it achieves the coercion-resistant security requirement. Moreover, comparing [32,33], the improved e-voting scheme takes less time overall.…”

Section: Performance Analysis Of the Postvoting Phasementioning

confidence: 99%

“…us, we mainly analyse the computation cost of the voting phase and postvoting phase. In addition, we compare our scheme with [32,33,35] for partial security requirement and computation complexity, which is shown in Table 2. Moreover, we also, respectively, test the total time cost for the different numbers of voters and candidates by using the 1024-bit session key and the 512-bit shared secret on a laptop with Intel i5 3.1 GHz CPU and 8.00 GB memory, and the result is shown in Figures 3 and 4.…”

Section: Integrity Of Ballotsmentioning

confidence: 99%

“…Although blind signature has better practicality in e-voting, it does not satisfy the security requirement of receipt-freeness and verifiability to some extent. At present, in order to achieve secure and feasible e-voting, homomorphic encryption is popular in conjunction with other encryption techniques, such as zeroknowledge proof [32] and partial knowledge proof [33]. However, the computation burden becomes a problem that needs to be solved.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

An Improved Coercion-Resistant E-Voting Scheme

Hao

Zeng

Chang

2021

Security and Communication Networks

View full text Add to dashboard Cite

E-voting has gradually replaced the traditional voting methods to make it easier for people to conduct an election. Recently, Liu et al. propose an unconditional secure e-voting scheme using secret sharing and k-anonymity. Their scheme achieves correct tallying results without revealing raw voting information. However, in this paper, we observe that Liu et al.’s scheme cannot achieve coercion resistance in e-voting since the voter can prove the content of his ballot to the colluded candidates. Then, we propose an improved e-voting scheme to cover up the ballot of the voter with masked values. In this way, even if the voter colludes with corresponding candidates, he cannot prove which candidate he has voted for. Moreover, comparing with Liu et al.’s scheme, the security analysis shows that our proposed e-voting scheme achieves these security requirements like the coercion resistance, integrity of ballots, privacy of ballots, multiple-voting detection, and fairness. Through performance analysis, the experimental results show that our proposed e-voting scheme has higher time efficiency. Compared with other schemes, our scheme achieves a complete voting process and obtains the correct tallying result without complex computation and intricate communication process.

show abstract

Section: Introductionmentioning

confidence: 94%

Section: Performance Analysis Of the Postvoting Phasementioning

confidence: 99%

Section: Integrity Of Ballotsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Improved Coercion-Resistant E-Voting Scheme

Hao

Zeng

Chang

2021

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…Various hyper elliptic curve based signcryption techniques are researched which prove their efficiency in terms of security [12]. Some other significant use of signcryption in various IoT based infrastructures are also worth mentioning [13]- [20]. To enhance the performance of signcryptions blockchain based signcryption is also derived [21].…”

Section: B Signcryption Aggregates and Recent Developmentsmentioning

confidence: 99%

CASCF: Certificateless Aggregated SignCryption Framework for Internet-of-Things Infrastructure

et al. 2020

View full text Add to dashboard Cite

The increasing number of devices in the age of Internet-of-Thing (IoT) has arisen a number of problems related to security. Cryptographic processes, more precisely the signatures and the keys, increase and generate an overhead on the network resources with these huge connections. Therefore, in this paper we present a signcryption framework to address the above problems. The solution highlights the use of aggregate signcryption and certificaless approach based on bilinear pairings. The use of signcryption with aggregation and certificateless authentication reduces the time consumption, overhead and complexity. The solution is also able to solve the key staling problems. Experimental results and comparative analysis based on key parameters, memory utilization and bandwidth utilization have been measured. It confirms that the presented work is efficient for IoT infrastructure.

show abstract

Efficient and secure e‐voting scheme using elliptic curve cryptography

Chatterjee

Ray

Adhikari

et al. 2022

Security and Privacy

View full text Add to dashboard Cite

Voting allows the people to elect their representative and express their preferences. In modern day democracy, voting is one fundamental and most important tool for election. To strengthen this process, efforts must be made to achieve a confirmable and transparent voting system. Naturally, the veracity of the election process is of ultimate importance for the honor of the democracy itself. The online voting or e-voting system is a cost-effective procedure, which saves a lot of money and time spent for organizing the election. However, security, integrity of data and privacy of the voter are the increasing concerns in this context. In this paper, we have done a thorough literature survey of the various latest schemes in this context and found that the schemes prone to several security and privacy threats. Moreover, a major issue with all these schemes is that they are inefficient in terms of computation and communication overheads. With this motivation, we present a novel and efficient e-voting scheme to tackle the security and privacy concerns. The proposed scheme is designed using the concept of blind signature, anonymous channel and trust worthy entities where elliptic curve cryptography (ECC) works as a backbone. The proposed scheme is formally evaluated using well known AVISPA simulation tool, which simulates the attack model using CL-AtSe as well as OFMC backend according to Dolev-Yao threat model. In both the cases, all the possible security threats are being nullified by the proposed scheme and results in safe communication. Also, the scheme is analyzed against all the possible attacks that jeopardize the integrity of the existing voting systems. Moreover, the proposed scheme is also compared with other prevailing schemes in terms of computation and communication overheads and found more efficient.

show abstract

HSE-Voting: A secure high-efficiency electronic voting scheme based on homomorphic signcryption

Cited by 24 publications

References 19 publications

An Improved Coercion-Resistant E-Voting Scheme

An Improved Coercion-Resistant E-Voting Scheme

CASCF: Certificateless Aggregated SignCryption Framework for Internet-of-Things Infrastructure

Efficient and secure e‐voting scheme using elliptic curve cryptography

Contact Info

Product

Resources

About