Abstract
Lin, Hwang and Chang (2003) have proposed an electronic-voting scheme which can be utilised in large-scale elections, and claimed that it detects double voting. In this article, by presenting an attack, we show that voters can successfully vote more than once without being detected. Then, we propose a new modified scheme based on the Lin, Hwang and Chang's (2003) scheme with the same efficiency to solve this weakness and analyse its security.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Electronic Security and Digital Forensics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
