A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Practical Governmental Voting with Unconditional Integrity and Privacy
[chapter]
2017
Lecture Notes in Computer Science
Throughout the years, many cryptographically verifiable voting systems have been proposed with a whole spectrum of features and security assumptions. Where the voter casts an in-person (and possibly paper) ballot and leaves, as is common in a governmental election, the majority of the proposals fall in the category of providing unconditional integrity and computational privacy. A minority of papers have looked at the inverse scenario: everlasting privacy with computational integrity. However as
doi:10.1007/978-3-319-70278-0_27
fatcat:gobfldct45fspm73osyrkadj2m