Analysis of Security and Cryptographic Approaches to Provide Secret and Verifiable Electronic Voting

Analysis of Security and Cryptographic Approaches to Provide Secret and Verifiable Electronic Voting

Stephan Neumann (TU Darmstadt, Germany), Jurlind Budurushi (TU Darmstadt, Germany) and Melanie Volkamer (TU Darmstadt, Germany)
Copyright: © 2014 |Pages: 35
DOI: 10.4018/978-1-4666-5820-2.ch002
OnDemand PDF Download:
$37.50

Abstract

Electronic voting systems are inextricably bound to security and cryptographic techniques. Over the last decades, countless techniques have been proposed to face the dangers of electronic voting systems with mathematical precision. Certainly, the majority of these works address secrecy and verifiability. In this chapter, security and cryptographic techniques are analyzed with respect to those security properties that can be evaluated on the basis of these techniques: secrecy, fairness, integrity, and verifiability. Furthermore, the chapter discusses their adequacy to ensure further relevant properties like eligibility and uniqueness, and evaluates security and cryptographic techniques with respect to the costs that come along with their real-world application. The authors conclude the chapter with a summary of the evaluation results, which can serve as guideline for decision-makers.
Chapter Preview
Top

Background

The first part of this section reviews related literature and shows where the present work is settled in the current state of the art on SnC techniques. In the second part, we outline components generally involved in the electronic voting process. Afterwards, we provide the preliminaries used throughout the analysis. More precisely, the preliminaries cover secret sharing techniques, encryption schemes, digital signature schemes, zero-knowledge proof systems, and the Benaloh challenge. The reader familiar with these preliminaries can safely skip these parts.

Complete Chapter List

Search this Book:
Reset