17 search results - page 3 / 4 » Information-Theoretically Secure Voting Without an Honest Ma... |
ICDE
2005
IEEE
14 years 10 months ago
2005
IEEE
Standard multi-party computation models assume semi-honest behavior, where the majority of participants implement protocols according to specification, an assumption not always pl...
SPAA
2010
ACM
14 years 1 months ago
2010
ACM
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
EUROCRYPT
1997
Springer
14 years 3 days ago
1997
Springer
In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. It is the first scheme for which the ...
USS
2008
13 years 11 months ago
2008
Optical scan electronic voting machines employ software components that are customized for each specific election. Such software components are critical from a security and integr...
FOCS
2004
IEEE
14 years 8 days ago
2004
IEEE
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...