How to verifiably encrypt many bits for an election?

DOI10.1007/978-3-031-17146-8_32zbMath1524.94064OpenAlexW4296960025MaRDI QIDQ6109453

No author found.

Publication date: 28 July 2023

Published in: Computer Security – ESORICS 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-17146-8_32

Mathematics Subject Classification ID

Voting theory (91B12) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast distributed RSA key generation for semi-honest and malicious adversaries
• Belenios: a simple private and verifiable electronic voting system
• Universally verifiable MPC and IRV ballot counting
• One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
• Linear Algebra with Sub-linear Zero-Knowledge Arguments