Abstract
Provable data possession (PDP) allows a client that has stored data at remote server to verify that the server correctly possesses the original data. A long-standing problem is how to reduce I/O cost. Through the integration of Online-code and PDP, a challenge/check protocol that can verifies the possession is proposed. The protocol generates probabilistic proofs of possession by sampling tiny sets of data, which obviously reduces I/O cost. Meanwhile, the protocol can recover corrupted data. The authors formalize this notion in the Robust/Recover (RR) provable data possession guarantee. Briefly speaking, the client maintains a constant amount of metadata to verify the proof. The challenge/check protocol transmits a constant amount of data, which reduces communication complexity. The authors give a detailed analysis of this protocol and build a simulation to evaluate practicability in reliability, space overhead, computation complexity, and communication complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Devanbu, P., Gertz, M., Martel, C., et al.: Authentic third-party data publication. J. Comput. Secur. 11(4), 291–314 (2003)
Mykletun, E., Narasimha, M., Tsudik, G.: Authentication and integrity in outsourced databases. ACM Trans. Storage 2(2), 107–318 (2006)
Xue, L., Ni, J., Li, Y., Shen, J.: Provable data transfer from provable data possession and deletion in cloud storage. Comput. Stand. Interfaces 11(Part 1), 46–54 (2017)
Clementine, G., Chen, R., Willy, S., Thomas, P.: Dynamic provable data possession protocols with public verifiability and data privacy. In: ISPEC 2017. LNCS, Melbourne, vol. 10701, pp. 485–505. Springer (2017)
Fan, X., Yang, G., Mu, Y., Yu, Y.: On indistinguishability in remote data integrity checking. Comput. J. 58(4), 823–830 (2015)
Golle, P., Staddon, J., Waters, L.B.: Secure conjunctive keyword search over encrypted data. In: Proceedings of the Second International Conference ACNS 2004. LNCS, Yellow Mountain, vol. 3089, pp. 31–45. Springer (2004)
Ateniese, G., Burns, R., Curtmola, R., et al.: Provable data possession at untrusted stores. In: Proceedings of ACM Conference on Computer and Communications Security, pp. 598–609. ACM, New York (2007)
Juels, A., Kaliski, S.B.: PoRs: proofs of retrievability for large files. In: Proceedings of ACM Conference on Computer and Communications Security, pp. 584–597. ACM, New York (2007)
Curtmola, R., Khan, O., Burns, R.: Robust remote data checking. In: Proceedings of the 4th ACM International Workshop on Storage Security and Survivability, pp. 63–68. ACM, New York (2008)
Bowers, K., Juels, A., Oprea, A.: Proofs of retrievability: theory and implementation. ePrint Archive Report (2008/175) (2008)
Kotla, R., Alvisi, L., Dahlin, M.: SafeStore: a durable and practical storage system. In: USENIX Annual Technical Conference, Santa Clara, pp. 129–142 (2007)
Golle, P., Jarecki, S., Mironov, I.: Cryptographic primitives enforcing communication and storage complexity. In: Proceedings of the 6th International Conference on Financial Cryptography, Melbourne, pp. 120–135. Springer (2002)
Maymounkov, P.: Online codes. New York University, TR2003-883 (2003)
Damgard, I.: Towards practical public key systems secure against chosen ciphertext attacks. In: Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology. LNCS, Santa Barbara, vol. 740, pp. 445–456. Springer (1992)
Bellare, M., Palacio, A.: The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols. In: Proceedings of the CRYPTO 2004, LNCS, Santa Barbara, vol. 3152, pp. 273–289. Springer (2004)
Acknowledgment
The authors would like to thank G. Ateniese, K. Bowers, Guomin Yang and Haiying Liu for sharing their deep insights about delegated computation and KEA1-assumption related matters. This work was supported in part by the National Natural Science Foundation of China (Grant No. 61701270) and Cooperation Foundation for The Youth Doctors of QiLu University of Technology (Shandong Academy of Sciences) (Grant No. 2017BSHZ008).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Feng, C., Wang, H., Wan, W., Li, Q., Xu, F. (2020). Robust/Recover Provable Data Possession Protocol. In: Yang, CN., Peng, SL., Jain, L. (eds) Security with Intelligent Computing and Big-data Services. SICBS 2018. Advances in Intelligent Systems and Computing, vol 895. Springer, Cham. https://doi.org/10.1007/978-3-030-16946-6_46
Download citation
DOI: https://doi.org/10.1007/978-3-030-16946-6_46
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-16945-9
Online ISBN: 978-3-030-16946-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)