Open Access Open Access  Restricted Access Subscription or Fee Access

Proof of Data Integrity Using No-SQL Database in Cloud Storage: A Survey

Mahesh E. Pore, Amit B. Chougule


Cloud computing shares a pool of the application software, databases, and hardware to the centralized large data centers. When multiple users use the cloud service, the management of the data at the server side is difficult, so cloud services may not be trusted.  This paper introduces the problem of ensuring the integrity of data stored in cloud computing. To reduce the computational cost at user side during the integrity verification of their data, the many schemes introduce the notion of public verifiability. These schemes introduce one more network element which acts as an auditor on the behalf of the client.  The auditor preprocesses client's data and uploads it to the storage server and later verifies the integrity of that data. However, the challenge is to find out this verifier is itself trustable or not. For this, we propose a new scheme where the storage server as well as auditor also is assumed to be untrusted. Furthermore, we strengthen the performance of data operation to process user’s time series data by replacing traditional data warehouse solution into emerging big data technologies such as No-Sql databases. We also maintain multiple replica of data file to increase availability and reduce the data loss.


Data Integrity, Third Party Auditor, No-SQL database, Data file Replicas

Full Text:



Jin Li, Xiao Tan, Xiaofeng Chen, Duncan S. Wong, and Fatos Xhafa, “OPoR: Enabling Proof of Retrievability in Cloud Computing with Resource-Constrained Devices” IEEE Transactions on cloud computing vol.3, No.2, April/June 2015.

G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson,and D. Song, “Provable data possession at untrusted stores,”in Proc. 14th ACM Conf. Comput. Commun. Security, 2007, pp. 598–609.

A. Juels and B. S. Kaliski Jr, “Pors: Proofs of retrievability for large files,” in Proc. 14th ACM Conf. Comput. Commun. Security, 2007, pp. 584–597.

H. Shacham and B. Waters, “Compact proofs of retrievability,” in Proc. 14th Int. Conf. Theory Appl. Cryptol. Inf. Security, 2008, pp. 90–107.

K. D. Bowers, A. Juels, and A. Oprea, “Proofs of retrievability:Theory and implementation,” in Proc. ACM Workshop Cloud Comput.Security, 2009, pp. 43–54.

M. Naor and G. N. Rothblum, “The complexity of online memory checking,” J. ACM, vol. 56, no. 1, pp. 2:1–2:46, Feb. 2009.

E.-C. Chang and J. Xu, “Remote integrity check with dishonest storage server,” in Proc. 13th Eur. Symp. Res. Comput. Security,2008, pp. 223–237.

M. A. Shah, R. Swaminathan, and M. Baker. (2008). Privacy-preserving audit and extraction of digital contents, Cryptology ePrint Archive, Report 2008/186 [Online]. Available:

A. Opera, M. K. Reiter, and K. Yang, “Space-efficient block storage integrity,” in Proc. 12th Annu. Netw. Distrib. Syst. Security Symp.,2005, pp. 17–28.

T. S. J. Schwarz and E. L. Miller, “Store, forget, and check: Using algebraic signatures to check remotely administered storage,” in Proc. 26th IEEE Int. Conf. Distrib. Comput. Syst., 2006, p. 12.

Q. Wang, K. Ren, S. Yu, and W. Lou, “Dependable and secure sensor data storage with dynamic integrity assurance,” ACM Trans.Sens. Netw., vol. 8, no. 1, pp. 9:1–9:24, Aug. 2011.

Jia Yu, Kui Ren, Cong Wang and Vijay Varadharajan, “Enabling Cloud Storage Auditing with Key-Exposure Resistance” IEEE Transactions on Information forensics and security vol.10, No.6, June 2015.

Zhuo Haoand Nenghai Yu, “A Multiple-Replica Remote Data Possession Checking Protocol with Public Verifiability” IEEE Transactions on Data, Privacy and E-commerce April 2010.

Ruxandra Burtica, Eleonora Maria Mocanu, Mugurel Ionuţ Andreica, Nicolae Ţapuş “Practical application and evaluation of No-Sql databases inCloud Computing” IEEE transactions on No-Sql 2012.

Jing Han, Haihong E, Guan Le and Jian Du ” Survey on No-Sql Database” IEEE 2011.

MongoDB tutorials

MongoDB predefined datasets

R.Hecht and S.Jablonski, “NoSQL evaluation: A use case oriented survey. In Cloud and Service Computing (CSC) ” , 2011 International Conference, IEEE, (2011) December, pp. 336-341.

Use relational DBMS, N. Saying good bye to DBMSs, designing effective interfaces, Communications of the ACM vol.52 no. 9, (2009)


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.