Sciweavers

250 search results - page 16 / 50
» A Round and Communication Efficient Secure Ranking Protocol
Sort
View
IEEEARES
2008
IEEE
14 years 2 months ago
RTQG: Real-Time Quorum-based Gossip Protocol for Unreliable Networks
We consider scheduling real-time tasks in the presence of message loss and Byzantine node failures in unreliable networks. We present scheduling algorithms called RTQG and RTQG-B....
Bo Zhang, Kai Han, Binoy Ravindran, E. Douglas Jen...
IPPS
2009
IEEE
14 years 2 months ago
Performance analysis of distributed intrusion detection protocols for mobile group communication systems
Under highly security vulnerable, resource restricted, and dynamically changing mobile ad hoc environments, it is critical to be able to maximize the system lifetime while boundin...
Jin-Hee Cho, Ing-Ray Chen
JCP
2007
122views more  JCP 2007»
13 years 7 months ago
Converting Group Key Agreement Protocol into Password-Based Setting - Case Study
Abstract— Converting a secure group key agreement protocol into password-based setting is not a trivial task. The security of a password-based scheme hinges on preventing diction...
Ratna Dutta
JOC
2008
86views more  JOC 2008»
13 years 7 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
CCS
2007
ACM
14 years 2 months ago
Robust group key agreement using short broadcasts
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik