Skip to main content
Erschienen in: The Journal of Supercomputing 1/2019

09.01.2016

A method for achieving provable data integrity in cloud computing

verfasst von: Aiping Li, Shuang Tan, Yan Jia

Erschienen in: The Journal of Supercomputing | Ausgabe 1/2019

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

By storing data files in the cloud, users can make use of cloud computing techniques, thereby reducing hardware investment and simplifying data management. However, ensuring data integrity when using unreliable service providers is a problem. In this paper, we propose a novel method for provable data integrity (PDI) aimed at clients with data stored in untrusted servers in cloud computing environments. An advantage of this model is the low client cost since a constant amount of metadata is generated. Based on a bilinear group, we propose a simple, efficient audit service for public verification of untrusted outsourced storage. Compared with existing PDI methods, we aim to resolve this issue by considering the cost of generating verification metadata at the client. Furthermore, our method supports data dynamics and public verifiability. Finally, the results of extensive experiments conducted to evaluate the performance of our method demonstrate that our method achieves high efficiency.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Ateniese G, Burns R, Curtmola R, Herring J, Khan O, Kissner L, Peterson Z, Song D (2011) Remote data checking using provable data possession. ACM Trans Inf Syst Secur (TISSEC) 14(1):12CrossRef Ateniese G, Burns R, Curtmola R, Herring J, Khan O, Kissner L, Peterson Z, Song D (2011) Remote data checking using provable data possession. ACM Trans Inf Syst Secur (TISSEC) 14(1):12CrossRef
2.
Zurück zum Zitat Ateniese G, Burns R, Curtmola R, Herring J, Kissner L, Peterson Z, Song D (2007) Provable data possession at untrusted stores. In: Proceedings of the 14th ACM conference on computer and communications security. ACM, New York, pp 598–609 Ateniese G, Burns R, Curtmola R, Herring J, Kissner L, Peterson Z, Song D (2007) Provable data possession at untrusted stores. In: Proceedings of the 14th ACM conference on computer and communications security. ACM, New York, pp 598–609
3.
Zurück zum Zitat Boneh D, Lynn B, Shacham H (2001) Short signatures from the weil pairing. In: Advances in cryptology—ASIACRYPT’01. Springer, New York, pp 514–532 Boneh D, Lynn B, Shacham H (2001) Short signatures from the weil pairing. In: Advances in cryptology—ASIACRYPT’01. Springer, New York, pp 514–532
5.
Zurück zum Zitat Dodis Y, Vadhan S, Wichs D (2009) Proofs of retrievability via hardness amplification. In: Theory of cryptography. Springer, New York, pp 109–127 Dodis Y, Vadhan S, Wichs D (2009) Proofs of retrievability via hardness amplification. In: Theory of cryptography. Springer, New York, pp 109–127
6.
Zurück zum Zitat Erway C, Küpçü A, Papamanthou C, Tamassia R (2009) Dynamic provable data possession. In: Proceedings of the 16th ACM conference on computer and communications security (CCS’09). ACM, New York, pp 213–222. doi:10.1145/1653662.1653688 Erway C, Küpçü A, Papamanthou C, Tamassia R (2009) Dynamic provable data possession. In: Proceedings of the 16th ACM conference on computer and communications security (CCS’09). ACM, New York, pp 213–222. doi:10.​1145/​1653662.​1653688
7.
Zurück zum Zitat Grobauer B, Walloschek T, Stöcker E (2011) Understanding cloud computing vulnerabilities. Secur Priv IEEE 9(2):50–57CrossRef Grobauer B, Walloschek T, Stöcker E (2011) Understanding cloud computing vulnerabilities. Secur Priv IEEE 9(2):50–57CrossRef
8.
Zurück zum Zitat Juels A, Kaliski BS Jr (2007) Pors: proofs of retrievability for large files. In: Proceedings of the 14th ACM conference on computer and communications security. ACM, New York, pp 584–597 Juels A, Kaliski BS Jr (2007) Pors: proofs of retrievability for large files. In: Proceedings of the 14th ACM conference on computer and communications security. ACM, New York, pp 584–597
9.
Zurück zum Zitat Mell P, Grance T (2009) The NIST definition of cloud computing. Natl Inst Stand Technol 53(6):50 Mell P, Grance T (2009) The NIST definition of cloud computing. Natl Inst Stand Technol 53(6):50
10.
Zurück zum Zitat Shacham H, Waters B (2008) Compact proofs of retrievability. In: Advances in cryptology—ASIACRYPT’08. Springer, New York, pp 90–107 Shacham H, Waters B (2008) Compact proofs of retrievability. In: Advances in cryptology—ASIACRYPT’08. Springer, New York, pp 90–107
12.
Zurück zum Zitat Shuang T, Lin T, Xiaoling L, Yan J (2014) An efficient method for checking the integrity of data in the cloud. Commun China 11(9):68–81CrossRef Shuang T, Lin T, Xiaoling L, Yan J (2014) An efficient method for checking the integrity of data in the cloud. Commun China 11(9):68–81CrossRef
13.
Zurück zum Zitat Wang C, Wang Q, Ren K, Lou W (2010) Privacy-preserving public auditing for data storage security in cloud computing. In: INFOCOM, 2010 proceedings IEEE. IEEE, pp 1–9 Wang C, Wang Q, Ren K, Lou W (2010) Privacy-preserving public auditing for data storage security in cloud computing. In: INFOCOM, 2010 proceedings IEEE. IEEE, pp 1–9
14.
Zurück zum Zitat Wang Q, Wang C, Li J, Ren K, Lou W (2009) Enabling public verifiability and data dynamics for storage security in cloud computing. In: Computer security—ESORICS’09. Springer, New York, pp 355–370 Wang Q, Wang C, Li J, Ren K, Lou W (2009) Enabling public verifiability and data dynamics for storage security in cloud computing. In: Computer security—ESORICS’09. Springer, New York, pp 355–370
15.
Zurück zum Zitat Wang Q, Wang C, Ren K, Lou W, Li J (2011) Enabling public auditability and data dynamics for storage security in cloud computing. IEEE Trans Parallel Distrib Syst 22(5):847–859CrossRef Wang Q, Wang C, Ren K, Lou W, Li J (2011) Enabling public auditability and data dynamics for storage security in cloud computing. IEEE Trans Parallel Distrib Syst 22(5):847–859CrossRef
16.
Zurück zum Zitat Zhu Y, Hu H, Ahn GJ, Yu M (2012) Cooperative provable data possession for integrity verification in multicloud storage. IEEE Trans Parallel Distrib Syst 23(12):2231–2244CrossRef Zhu Y, Hu H, Ahn GJ, Yu M (2012) Cooperative provable data possession for integrity verification in multicloud storage. IEEE Trans Parallel Distrib Syst 23(12):2231–2244CrossRef
17.
Metadaten
Titel
A method for achieving provable data integrity in cloud computing
verfasst von
Aiping Li
Shuang Tan
Yan Jia
Publikationsdatum
09.01.2016
Verlag
Springer US
Erschienen in
The Journal of Supercomputing / Ausgabe 1/2019
Print ISSN: 0920-8542
Elektronische ISSN: 1573-0484
DOI
https://doi.org/10.1007/s11227-015-1598-2

Weitere Artikel der Ausgabe 1/2019

The Journal of Supercomputing 1/2019 Zur Ausgabe