Open Access Open Access  Restricted Access Subscription Access

Cloud Storage Public Integrity Verification Using Blockchain Technology to Thwart Tardy Auditors

A. Mohamed Aslam, A. M. Niyas, S.M. Abdul Rahuman, SB. Shahjahan, A. Aafiya Thahaseen

Abstract


In cloud storage, remote data integrity checking is critical. Clients may be compelled to check whether their outsourced data is preserved without downloading the entire set. Clients may be required to store their data on multiple cloud Servers in certain application scenarios. In addition, the integrity checking procedure needs to be cost-effective in order to save the verifier money. From these two points, we propose a brand-new remote data integrity checking model with two schemes called BLS (Batch Level Signature). Due to an effective cryptographic primitive known as batch signature, which supports the authentication of any number of datas simultaneously, the basic scheme (BLS) is also efficient in terms of latency, computation, and communication overhead. As a result, it provides the ideal resilience to data security and eliminates the correlation between datas. In addition, we present an improved scheme known as BLS, which combines the fundamental scheme with a data filtering mechanism to lessen the impact of DoS while maintaining the highest possible resistance to data security.


Full Text:

PDF

References


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

Juels, A., & Kaliski Jr, B. S. (2007, October). PORs: Proofs of retrievability for large files. In Proceedings of the 14th ACM conference on Computer and communications security (pp. 584-597).

Bowers, K. D., Juels, A., & Oprea, A. (2009, November). Proofs of retrievability: Theory and implementation. In Proceedings of the 2009 ACM workshop on Cloud computing security (pp. 43-54)..

Dodis, Y., Vadhan, S., & Wichs, D. (2009). Proofs of retrievability via hardness amplification. In Theory of Cryptography: 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings 6 (pp. 109-127). Springer Berlin Heidelberg.

Erway, C. C., Küpçü, A., Papamanthou, C., & Tamassia, R. (2015). Dynamic provable data possession. ACM Transactions on Information and System Security (TISSEC), 17(4), 1-29.


Refbacks

  • There are currently no refbacks.