Verifiability and receipt-freeness in cryptographic voting systems

Download

index.pdf

Date

2007

Author

Çetinkaya, Orhan

Metadata

Show full item record

Item Usage Stats

118
views

43
downloads

This thesis examines verifiability and receipt freeness in cryptographic voting protocols in detail and points out the contradiction between these requirements. Firstly, an extensive electronic voting requirement set is clearly defined, and then the voting dilemma is described. This is followed by a suggestion of an applicable solution to overcome the voting dilemma by introducing Predefined Fake Vote (PreFote) scheme. Based on a comprehensive literature review, a classification of the existing privacy preserving approaches and a taxonomy of the existing cryptographic voting protocols extending the previous studies are provided. Thereby, a complete and secure cryptographic voting protocol satisfying all electronic voting security requirements at the same time seems non-existent. Hence, an alternative privacy preserving approach is highly needed. Pseudo-Voter Identity (PVID) scheme, proposed in the present study, is a practical and low cost one. The PVID scheme is based on RSA blind signature, and it allows recasting without sacrificing uniqueness. Furthermore, this study proposes a dynamic ballot mechanism including an extension with PreFotes. This study, wherein the PVID scheme and extended dynamic ballots with PreFotes are employed, proposes a practical, complete and secure cryptographic voting protocol over a network for large scale elections, which fulfils all of the electronic voting security requirements: privacy, eligibility, uniqueness, fairness, uncoercibility, receipt-freeness, individual verifiability and accuracy. Lastly, a method to analyse voting systems based on security requirements is suggested, and a detailed analysis of the proposed protocol, which uses this method, concludes this study.

Subject Keywords

Cryptography., Cryptography

URI

http://etd.lib.metu.edu.tr/upload/12609081/index.pdf
https://hdl.handle.net/11511/17439

Collections

Graduate School of Applied Mathematics, Thesis

Suggestions

OpenMETU
Core

On statistical analysis of synchronous stream ciphers Sönmez Turan, Meltem; Doğanaksoy, Ali; Department of Cryptography (2008) Synchronous stream ciphers constitute an important class of symmetric ciphers. After the call of the eSTREAM project in 2004, 34 stream ciphers with different design approaches were proposed. In this thesis, we aim to provide a general framework to analyze stream ciphers statistically. Firstly, we consider stream ciphers as pseudo random number generators and study the quality of their output. We propose three randomness tests based on one dimensional random walks. Moreover, we theoretically and experimenta...
Combined attacks on block ciphers Öztop, Neşe; Doğanaksoy, Ali; Department of Cryptography (2009) Cryptanalytic methods are very important tools in terms of evaluating the security of block ciphers in a more accurate and reliable way. Differential and linear attacks have been the most effective cryptanalysis methods since the early 1990s. However, as the technology developed and more secure ciphers are designed, these fundamental methods started to be not so efficient. In order to analyze the ciphers, new methods should be introduced. One approach is inventing new techniques that are different from the ...
Some generalized multipartite access structures Kaşkaloğlu, Kerem; Özbudak, Ferruh; Department of Cryptography (2010) In this work, we study some generalized multipartite access structures and linear secret sharing schemes for their realizations. Given a multipartite set of participants with m compartments (or levels) and m conditions to be satisfied by an authorized set, we firstly examine the intermediary access structures arousing from the natural case concerning that any c out of m of these conditions suffice, instead of requiring anyone or all of the m conditions simultaneously, yielding to generalizations for both th...
Reliable Transmission of Short Packets Through Queues and Noisy Channels Under Latency and Peak-Age Violation Guarantees Devassy, Rahul; Durisi, Giuseppe; Ferrante, Guido Carlo; Simeone, Osvaldo; Uysal, Elif (Institute of Electrical and Electronics Engineers (IEEE), 2019-04-01) This paper investigates the probability that the delay and the peak-age of information exceed a desired threshold in a point-to-point communication system with short information packets. The packets are generated according to a stationary memoryless Bernoulli process, placed in a single-server queue and then transmitted over a wireless channel. A variable-length stop-feedback coding scheme-a general strategy that encompasses simple automatic repetition request (ARQ) and more sophisticated hybrid ARQ techniq...
Wireless Healthcare Monitoring with RFID-Enhanced Video Sensor Networks Alemdar, Hande; Ersoy, Cem (SAGE Publications, 2010-01-01) In pervasive healthcare systems, WSNs provide rich contextual information and alerting mechanisms against odd conditions with continuous monitoring. Furthermore, they minimize the need for caregivers and help the chronically ill and elderly to survive an independent life. In this paper, we propose an outdoor monitoring environment and evaluate the capabilities of video sensor networks for healthcare monitoring in an outdoor setting. The results exhibit that their capabilities are limited. For this reason, w...

Citation Formats

O. Çetinkaya, “Verifiability and receipt-freeness in cryptographic voting systems,” Ph.D. - Doctoral Program, Middle East Technical University, 2007.