skip to main content
research-article
Public Access

Efficient Dynamic Provable Possession of Remote Data via Update Trees

Published:19 February 2016Publication History
Skip Abstract Section

Abstract

The emergence and wide availability of remote storage service providers prompted work in the security community that allows clients to verify integrity and availability of the data that they outsourced to a not fully trusted remote storage server at a relatively low cost. Most recent solutions to this problem allow clients to read and update (i.e., insert, modify, or delete) stored data blocks while trying to lower the overhead associated with verifying the integrity of the stored data. In this work, we develop a novel scheme, performance of which favorably compares with the existing solutions. Our solution additionally enjoys a number of new features, such as a natural support for operations on ranges of blocks, revision control, and support for multiple user access to shared content. The performance guarantees that we achieve stem from a novel data structure called a balanced update tree and removing the need for interaction during update operations in addition to communicating the updates themselves.

References

  1. G. Adelson-Velskii and E. M. Landis. 1962. An algorithm for the organization of information. In Proceedings of the USSR Academy of Sciences. 263--266.Google ScholarGoogle Scholar
  2. A. Anagnostopoulos, M. Goodrich, and R. Tamassia. 2001. Persistent authenticated dictionaries and their applications. In International Conference on Information Security (ISC’01). 379--393. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song. 2007. Provable data possession at untrusted stores. In ACM Conference on Computer and Communications Security (CCS’07). 598--609. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. G. Ateniese, R. Di Pietro, L. Mancini, and G. Tsudik. 2008. Scalable and efficient provable data possession. In Security and Privacy in Communication Networks (SecureComm’08). 9:1--9:10. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. G. Ateniese, S. Kamara, and J. Katz. 2009. Proofs of storage from homomorphic identification protocols. In Advances in Cryptology -- ASIACRYPT. 319--333. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Bentley. 1979. Decomposable searching problems. Information Processing Letters 8, 5, 244--251.Google ScholarGoogle ScholarCross RefCross Ref
  7. K. Bowers, A. Juels, and A. Oprea. 2009a. HAIL: A high-availability and integrity layer for cloud storage. In ACM Conference on Computer and Communications Security (CCS’09). 187--198. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. K. Bowers, A. Juels, and A. Oprea. 2009b. Proofs of retrievability: Theory and implementation. In ACM Workshop on Cloud Computing Security (CCSW’09). 43--54. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. E. Chang and J. Xu. 2008. Remote integrity check with dishonest storage server. In ESORICS. 223--237. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. R. Curtmola, O. Khan, R. Burns, and G. Ateniese. 2008. MR. PDP: Multiple-replica provable data possession. In International Conference on Distributed Computing Systems (ICDCS’08). 411--420. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. 2000. Interval trees. In Computational Geometry (2nd ed.). Springer-Verlag, Chapter 10.1, 212--217.Google ScholarGoogle Scholar
  12. Y. Dodis, S. Dadhan, and D. Wichs. 2009. Proofs of retrievability via hardness amplification. In TCC. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. N. Dushyanth, D. Austin, and R. Antony. 2008. Write off-loading: Practical power management for enterprise storage. Transactions on Storage 4, 3, 10:1--10:23. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. Ellard, J. Ledlie, P. Malkani, and M. Seltzer. 2003. Passive NFS tracing of email and research workloads. In USENIX Conference on File and Storage Technologies (FAST’03). 15. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. C. Ellis and S. Gibbs. 1989. Concurrency control in groupware systems. In SIGMOD. 399--407. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. C. Erway, A. Kupcu, C. Papamanthou, and R. Tamassia. 2009. Dynamic provable data possession. In ACM Conference on Computer and Communications Security (CCS’09). 213--222. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. M. Goodrich, C. Papamanthou, R. Tamassia, and N. Triandopoulos. 2008. Athos: Efficient authentication of outsourced file systems. In International Conference on Information Security. 80--96. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. M. Goodrich, R. Tamassia, and A. Schwerin. 2001. Implementation of an authenticated dictionary with skip lists and commutative hashing. In DARPA Information Survivability Conference and Exposition.Google ScholarGoogle Scholar
  19. A. Heitzmann, B. Palazzi, C. Papamanthou, and R. Tamassia. 2008. Efficient integrity checking of untrusted network storage. In StorageSS. 43--54. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. IDC. 2008. IT Cloud Services User Survey, pt. 2: Top Benefits & Challenges. Retrieved January 9, 2016 from http://blogs.idc.com/ie/?p==210.Google ScholarGoogle Scholar
  21. A. Juels and B. Kaliski. 2007. PORs: Proofs of retrievability for large files. In CCS. 584--597. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. L. Lamport. 1978. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21, 558--565. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. J. Li, M. Krohn, D. Mazieres, and D. Shasha. 2004. Secure untrusted data repository (SUNDR). In USENIX Symposium on Operating Systems Design and Implementation (OSDI’04). 121--136. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. X. Liu, Y. Zhang, B. Wang, and J. Yan. 2013. Mona: Secure multi-owner data sharing for dynamic groups in the cloud. IEEE Transactions on Parallel and Distributed Systems 24, 6, 1182--1191. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Z. Mo, Y. Zhou, and S. Chen. 2012. A dynamic proof of retrievability (PoR) scheme with O(log n) complexity. In IEEE ICC Communication and Information Systems Security Symposium.Google ScholarGoogle Scholar
  26. A. Oprea and M. Reiter. 2007. Integrity checking in cryptographic file systems with constant trusted storage. In USENIX Security Symposium. 183--198. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. C. Papamanthou and R. Tamassia. 2007. Time and space efficient algorithms for two-party authenticated data structures. In International Conference on Information and Communications Security (ICICS’07). 1--15. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. R. Popa, J. Lorch, D. Molnar, H. Wang, and L. Zhuang. 2011. Enabling security in cloud storage SLAs with Cloudproof. In USENIX Annual Technical Conference. 355--368. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. W. Pugh. 1990. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM 33, 668--676. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. F. Sebe, J. Domingo-Ferrer, A. Martinez-Belleste, Y. Deswarte, and J.-J. Quisquater. 2008. Efficient remote data possession checking in critical information infrastructures. TKDE 20, 1034--1038. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. H. Shacham and B. Waters. 2008. Compact proofs of retrievability. In ASIACRYPT. 90--107. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. E. Stefanov, M. V. Dijk, A. Juels, and A. Oprea. 2012. Iris: A scalable cloud file system with efficient integrity checks. In Annual Computer Security Applications Conference (ACSAC). 229--238. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. B. Wang, B. Li, and H. Li. 2012a. Knox: Privacy-preserving auditing for shared data with large groups in the cloud. In International Conference on Applied Cryptography and Network Security (ACNS’12). 507--525. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. B. Wang, B. Li, and H. Li. 2012b. Oruta: Privacy-preserving public auditing for shared data in the cloud. In IEEE CLOUD. 295--302. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. B. Wang, B. Li, and H. Li. 2013. Public auditing for shared data with efficient user revocation in the cloud. In IEEE International Conference on Computer Communications (INFOCOM’13). 2904--2912.Google ScholarGoogle Scholar
  36. C. Wang, S. Chow, Q. Wang, K. Ren, and W. Lou. 2013. Privacy-preserving public auditing for secure cloud storage. IEEE Transactions on Computers 62, 2, 362--375. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. C. Wang, Q. Wang, K. Ren, and W. Lou. 2009b. Ensuring data storage security in cloud computing. In International Workshop on Quality of Service. 1--9.Google ScholarGoogle Scholar
  38. Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou. 2009a. Enabling public verifiability and data dynamics for storage security in cloud computing. In ESORICS. 355--370. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. L. Wei, H. Zhu, Z. Cao, W. Jia, and A. Vasilakos. 2010. SecCloud: Bringing secure storage and computation in cloud. In ICDCS Workshops. 52--61. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. K. Zeng. 2008. Publicly verifiable remote data integrity. In ICICS. 419--434. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. Q. Zheng and S. Xu. 2011. Fair and dynamic proofs of retrievability. In CODASPY. 237--248. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Efficient Dynamic Provable Possession of Remote Data via Update Trees

                  Recommendations

                  Comments

                  Login options

                  Check if you have access through your login credentials or your institution to get full access on this article.

                  Sign in

                  Full Access

                  PDF Format

                  View or Download as a PDF file.

                  PDF

                  eReader

                  View online with eReader.

                  eReader
                  About Cookies On This Site

                  We use cookies to ensure that we give you the best experience on our website.

                  Learn more

                  Got it!