Prêt à voter with Paillier encryption

DOI10.1016/J.MCM.2008.05.015zbMATH Open1187.91188OpenAlexW2095423793WikidataQ30054168 ScholiaQ30054168MaRDI QIDQ2389798FDOQ2389798

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

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)

zbMATH Keywords

high assurance electionsverifiable voting

Mathematics Subject Classification ID

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

Cites Work

• A method for obtaining digital signatures and public-key cryptosystems
• How to share a secret
• A public key cryptosystem and a signature scheme based on discrete logarithms
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• New directions in cryptography
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Title not available (Why is that?)
• Receipt-free secret-ballot elections (extended abstract)
• Group anonymity
• Prêt à voter with Paillier encryption
• 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)