Reliable broadcast protocols

Chang, Jo-Mei; Maxemchuk, Nicholas F.

doi:10.1145/989.357400

Cited by 564 publications

(206 citation statements)

References 2 publications

Supporting

Mentioning

201

Contrasting

Unclassified

Order By: Relevance

“…For a small network with infrequent rekey messages, a user could save all unintelligible messages and retry each one whenever a new rekey message arrives, but this approach is obviously impractical if rekey messages are frequent. Another approach would be to implement a scheme to provide order-preserving broadcast on top of the non-order-preserving network, such as ABCAST [1]. Unfortunately, such schemes Impose substantial overhead and hinder scalability to large networks.…”

Section: Resultsmentioning

confidence: 99%

Model-Checking a Secure Group Communication Protocol: A Case Study

Shi

et al. 1999

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Abstract:With the explosive growth of the Internet and the distributed applications it supports, there is a pressing need for secure group communications -the ability of a group of agents to communicate securely with each other while allowing members to join or leave the group. Prompted by the success of other researchers in applying finite-state model-checking tools to the verification of small security protocols, we decided to attempt a larger security protocol: a recently published protocol for secure group communication. Not surprisingly, creating an ad hoc abstract model suitable for model-checking required cleverness, and state explosion was always a threat. Nevertheless, with minimal effort, the model checking tool discovered two flaws in the protocol, one of which has not been reported previously. We conclude our paper with a discussion of possible fixes to the protocol, as well as suggested verification tool improvements that would have simplified our task.

show abstract

Section: Resultsmentioning

confidence: 99%

Model-Checking a Secure Group Communication Protocol: A Case Study

Shi

et al. 1999

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

show abstract

“…Continuing the synchronous broadcast example let us assume that it is implemented as a reliable broadcast protocol on the lines of the protocol in [2] . Then in order to validate our assumptions on the information flow we need to construct a SAID description of the broadcast protocol and validate the sub-policies on the system in the same way as we did for the higher level system that uses the broadcast bus.…”

Section: Discussionmentioning

confidence: 99%

Enforcing Distributed Information Flow Policies Architecturally: The SAID Approach

Ray

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Architectural security of a distributed system is best considered at design time rather than further down the software life cycle where it may become very expensive to make even minor modifications to the software architecture. In this paper we take Architectural Interaction Diagrams (AID) [9,8], an architecture description framework with an unique ability to encode communication efficiently and augment actions of AID components with security levels to produce SAID. This new architecture description language enables the designer to impose information flow restriction policies on system communications at design time which in turn allows a reduction of the information flow analysis problem for distributed systems to the simpler problem of information flow analysis of individual components of the distributed system.

show abstract

“…In sequencer-based approaches, typically one node is elected as a sequencer and is responsible for ordering messages [13,14,15]. More than one sequencer can be present, but only one will be active or relevant at a time [16,17].…”

Section: Related Workmentioning

confidence: 99%

Decentralized Message Ordering for Publish/Subscribe Systems

Lumezanu

Spring

Bhattacharjee

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We describe a method to order messages across groups in a publish/subscribe system without centralized control or large vector timestamps. We show that our scheme is practical-little state is required; that it is scalable-the maximum message load is limited by receivers; and that it performs well-the paths messages traverse to be ordered are not made much longer than necessary. Our insight is that only messages to groups that overlap in membership can be observed to arrive out of order: sequencing messages to these groups is sufficient to provide a consistent order, and when publishers subscribe to the groups to which they send, this message order is a causal order.

show abstract

Reliable broadcast protocols

Cited by 564 publications

References 2 publications

Model-Checking a Secure Group Communication Protocol: A Case Study

Model-Checking a Secure Group Communication Protocol: A Case Study

Enforcing Distributed Information Flow Policies Architecturally: The SAID Approach

Decentralized Message Ordering for Publish/Subscribe Systems

Contact Info

Product

Resources

About