Secure event dissemination in publish-subscribe networks

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2007, Pages

  Srivatsa, Mudhakar ^a   Liu, Ling ^a  

^a Georgia Institute of Technology

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; NETWORK ROUTING; SCALABILITY; SECURITY OF DATA;

SCALABLE KEY MANAGEMENT; SUBSCRIBE NETWORKS; UNAUTHORIZED SUBSCRIBERS;

INFORMATION DISSEMINATION;

EID: 34848864560     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2007.136     Document Type: Conference Paper

References (20)

1. Scalable access control in content-based publish-subscribe systems. Technical Report GIT-CERCS-06-05, Georgia Institute of Technology, 2006.
2. M. Aguilera, R. Strom, D. Sturman, M. Astley, and T. Chandra. Matching events in a content-based subscription system. In Proceedings of the 18th ACM PODC, 1999.
3. M. Atallah, K. Frikken, and M. Blanton. Dynamic and efficient key management for access hierarchies. In Proceedings of ACM CCS, 2005.
4. G. Banavar, T. Chandra, B. Mukherjee, and J. Nagarajarao. An efficient multicast protocol for content-based publish subscribe systems. In Proceedings of the 19th ICDCS, 1999.
5. R. Canetti, J. Garay, G. Itkis, and D. Micciancio. Multicast security: A taxonomy and some efficient constructions. In Proceedings of the IEEE INFOCOM, Vol. 2, 708-716, 1999.
6. A. Carzaniga, D. S. Rosenblum, and A. L. Wolf. Design and evaluation of a wide-area event notification service. In ACM Transactions on Computer System, 19(3):332-383, 2001.
7. A. K. Datta, M. Gradinariu, M. Raynal, and G. Simon. Anonymous publish/subscribe in P2P networks. In Proceedings of IPDPS, 2003.
8. D. Eastlake and P. Jones. US secure hash algorithm I. http://www.ietf.org/rfc/rfc3174.txt, 2001.
9. H.Krawczyk, M. Bellare, and R. Canetti. HMAC: Keyed-hashing for message authentication. http://www.faqs.org/rfcs/rfc2104.html.
10. L. Opyrchal and A. Prakash. Secure distribution of events in content-based publish subscribe system. In Proceedings of the 10th USENIX Security Symposium, 2001.
11. A. Perrig, D. Song, and J. D. Tygar. ELK: A new protocol for efficient large group key distribution. In Proceedings of IEEE Symposium on Security and Privacy, 2001.
12. S. R. Qin Lv and S. Shenker. Can heterogeneity make gnutella scalable? In Proceedings of the first International Workshop on Peer-to-Peer Systems, 2002.
13. S. Rafaeli and D. Hutchison. A survey of key management for secure group communication. In Journal of the ACM Computing Surveys, Vol 35, Issue 3, 2003.
14. R. Rivest. The MD5 message-digest algorithm. http://www.ietf.org/rfc/ rfc1321.txt, 1992.
15. M. Srivatsa and L. Liu. Securing publish-subscribe overlay services using eventguard. In Proceedings of ACM CCS, 2005.
16. D. Wallner, E. Harder, and R. Agee. Key management for multicast: Issues and architectures. In RFC 2627, 1999.
17. C. Wang, A. Carzaniga, D. Evans, and A. L. Wolf. Security issues and requirements for internet-scale publish-subscribe systems. In Proceedings of the 35th Hawaii International Conference on System Sciences (HICSS-35), 2002.
18. C. K. Wong, M. G. Gouda, and S. S. Lam. Secure group communications using key graphs. In IEEE/ACM Transactions on Networking: 8, 1(Feb), 16-30, 2000.
19. Y. R. Yang, X. S. Li, X. B. Zhang, and S. S. Lam. Reliable group rekeying: A performance analysis. In Proceedings of ACM SIGCOMM, 2001.
20. E. W. Zegura, K. Calvert, and S. Bhattacharjee. How to model an internetwork. In Proceedings of IEEE Infocom, 1996.