13 search results - page 1 / 3 » Fully Robust Tree-Diffie-Hellman Group Key Exchange |
CANS
2009
Springer
13 years 8 months ago
2009
Springer
We extend the well-known Tree-Diffie-Hellman technique used for the design of group key exchange (GKE) protocols with robustness, i.e. with resistance to faults resulting from poss...
CCS
2008
ACM
13 years 6 months ago
2008
ACM
When users run a group key exchange (GKE) protocol, they usually extract the key from some auxiliary (ephemeral) secret information generated during the execution. Strong corrupti...
PODC
2004
ACM
13 years 10 months ago
2004
ACM
Group key exchange protocols allow a group of servers communicating over an asynchronous network of point-to-point links to establish a common key, such that an adversary which fu...
IPTPS
2005
Springer
13 years 10 months ago
2005
Springer
— We propose here an analysis of a rich dataset which gives an exhaustive and dynamic view of the exchanges processed in a running eDonkey system. We focus on correlation in term...
EMMCVPR
2009
Springer
13 years 2 months ago
2009
Springer
Determining Euclidean transformations for the robust registration of noisy unstructured point sets is a key problem of model-based computer vision and numerous industrial applicati...