13457 search results - page 11 / 2692 » Can we elect if we cannot compare |
USS
2008
13 years 9 months ago
2008
Voting with cryptographic auditing, sometimes called open-audit voting, has remained, for the most part, a theoretical endeavor. In spite of dozens of fascinating protocols and re...
TARK
2007
Springer
14 years 1 months ago
2007
Springer
Multiple election paradoxes arise when voting separately on each issue from a set of related issues results in an obviously undesirable outcome. Several authors have argued that a...
FMCO
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We compare the expressive power of process calculi by studying the problem of electing a leader in a symmetric network of processes. We consider the π-calculus with mixe...
ESORICS
2010
Springer
13 years 8 months ago
2010
Springer
We present a formal, symbolic definition of election verifiability for electronic voting protocols in the context of the applied pi calculus. Our definition is given in terms of bo...
SRDS
1996
IEEE
13 years 11 months ago
1996
IEEE
In existing asynchronous distributed systems it is impossible to implement failure detectors which are perfect, i.e. they only suspect crashed processes and eventually suspect all...