High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Order Preserving Encryption-Scheme to Preserve the Order of Encrypted Cloud Data Search

Author(s):

Punam Suresh Kharche , DBACER/RTMNU; Roshan Thakur, DBACER/RTMNU; Dinesh Gawande, DBACER/RTMNU

Keywords:

Cloud Computing, Document Relevance, Privacy, Searchable Encryption

Abstract

The data on cloud computing is encrypted due to security concern or the factor of third party to excavate into it. As the consequence to this, the search over encrypted data becomes a complex task. The traditional approaches like to search in plain text cannot be apply over encrypted data. So the searchable encryption techniques are being used. In searchable encryption techniques the order of relevance must be consider as the concern because when it is large amount of data it becomes complex as relevant documents are more in number. We have discussed the probabilistic OPE technique which known as one-to-many OPE. The expected result is to be that cloud server cannot penetrate in actual user data and provide the search on encrypted data will be performed and results will appear in order of relevance score. Even though with good security of one-to-many OPE the cloud can get the information of the plain text if differential attacks occurred on the cipher text by calculating the differences between the cipher text.

Other Details

Paper ID: IJSRDV5I51091
Published in: Volume : 5, Issue : 5
Publication Date: 01/08/2017
Page(s): 1406-1410

Article Preview

Download Article