Multiplicative homomorphic e-voting

DOI10.1007/978-3-540-30556-9_6MaRDI QIDQ5712210zbMATH OpenOpenAlexFDO

Authors Kun Peng, Riza Aditya, Ed Dawson, Byoungcheon Lee, Colin A. Boyd

Publication date 22 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104579, https://eprints.qut.edu.au/24434/1/Multiplicative_Homomorphic_E-Voting.pdf

Mathematics Subject Classification ID

Voting theory (91B12) Cryptography (94A60)

Recommendations

• A homomorphic encryption-based secure electronic voting scheme
• Secure voting using partially compatible homomorphisms
• Divisible voting scheme
• The vector-ballot e-voting approach
• Modular secret-sharing and electronic voting systems

Cited in

(6)

• Improved lattice-based mix-nets for electronic voting
• A homomorphic LWE based E-voting scheme
• A homomorphic encryption-based secure electronic voting scheme
• A general, flexible and efficient proof of inclusion and exclusion
• Evaluating 2-DNF formulas on ciphertexts
• Verifiable Decryption for Fully Homomorphic Encryption

This page was built for publication: Multiplicative homomorphic e-voting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712210)