On Some Incompatible Properties of Voting Schemes
نویسندگان
چکیده
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 assumptions and efficiency requirements, we show that we cannot achieve: – universal verifiability of the tally (UV) and unconditional privacy of the votes (UP) simultaneously, unless all the registered voters actually vote; – universal verifiability of the tally (UV) and receiptfreeness (RF), unless the voting process involves interactions between several voters (and possibly the voting
منابع مشابه
Double voter perceptible blind signature based electronic voting protocol
Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...
متن کاملMajority and Positional Voting in a Probabilistic Framework
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected].. Oxford University Press and The Review of Economic Studie...
متن کاملApproval voting and Arrow's impossibility theorem
Approval voting has attracted considerable interest among voting theorists, but they have rarely investigated it in the Arrovian framework of social welfare functions (SWF) and never connected it with Arrow’s impossibility theorem. This note explores these two directions. Assuming that voters have dichotomous preferences, it first characterizes approval voting in terms of its SWF properties and...
متن کاملA framework and taxonomy for comparison of electronic voting schemes
Electronic voting is an emerging social application of cryptographic protocols. A vast amount of literature on electronic voting has been developed over the last two decades. In this paper, we provide a framework that classifies these approaches and defines a set of metrics under which their properties can be compared. Such a methodology reveals important differences in security properties betw...
متن کاملApplications of Polynomial Properties to Verifiable Delegation of Computation and Electronic Voting
This paper presents some proposals of protocols for two types of schemes such as verifiable delegation of computation and remote electronic voting, based on polynomial properties. Our protocols for verifiable delegation of computation are aimed to the efficient evaluation of polynomials, working on schemes where the polynomial and/or the input are kept secret to the server. Our proposal for rem...
متن کامل