2021
DOI: 10.1007/978-3-030-86942-7_1
|View full text |Cite
|
Sign up to set email alerts
|

Provably Improving Election Verifiability in Belenios

Abstract: Belenios is an online voting system that provides a strong notion of election verifiability, where no single party has to be trusted, and security holds as soon as either the voting registrar or the voting server is honest. It was formally proved to be secure, making the assumption that no further ballots are cast on the bulletin board after voters verified their ballots. In practice, however, revoting is allowed and voters can verify their ballots anytime. This gap between formal proofs and use in practice le… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 20 publications
0
4
0
Order By: Relevance
“…In this case, ballot-stuffing attackers [36] enlarge their reputation by their self-announcement, including positive feedback from each other and concealing the incompatible intentions to the higher authorities. In consequence, all trust models are devoted to recommendation trusts directly and indirectly, which can be easily affected by ballot-stuffing attacks [37]. The e-voting model can be faced with ballot-stuffing attacks.…”
Section: Centralization Attackmentioning
confidence: 99%
“…In this case, ballot-stuffing attackers [36] enlarge their reputation by their self-announcement, including positive feedback from each other and concealing the incompatible intentions to the higher authorities. In consequence, all trust models are devoted to recommendation trusts directly and indirectly, which can be easily affected by ballot-stuffing attacks [37]. The e-voting model can be faced with ballot-stuffing attacks.…”
Section: Centralization Attackmentioning
confidence: 99%
“…We note that the protocols in B-ID-MIX can handle more complex ballots than existing ones in B-ID-HOM. 4 We study sub-class B-ID-HOM in Sec. 6, where we demonstrate that the best protocols in this sub-class are [21] and its extension [29], as well as the homomorphic version of [22].…”
Section: Identifiable Ballots (B-id)mentioning
confidence: 99%
“…IV-C of [3], Baloglu et al observe that the reason for these issues is the fact that Belenios uses pseudonyms to achieve everlasting privacy. In a different work, Baloglu et al [4] show how to mitigate most, but not all of Belenios' verifiability issues they presented in [3].…”
Section: Conceptmentioning
confidence: 99%
“…These three examples, TLS 1.3, 5G-AKA, and EMV were each developed by some subset of this paper's authors together with other colleagues. 1 We emphasize though that there are many other impactful examples, not covered here, by other users who have independently applied TAMARIN to ambitious, large-scale protocols, including payment systems [5], e-voting systems [6], and distance bounding protocols [7]. 1.…”
Section: Scope Of Applicationsmentioning
confidence: 99%