Venus: Verification for untrusted cloud storage

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2010, Pages 19-29

  Shraer, Alexander ^a   Cachin, Christian ^b   Cidon, Asaf ^a   Keidar, Idit ^b   Michalevsky, Yan ^a   Shaket, Dani ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b IBM RESEARCH ZURICH   (Switzerland)

Author keywords

Cloud storage; Forking semantics; Hashing; Integrity

Indexed keywords

CLOUD STORAGES; DATA INTEGRITY; FORKING SEMANTICS; HASHING; INTEGRITY; OBJECT STORE; STORAGE OPERATIONS; STORAGE SERVICES; TRUSTED COMPONENTS; USER INTERACTION;

COMPUTER SYSTEMS;

SEMANTICS;

EID: 78650085550     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1866835.1866841     Document Type: Conference Paper

References (26)

1. G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song. Provable data possession at untrusted stores. In Proc. 14th ACM Conference on Computer and Communications Security (CCS), pages 598-609, 2007.
2. M. Blum, W. Evans, P. Gemmell, S. Kannan, and M. Naor. Checking the correctness of memories. Algorithmica, 12:225-244, 1994.
3. K. D. Bowers, A. Juels, and A. Oprea. HAIL: A high-availability and integrity layer for cloud storage. In Proc. 16th ACM Conference on Computer and Communications Security (CCS), pages 187-198, 2009.
4. C. Cachin and M. Geisler. Integrity protection for revision control. In M. Abdalla and D. Pointcheval, editors, Proc. Applied Cryptography and Network Security (ACNS), volume 5536 of Lecture Notes in Computer Science, pages 382-399, 2009.
5. C. Cachin, I. Keidar, and A. Shraer. Fail-aware untrusted storage. In Proc. International Conference on Dependable Systems and Networks (DSN-DCCS), pages 494-503, 2009.
6. C. Cachin, I. Keidar, and A. Shraer. Fork sequential consistency is blocking. Inf. Process. Lett., 109(7):360-364, 2009.
7. C. Cachin, A. Shelat, and A. Shraer. Efficient fork-linearizable access to untrusted shared memory. In Proc. 26th ACM Symposium on Principles of Distributed Computing (PODC), pages 129-138, 2007.
8. B.-G. Chun, P. Maniatis, S. Shenker, and J. Kubiatowicz. Attested append-only memory: Making adversaries stick to their word. In Proc. 21st ACM Symposium on Operating System Principles (SOSP), pages 189-204, 2007.
9. E.-J. Goh, H. Shacham, N. Modadugu, and D. Boneh. SiRiUS: Securing remote untrusted storage. In Proc. Network and Distributed Systems Security Symposium (NDSS), 2003.
10. M. T. Goodrich, C. Papamanthou, R. Tamassia, and N. Triandopoulos. Athos: Efficient authentication of outsourced file systems. In T.-C. Wu et al., editors, Proc. 11th Information Security Conference (ISC), volume 5222 of Lecture Notes in Computer Science, pages 80-96, 2008.
11. A. Heitzmann, B. Palazzi, C. Papamanthou, and R. Tamassia. Efficient integrity checking of untrusted network storage. In Proc. Workshop on Storage Security and Survivability (StorageSS), pages 43-54, 2008.
12. J. Hendricks, G. R. Ganger, and M. K. Reiter. Low-overhead Byzantine fault-tolerant storage. In SOSP, pages 73-86, 2007.
13. P. W. Hutto and M. Ahamad. Slow memory: Weakening consistency to enchance concurrency in distributed shared memories. In Proc. 10th Intl. Conference on Distributed Computing Systems (ICDCS), pages 302-309, 1990.
14. A. Juels and B. S. Kaliski. PORs: Proofs of retrievability for large files. In Proc. 14th ACM Conference on Computer and Communications Security (CCS), pages 584-597, 2007.
15. M. Kallahalla, E. Riedel, R. Swaminathan, Q. Wang, and K. Fu. Plutus: Scalable secure file sharing on untrusted storage. In Proc. 2nd USENIX Conference on File and Storage Technologies (FAST), 2003.
16. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7):558-565, 1978.
17. J. Li, M. Krohn, D. Mazières, and D. Shasha. Secure untrusted data repository (SUNDR). In Proc. 6th Symp. Operating Systems Design and Implementation (OSDI), pages 121-136, 2004.
18. U. Maheshwari, R. Vingralek, and W. Shapiro. How to build a trusted database system on untrusted storage. In Proc. 4th Symp. Operating Systems Design and Implementation (OSDI), pages 135-150, 2000.
19. M. Majuntke, D. Dobre, M. Serafini, and N. Suri. Abortable fork-linearizable storage. In T. F. Abdelzaher, M. Raynal, and N. Santoro, editors, Proc. 13th Conference on Principles of Distributed Systems (OPODIS), volume 5923 of Lecture Notes in Computer Science, pages 255-269, 2009.
20. D. Mazières and D. Shasha. Building secure file systems out of Byzantine storage. In Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC), pages 108-117, 2002.
21. A. Milani. Causal consistency in static and dynamic distributed systems. PhD Thesis, "La Sapienza" Universitá di Roma, 2006.
22. M. Serafini, D. Dobre, M. Majuntke, P. Bokor, and N. Suri. Eventually linearizable shared objects. In Proc. 29th ACM Symposium on Principles of Distributed Computing (PODC), pages 95-104, 2010.
23. D. B. Terry, M. Theimer, K. Petersen, A. J. Demers, M. Spreitzer, and C. Hauser. Managing update conflicts in Bayou, a weakly connected replicated storage system. In Proc. 15th ACM Symposium on Operating System Principles (SOSP), pages 172-182, 1995.
24. P. Williams, R. Sion, and D. Shasha. The blind stone tablet: Outsourcing durability to untrusted parties. In Proc. Network and Distributed Systems Security Symposium (NDSS), 2009.
25. J. Yang, H. Wang, N. Gu, Y. Liu, C. Wang, and Q. Zhang. Lock-free consistency control for Web 2.0 applications. In Proc. 17th Intl. Conference on World Wide Web (WWW), pages 725-734, 2008.
26. A. R. Yumerefendi and J. S. Chase. Strong accountability for network storage. ACM Transactions on Storage, 3(3), 2007.