A Secure Anonymous E-Voting System based on Discrete Logarithm Problem

Tu, Yu–Kang; Chen, Yu-Yi; Chen, Chih‐Cheng

doi:10.12785/amis/080556

Cited by 18 publications

(17 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After signing, the message will be unblinded in order to check the message and verify in public with the original message for any possible distortion or tampering. This technique can be executed using various public key encryption schemes 34,35 . In the proposed scheme, we have shown implementation of blind signature along with the advantages of ECC.…”

Section: Preliminariesmentioning

confidence: 99%

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

Section: Preliminariesmentioning

confidence: 99%

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

show abstract

“…2. Anonymity/Privacy/Secrecy [7] -I should be able to vote without anyone knowing how I have voted. 3.…”

Section: Complex Interacting Requirementsmentioning

confidence: 99%

Modelling an E-Voting Domain for the Formal Development of a Software Product Line: When the Implicit Should Be Made Explicit

Gibson

Raffy

2020

Implicit and Explicit Semantics Integration in Proof-Based Developments of Discrete Systems

View full text Add to dashboard Cite

There has been much recent interest in the development of electronic voting (e-voting) systems, but there remain many outstanding research challenges for software and system engineers. Software product line (SPL) techniques offer many advantages for the practical development of reliable and trustworthy e-voting systems, but the composition of system features poses significant problems that can be addressed satisfactorily only through the use of formal methods. When such systems are used in government elections then they are obliged to follow legal standards and/or recommendations written in natural language. For the formal development of e-voting systems it is necessary to build a domain model which is consistent with the legal requirements. We have already demonstrated that Event-B models can be used to verify critical requirements for e-voting system components. However, the refinement-based approach needs to be applied to the engineering of a complete e-voting system. We report on our approach, using Event-B contexts to model an e-voting ontology, and its integration with an e-voting features model tree which formally specifies the SPL. During this work, we identified the importance of making the implicit explicit in two different ways -domain experts need to explicitly model implicit knowledge, and Event-B modellers need to explicitly communicate the semantics of the formal model constructs to the domain experts. If either of these tasks is not adequately carried out then this compromises validation of the requirements model (instance of the SPL).

show abstract

“…The first EV scheme was proposed by David Chaum (Chaum, 1981) in 1981. There have been many other schemes proposed by researchers since 1981, e.g., EV schemes with publicly verifiable secret sharing (Schoenmakers, 1999), (Neff, 2001); EV based on homomorphic encryption (Hirt and Sako, 2000); EV based on secret sharing techniques with a secure multiparty computation (Chen et al, 2014). (Gerlach and Gasser, 2009) describes EV experiences by mentioning how EV systems worked in Geneva and Zurich in Switzerland.…”

Section: Electronic Votingmentioning

confidence: 99%

Secure Benchmarking using Electronic Voting

Agrawal

Snekkenes

2018

Proceedings of the 15th International Joint Conference on E-Business and Telecommunications

View full text Add to dashboard Cite

It is a common practice in the industry to organize benchmark processes to establish information security performance evaluation standards. A benchmarking system collects information security-related data from the organization to establish a standard. The information shared by the organization often contains sensitive data (details of the vulnerability, Cyber attacks). The present benchmarking systems do not provide a secure way of exchanging sensitive information between the submitter and the benchmark authority. Furthermore, there is a lack of any mechanism for the submitters to verify that the final benchmark result contains the response submitted by them. Hence, people are reluctant to take active participation in sharing their sensitive information in the benchmarking process. We propose a novel approach to solve the security limitations of present benchmarking systems by applying the concepts of electronic voting to benchmark. Our solution provides secrecy to submitters' identity and to the benchmark responses. Our approach also ensures that all the submitted responses have been correctly counted and considered in the final benchmark result.

show abstract

A Secure Anonymous E-Voting System based on Discrete Logarithm Problem

Cited by 18 publications

References 22 publications

Efficient and secure e‐voting scheme using elliptic curve cryptography

Efficient and secure e‐voting scheme using elliptic curve cryptography

Modelling an E-Voting Domain for the Formal Development of a Software Product Line: When the Implicit Should Be Made Explicit

Secure Benchmarking using Electronic Voting

Contact Info

Product

Resources

About