Prêt à voter with Paillier encryption

DOI10.1016/J.MCM.2008.05.015MaRDI QIDQ2389798zbMATH OpenOpenAlexWikidataFDO

Authors Peter Y. A. Ryan

Publication date 18 July 2009

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mcm.2008.05.015

zbMATH Keywords

high assurance electionsverifiable voting

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1618044
• Versatile Prêt à Voter: handling multiple election methods with a unified interface
• Practical multi-candidate election system
• Efficent receipt-free voting based on homomorphic encryption
• Receipt-free secret-ballot elections (extended abstract)

Cites work

• scientific article; zbMATH DE number 2221909 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Group anonymity
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• How to share a secret
• New directions in cryptography
• Prêt à voter with Paillier encryption
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Receipt-free secret-ballot elections (extended abstract)
• Simple and Efficient Shuffling with Provable Correctness and ZK Privacy

Cited in

(4)

• Prêt à voter with Paillier encryption
• Versatile Prêt à Voter: handling multiple election methods with a unified interface
• Generic plaintext equality and inequality proofs
• Internet voting protocol based on improved implicit security

This page was built for publication: Prêt à voter with Paillier encryption

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