Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Early-delivery atomic broadcast
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
VICTOR: an efficient RSA hardware implementation
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
CRYPTO '89 Proceedings on Advances in cryptology
A survey of hardware implementations of RSA (abstract)
CRYPTO '89 Proceedings on Advances in cryptology
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
Authentication in distributed systems: theory and practice
ACM Transactions on Computer Systems (TOCS)
Principal Features of the VOLTAN Family of Reliable Node Architectures for Distributed Systems
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Distributed fingerprints and secure information dispersal
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
The group membership problem in asynchronous systems
The group membership problem in asynchronous systems
Another method for attaining security against adaptively chosen ciphertext attacks
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
A security architecture for fault-tolerant systems
A security architecture for fault-tolerant systems
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Security Mechanisms in High-Level Network Protocols
ACM Computing Surveys (CSUR)
Digital signatures with RSA and other public-key cryptosystems
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
How to Make Replicated Data Secure
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
The MD4 Message Digest Algorithm
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Shared Generation of Authenticators and Signatures (Extended Abstract)
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Generalized Threshold Cryptosystems
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Integrating Security in a Group Oriented Distributed System
SP '92 Proceedings of the 1992 IEEE Symposium on Security and Privacy
Preventing Denial and Forgery of Causal Relationships in Distributed Systems
SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
A Secure Group Membership Protocol
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
Secure agreement protocols: reliable and atomic group multicast in rampart
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
A security architecture for fault-tolerant systems
ACM Transactions on Computer Systems (TOCS) - Special issue on computer architecture
A Secure Group Membership Protocol
IEEE Transactions on Software Engineering
Witness-based cryptographic program checking and robust function sharing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Access control and signatures via quorum secret sharing
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
The load and availability of Byzantine quorum systems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Access Control and Signatures via Quorum Secret Sharing
IEEE Transactions on Parallel and Distributed Systems
An authentication-combined access control scheme using a geometric approach in distributed systems
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Replica Determinism and Flexible Scheduling in Hard Real-Time Dependable Systems
IEEE Transactions on Computers
Key Agreement in Dynamic Peer Groups
IEEE Transactions on Parallel and Distributed Systems
Supporting internet-scale multi-agent systems
Data & Knowledge Engineering - DKE 40
Secure and Efficient Asynchronous Broadcast Protocols
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Distributing Trust on the Internet
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Programming with Live Distributed Objects
ECOOP '08 Proceedings of the 22nd European conference on Object-Oriented Programming
Minimal backups of cryptographic protocol runs
Proceedings of the 6th ACM workshop on Formal methods in security engineering
Fault-tolerant authentication services
International Journal of Computers and Applications
Efficient threshold RSA signatures with general moduli and no extra assumptions
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
State machine replication with byzantine faults
Replication
Distributing trusted third parties
ACM SIGACT News
| Hi-index | 0.01 |
We present a method for constructing replicated services that retain their availability and integrity despite several servers and clients being corrupted by an intruder, in addition to others failing benignly. We also address the issue of maintaining a causal order among client requests. We illustrate a security breach resulting from an intruder's ability to effect a violation of causality in the sequence of requests processed by the service and propose an approach to counter this attack. An important and novel feature of our techniques is that the client need not be able to identify or authenticate even a single server. Instead, the client is required to possess only a single public key for the service. We demonstrate the performance of our techniques with a service we have implemented using one of our protocols.