Abstract
E-voting maybe replaces the traditional voting scheme in the future, however, the security threat must be paid enough attention. In this paper, a novel e-voting scheme is proposed using secret sharing and k-anonymity, which not only satisfies the basic security goals such as the non-cheating, the universal verifiability, the confidentiality, and the anonymity, but also achieves the addition properties including coercion-resistance and unconditional security since the security of the proposed scheme does not rely on any computational hard problem.
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.
