Design and Analysis of Novel Verifiable Voting Schemes Page: 18
View a full description of this thesis.
Extracted Text
The following text was automatically extracted from the image on this page using optical character recognition software:
around the world each day. Even if would solve a problem of distributing initial keys, you
would have to maintain a million of keys!
In 1979, Whitfield Diffie and Martin Hellman presented their revolutionary paper
"New Directions in Cryptography" [21]. They proposed to perform encryption and
decryption using different keys. The key for encryption should be made public and
available to anyone, while decryption key should be kept secret. This approach was
named the public-key cryptography. It has solved the problem of distribution of a shared
secret and maintaining different keys for each engaged party.
2.4 Current Approaches to Voting Schemes
Let's consider the current approaches to voting from classical voting system to
systems based on cryptographic primitives.
2.4.1 Classical Voting System
The classical voting system is quite simple. On election day, a voter marks his
preferences on the preprinted ballot (can be both paper or electronic), cast the ballot to
a ballot box or a machine and leaves the precinct. The security of election is based on
assumption that voter should trust to the election officials and people who count the
tally. As soon as the ballot falls into the ballot box, a voter establish the trust to a chain
of custody. There is no way to verify that his ballot was counted as intended. As most of
the current voting systems used in elections, classical voting scheme preserve privacy
against verifiability (See Fig. 2.1).18
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/23/: accessed July 17, 2024), University of North Texas Libraries, UNT Digital Library, https://digital.library.unt.edu; .