arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1908.09557cs.CRcs.CY
收藏

OpenVoting:双重投票中故障的可恢复性

OpenVoting: Recoverability from Failures in Dual Voting

Prashant Agrawal, Kabir Tomer, Abhinav Nakarmi, Mahabir Prasad Jhanwar, Subodh Sharma, Subhashis Banerjee

AI总结:

本文提出OpenVoting协议,结合密码学验证与纸质审计,在选举验证失败时无需重跑整个选举即可恢复,识别无误投票子集及失败原因,对选民认知负担小。

摘要:

本文探讨了当选举验证失败时,如何在不重新运行整个选举的情况下从故障中恢复的问题。我们考虑了双重投票协议的场景,该协议将端到端可验证投票(E2E-V)的密码学保证与使用选民可验证纸质记录(VVPR)进行审计的简便性相结合。我们首先考虑此类系统的设计要求,然后提出一个名为OpenVoting的协议,该协议能够识别与VVPR一致的可验证无误投票子集,并指出对应验证失败投票的投票站及可能的失败原因。对于普通选民而言,OpenVoting看起来就像一个老式的纸质投票系统,额外的认知负担极小。

英文摘要:

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 \emph{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 \emph{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. To an ordinary voter \emph{OpenVoting} looks just like an old fashioned paper based voting system, with minimal additional cognitive overload.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑