Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Checksum Validated Individual Page Updates on Encrypted Keyword

Author : L.Harikrishna 1 M.Harrish 2 R.Mahendar 3 V.Mohammed Rameez Khan 4 T.Veeramani 5

Date of Publication :7th April 2015

Abstract: Information sharing is the key goal of Cloud Storage servers. It allows storage of sensitive and large volume of data with limited cost and high access benefits. Security must be given due importance for the cloud data with utmost care to the data and confidence to the data owner. But this limits the utilization of data through plain text search. Hence an excellent methodology is required to match the keywords with encrypted cloud data. The proposed approach similarity measure of “coordinate matching” combined with “inner product similarity” quantitatively evaluates and matches all relevant data with search keyword to arrive at best results .In this approach, each document is associated with a binary vector to represent a keyword contained in the document. The search keyword is also described as a binary vector, so the similarity could be exactly measured by the inner product of the query vector with the data vector. The inner product computation and the two multi-keyword ranked search over encrypted data (MRSE) schemes ensures data privacy and provides detailed information about the dynamic operation on the data set and index. To further refine these search results, “stop word” and “stemming” techniques have been used. Also, a checksum value for each page is stored using checksum validation algorithm and individual pages are updated in the cloud which reduces the usage cost and hence improves the experience of the user.

Reference :

    1. R. Curtmola, J.A. Garay, S. Kamara, and R. Ostrovsky, “Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions,”Proc. 13th ACM Conf. Computer and Comm. Security (CCS ’06), 2006.
    2. S.Yu, C.Wang, K.Ren, and W.Lou, “Achieving Secure, Scalable,and Fine-Grained Data Access Control in Cloud Computing,” Proc. IEEE INFOCOM, 2010.
    3. C. Wang, Q. Wang, K. Ren, and W. Lou, “PrivacyPreserving Public Auditing for Data Storage Security in Cloud Computing,” Proc. IEEE INFOCOM, 2010.
    4. S. Zerr, E. Demidova, D. Olmedilla, W. Nejdl, M. Winslett, and S. Mitra, “Zerber: r-Confidential Indexing for Distributed Documents,” Proc. 11th Int’l Conf. Extending Database Technology (EDBT ’08), pp. 287-298, 2008.
    5. I.H. Witten, A. Moffat, and T.C. Bell, Managing Gigabytes:Compressing and Indexing Documents and Images. Morgan Kaufmann Publishing, May 1999
    6. S. Zerr, D. Olmedilla, W. Nejdl, and W. Siberski, “Zerber+r: Top-k Retrieval from a Confidential Index,” Proc. 12th Int’l Conf. Extending Database Technology (EDBT ’09), pp. 439-449, 2009.
    7. R. Brinkman, “Searching in Encrypted Data,” PhD thesis, Univ. of Twente, 2007.
    8. Y. Ishai, E. Kushilevitz, R. Ostrovsky, and A. Sahai, “Cryptography from Anonymity,” Proc. IEEE 47th Ann. Symp. Foundationsof CS,pp.239-248, 2006.
    9. W.K. Wong, D.W. Cheung, B. Kao, and N. Mamoulis, “Secure kNN Computation on Encrypted Databases,” Proc. 35th ACM SIGMOD Int’l Conf. Management of Data (SIGMOD), pp. 139-152,2009.

Recent Article