منابع مشابه
Accessible Voter-Verifiability
All voter-verifiable voting schemes in the literature require that the voter be able to see and to mark. This paper describes modifications to the Prêt à Voter and PunchScan schemes so that a voter who can either see or hear, or both, independent of marking ability, may avail of voter-verifiability without revealing her vote. The modified systems would provide privacy and integrity guarantees t...
متن کاملVoter Verifiability in Homomorphic Election Schemes
Voters are now demanding the ability to verify that their votes are cast and counted as intended. Most existing cryptographic election protocols do not treat the voter as a computationally-limited entity separate from the voting booth, and therefore do not ensure that the voting booth records the correct vote. David Chaum and Andrew Neff have proposed mixnet schemes that do provide this assuran...
متن کاملScantegrity III: Automatic Trustworthy Receipts, Highlighting Over/Under Votes, and Full Voter Verifiability
Building on lessons learned from the November 2009 Scantegrity II election in Takoma Park, MD, we propose improvements to the Scantegrity II voting system that (1) automatically print trustworthy receipts for easier on-line verification, (2) highlight ballot features including over/under votes to comply with the Help America Vote Act, and (3) achieve full voter verifiability by eliminating prin...
متن کاملA PC-Based Open-Source Voting Machine with an Accessible Voter-Verifiable Paper Ballot
A PC-Based Open-Source Voting Machine with an Accessible Voter-Verifiable Paper Ballot Arthur M. Keller, UC Santa Cruz and Open Voting Consortium [email protected] Alan Dechert, Open Voting Consortium [email protected] Karl Auerbach, InterWorking Labs [email protected] David Mertz, Gnosis Software, Inc. [email protected] Amy Pearl, Software Innovations [email protected] Joseph Lorenzo Hall, ...
متن کاملVerifiability of Argumentation Semantics
Dung’s abstract argumentation theory is a widely used formalism to model conflicting information and to draw conclusions in such situations. Hereby, the knowledge is represented by so-called argumentation frameworks (AFs) and the reasoning is done via semantics extracting acceptable sets. All reasonable semantics are based on the notion of conflict-freeness which means that arguments are only j...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cryptologia
سال: 2009
ISSN: 0161-1194,1558-1586
DOI: 10.1080/01611190902894946