An Improved Electronic Voting Scheme without a Trusted Random Number Generator

DOI10.1007/978-3-642-34704-7_8MaRDI QIDQ4899199zbMATH OpenOpenAlexFDO

Authors Yining Liu, Peiyong Sun, Jihong Yan, Yajun Li, Jianyu Cao

Publication date 7 January 2013

Published in Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34704-7_8

zbMATH Keywords

coercion-freee-votingfinite fieldinterpolating polynomialverifiabilityverifiable random number

Mathematics Subject Classification ID

Voting theory (91B12) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1950626
• E-voting without `cryptography' (extended abstract)
• An implementation of a universally verifiable electronic voting scheme based on shuffling
• Towards trustworthy elections. New directions in electronic voting
• scientific article; zbMATH DE number 176563
• An anonymous and flexible í-out-of-n electronic voting scheme
• A homomorphic encryption-based secure electronic voting scheme

This page was built for publication: An Improved Electronic Voting Scheme without a Trusted Random Number Generator

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