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.
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- G. Ateniese, S. Kamara, and J. Katz. 2009. Proofs of storage from homomorphic identification protocols. In Advances in Cryptology -- ASIACRYPT. 319--333. Google Scholar
Digital Library
- J. Bentley. 1979. Decomposable searching problems. Information Processing Letters 8, 5, 244--251.Google Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- E. Chang and J. Xu. 2008. Remote integrity check with dishonest storage server. In ESORICS. 223--237. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- Y. Dodis, S. Dadhan, and D. Wichs. 2009. Proofs of retrievability via hardness amplification. In TCC. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- C. Ellis and S. Gibbs. 1989. Concurrency control in groupware systems. In SIGMOD. 399--407. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- A. Heitzmann, B. Palazzi, C. Papamanthou, and R. Tamassia. 2008. Efficient integrity checking of untrusted network storage. In StorageSS. 43--54. Google Scholar
Digital Library
- 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 Scholar
- A. Juels and B. Kaliski. 2007. PORs: Proofs of retrievability for large files. In CCS. 584--597. Google Scholar
Digital Library
- L. Lamport. 1978. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21, 558--565. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- A. Oprea and M. Reiter. 2007. Integrity checking in cryptographic file systems with constant trusted storage. In USENIX Security Symposium. 183--198. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- W. Pugh. 1990. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM 33, 668--676. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- H. Shacham and B. Waters. 2008. Compact proofs of retrievability. In ASIACRYPT. 90--107. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- K. Zeng. 2008. Publicly verifiable remote data integrity. In ICICS. 419--434. Google Scholar
Digital Library
- Q. Zheng and S. Xu. 2011. Fair and dynamic proofs of retrievability. In CODASPY. 237--248. Google Scholar
Digital Library
Index Terms
Efficient Dynamic Provable Possession of Remote Data via Update Trees
Recommendations
Dynamic Provable Data Possession
As storage-outsourcing services and resource-sharing networks have become popular, the problem of efficiently proving the integrity of data stored at untrusted servers has received increased attention. In the Provable Data Possession (PDP) model, the ...
Efficient dynamic provable possession of remote data via balanced update trees
ASIA CCS '13: Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications securityThe emergence and availability of remote storage providers prompted work in the security community that allows a client to verify integrity and availability of the data she outsourced to an untrusted remove storage server at a relatively low cost. Most ...
Scalable and efficient provable data possession
SecureComm '08: Proceedings of the 4th international conference on Security and privacy in communication netowrksStorage outsourcing is a rising trend which prompts a number of interesting security issues, many of which have been extensively investigated in the past. However, Provable Data Possession (PDP) is a topic that has only recently appeared in the research ...






Comments