Abstract
An ideal e-voting system would allow users to go online, using web-browser or a phone application, enter their credentials and vote; it would also allow voters to verify their votes after election. The properties that make e-voting such a promising technology also raise potential privacy and efficiency problems. In literature, researchers have listed the requirements which an e-voting scheme must have. Many e-voting schemes have been proposed which are based on combination of cryptographic tools, however some schemes have efficiency problems, voter or election authority does a lot of processing at their end, and some do not fulfill all security requirements e.g. most lack coercion-resistance and receipt free-ness. In this paper, we propose an e-voting scheme based on blind signatures which fulfils important security requirements and is efficient too. In our scheme, voter does not generate any keys or sign anything, yet still is universally verifiable and coercion-resistant.
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 callDisclaimer: 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.
