How to share a secret with cheaters
Journal of Cryptology
ACM Transactions on Programming Languages and Systems (TOPLAS)
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Byzantine clients rendered harmless
DISC'05 Proceedings of the 19th international conference on Distributed Computing
How to Solve Consensus in the Smallest Window of Synchrony
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Remote storage with byzantine servers
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Efficient Robust Storage Using Secret Tokens
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
The complexity of robust atomic storage
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Multi-writer regular registers in dynamic distributed systems with byzantine failures
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
An algorithm for implementing BFT registers in distributed systems with bounded churn
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Fast Access to Distributed Atomic Memory
SIAM Journal on Computing
PoWerStore: proofs of writing for efficient and robust storage
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
A protocol for implementing byzantine storage in churn-prone distributed systems
Theoretical Computer Science
Hi-index | 0.00 |
We present the first optimally resilient, bounded, wait-free implementation of a distributed atomic register, tolerating Byzantine readers and (up to one-third of) Byzantine servers, without the use of unproven cryptographic primitives or requiring communication among servers. Unlike previous (non-optimal) solutions, the sizes of messages sent to writers depend only on the actual number of active readers and not on the total number of readers in the system. With a novel use of secret sharing techniques combined with write back throttling we present the first solution to tolerate Byzantine readers information theoretically, without the use of cryptographic techniques based on unproven numbertheoretic assumptions.