Open Access Open Access  Restricted Access Subscription or Fee Access

Security Analysis on Privacy Data Encryption in Many Order Using Magic Number

S. Srilekha


Order Preserving encryption (OPE) is efficient tools to encrypt relevance score of an inverted index. In this one to many orders preserving encryption is proposed which will encrypt the single plaintext into many cipher text data. For a customer to get access to this data the encrypt data will be provided with a relevance score which is nothing but relevant information of that user. Based on that relevant score an inverted index is created. The inverted index contains the private key of the particular user and that user’s information. This method are used to get the information from the cloud with more secure. These information are grouped in clusters for easy access by the users.

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 transaction on cloud computing, vol. 3, No. 2, April/ June 2015.

Huiqi Xu, Shumin Guo, Keke Chen “Building Confidential and Efficient Query Services in the Cloud with RASP Data Perturbation” in june 2009.

Frank Li, Richard Shin, Vern Paxson “Exploring Privacy Preservation in Outsourced K-Nearest Neighbors with Multiple Data Owners”,2015

Bing Wang, Shucheng Yu, Wenjing Lou, Y. Thomas Hou “Privacy-Preserving Multi-Keyword Fuzzy Search over Encrypted Data in the Cloud”, IEEE INFOCOM,2014.

Cong Wang, Sherman S,M. Chow, Qian Wang, Kui Ren, Wenjing Lou ” Privacy-Preserving Public Auditing for Secure Cloud Storage”, IEEE transactions on computers Vol:62 No:2,2013.

B. Krebs, “Payment processor breach may be largest ever,”, 2009.

Ke Li, Weiming Zhang, Ce Yang, and Nenghai Yu,” Security Analysis on One-to-Many Order Preserving Encryption Based Cloud data Search” DOI 10.1109/TIFS.2015.2435697, IEEE Transactions on Information Forensics and Security.


  • There are currently no refbacks.

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