The performance of group Diffie- Hellman paradigms

Proceedings of the International Conference on Wireless Networks, ICWN'04

Volumn 1, Issue , 2004, Pages 88-94

  Hagzan, Kieran S ^a   Bischof, Hans Peter ^a  

^a ROCHESTER INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD-HOC NETWORKS; HGDH ALGORITHMS; HYPERCUBIC DIFFIE-HELLMAN; POINT-TO-POINT (PTP);

ALGORITHMS; BROADCASTING; COMPUTATIONAL COMPLEXITY; LINEARIZATION; PROBABILITY; SECURITY OF DATA; TOPOLOGY; WIRELESS TELECOMMUNICATION SYSTEMS;

NETWORK PROTOCOLS;

EID: 12744268208     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. W. Diffie and M.E. Hellman, "New Directions in Cryptography", IEEE Transactions on Information Theory 22 (1976), 644- 654.
2. Y. Amir, Y. Kim, C. Nita- Rotaru, and G. Tsudik, "On the Performance of Group Key- Agreement Protocols", Proceedings of the 22nd IEEE International Conference on Distributed Computing Systems, (Viena, Austria), June 2002. An extended version is available as Tech. Rep., CNDS 2001 - 5.
3. Y. Kim, A. Perrig, and G. Tsudik, "Tree- Based Group Key Agreement," Cryptology ePrint Archive, Report 2002/009, 2002.
4. C. Becker and Wille, U., "Communication Complexity of Group Key Distribution", In Proceedings of the ACM-CCS'98 (November 1998) ACM Press, 1-6