Sciweavers

284 search results - page 2 / 57
» Distributed Agreement with Optimal Communication Complexity
Sort
View
ACNS
2003
Springer
156views Cryptology» more  ACNS 2003»
13 years 8 months ago
An Efficient Tree-Based Group Key Agreement Using Bilinear Map
Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative application. One of the important challeng...
Sangwon Lee, Yongdae Kim, Kwangjo Kim, DaeHyun Ryu
ASIACRYPT
2000
Springer
13 years 8 months ago
Round-Efficient Conference Key Agreement Protocols with Provable Security
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. ...
Wen-Guey Tzeng, Zhi-Jia Tzeng
ATAL
2007
Springer
13 years 8 months ago
A unified framework for multi-agent agreement
Multi-Agent Agreement problems (MAP) - the ability of a population of agents to search out and converge on a common state - are central issues in many multi-agent settings, from d...
Kiran Lakkaraju, Les Gasser
CCS
2007
ACM
13 years 11 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
ICC
2007
IEEE
13 years 11 months ago
Optimal Pilot Symbol Distribution for Efficient and Low-Complexity Doppler-Shift and Doppler-Rate Estimation in Bursty Transmiss
— Due to relative motion between the transmitter and the receiver, the carrier of the received signal in digital burstmode transmission can be affected by Doppler distortion. Thi...
Luca Giugno, Francesca Zanier, Marco Luise