Receipt-Free K-out-of-L Voting Based on ElGamal Encryption

DOI10.1007/978-3-642-12980-3_3zbMATH Open1284.68245OpenAlexW1516997070MaRDI QIDQ3569102FDOQ3569102

Authors: Martin Hirt 

Publication date: 17 June 2010

Published in: Towards Trustworthy Elections (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12980-3_3

Recommendations

• Efficent receipt-free voting based on homomorphic encryption
• Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
• Information Security and Cryptology - ICISC 2003
• An anonymous and flexible í-out-of-n electronic voting scheme
• scientific article; zbMATH DE number 1759320
• An efficient multi-receipt mechanism for uncoercible anonymous electronic voting
• Incoercible multi-party computation and universally composable receipt-free voting
• A homomorphic LWE based E-voting scheme

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

This page was built for publication: Receipt-Free K-out-of-L Voting Based on ElGamal Encryption

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