Fear not, vote truthfully: Secure Multiparty Computation of score based rules

Dery, Lihi; Tassa, Tamir; Yanai, Avishay

doi:10.1016/j.eswa.2020.114434

Cited by 10 publications

(8 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The design of a mechanism that offers perfect ballot secrecy must be tailored to the specific voting rule that governs the elections. Others have studied Plurality, Majority Judgement, and Approval voting rules [29,37,8], or the entire family of score-based rules [19]. However, ours is the first study that offers a privacy-preserving solution for order-based voting rules.…”

Section: Discussionmentioning

confidence: 99%

“…(a) A running voting system. To demonstrate the features and advantages of the secure protocols presented here, we intend to implement a running voting system, as was done in [20] for the secure protocols implementing score-based rules [19].…”

Section: Discussionmentioning

confidence: 99%

“…However, while this system preserves anonymity, the talliers are exposed to the actual ballots. The mere anonymity of the ballots might not provide sufficient security and this may encourage voters to abstain or vote untruthfully [19].…”

Section: Related Workmentioning

confidence: 99%

“…Yang et al [37] suggested using homomorphic encryption specifically for Approval voting [6]. Lastly, Dery et al [19] offered a solution based on multiparty computation in order to securely determine the winners in elections governed by score-based voting rules.…”

Section: Related Workmentioning

confidence: 99%

“…Modal ranking rule is an order-based voting rule over C, but it is equivalent to the Plurality score-based voting rule (see [6]) over the set of candidate rankings R C . Hence, it can be securely implemented by the protocol that was presented in [19].…”

Section: Modal Rankingmentioning

confidence: 99%

See 4 more Smart Citations

Towards Secure Virtual Elections: Multiparty Computation of Order Based Voting Rules

Tassa¹,

Dery²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

Electronic voting systems are essential for holding virtual elections, and the need for such systems increases due to the COVID-19 pandemic and the social distancing that it mandates. One of the main challenges in e-voting systems is to secure the voting process: namely, to certify that the computed results are consistent with the cast ballots, and that the privacy of the voters is preserved. We propose herein a secure voting protocol for elections that are governed by order-based voting rules. Our protocol offers perfect ballot secrecy, in the sense that it issues only the required output, while no other information on the cast ballots is revealed. Such perfect secrecy, which is achieved by employing secure multiparty computation tools, may increase the voters' confidence and, consequently, encourage them to vote according to their true preferences. Evaluation of the protocol's computational costs establishes that it is lightweight and can be readily implemented in real-life electronic elections.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Modal Rankingmentioning

confidence: 99%

See 3 more Smart Citations