Sciweavers

17 search results - page 1 / 4
» Information-Theoretically Secure Voting Without an Honest Ma...
Sort
View
74
Voted
CORR
2008
Springer
166views Education» more  CORR 2008»
14 years 10 months ago
Information-Theoretically Secure Voting Without an Honest Majority
We present three voting protocols with unconditional privacy and information-theoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities...
Anne Broadbent, Alain Tapp
ACSAC
1999
IEEE
15 years 2 months ago
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 neve...
Jared Karro, Jie Wang
EUROCRYPT
2003
Springer
15 years 3 months ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
CRYPTO
2012
Springer
247views Cryptology» more  CRYPTO 2012»
13 years 22 days ago
Black-Box Constructions of Composable Protocols without Set-Up
Abstract. We present the first black-box construction of a secure multiparty computation protocol that satisfies a meaningful notion of concurrent security in the plain model (wi...
Huijia Lin, Rafael Pass
SCN
2008
Springer
14 years 10 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