Paper 2023/1393 Original: eprint.iacr.org/2023/1393 ↗
OpenVoting: Recoverability from Failures in Dual Voting
Abstract
In this paper we address the problem of recovery from failures without re-running entire elections when elections fail to verify. We consider the setting of $\textit{dual voting}$ protocols, where the cryptographic guarantees of end-to-end verifiable voting (E2E-V) are combined with the simplicity of audit using voter-verified paper records (VVPR). We first consider the design requirements of such a system and then suggest a protocol called $\textit{OpenVoting}$, which identifies a verifiable subset of error-free votes consistent with the VVPRs, and the polling booths corresponding to the votes that fail to verify with possible reasons for the failures.
Metadata
- Available format(s)
PDF- Category
- Applications
- Publication info
- Preprint.
- History
- 2023-09-18: last updated
- 2023-09-18: published
- Short URL
- https://ia.cr/2023/1393
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2023/1393,
author = {Prashant Agrawal and Kabir Tomer and Abhinav Nakarmi and Mahabir Prasad Jhanwar and Subodh Sharma and Subhashis Banerjee},
title = {OpenVoting: Recoverability from Failures in Dual Voting},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/1393},
year = {2023},
url = {https://eprint.iacr.org/2023/1393}
}