Shuffle-Sum: Coercion-Resistant Verifiable Tallying for STV Voting

There are many advantages to voting schemes in which voters rank all candidates in order, rather than just choosing their favorite. However, these schemes inherently suffer from a coercion problem when there are many candidates, because a coercer can demand a certain permutation from a voter and the...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information forensics and security 2009-12, Vol.4 (4), p.685-698
Hauptverfasser:	Benaloh, J., Moran, T., Naish, L., Ramchen, K., Teague, V.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Communication system security Computer information security Computer science Computer security Construction Cryptographic protocols Cryptography Elections Electronic voting Electronic voting systems end-to-end verifiable elections Information security instant runoff voting Marketing Nominations and elections Permutations preferential voting single transferrable vote (STV) Software engineering Technology social factors Voters Voting
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!