Sciweavers

62 search results - page 1 / 13
» A Latency-Free Election Scheme
Sort
View
CTRSA
2008
Springer
100views Cryptology» more  CTRSA 2008»
13 years 6 months ago
A Latency-Free Election Scheme
We motivate and describe the problem of finding protocols for multiparty computations that only use a single broadcast round per computation (latency-free computations). We show t...
Kristian Gjøsteen
TARK
2007
Springer
13 years 10 months ago
Knowledge-based modelling of voting protocols
We contend that reasoning about knowledge is both natural and pragmatic for verification of electronic voting protocols. We present a model in which desirable properties of elect...
A. Baskar, Ramaswamy Ramanujam, S. P. Suresh
WCNC
2008
IEEE
13 years 11 months ago
A Mechanism Design-Based Multi-Leader Election Scheme for Intrusion Detection in MANET
—In this paper, we study the election of multiple leaders for intrusion detection in the presence of selfish nodes in mobile ad hoc networks (MANETs). To balance the resource co...
Noman Mohammed, Hadi Otrok, Lingyu Wang, Mourad De...
COMPSAC
2005
IEEE
13 years 10 months ago
Two Variations to the mCESG Pollsterless E-Voting Scheme
— Over the past several years, the UK Government has piloted several new voting technologies during local authority elections. The mCESG pollsterless Remote Electronic Voting (RE...
Tim Storer, Ishbel Duncan
WOTE
2010
13 years 2 months ago
Aperio: High Integrity Elections for Developing Countries
This article presents an ‘end-to-end’ integrity verification mechanism for use in minimally equipped secret paper-ballot election environments. The scheme presented in this pa...
Aleksander Essex, Jeremy Clark, Carlisle Adams