Abstract
Publish/subscribe is a communication paradigm where loosely-coupled clients communicate in an asynchronous fashion. Publish/subscribe supports the flexible development of large-scale, event-driven and ubiquitous systems. Publish/subscribe is prevalent in a number of application domains such as social networking, distributed business processes and real-time mission-critical systems. Many publish/subscribe applications are sensitive to message loss and violation of privacy. To overcome such issues, we propose a novel method of using secret sharing and replication techniques. This is to reliably and confidentially deliver decryption keys along with encrypted publications even under the presence of several Byzantine brokers across publish/subscribe overlay networks. We also propose a framework for dynamically and strategically allocating broker replicas based on flexibly definable criteria for reliability and performance. Moreover, a thorough evaluation is done through a case study on social networks using the real trace of interactions among Facebook users.
Highlights
Publish/Subscribe is a communication paradigm where loosely-coupled clients communicate in an asynchronous fashion
We propose a framework for dynamically and strategically allocating broker replicas based on reliability and performance criteria that can be defined flexibly by pub/sub overlay administrators
We show that in the subsequent virtual node Vi+1, non-Byzantine brokers receive a sufficient number of secret shares to reconstruct S
Summary
Publish/Subscribe (in short pub/sub) is a communication paradigm where loosely-coupled clients communicate in an asynchronous fashion. Theorem 3 A non-authorized subscriber (SUB2) that is not entitled to the messages published by a publisher PUB cannot receive a sufficient number of secret shares from the brokers to reconstruct the original key S generated by PUB. There can be a situation where all the n blocks end up in the hands of Byzantine brokers at a certain virtual node This is still safe because the blocks are encrypted and can only be decrypted with the keys that are transferred securely through the secret share propagation method that we devised in the previous section. We affirmed that the end-to-end path length between the publishers and the subscribers affects the overhead of our scheme This can guide the administrator of pub/sub broker overlays to reduce the number of hops by consolidating the brokers along the publication delivery paths, so that the number of secret shares is reduced.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
