ACM Transactions on Programming Languages and Systems (TOPLAS)
Secure agreement protocols: reliable and atomic group multicast in rampart
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Fault-tolerant wait-free shared objects
Journal of the ACM (JACM)
A high-throughput secure reliable multicast protocol
Journal of Computer Security
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
An Architecture for Survivable Coordination in Large Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Efficient Byzantine-Tolerant Erasure-Coded Storage
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Byzantine disk paxos: optimal resilience with byzantine shared memory
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
How fast can a distributed atomic read be?
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed Computing
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Lucky Read/Write Access to Robust Atomic Storage
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock
IEEE Transactions on Dependable and Secure Computing
On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Fault-tolerant semifast implementations of atomic read/write registers
Journal of Parallel and Distributed Computing
On the Time-Complexity of Robust and Amnesic Storage
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Low-latency access to robust amnesic storage
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
Efficient Robust Storage Using Secret Tokens
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
The complexity of robust atomic storage
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.01 |
This paper studies the time complexity of reading unauthenticated data from a distributed storage made of a set of failure-prone base objects. More specifically, we consider the abstraction of a robust read/write storage that provides wait-free access to unauthenticated data over a set of base storage objects with t possible failures, out of which at most b are arbitrary and the rest are simple crash failures.We prove a 2 communication round-trip lower bound for reading from a safe storage that uses at most 2t+2b base objects, independently of the number or round-trips needed by the writer. We then prove the lower bound tight by exhibiting a regular storage that uses 2t+b+1 base objects (optimal resilience) and features 2 communication round-trips for both read and write operations.