The vector-ballot e-voting approach

DOI10.1007/978-3-540-27809-2_9MaRDI QIDQ4680928zbMATH OpenOpenAlexFDO

Authors Aggelos Kiayias, Moti Yung

Publication date 13 June 2005

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

Full work available at URL https://doi.org/10.1007/b98935

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• The vector-ballot approach for online voting procedures
• Secure voting using partially compatible homomorphisms
• A comparative overview of cryptographic voting protocols
• A homomorphic encryption-based secure electronic voting scheme
• E-voting without `cryptography' (extended abstract)

Cited in

(10)

• Filling the gap between voters and cryptography in e-voting
• Improved lattice-based mix-nets for electronic voting
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
• E-voting without `cryptography' (extended abstract)
• The vector-ballot approach for online voting procedures
• Non-interactive Zero-Knowledge Arguments for Voting
• A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting
• Secure voting using partially compatible homomorphisms
• Multiplicative homomorphic e-voting
• A verifiable secret shuffle of homomorphic encryptions

This page was built for publication: The vector-ballot e-voting approach

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