Design and Analysis of Novel Verifiable Voting Schemes Page: 14
This thesis is part of the collection entitled: UNT Theses and Dissertations and was provided to UNT Digital Library by the UNT Libraries.
Extracted Text
The following text was automatically extracted from the image on this page using optical character recognition software:
Adida [14] perfectly described how banking and aviation would look like if it would have
the same requirements as voting:
If voting is compared to banking, then one should imagine a banking system
where the bank cannot know the customer's balance, and even the customer cannot
prove her balance to her spouse, yet somehow she receives enough assurance that her
money is safe. If voting is compared to aviation, then one must imagine that pilots are
regularly trying to crash the plane, and that we must ensure that they are almost always
unsuccessful, even though, in this imaginary world, plane crashes are particularly
difficult to detect. These significant additional constraints lead to a clearer appreciation
of the challenges faced by voting system designers.
2.2 Key Properties for Voting Protocols
2.2.1 Integrity
Election results should be correct and not altered in any way. Therefore each
stage of the elections must be honest [15], [16], [17]. [17] provides a good summary of
each stage:
- Cast as intended: the vote recorded by the voting device (paper ballot, DRE,
optical scan and etc) should match the vote that the voter intended to cast. It is
more a usability requirement than a security one.
- Recorded as cast: a process of processing votes should not change the votes
itself. It can change only the form of it. For example, scanning a paper ballot to
electronic record.
- Counted as recorded: recorded ballots are counted correctly.
2.2.2 Privacy (Confidentiality)
A precise definition of privacy is given in [18]: Let two voters Assiya and Bob cast
the ballots. Let vi and v2 denote their votes. There are two possible cases exist: Assiya14
Upcoming Pages
Here’s what’s next.
Search Inside
This thesis can be searched. Note: Results may vary based on the legibility of text within the document.
Tools / Downloads
Get a copy of this page or view the extracted text.
Citing and Sharing
Basic information for referencing this web page. We also provide extended guidance on usage rights, references, copying or embedding.
Reference the current page of this Thesis.
Yestekov, Yernat. Design and Analysis of Novel Verifiable Voting Schemes, thesis, December 2013; Denton, Texas. (https://digital.library.unt.edu/ark:/67531/metadc407785/m1/19/?rotate=270: accessed July 18, 2024), University of North Texas Libraries, UNT Digital Library, https://digital.library.unt.edu; .