DISP: Practical, efficient, secure and fault-tolerant distributed data storage
ACM Transactions on Storage (TOS)
Stardust: tracking activity in a distributed storage system
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
How fast can a very robust read be?
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Efficient Updates in Highly Available Distributed Random Access Memory
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Design, implementation and evaluation of security in iSCSI-based network storage systems
Proceedings of the second ACM workshop on Storage security and survivability
Wait-free regular storage from Byzantine components
Information Processing Letters
Providing tunable consistency for a parallel file store
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
Ursa minor: versatile cluster-based storage
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Verifying distributed erasure-coded data
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Remote storage with byzantine servers
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
DepSpace: a byzantine fault-tolerant coordination service
Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008
POTSHARDS: secure long-term storage without encryption
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
Using utility to provision storage systems
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
Optimistic Erasure-Coded Distributed Storage
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Proceedings of the 4th ACM international workshop on Storage security and survivability
Scalable and efficient provable data possession
Proceedings of the 4th international conference on Security and privacy in communication netowrks
GRID codes: Strip-based erasure codes with high fault tolerance for storage systems
ACM Transactions on Storage (TOS)
Write Markers for Probabilistic Quorum Systems
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
On the Time-Complexity of Robust and Amnesic Storage
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Tiered fault tolerance for long-term integrity
FAST '09 Proccedings of the 7th conference on File and storage technologies
Low-latency access to robust amnesic storage
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
POTSHARDS—a secure, recoverable, long-term archival storage system
ACM Transactions on Storage (TOS)
Remote storage with byzantine servers
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
HAIL: a high-availability and integrity layer for cloud storage
Proceedings of the 16th ACM conference on Computer and communications security
Efficient Robust Storage Using Secret Tokens
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Maintaining and checking parity in highly available Scalable Distributed Data Structures
Journal of Systems and Software
A comprehensive reference architecture for trustworthy long-term archiving of sensitive data
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Survivable distributed storage with progressive decoding
INFOCOM'10 Proceedings of the 29th conference on Information communications
AONT-RS: blending security and performance in dispersed storage systems
FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
DepSky: dependable and secure storage in a cloud-of-clouds
Proceedings of the sixth conference on Computer systems
An efficient group-based secret sharing scheme
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Middleware for a re-configurable distributed archival store based on secret sharing
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
Byzantine clients rendered harmless
DISC'05 Proceedings of the 19th international conference on Distributed Computing
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
Consistency and fault tolerance for erasure-coded distributed storage systems
Proceedings of the fifth international workshop on Data-Intensive Distributed Computing Date
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Towards privacy enhanced limited image processing in the clouds
Proceedings of the 9th Middleware Doctoral Symposium of the 13th ACM/IFIP/USENIX International Middleware Conference
Analysis for REPERA: A Hybrid Data Protection Mechanism in Distributed Environment
International Journal of Cloud Applications and Computing
PoWerStore: proofs of writing for efficient and robust storage
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
DepSky: Dependable and Secure Storage in a Cloud-of-Clouds
ACM Transactions on Storage (TOS)
Privacy aware image template matching in clouds using ambient data
The Journal of Supercomputing
| Hi-index | 0.00 |
This paper describes a decentralized consistency protocolfor survivable storage that exploits local data versioningwithin each storage-node. Such versioning enables the protocolto efficiently provide linearizability and wait-freedomof read and write operations to erasure-coded data in asynchronousenvironments with Byzantine failures of clientsand servers. By exploiting versioning storage-nodes, theprotocol shifts most work to clients and allows highly optimisticoperation: reads occur in a single round-trip unlessclients observe concurrency or write failures. Measurementsof a storage system prototype using this protocolshow that it scales well with the number of failures tolerated,and its performance compares favorably with an efficientimplementation of Byzantine-tolerant state machine replication.