Verifying Randomized Byzantine Agreement
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
CODEX: A Robust and Secure Secret Distribution System
IEEE Transactions on Dependable and Secure Computing
APSS: proactive secret sharing in asynchronous systems
ACM Transactions on Information and System Security (TISSEC)
Implementing Trustworthy Services Using Replicated State Machines
IEEE Security and Privacy
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
INSENS: Intrusion-tolerant routing for wireless sensor networks
Computer Communications
Using non-deterministic finite automaton to research intrusion tolerant system
ASID'09 Proceedings of the 3rd international conference on Anti-Counterfeiting, security, and identification in communication
Security in business process engineering
BPM'03 Proceedings of the 2003 international conference on Business process management
Seeing through mist given a small fraction of an RSA private key
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Intrusion-tolerant architectures: concepts and design
Architecting dependable systems
Intrusion-tolerant fine-grained authorization for Internet applications
Journal of Systems Architecture: the EUROMICRO Journal
Beyond one-third faulty replicas in byzantine fault tolerant systems
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Using diversity in cloud-based deployment environment to avoid intrusions
SERENE'11 Proceedings of the Third international conference on Software engineering for resilient systems
On consistency of encrypted files
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Behavioral distance measurement using hidden markov models
RAID'06 Proceedings of the 9th international conference on Recent Advances in Intrusion Detection
DSO: dependable signing overlay
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
State machine replication with byzantine faults
Replication
Towards practical communication in Byzantine-resistant DHTs
IEEE/ACM Transactions on Networking (TON)
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
This paper describes a Secure INtrusion-Tolerant Replication Architecture 1 (SINTRA) for coordination in asynchronous networks subject to Byzantine faults. SINTRA supplies a number of group communication primitives, such as binary and multi-valued Byzantine agreement, reliable and consistent broadcast, and an atomic broadcast channel. Atomic broadcast immediately provides secure state-machine replication. The protocols are designed for an asynchronous wide-area network, such as the Internet, where messages may be delayed indefinitely, the servers do not have access to a common clock, and up to one thirdof the servers may fail in potentially malicious ways. Security is achieved through the use of threshold public-key cryptography, in particular through a cryptographic common coin based on the Diffie-Hellman problem that underlies the randomized protocols in SINTRA. The implementation of SINTRA in Java is described and timing measurements are given for a test-bed of servers distributed over three continents. They show that extensive use of public-key cryptography does not impose a large overhead for secure coordination in wide-area networks.