Sciweavers

28 search results - page 1 / 6
» Efficient Receipt-Free Voting Based on Homomorphic Encryptio...
Sort
View
EUROCRYPT
2000
Springer
13 years 11 months ago
Efficient Receipt-Free Voting Based on Homomorphic Encryption
Voting schemes that provide receipt-freeness prevent voters from proving their cast vote, and hence thwart vote-buying and coercion. We analyze the security of the multi-authority ...
Martin Hirt, Kazue Sako
WOTE
2010
13 years 5 months ago
Receipt-Free K-out-of-L Voting Based on ElGamal Encryption
We present a K-out-of-L voting scheme, i.e., a voting scheme that allows every voter to vote for (up to) K candidates from a set of L candidates. The scheme is receipt-free, which ...
Martin Hirt
ICISC
2003
115views Cryptology» more  ICISC 2003»
13 years 8 months ago
Receipt-Free Electronic Auction Schemes Using Homomorphic Encryption
Bid-rigging is a dangerous attack in electronic auction. Abe and Suzuki firstly introduced the idea of receipt-free to prevent this attack. In this paper we point out that Abe and...
Xiaofeng Chen, Byoungcheon Lee, Kwangjo Kim
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
Tal Moran, Moni Naor
SCN
2008
Springer
13 years 7 months ago
Simplified Submission of Inputs to Protocols
Consider an electronic election scheme implemented using a mix-net; a large number of voters submit their votes and then a smaller number of servers compute the result. The mix-net...
Douglas Wikström