A Latency-Free Election Scheme

DOI10.1007/978-3-540-79263-5_27MaRDI QIDQ5458955zbMATH OpenOpenAlexFDO

Authors Kristian Gjøsteen

Publication date 24 April 2008

Published in Topics in Cryptology – CT-RSA 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-79263-5_27

Mathematics Subject Classification ID

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

Recommendations

• Multi-authority secret-ballot elections with linear work
• scientific article; zbMATH DE number 1406797
• A practical secret voting scheme for large scale elections
• Receipt-free secret-ballot elections (extended abstract)
• scientific article; zbMATH DE number 176564

Cited in

(2)

• A blind coupon mechanism enabling veto voting over unreliable networks
• Efficient and universally composable single secret leader election from pairings

This page was built for publication: A Latency-Free Election Scheme

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