Skip to main content

Exploiting Block-Chain Data Structure for Auditorless Auditing on Cloud Data

  • Conference paper
  • First Online:

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

Abstract

Low cost, high performance and on-demand access of cloud infrastructure facilitates individuals and organizations to outsource their high volume of data to cloud storage system. With continuously increasing demand of cloud storage, security of users’ data in cloud is becoming a great challenge. One of the security concerns is ensuring integrity of the data stored in the cloud, and trusted third-party based public auditing is a standard technique for cloud data authentication. In this paper, for the first time, we propose an auditing scheme for cloud data without requiring a third party. We exploit the block-chain data structure of Bitcoins to propose an auditing mechanism whereby any user can perform the validation of selected files efficiently. In case a user does not possess the required computational resource for verification, or a user is reluctant to do the verification, our scheme provides the option for third party verification as well, without any additional overhead of data structure, computation or storage.

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

Buying options

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

Notes

  1. 1.

    Since “block” in the context of block-chain means a node in the chain, we use the term “file-block” to denote the smallest unit of data-chunk in the file.

  2. 2.

    A file-block may be further divided into s smaller parts. In our scheme, s is taken to be 1. Hence for fair comparison, we have taken \(s=1\) for the other schemes as well.

References

  1. Alkhojandi, N., Miri, A.: Privacy-preserving public auditing in cloud computing with data deduplication. In: Cuppens, F., Garcia-Alfaro, J., Zincir Heywood, N., Fong, P.W.L. (eds.) FPS 2014. LNCS, vol. 8930, pp. 35–48. Springer, Heidelberg (2015). doi:10.1007/978-3-319-17040-4_3

    Google Scholar 

  2. Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., Song, D.: Provable data possession at untrusted stores. In: Ning, P., et al. [13], pp. 598–609

    Google Scholar 

  3. Coelho, F.: An (almost) constant-effort solution-verification proof-of-work protocol based on merkle trees. IACR Cryptology ePrint Archive 2007:433 (2007)

    Google Scholar 

  4. Deswarte, Y., Quisquater, J.-J., Saïdane, A.: Remote integrity checking. In: Jajodia, S., Strous, L. (eds.) Integrity and Internal Control in Information Systems VI. IIFIP, vol. 140, pp. 1–11. Springer, Heidelberg (2004). doi:10.1007/1-4020-7901-X_1

    Chapter  Google Scholar 

  5. Ederov, B.: Merkle tree traversal techniques. Bachelor thesis, Technische Universität Darmstadt (2007)

    Google Scholar 

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

    Article  Google Scholar 

  7. Gazzoni Filho, D.L., Barreto, P.S.L.M.: Demonstrating data possession, uncheatable data transfer. IACR Cryptology ePrint Archive, 2006:150 (2006)

    Google Scholar 

  8. Juels, A., Kaliski Jr., B.S.: PORs: proofs of retrievability for large files. In: Ning, P., et al. [13], pp. 584–597

    Google Scholar 

  9. Li, L., Xu, L., Li, J., Zhang, C.: Study on the third-party audit in cloud storage service. In: Proceedings of the International Conference on Cloud and Service Computing, CSC 2011, pp. 220–227. IEEE Computer Society, Washington, DC (2011)

    Google Scholar 

  10. Merkle, R.C.: Secrecy, Authentication, and Public Key Systems. PhD thesis, Stanford, CA, USA, AAI8001972 (1979)

    Google Scholar 

  11. Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system, May 2009

    Google Scholar 

  12. Naor, M., Rothblum, G.N.: The complexity of online memory checking. J. ACM 56(1), 2:1–2:46 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ning, P., di Vimercati, S.D.C., Syverson, P.F. (eds.) Proceedings of the ACM Conference on Computer and Communications Security, CCS, Alexandria, Virginia, USA, 28–31 October 2007. ACM (2007)

    Google Scholar 

  14. Tian, H., Chen, Y., Chang, C.-C., Jiang, H., Huang, Y., Chen, Y., Liu, J.: Dynamic-hash-table based public auditing for secure cloud storage. IEEE Trans. Serv. Comput. (2016). doi:10.1109/TSC.2015.2512589

    Google Scholar 

  15. Wang, C., Ren, K., Lou, W., Li, J.: Toward publicly auditable secure cloud data storage services. IEEE Network 24(4), 19–24 (2010)

    Article  Google Scholar 

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

    Article  Google Scholar 

  17. Yang, K., Jia, X.: Data storage auditing service in cloud computing: challenges, methods and opportunities. World Wide Web 15(4), 409–428 (2012)

    Article  Google Scholar 

  18. Yang, K., Jia, X.: An efficient and secure dynamic auditing protocol for data storage in cloud computing. IEEE Trans. Parallel Distrib. Syst. 24(9), 1717–1726 (2013)

    Article  Google Scholar 

  19. Zhu, Y., Ahn, G.-J., Hongxin, H., Yau, S.S., An, H.G., Changjun, H.: Dynamic audit services for outsourced storages in clouds. IEEE Trans. Serv. Comput. 6(2), 227–238 (2013)

    Article  Google Scholar 

  20. Zhu, Y., Hongxin, H., Ahn, G.-J., Mengyang, Y.: Cooperative provable data possession for integrity verification in multicloud storage. IEEE Trans. Parallel Distrib. Syst. 23(12), 2231–2244 (2012)

    Article  Google Scholar 

Download references

Acknowledgments

We are grateful to the Project CoEC (Centre of Excellence in Cryptology), Indian Statistical Institute, Kolkata, funded by the Government of India, for partial support towards this project.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Goutam Paul .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Ghoshal, S., Paul, G. (2016). Exploiting Block-Chain Data Structure for Auditorless Auditing on Cloud Data. In: Ray, I., Gaur, M., Conti, M., Sanghi, D., Kamakoti, V. (eds) Information Systems Security. ICISS 2016. Lecture Notes in Computer Science(), vol 10063. Springer, Cham. https://doi.org/10.1007/978-3-319-49806-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49806-5_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49805-8

  • Online ISBN: 978-3-319-49806-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics