Verifying distributed erasure-coded data
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Low-overhead byzantine fault-tolerant storage
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Pors: proofs of retrievability for large files
Proceedings of the 14th ACM conference on Computer and communications security
DepSpace: a byzantine fault-tolerant coordination service
Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008
HAIL: a high-availability and integrity layer for cloud storage
Proceedings of the 16th ACM conference on Computer and communications security
Optimal resilience for erasure-coded byzantine distributed storage
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Asynchronous verifiable information dispersal
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.00 |
Information dispersal addresses the question of storing a ?le by distributing it among a set of servers in a storageef ?cient way. We introduce the problem of veri?able information dispersal in an asynchronous network, where up to one third of the servers as well as an arbitrary number of clients might exhibit Byzantine faults. Veri?ability ensures that the stored information is consistent despite such faults. We present a storage- and communication-ef?cient scheme for asynchronous veri?able information dispersal that achieves an asymptotically optimal storage blow-up. Additionally, we show how to guarantee the secrecy of the stored data with respect to an adversary that may mount adaptive attacks. Our technique also yields a new protocol for asynchronous reliable broadcast that improves the communication complexity by an order of magnitude on large inputs.