Efficient voting with no selling of votes

DOI10.1016/S0304-3975(99)00068-7MaRDI QIDQ1575863zbMATH OpenOpenAlexFDO

Authors Valtteri Niemi, Ari Renvall

Publication date 23 August 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(99)00068-7

zbMATH Keywords

computer electionscryptographic protocolsvoting scheme

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Voting theory (91B12) Cryptography (94A60)

Review text

This papers presents a voting scheme for computer elections. Selling of votes is impossible since there is only a negligible chance of proving voting strategies. No trusted party is needed but all candidates must cooperate in the voters registration and counting phases.

Recommendations

• scientific article; zbMATH DE number 1024093
• A practical secret voting scheme for large scale elections
• Information Security
• scientific article; zbMATH DE number 176563

Cited in

(10)

• A simpler bitcoin voting protocol
• Efficient voting with penalties
• scientific article; zbMATH DE number 2085426 (Why is no real title available?)
• A secure voting scheme for professional organizations for one occasion
• scientific article; zbMATH DE number 1024093 (Why is no real title available?)
• Information Security
• Information Security
• scientific article; zbMATH DE number 2219227 (Why is no real title available?)
• Cryptographic protocols and voting
• Vote trading in public elections

This page was built for publication: Efficient voting with no selling of votes

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