A Simplified Approach on Security Analysis Using Probabilistic Order Preserving Encryption Based on Cloud Data Search

Abstract

Probabilistic Order Preserving Encryption is an effective tool to encrypt relevance score of the inverted index in encrypted cloud data for ranked search. In this paper, a hierarchical clustering method is proposed to support more search semantics and within a big data environment also to meet the demand for fast cipher text search. The proposed hierarchical approach clusters the documents based on the minimum relevance threshold, and then until the constraint on the maximum size of cluster is reached, partitions the resulting clusters into sub-clusters. This approach can reach a linear computational complexity against an exponential size increase of document collection in the search phase. The authenticity of search results can be verify in order, a structure called minimum hash sub-tree is designed in this paper.