Secure message delivery in publish/subscribe networks using overlay multicast
by Paul Rabinovich, Robert Simon
International Journal of Security and Networks (IJSN), Vol. 2, No. 1/2, 2007

Abstract: This paper examines an approach to guarantee service integrity in insecure publish/subscribe systems using overlay multicast. The proposed mechanism constructs a delivery tree laid over both the underlying network and the predicate (subscription) graph. It uses message replication and voting to simulate a secure delivery tree in an insecure environment. We provide an algorithm to construct a minimum-cost delivery tree, analyse its performance, develop a formal model to estimate the cost of delivery of a single message and propose heuristics to lower the computational complexity of our basic algorithm.

Online publication date: Fri, 16-Mar-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Security and Networks (IJSN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com