ZTE Communications ›› 2013, Vol. 11 ›› Issue (2): 24-29.doi: DOI:10.3969/j.issn.1673-5188.2013.02.004

• Special Topic • Previous Articles     Next Articles

An Efficient Dynamic Proof of Retrievability Scheme

Zhen Mo, Yian Zhou, and Shigang Chen   

  1. Department of Computer & Information Science & Engineering, University of Florida, Gainesville, FL 32611, USA
  • Received:2013-04-29 Online:2013-06-25 Published:2013-06-25
  • About author:Zhen Mo (zmo@cise.ufl.edu) is a PhD student in the Department of Computer and Information Science Engineering, University of Florida. He received his BE degree in Information Security Engineering from Shanghai Jiao Tong University in 2007. He received his ME degree in theory and new technology of electrical engineering from Shanghai Jiao Tong University in 2010. His research interests include network security and cloud computing security.

    Yian Zhou (yian@cise.ufl.edu) is a PhD student in the Department of Computer and Information Science and Engineering, University of Florida. She received her BS degree from Peking University in 2010. Her research interests include cloud computing and privacy-preserving cyber-physical systems.

    Shigang Chen (sgchen@cise.ufl.edu) is an associate professor in the Department of Computer and Information Science and Engineering, University of Florida. He received his BS degree in computer science from University of Science and Technology, China, in 1993. He received his MS and PhD degrees in computer science from the University of Illinois at Urbana-Champaign in 1996 and 1999. After graduating, he worked at Cisco Systems for three years. He joined the University of Florida in 2002. His research interests include network security and wireless networks. He received the IEEE Communications Society Best Tutorial Paper Award in 1999 and NSF CAREER Award in 2007. He was a guest editor forACM/Baltzer Journal of Wireless Networks andIEEE Transactions on Vehicle Technologies . He was TPC co-chair of theIEEE Computer and Network Security Symposium 2006 , vice TPC chair ofThe 2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems 2005 , vice general chair ofQShine 2005 , and TPC co-chair ofQShine 2004 .

Abstract: Data security is a significant issue in cloud storage systems. After outsourcing data to cloud servers, clients lose physical control over the data. To guarantee clients that their data is intact on the server side, some mechanism is needed for clients to periodically check the integrity of their data. Proof of retrievability (PoR) is designed to ensure data integrity. However, most prior PoR schemes focus on static data, and existing dynamic PoR is inefficient. In this paper, we propose a new version of dynamic PoR that is based on a B+ tree and a Merkle hash tree. We propose a novel authenticated data structure, called Cloud Merkle B+ tree (CMBT). By combining CMBT with the BLS signature, dynamic operations such as insertion, deletion, and modification are supported. Compared with existing PoR schemes, our scheme improves worst-case overhead from O(n ) to O(logn ).

Key words: cloud storage, proof of retrievability, data integrity, B+ tree