Secure group communications using key graphs

By C. Wong, M. Gouda, S. Lam. TNET, 2000

860 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Sociology and Political Science

View Paper: https://www.semanticscholar.org/paper/cb516e2c5fe6b37a7ad9da55a2279a736ac0d815

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Adrian Perrig
2. Gene Tsudik
3. Yongdae Kim
4. Michael Waidner
5. Jean-Pierre Hubaux
6. Jaydip Sen
7. Srdjan Čapkun
8. Bülent Yener

In Sociology and Political Science

1. Adrian Perrig
2. Gene Tsudik
3. Yongdae Kim
4. Ran Canetti
5. Roger Colbeck

Citations in the corpus

• Key Agreement in Dynamic Peer Groups (2000, background): “In practice, group key agreement is typically done in a centralized manner [10], [11], [12]: one dedicated party (typically, a group leader) chooses the group key and distributes it to all group members.”
• Tree-based group key agreement (2004, methodology): “Similar to other tree-based key management schemes [e.g., Wallner et al. 1997; Wong et al. 2000; McGrew and Sherman n.d.] the key tree in TGDH is logical: Group members are leaves in a tree and internal nodes are logical.”