Secure agreement protocols: reliable and atomic group multicast in rampart
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
The Totem single-ring ordering and membership protocol
ACM Transactions on Computer Systems (TOCS)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Totem: a fault-tolerant multicast group communication system
Communications of the ACM
A Secure Group Membership Protocol
IEEE Transactions on Software Engineering
The Totem multiple-ring ordering and topology maintenance protocol
ACM Transactions on Computer Systems (TOCS)
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Byzantine-resistant total ordering algorithms
Information and Computation
A high-throughput secure reliable multicast protocol
Journal of Computer Security
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
The MD4 Message Digest Algorithm
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
The Rampart Toolkit for Building High-Integrity Services
Selected Papers from the International Workshop on Theory and Practice in Distributed Systems
Unreliable Intrusion Detection in Distributed Computations
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
The SecureRing Protocols for Securing Group Communication
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences - Volume 3
Secure and Scalable Replication in Phalanx
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Secure Reliable Multicast Protocols in a WAN
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Providing Support for Survivable CORBA Applications with the Immune System
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Survivable distributed systems: design and implementation (common object request broker architecture)
Fault-scalable Byzantine fault-tolerant services
Proceedings of the twentieth ACM symposium on Operating systems principles
Worm-IT - A wormhole-based intrusion-tolerant group communication system
Journal of Systems and Software
Specifying and using intrusion masking models to process distributed operations
Journal of Computer Security
Multicast survivability in hierarchical broadcast networks
WSEAS TRANSACTIONS on COMMUNICATIONS
Intrusion-tolerant architectures: concepts and design
Architecting dependable systems
Beyond one-third faulty replicas in byzantine fault tolerant systems
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Design and implementation of survivable network systems
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
State machine replication with byzantine faults
Replication
| Hi-index | 0.00 |
Secure reliable group communication protocols can facilitate the development of survivable distributed systems that are able to remain correct and reliable despite intrusions that cause some nodes to behave in an arbitrary or malicious manner. However, the development of such protocols is itself difficult, and prior systems have exhibited high overheads, primarily due to the cost of digital signatures. The SecureRing group communication system provides secure, reliable, totally-ordered message delivery and group membership services despite the malicious corruption of a constant fraction of the processors within the system. The network is assumed not to partition, and persistent communication faults are handled as processor faults. The SecureRing message delivery protocol makes use of message digests in a signed token to allow a single digital signature to cover multiple messages, and to avoid the need for multiple rounds of message exchange in normal operation. While these techniques mean that messages are not authenticated in real time, they enable the SecureRing protocols to achieve high throughput and reasonable latency.