Universally verifiable MPC and IRV ballot counting

DOI10.1007/978-3-030-32101-7_19MaRDI QIDQ2656911zbMATH OpenOpenAlexFDO

Authors Kim Ramchen, Chris Culnane, Olivier Pereira, Vanessa Teague

Publication date 17 March 2021

Full work available at URL https://doi.org/10.1007/978-3-030-32101-7_19

zbMATH Keywords

electionsinstant runoff votingmultiparty computationverifiabilityverifiable computationvoting

Mathematics Subject Classification ID

Internet topics (68M11) Cryptography (94A60)

Recommendations

• Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
• Multi-authority secret-ballot elections with linear work
• Universally verifiable multiparty computation from threshold homomorphic cryptosystems
• Verifiable elections that scale for free
• scientific article; zbMATH DE number 1722672

Cited in

(3)

• scientific article; zbMATH DE number 1722672 (Why is no real title available?)
• How to verifiably encrypt many bits for an election?
• Fully tally-hiding verifiable E-voting for real-world elections with seat-allocations

This page was built for publication: Universally verifiable MPC and IRV ballot counting

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