Towards Practical and Secure Coercion-Resistant Electronic Elections
نویسندگان
چکیده
Coercion-resistance is the most effective property to fight coercive attacks in Internet elections. This notion was introduced by Juels, Catalano, and Jakobsson (JCJ) at WPES 2005 together with a voting protocol that satisfies such a stringent security requirement. Unfortunately, their scheme has a quadratic complexity (the overhead for tallying authorities is quadratic in the number of votes) and would therefore not be suitable for large scale elections. Based on the work of JCJ, Schweisgut proposed a more efficient scheme. In this paper, we first show that Schweisgut’s scheme is insecure. In particular, we describe an attack that allows a coercer to check whether a voter followed or not his instructions. We then present a new coercion-resistant election scheme with a linear complexity that overcomes the drawbacks of these previous proposals. Our solution relies on special anonymous credentials and is proven secure, in the random oracle model, under the q-Strong DiffieHellman and Strong Decisional Diffie-Hellman Inversion assumptions.
منابع مشابه
A practical and secure coercion-resistant scheme for remote elections
Juels, Catalano, and Jakobsson (JCJ) proposed at WPES 2005 the first scheme that considers real-world threats and that is more realistic for remote elections. Their scheme, though, has quadratic work factor and thereby is not efficient for large scale elections. Based on the work of JCJ, Smith proposed an efficient scheme that has linear work factor. In this paper we first show that the Smith’s...
متن کاملA Practical and Secure Coercion-Resistant Scheme for Internet Voting
Juels, Catalano, and Jakobsson (JCJ) proposed at WPES 2005 the first voting scheme that considers real-world threats and that is more realistic for Internet elections. Their scheme, though, has a quadratic work factor and thereby is not efficient for large scale elections. Based on the work of JCJ, Smith proposed an efficient scheme that has a linear work factor. In this paper we first show tha...
متن کاملCoercion-Resistant Electronic Elections with Observer
We introduce an electronic election scheme, that is coercion-resistant, a notion introduced by Juels et al. in [JCJ05]. In our scheme we encrypt the credentials that serve as an authorisation to vote during registration. By using a MIX-cascade we can omit one time-consuming plaintext equivalence test in the tallying. In addition, the observer facilitates registration and voting for the benefit ...
متن کاملTowards a Practical, Secure, and Very Large Scale Online Election
We propose in this paper a practical and secure electronic voting protocol for large-scale online elections. Our protocol satisfies a large set of important criteria that has never been put together in a single protocol before. Among all electronic voting schemes in the literature, Sensus, a security-conscious electronic voting protocol proposed by Cranor and Cytron [CC97], satisfies the most o...
متن کاملSelections: Internet Voting with Over-the-Shoulder Coercion-Resistance
We present Selections, a new cryptographic voting protocol that is end-to-end verifiable and suitable for Internet voting. After a one-time in-person registration, voters can cast ballots in an arbitrary number of elections. We say a system provides over-the-shoulder coercionresistance if a voter can undetectably avoid complying with an adversary that is present during the vote casting process....
متن کامل