ACM Home Page
Please provide us with feedback. Feedback
Secure group communications using key graphs
Full text PdfPdf (1.68 MB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication table of contents
Vancouver, British Columbia, Canada
Pages: 68 - 79  
Year of Publication: 1998
ISBN:1-58113-003-1
Also published in ...
Authors
Chung Kei Wong  Department of Computer Sciences, University of Texas at Austin, Austin, TX
Mohamed Gouda  Department of Computer Sciences, University of Texas at Austin, Austin, TX
Simon S. Lam  Department of Computer Sciences, University of Texas at Austin, Austin, TX
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 58,   Citation Count: 73
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/285237.285260
What is a DOI?

ABSTRACT

Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group communications model, i.e., they require packet delivery from one or more authorized senders to a very large number of authorized receivers. As a result, securing group communications (i.e., providing confidentiality, integrity, and authenticity of messages delivered between group members) will become a critical networking issue.In this paper, we present a novel solution to the scalability problem of group/multicast key management. We formalize the notion of a secure group as a triple (U,K,R) where U denotes a set of users, K a set of keys held by the users, and R a user-key relation. We then introduce key graphs to specify secure groups. For a special class of key graphs, we present three strategies for securely distributing rekey messages after a join/leave, and specify protocols for joining and leaving a secure group. The rekeying strategies and join/leave protocols are implemented in a prototype group key server we have built. We present measurement results from experiments and discuss performance comparisons. We show that our group key management service, using any of the three rekeying strategies, is scalable to large groups with frequent joins and leaves. In particular, the average measured processing time per join/leave increases linearly with the logarithm of group size.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Tony Ballardie. Scalable Multicast Key Distribution, RFC 19~9, May 1996.
 
2
 
3
Shimshon Berkovits. How to Broadcast a Secret. In D.W. Davies, editor, Advances in cryptology, EURO- CRYPT '91, volume 547 of Lecture Notes in Computer Science, pages 535-541. Springer Verlag, 1991.
 
4
 
5
6
 
7
 
8
Li Gong. Enclaves: Enabling Secure Collaboration over the Internet. IEEE Journal on Selected Areas in Communications, pages 567-575, April 1997.
 
9
H. Harney and C. Muckenhirn. Group Key Management Protocol {CKMP) Architecture, RFC 209J, July 1997.
 
10
H. Harney and C. Muckenhirn. Croup Key Management Protocol (GKMP) Specification, RFC 2093, July 1997.
 
11
J. B. Lacy, D. P. Mitchell, and W. M. Schell. CryptoLib: cryptography in software. In Proceedings of USENIX: .~th UNIX Security Symposium, October 1993.
 
12
Simon S. Lain and Chung Kei Wong. Keystone: A Group Key Management Service. Work in progress, Department of Computer Sciences, The University of Texas at Austin.
 
13
 
14
15
 
16
B. Clifford Neuman. Proxy-Based Authorization and Accounting for Distributed Systems. In Proceedings of 13th International Conference on Distributed Computing Systems, pages 283-291, May 1993.
 
17
Jennifer G. Steiner, Clifford Neuman, and Jeffrey I. Schiller. Kerberos: An Authentication Service for Open Network Systems. In USENIX Winter Conference, pages 191-202, February 1988.
 
18
 
19
J.J. Tardo and K. Alagappan. SPX: Global authentication using public key certificates. In Proceedings of 12th IEEE Symposium on Research in Security and Privacy, pages 232-244, May 1991.
 
20
Debby M. Wallner, Eric J. Harder, and Ryan C. Agee. Key Management for Multicast: Issues and Architectures. Working draft, National Security Agency, July 1997.
 
21
 
22
Thomas Y.C. Woo, Raghuram Bindignavle, Shaowen Su, and Simon S. Lam. SNP: An interface for secure network programming. In Proceedings of USENIX'9.~ Summer Technical Conference, June 1994.
 
23
Thomas Y.C. Woo and Simon S. Lain. Designing a Distributed Authorization Service. In Proceedings IEEE INFOCOM '98, San Francisco, March 1998.

CITED BY  74

Collaborative Colleagues:
Chung Kei Wong: colleagues
Mohamed Gouda: colleagues
Simon S. Lam: colleagues