Secure voting using partially compatible homomorphisms

DOI10.1007/3-540-48658-5_37MaRDI QIDQ4940713zbMATH OpenFDO

Authors Kazue Sako, Joe Kilian

Publication date 1 March 2000

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

Full work available at URL https://doi.org/10.1007/3-540-48658-5_37

zbMATH Keywords

homomorphic encryptionsnumber-theoretic based protocolpartial compatibilitysecure electronic voting

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• A homomorphic encryption-based secure electronic voting scheme
• Efficent receipt-free voting based on homomorphic encryption
• Financial Cryptography
• Modular secret-sharing and electronic voting systems
• Multi-authority secret-ballot elections with linear work

Cited in

(34)

• Reconciling non-malleability with homomorphic encryption
• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 1722672 (Why is no real title available?)
• A homomorphic LWE based E-voting scheme
• A homomorphic encryption-based secure electronic voting scheme
• Modular secret-sharing and electronic voting systems
• Cryptocomputing with rationals
• Benaloh's dense probabilistic encryption revisited
• On application of elliptic curves in some electronic voting protocols
• Efficent receipt-free voting based on homomorphic encryption
• Divisible voting scheme
• A secure anonymous internet electronic voting scheme based on the polynomial
• Simplified Submission of Inputs to Protocols
• The vector-ballot approach for online voting procedures
• Non-interactive Zero-Knowledge Arguments for Voting
• A New Protocol for Conditional Disclosure of Secrets and Its Applications
• Electronic voting scheme based on OT protocol
• scientific article; zbMATH DE number 2043334 (Why is no real title available?)
• scientific article; zbMATH DE number 1759349 (Why is no real title available?)
• Financial Cryptography
• Applied Cryptography and Network Security
• Cryptographic voting -- a gentle introduction
• New receipt-free voting scheme using double-trapdoor commitment
• A Latency-Free Election Scheme
• Information Security
• Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library
• Theory of Cryptography
• Progress in Cryptology - INDOCRYPT 2004
• Electronic jury voting protocols
• Privacy-preserving voluntary-tallying leader election for Internet of Things
• How to verifiably encrypt many bits for an election?
• Improving the Performance of Cryptographic Voting Protocols
• Cryptographic protocols and voting
• Remote voting protocols. II

This page was built for publication: Secure voting using partially compatible homomorphisms

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