Securing publish-subscribe overlay services with EventGuard
Authors:
Open Access
- 7 November 2005
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 289-298
Abstract
A publish-subscribe overlay service is a wide-area communication infrastructure that enables information dissemination across geographically scattered and potentially unlimited number of publishers and subscribers. A wide-area publish-subscribe (pub-sub) system is often implemented as a collection of spatially disparate nodes communicating on top of a peer to peer overlay network. Such a model presents many inherent benefits such as scalability and performance, as well as potential challenges such as: (i) confidentiality & integrity, (ii) authentication, and (iii) denial-of-service (DoS) attacks. In this paper we present EventGuard for securing pub-sub overlay services. EventGuard comprises of a suite of security guards that can be seamlessly plugged-into a content-based pub-sub system. EventGuard mechanisms aim at providing security guarantees while maintaining the system's overall simplicity, scalability and performance metrics. We present an implementation which shows that EventGuard is easily stackable on any content-based pub-sub core. Finally, our experimental results show that EventGuard can secure a pub-sub system with minimal performance penalty.Keywords
This publication has 9 references indexed in Scilit:
- TrustGuard2005
- PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic CommunitiesIEEE Transactions on Knowledge and Data Engineering, 2004
- A survey of key management for secure group communicationACM Computing Surveys, 2003
- US Secure Hash Algorithm 1 (SHA1)2001
- Design and evaluation of a wide-area event notification serviceACM Transactions on Computer Systems, 2001
- Efficient atomic broadcast using deterministic merge2000
- Matching events in a content-based subscription system1999
- The MD5 Message-Digest Algorithm1992
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985