Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A Provable Data Possession Scheme with Data Hierarchy in Cloud

  • Conference paper
  • First Online:
Information Security and Cryptology (Inscrypt 2015)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9589))

Included in the following conference series:

Abstract

In recent years, numerous provable data possession (PDP) schemes have been proposed for checking the availability and integrity of data stored on cloud storage server (CSS) which is not fully trusted. However, these schemes do not work with specific subsets of verifiers, and they do not efficiently support dynamic enrollment and revocation of verifiers. In this paper, we propose a novel provable data possession scheme under hierarchical data framework in cloud environment. Our scheme can be considered as a generalization of privately verifiable PDP schemes. Specifically, data of different values are integrated into a data hierarchy, and clients are classified and authorized different access permissions according to their amounts of payment. Furthermore, our scheme allows the data owner to efficiently enroll and revoke clients. The scheme satisfies existential unforgeability against malicious CSS based on the hardness of the computational Diffie-Hellman problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Armknecht, F., Bohli, J.M., Karame, G.O., Liu, Z., Reuter, C.A.: Outsourced proofs of retrievability. In: Proceedings of the 21st ACM Conference on Computer and Communications Security, CCS 2014, pp. 831–843 (2014)

    Google Scholar 

  2. Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., Song, D.: Provable data possession at untrusted stores. In: Proceedings of the 14th ACM Conference on Computer and communications security, CCS 2007, pp. 598–609 (2007)

    Google Scholar 

  3. Barsoum, A.F., Hasan, M.A.: Provable possession and replication of data over cloud servers. Centre For Applied Cryptographic Research (CACR), University of Waterloo, Report 2010/32 (2010). http://www.cacr.math.uwaterloo.ca/techreports/2010/cacr2010-32.pdf

  4. Bowers, K.D., Juels, A., Oprea, A.: Proofs of retrievability: Theory and implementation. In: Proceedings of the ACM Workshop on Cloud Computing Security, CCSW 2009, pp. 43–54 (2009)

    Google Scholar 

  5. Curtmola, R., Khan, O., Burns, R., Ateniese, G.: MR-PDP: Multiple-replica provable data possession. In: Proceedings of the 28th International Conference on Distributed Computing Systems, ICDCS 2008, pp. 411–420 (2008)

    Google Scholar 

  6. Erway, C.C., Küpü, A., Papamanthou, C., Tamassia, R.: Dynamic provable data possession. ACM Trans. Inf. Syst. Secur. (TISSEC) 17(4), 1–29 (2015). article 15

    Article  Google Scholar 

  7. Gritti, C., Susilo, W., Plantard, T.: Efficient dynamic provable data possession with public verifiability and data privacy. In: Foo, E., Stebila, D. (eds.) ACISP 2015. LNCS, vol. 9144, pp. 395–412. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  8. Ren, Y., Xu, J., Wang, J., Kim, J.-U.: Designated-verifier provable data possession in public cloud storage. Int. J. Secur. Its Appl. 7(6), 11–20 (2013)

    Article  Google Scholar 

  9. Ren, Y., Yang, Z., Wang, J., Fang, L.: Attributed based provable data possession in public cloud storage. In: Proceedings of the Tenth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2014, pp. 710–713 (2014)

    Google Scholar 

  10. Shen, S.-T., Tzeng, W.-G.: Delegable provable data possession for remote data in the clouds. In: Qing, S., Susilo, W., Wang, G., Liu, D. (eds.) ICICS 2011. LNCS, vol. 7043, pp. 93–111. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  11. Sookhak, M., Gani, A., Talebian, H., Akhunzada, A., Khan, S.U., Buyya, R., Zomaya, A.Y.: Remote data auditing in cloud computing environments: A survey, taxonomy, and open issues. ACM Comput. Surv. 47(4), Article No. 65, p. 34 (2015)

    Google Scholar 

  12. Sun, X., Chen, L., Xia, Z., Zhu, Y.: Cooperative provable data possession with stateless verification in multicloud storage. J. Comput. Inf. Syst. 10(8), 3403–3411 (2014)

    Google Scholar 

  13. Tan, S., Tan, L., Lin, X., Jia, Y.: An efficient method for checking the integrity of data in the Cloud. China Commun. 11(9), 68–81 (2014)

    Article  Google Scholar 

  14. Wang, H.: Proxy provable data possession in public clouds. IEEE Trans. Serv. Comput. 6(4), 551–559 (2012)

    Article  Google Scholar 

  15. Wang, Q., Wang, C., Li, J., Ren, K., Lou, W.: Enabling public verifiability and data dynamics for storage security in cloud computing. IEEE Trans. Parallel Distrib. Syst. 22(5), 847–859 (2011)

    Article  Google Scholar 

  16. 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)

    Article  Google Scholar 

  17. Yuan, J., Yu, S.: Proofs of retrievability with public verifiability and constant communication cost in cloud. In: Proceedings of the International Workshop on Security in Cloud Computing - Cloud Computing 2013, pp. 19–26 (2013)

    Google Scholar 

  18. Zhu, Y., Ahn, G.-J., Hu, H.X., Ma, D., Wang, H.X.: Role-based cryptosystem: A new cryptographic RBAC system based on role-key hierarchy. IEEE Trans. Inf. Forensics Secur. 8(12), 2138–2153 (2013)

    Article  Google Scholar 

  19. Zhu, Y., Ahn, G.-J., Hu, H.X., Wang, H.X.: Cryptographic role-based security mechanisms based on role-key hierarchy. In: Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, ASIACCS 2010, pp. 314–319 (2010)

    Google Scholar 

  20. Zhu, Y., Wang, H.X., Hu, Z.X., Ahn, G.-J., Hu, H.X.: Zero-knowledge proofs of retrievability. Sci. China Inf. Sci. 54(8), 1608–1617 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The first author would like to thank Dr. Khoa Nguyen for many helpful and valuable comments on the write-up. We are also very grateful to four anonymous referees, who pointed out several inaccuracies and suggested improvements in the presentation of the paper. This work is supported by the National 973 Program (Grant No. 2013CB329605), the National Natural Science Foundation of China (Grant Nos. 61572132, 61170264, 61472032, and U1405255, and the Natural Science Foundation of Fujian Province (Grant No. 2015J01239).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Changlu Lin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Lin, C., Luo, F., Wang, H., Zhu, Y. (2016). A Provable Data Possession Scheme with Data Hierarchy in Cloud. In: Lin, D., Wang, X., Yung, M. (eds) Information Security and Cryptology. Inscrypt 2015. Lecture Notes in Computer Science(), vol 9589. Springer, Cham. https://doi.org/10.1007/978-3-319-38898-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-38898-4_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-38897-7

  • Online ISBN: 978-3-319-38898-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics