Privacy-Preserving Dispute Resolution in the Improved Bingo Voting
In this work, we advance the formal analysis in the symbolic model of an improved version of the Bingo Voting scheme, whose enhancements include privacy-preserving dispute resolution mechanisms. Most of our analysis of several verification, dispute resolution, and privacy properties is done automatically using ProVerif, which we complement with manual induction proofs as necessary. We find that the scheme meets some properties only if one makes additional trust assumptions to those stated in . For example, we find that dispute resolution is met assuming an honest voting authority. Moreover, our work provides an understanding of privacy-preserving dispute resolution in general, which can be beneficial to similar analyses of other voting schemes.
|Title of host publication||E-Vote-ID: International Joint Conference on Electronic Voting|
|Number of pages||16|
|Publication date||25 Sep 2020|
|ISBN (Print)||978-3-030-60346-5, 978-3-030-60347-2|
|Publication status||Published - 25 Sep 2020|
|Series||Lecture Notes in Computer Science|