Limits...
Secret Forwarding of Events over Distributed Publish/Subscribe Overlay Network.

Yoon Y, Kim BH - PLoS ONE (2016)

Bottom Line: 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.

View Article: PubMed Central - PubMed

Affiliation: Department of Computer Engineering, Hongik University, Seoul, South Korea.

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.

No MeSH data available.


The architecture of the extended pub/sub broker for secret forwarding.
© Copyright Policy
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC4930217&req=5

pone.0158516.g006: The architecture of the extended pub/sub broker for secret forwarding.

Mentions: Before we articulate the re-deployment protocol, we describe the extended broker architecture of the reference pub/sub overlay implementation [20, 21]. As shown in Fig 6, each broker has a single input queue and multiple output queues. Output queues are grouped to be associated with each virtual node in the next hop. Each output queue is designated to a broker replica in the next-hop virtual node. A broker receives secret shares from the previous virtual node through its input queue. When a secret share from the previous hop gets dequeued from the input queue, the broker runs a topic-based matching in order to determine where the secret shares and publications should be forwarded to. The topic does not need to be encrypted as long as it does not reveal private information. However, if the topic has to be encrypted as well, then homomorphic matching techniques have to be used as introduced in [29], which is the subject for future work. Upon the detection of the next virtual node to forward the secret, a broker first splits the received secret share once again.


Secret Forwarding of Events over Distributed Publish/Subscribe Overlay Network.

Yoon Y, Kim BH - PLoS ONE (2016)

The architecture of the extended pub/sub broker for secret forwarding.
© Copyright Policy
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC4930217&req=5

pone.0158516.g006: The architecture of the extended pub/sub broker for secret forwarding.
Mentions: Before we articulate the re-deployment protocol, we describe the extended broker architecture of the reference pub/sub overlay implementation [20, 21]. As shown in Fig 6, each broker has a single input queue and multiple output queues. Output queues are grouped to be associated with each virtual node in the next hop. Each output queue is designated to a broker replica in the next-hop virtual node. A broker receives secret shares from the previous virtual node through its input queue. When a secret share from the previous hop gets dequeued from the input queue, the broker runs a topic-based matching in order to determine where the secret shares and publications should be forwarded to. The topic does not need to be encrypted as long as it does not reveal private information. However, if the topic has to be encrypted as well, then homomorphic matching techniques have to be used as introduced in [29], which is the subject for future work. Upon the detection of the next virtual node to forward the secret, a broker first splits the received secret share once again.

Bottom Line: 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.

View Article: PubMed Central - PubMed

Affiliation: Department of Computer Engineering, Hongik University, Seoul, South Korea.

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.

No MeSH data available.