Advertisement

An Identity-Set-Based Provable Data Possession Scheme

  • Changlu LinEmail author
  • Fucai Luo
  • Jinglong Luo
  • Yali Liu
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 895)

Abstract

Provable Data Possession (PDP) scheme is a cryptographic protocol that allows the users to check the availability and integrity of outsourced data on cloud storage servers (CSS) which are not completely trusted. Most of the PDP schemes are publicly verifiable, while private verification is necessary in some applications to prevent the disclosure of any relevant information. In this work, we consider the scenario of allowing the cloud user to determine whether the clients can use the data or not through controlling their ability to verify the proof correctly, and propose an identity-set-based PDP (ISB-PDP) scheme. Our ISB-PDP scheme is not only proved to be secure under the hardness of the computational Diffie-Hellman (CDH) problem, but also select/cut some clients (verifiers) dynamically to check the proof correctly according to the needs of the cloud user.

Keywords

Cloud storage server Provable Data Possession (PDP) Identity-set-based CDH problem 

Notes

Acknowledgements

We are very grateful to the anonymous referees, who pointed out several inaccuracies and suggested improvements in the presentation of the paper. This work was supported by the National Natural Science Foundation of China (Nos. 61572132, U1705264, 61672030, and 61702237), the Natural Science Foundation of Jiangsu Province, China (No. BK20150241), and the Special Foundation of Promoting Science and Technology Innovation of Xuzhou City, China (No. KC18005).

References

  1. 1.
    Ateniese, G., Burns, R.C., Curtmola, R., Herring, J., Kissner, L., Peterson, Z.N.J., Song, D.X.: Provable data possession at untrusted stores. In: Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007, Alexandria, Virginia, USA, 28–31 October 2007, pp. 598–609 (2007)Google Scholar
  2. 2.
    Barsoum, A.F., Hasan, M.A.: Integrity verification of multiple data copies over untrusted cloud servers. In: 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, CCGrid 2012, Ottawa, Canada, 13–16 May 2012, pp. 829–834 (2012)Google Scholar
  3. 3.
    Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Advances in Cryptology - CRYPTO 2005: Proceedings of the 25th Annual International Cryptology Conference, Santa Barbara, California, USA, 14–18 August 2005, pp. 258–275 (2005)Google Scholar
  4. 4.
    Bowers, K.D., Juels, A., Oprea, A.: Proofs of retrievability: theory and implementation. In: Proceedings of the First ACM Cloud Computing Security Workshop, CCSW 2009, Chicago, IL, USA, 13 November 2009, pp. 43–54 (2009)Google Scholar
  5. 5.
    Curtmola, R., Khan, O., Burns, R.C., Ateniese, G.: MR-PDP: multiple-replica provable data possession. In: 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008), Beijing, China, 17–20 June 2008, pp. 411–420 (2008)Google Scholar
  6. 6.
    Hou, H., Yu, J., Hao, R.: Provable multiple-replica dynamic data possession for big data storage in cloud computing. I. J. Network Security 20(3), 575–584 (2018)Google Scholar
  7. 7.
    Juels, A., Kaliski Jr., B.S.: PORs: proofs of retrievability for large files. In: Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007, Alexandria, Virginia, USA, 28–31 October 2007, pp. 584–597 (2007)Google Scholar
  8. 8.
    Ren, Y., Yang, Z., Wang, J., Fang, L.: Attributed based provable data possession in public cloud storage. In: 2014 Tenth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2014, Kitakyushu, Japan, 27–29 August 2014, pp. 710–713 (2014)Google Scholar
  9. 9.
    Shacham, H., Waters, B.: Compact proofs of retrievability. In: Advances in Cryptology - ASIACRYPT 2008, Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, 7–11 December 2008, pp. 90–107 (2008)Google Scholar
  10. 10.
    Shen, S., Tzeng, W.: Delegable provable data possession for remote data in the clouds. In: Proceedings of the Information and Communications Security - 13th International Conference, ICICS 2011, Beijing, China, 23–26 November 2011, pp. 93–111 (2011)Google Scholar
  11. 11.
    Wang, C., Chow, S.S.M., Wang, Q., Ren, K., Lou, W.: Privacy-preserving public auditing for secure cloud storage. IEEE Trans. Comput. 62(2), 362–375 (2013)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Wang, F., Xu, L., Wang, H., Chen, Z.: Identity-based non-repudiable dynamic provable data possession in cloud storage. Comput. Electr. Eng. 69, 521–533 (2018)CrossRefGoogle Scholar
  13. 13.
    Wang, H.: Proxy provable data possession in public clouds. IEEE Trans. Serv. Comput. 6(4), 551–559 (2013)CrossRefGoogle Scholar
  14. 14.
    Wang, H., Wu, Q., Qin, B., Domingo-Ferrer, J.: Identity-based remote data possession checking in public clouds. IET Inf. Secur. 8(2), 114–121 (2014)CrossRefGoogle Scholar
  15. 15.
    Wang, Q., Wang, C., Li, J., Ren, K., Lou, W.: Enabling public verifiability and data dynamics for storage security in cloud computing. In: Computer Security - ESORICS 2009, Proceedings of the 14th European Symposium on Research in Computer Security, Saint-Malo, France, 21–23 September 2009, pp. 355–370 (2009)Google Scholar
  16. 16.
    Yu, Y., Au, M.H., Ateniese, G., Huang, X., Susilo, W., Dai, Y., Min, G.: Identity-based remote data integrity checking with perfect data privacy preserving for cloud storage. IEEE Trans. Inf. Forensics Secur. 12(4), 767–778 (2017)CrossRefGoogle Scholar
  17. 17.
    Yuan, J., Yu, S.: Proofs of retrievability with public verifiability and constant communication cost in cloud. In: Proceedings of the 2013 International Workshop on Security in Cloud Computing, SCC@ASIACCS 2013, Hangzhou, China, 8 May 2013, pp. 19–26 (2013)Google Scholar
  18. 18.
    Zheng, Q., Xu, S.: Fair and dynamic proofs of retrievability. In: Proceedings of the First ACM Conference on Data and Application Security and Privacy, CODASPY 2011, San Antonio, TX, USA, 21–23 February 2011, pp. 237–248 (2011)Google Scholar
  19. 19.
    Zhu, Y., Wang, H., Hu, Z., Ahn, G., Hu, H.: Zero-knowledge proofs of retrievability. Sci. China Inf. Sci. 54(8), 1608–1617 (2011)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Zhu, Y., Wang, X., Ma, D., Guo, R.: Identity-set-based broadcast encryption supporting “cut-or-select” with short ciphertext. In: Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security, ASIA CCS 2015, Singapore, 14–17 April 2015, pp. 191–202 (2015)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Changlu Lin
    • 1
    • 2
    Email author
  • Fucai Luo
    • 1
    • 3
    • 4
  • Jinglong Luo
    • 1
    • 2
  • Yali Liu
    • 5
  1. 1.College of Mathematics and InformaticsFujian Normal UniversityFuzhouChina
  2. 2.Fujian Provincial Key Laboratory of Network Security and CryptologyFujian Normal UniversityFuzhouChina
  3. 3.School of Cyber SecurityUniversity of Chinese Academy of SciencesBeijingChina
  4. 4.State Key Laboratory of Information SecurityInstitute of Information Engineering, Chinese Academy of SciencesBeijingChina
  5. 5.College of Computer Science and TechnologyJiangsu Normal UniversityXuzhouChina

Personalised recommendations