• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Secure Group Communications Using Key Graphs (1998)

Cached

  • Download as a PDF

Download Links

  • [www.cs.wisc.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [cosmos.kaist.ac.kr]
  • [ftp.cs.utexas.edu]
  • [webspace.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [cs.uccs.edu]
  • [bbcr.uwaterloo.ca]
  • [www.ece.cmu.edu]
  • [cs.baylor.edu]
  • [cs.uccs.edu]
  • [cs.baylor.edu]
  • [cs.ecs.baylor.edu]
  • [neuralnoise.com]
  • [users.ece.cmu.edu]
  • [vc.cs.nthu.edu.tw]
  • [cs.uccs.edu]
  • [users.ece.cmu.edu]
  • [cs.ecs.baylor.edu]
  • [www.leonsoftsolutions.com]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Chung Kei Wong , Mohamed Gouda , Simon S. Lam
Venue:SIGCOMM '98
Citations:554 - 17 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Wong98securegroup,
    author = {Chung Kei Wong and Mohamed Gouda and Simon S. Lam},
    title = {Secure Group Communications Using Key Graphs},
    institution = {SIGCOMM '98},
    year = {1998}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

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...

Keyphrases

key graph    secure group    group communication    interactive simulation    user-key relation    authorized receiver    packet delivery    rekey message    group member    join leave    special class    large number    scalability problem    collaborative work    key management    critical networking issue    real-time information service    novel solution    authorized sender   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University