Name
Abstract | ||
|---|---|---|
The security and trustworthiness of elections is critical to democracy; alas, securing elections is notoriously hard. Powerful cryptographic techniques for verifying the integrity of electronic voting have been developed and are in increasingly common use. The claimed security guarantees of most of these techniques have been formally proved. However, implementing the cryptographic verifiers which utilize these techniques is a technical and error prone process, and often leads to critical errors appearing in the gap between the implementation and the formally verified design. We significantly reduce the gap between theory and practice by using machine checked proofs coupled with code extraction to produce cryptographic verifiers that are themselves formally verified. We demonstrate the feasibility of our technique by producing a formally verified verifier which we use to check the 2018 International Association for Cryptologic Research (IACR) directors election.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3319535.3354247 | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security |
Keywords | Field | DocType |
code extraction, interactive theorem provers, verifiable e-voting | Internet privacy,Computer security,Computer science | Conference |
ISBN | Citations | PageRank |
978-1-4503-6747-9 | 1 | 0.36 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Haines | 1 | 5 | 10.26 |
| Rajeev Gore | 2 | 56 | 4.06 |
| Mukesh Tiwari | 3 | 5 | 2.54 |