We propose an electronic voting machine architecture in which the voting user interface is prerendered and published before election day. The prerendered user interface is a verifiable artifact — an electronic sample ballot — enabling public participation in the review, verification, usability testing, and accessibility testing of the ballot. Preparing the user interface outside of the voting m...

Threshold secret sharing schemes do not prevent any malicious behavior of the dealer or shareholders and so we need verifiable secret sharing, to detect and identify the cheaters, to achieve fair reconstruction of a secret. The problem of verifiable secret sharing is to verify the shares distributed by the dealer. A novel approach for verifiable secret sharing is presented in this paper where b...

Expert reviews, laboratory tests, and a large-scale field study of one paper/optical scan and five electronic voting systems suggested numerous possible improvements. Changes could be made in all aspects of the process—signing-on, navigating across the ballot, checking and changing votes, casting write-in votes, and reviewing and casting the ballot. A paper trail was largely ignored by voters. ...

We present new cryptographic protocols for multi-authority secret ballot elections that guarantee privacy, robustness, and universal verifiability. Application of some novel techniques, in particular the construction of witness hiding/indistinguishable protocols from Cramer, Damg̊ard and Schoenmakers, and the verifiable secret sharing scheme of Pedersen, reduce the work required by the voter or ...

We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [23] with a special public key, which is generated via a (possibly)interactive protocol and contains an instance y ∈ L ∩ {0, 1}∗ for a specific NP language L, but the security requirements on such a function are relaxed: we only...

This paper presents a case study in modelling and verifying the Linux Virtual File System (VFS). Our work is set in the context of Hoare’s verification grand challenge and, in particular, Joshi and Holzmann’s mini-challenge to build a verifiable file system. The aim of the study is to assess the viability of retrospective verification of a VFS implementation using model-checking technology. We ...

Program verification techniques based on programming logics and verification condition generators provide a powerful means to reason about programs. Whereas these techniques have very often been employed in the context of high-level languages in order to benefit from their structural nature, it is often required, especially in the context of mobile code, to prove the correctness of compiled pro...