Skip to main content
SpringerLink
Log in
Book cover

International Conference on Cloud Computing

CloudComp 2013: Cloud Computing pp 199–209Cite as

Data Possession Provability on Semi-trusted Cloud Storage

  • Conference paper
  • First Online:

  • 1521 Accesses

Abstract

In cloud storage applications, users cannot trust storage service provider as before. They need reliable methods to verify the possession of their data as well as replicas on such semi-trusted platform. In this paper, PPoDT scheme is carefully designed based on Data Tag to prove data possession with a Challenge-Response model. Furthermore, MPPoDT scheme is presented to validate multiple replicas possession provability. After procedure of file blocking, encrypting, Data Tag computing, challenge generating, evidence producing and validating, the client can be certain of the existence and integrity of its data/replica with very high probability. Prototype implementation and experiments show that the schemes are both effective and efficient.

This paper is supported by NSF of China (NO. 61100042), NSF of Hubei Province (NO. 2012FB06901) and Chinese postdoctoral Fund (NO. 2013M532170).

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

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

Learn about institutional subscriptions

References

  1. Foster, I., Kesselman, C.: The Grid 2: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers Inc., San Francisco (2003)

    Google Scholar 

  2. Feng, D.G., Zhang, M., Zhang, Y.: Study on cloud computing security. J. Softw. 22(1), 71–83 (2011)

    Article  Google Scholar 

  3. Kamara, S., Lauter, K.: Cryptographic cloud storage. In: Sion, R., Curtmola, R., Dietrich, S., Kiayias, A., Miret, J.M., Sako, K., Sebé, F. (eds.) FC 2010 Workshops. LNCS, vol. 6054, pp. 136–149. Springer, Heidelberg (2010)

    Google Scholar 

  4. Juels, A., Kaliski, B.: PORs: proofs of retrievability for large files. In: 14th ACM CCS, pp. 584−597 (2007)

    Google Scholar 

  5. Bowers, K.D., Juels, A., Oprea, A.: Proofs of retrievability: theory and implementation. In: CCSW 09, pp. 43–54. ACM Press, New York (2009)

    Google Scholar 

  6. Dodis, Y., Vadhan, S., Wichs, D.: Proofs of retrievability via hardness amplification. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 109–127. Springer, Heidelberg (2009)

    Google Scholar 

  7. Juels, A., Kaliski, B.S.: PORs: proofs of retrievability for large files. In: CCS’07: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 584–597. ACM (2007)

    Google Scholar 

  8. Shacham, H., Waters, B.: Compact proofs of retrievability. Cryptology ePrint Archive, Report 2008/073. http://eprint.iacr.org/ (2008)

  9. Bowers, K.D., Juels, A., Oprea, A.: HAIL: a high-availability and integrity layer for cloud storage. In: CCS 2009, pp. 187–198. ACM Press, New York (2009)

    Google Scholar 

  10. Ateniese, G., Burns, R., Curtmola, R.: Remote data checking using provable data possession. ACM Trans. Inf. Syst. Secur. 14(1), 12–34 (2011)

    Article  Google Scholar 

  11. Ateniese, G., Burns, R., Curtmola, R., et al.: Remote data checking using provable data possession. ACM Trans. Inf. Syst. Secur. 14(1), 12:1–12:34 (2011)

    Article  Google Scholar 

  12. Ateniese, G., Pietro, R.D., Mancini, L.V.: Scalable and efficient provable data procession. In: SecureComm, Istanbul, Turkey, pp. 1–10 (2008)

    Google Scholar 

  13. Chris, E., Alptekin, K., Papamanthou, C.: Dynamic provable data procession [EB/OL]. ePrint Archieve (2009)

    Google Scholar 

  14. Erway, C., Kupcu, A., Papamanthou, C., Tamassia, R.: Dynamic provable data possession. In: CCS ’09: Proceedings of the 16th ACM Conference on Computer and Communications Security, pp. 213–222. New York (2009)

    Google Scholar 

  15. Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33, 668–676 (1990)

    Article  Google Scholar 

  16. Zhu, Y., Hongxin, H., et al.: Cooperative provable data possession for integrity verification in multi-cloud storage. IEEE Trans. Parallel Distrib. Syst. 23(12), 2231–2244 (2012)

    Article  Google Scholar 

  17. Ren, Z., Wang, L., Deng, R., Rongwei, Yu.: Improved fair and dynamic provable data possession supporting public verification. Wuhan Univ. J. Nat. Sci. 18(4), 348–354 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Security, Navy University of Engineering, Wuhan, People’s Republic of China

    Wei Fu, Bo Yan & Xiaoping Wu

Authors
  1. Wei Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bo Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaoping Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei Fu .

Editor information

Editors and Affiliations

  1. Electrical and Computer Engineering, The University of British Columbia, Vancouver, British Columbia, Canada

    Victor C.M. Leung

  2. School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China

    Min Chen

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Fu, W., Yan, B., Wu, X. (2014). Data Possession Provability on Semi-trusted Cloud Storage. In: Leung, V., Chen, M. (eds) Cloud Computing. CloudComp 2013. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 133. Springer, Cham. https://doi.org/10.1007/978-3-319-05506-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-05506-0_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-05505-3

  • Online ISBN: 978-3-319-05506-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation