In this paper, we study the problem of simultaneously achieving several security properties, for voting schemes, without non-standard assumptions. This paper is a work in progress. More specifically, we focus on the universal verifiability of the computation of the tally, on the unconditional privacy/anonymity of the votes, and on the receipt-freeness properties. More precisely, under usual ass...

In this paper, we review the electronic voting protocols based on blind signature scheme. These protocols try to fulfil the following electronic voting requirements: eligibility, privacy, receipt-freeness, fairness, accuracy, individual verifiability and universal verifiability. Some of them like eligibility and privacy are easily achieved by the nature of blind signatures; on the other hand, s...

In e-voting protocol design, cryptographers must balance usability and strong security guarantees, such as privacy and verifiability. In traditional e-voting protocols, privacy is often provided by a trusted authority that learns the votes and computes the tally. Some protocols replace the trusted authority by a set of authorities, and privacy is guaranteed if less than a threshold number of au...

Most voting schemes aim at providing verifiability: voters should be able to check that their ballots did contribute to the outcome (individual verifiability) and that the tallying authorities did their job properly (universal verifiability). Surprisingly, verifiability still does not answer a very simple and natural question: how can I be sure that the published result corresponds to the (sum ...

We show how to extend the Helios voting system to provide eligibility verifiability without revealing who voted which we call private eligibility verifiability. The main idea is that real votes are hidden in a crowd of null votes that are cast by others but are indistinguishable from those of the eligible voter. This extended Helios scheme also improves Helios towards receipt-freeness.

The Verifiability Approach (VA) is a verbal veracity tool that assumes truth tellers provide more details can be verified and obtain higher ratio of such (verifiable details/total details) than liars. A VA meta-analysis was conducted. Results showed reported verifiable liars ( k = 20, N 1532, g 0.42). effect moderated by the presence information protocol nature statement (event-related or not)....

Autonomous systems are taking over the decision-making in many crucial aspects of our lives. Trust them will help users benefit from such without harming themselves. Establishing right level trust involves a holistic validation and verification process, accounting for as interactions with physical world human users. In this talk, I present ongoing effort to provide framework ensuring verifiabil...

Inductive inference is the study of learning in a recursion-theoretic framework. The basic model is that the learner sees data f(0), f(1), . . ., makes conjectures e1, e2, . . . (these are programs) and eventually always outputs the same program, which is a program for f . This model was introduced by Gold [12]. This model, and several variants of it, have been extensively studied by several pe...