Sciweavers

62 search results - page 6 / 13
» A Latency-Free Election Scheme
Sort
View
ESORICS
2010
Springer
14 years 11 months ago
Election Verifiability in Electronic Voting Protocols
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...
Steve Kremer, Mark Ryan, Ben Smyth
ICICS
1997
Springer
15 years 2 months ago
Fault tolerant anonymous channel
Previous anonymous channels, called MIX nets, do not work if one center stops. This paper shows new anonymous channels which allow less than a half of faulty centers. A fault toler...
Wakaha Ogata, Kaoru Kurosawa, Kazue Sako, Kazunori...
CATS
2007
14 years 11 months ago
On The Complexity of Manipulating Elections
We study the manipulation of voting schemes, where a voter lies about their preferences in the hope of improving the election’s outcome. All voting schemes are potentially manip...
Tom Coleman, Vanessa Teague
INFOCOM
2003
IEEE
15 years 3 months ago
On-demand Power Management for Ad Hoc Networks
— Battery power is an important resource in ad hoc networks. It has been observed that in ad hoc networks, energy consumption does not reflect the communication activities in th...
Rong Zheng, Robin Kravets
SIGCOMM
2009
ACM
15 years 4 months ago
SMACK: a SMart ACKnowledgment scheme for broadcast messages in wireless networks
Network protocol designers, both at the physical and network level, have long considered interference and simultaneous transmission in wireless protocols as a problem to be avoide...
Aveek Dutta, Dola Saha, Dirk Grunwald, Douglas C. ...