Sciweavers

13457 search results - page 10 / 2692
» Can we elect if we cannot compare
Sort
View
IJISEC
2010
159views more  IJISEC 2010»
13 years 4 months ago
A generalization of Paillier's public-key system with applications to electronic voting
We propose a generalization of Paillier's probabilistic public key system, in which the expansion factor is reduced and which allows to adjust the block length of the scheme e...
Ivan Damgård, Mads Jurik, Jesper Buus Nielse...
PRDC
2006
IEEE
14 years 1 months ago
Leader Election in the Timed Finite Average Response Time Model
The finite average response time model is a very weak distributed systems model: it permits runs with unbounded transmission and processing delays and it does not bound the relat...
Christof Fetzer, Martin Süßkraut
DIALM
2010
ACM
146views Algorithms» more  DIALM 2010»
13 years 8 months ago
Regional consecutive leader election in mobile ad-hoc networks
In this paper we introduce the regional consecutive leader election (RCLE) problem, which extends the classic leader election problem to the ever-changing environment of mobile ad-...
Hyun Chul Chung, Peter Robinson, Jennifer L. Welch
WCNC
2008
IEEE
14 years 1 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...
IPPS
2007
IEEE
14 years 1 months ago
Almost Peer-to-Peer Clock Synchronization
In this paper, an almost peer-to-peer (AP2P) clock synchronization protocol is proposed. AP2P is almost peer-topeer in the sense that it provides the desirable features of a purel...
Ahmed Sobeih, Michel Hack, Zhen Liu, Li Zhang