Secure, Dependable, and High Performance Cloud Storage

There have been works considering protocols for accessing partitioned data. Most of these works assume the local cluster based environment and their designs target atomic semantics. However, when considering widely distributed cloud storage systems, these existing protocols may not scale well. In this paper, we analyze the requirements of access protocols for storage systems based on data partitioning schemes in widely distributed cloud environments. We consider the regular semantics instead of atomic semantics to improve access efficiency. Then, we develop an access protocol following the requirements to achieve correct and efficient data accesses. Various protocols are compared experimentally and the results show that our protocol yields much better performance than the existing ones.

[1]  Ramesh Govindan,et al.  An empirical evaluation of internet latency expansion , 2005, CCRV.

[2]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[3]  Farokh B. Bastani,et al.  Evaluating Dependable Distributed Storage Systems , 2007, PDPTA.

[4]  Hugo Krawczyk,et al.  Secret Sharing Made Short , 1994, CRYPTO.

[5]  Marco Vieira,et al.  Detection of malicious transactions in DBMS , 2005, 11th Pacific Rim International Symposium on Dependable Computing (PRDC'05).

[6]  Maurice Herlihy,et al.  Obstruction-free synchronization: double-ended queues as an example , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[7]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

[8]  H. Venkateswaran,et al.  Responsive Security for Stored Data , 2003, IEEE Trans. Parallel Distributed Syst..

[9]  Jay J. Wylie,et al.  A Read/Write Protocol Family for Versatile Storage Infrastructures (CMU-PDL-05-108) , 2005 .

[10]  Yi Hu,et al.  Identification of malicious transactions in database systems , 2003, Seventh International Database Engineering and Applications Symposium, 2003. Proceedings..

[11]  Michael K. Reiter,et al.  Efficient Byzantine-tolerant erasure-coded storage , 2004, International Conference on Dependable Systems and Networks, 2004.

[12]  Zheng Zhang,et al.  Reperasure: replication protocol using erasure-code in peer-to-peer storage network , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..

[13]  Michael K. Reiter,et al.  Lazy verification in fault-tolerant distributed storage systems , 2005, 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05).

[14]  Li Gong.  Securely replicating authentication services , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.

[15]  R. Rodrigues,et al.  Full-Information Lookups for Peer-to-Peer Overlays , 2008, IEEE Transactions on Parallel and Distributed Systems.

[16]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[17]  Anjali Gupta,et al.  One Hop Lookups for Peer-to-Peer Overlays , 2003, HotOS.

[18]  Stefano Tessaro,et al.  Optimal Resilience for Erasure-Coded Byzantine Distributed Storage , 2005, International Conference on Dependable Systems and Networks (DSN'06).

[19]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[20]  Leslie Lamport,et al.  On interprocess communication , 1986, Distributed Computing.

[21]  Leslie Lamport,et al.  Interprocess Communication , 2020, Practical System Programming with C.

[22]  Michael K. Reiter,et al.  Low-overhead byzantine fault-tolerant storage , 2007, SOSP.