Semantic Searching Scheme Over Encrypted Data in Pubic Cloud

The end of this design is give semantic searching over translated data is a pivotal task for secure information reclamation in public pall. We propose a secure empirical semantic searching scheme for semantic optimal matching on ciphertext, we formulate Word Transportation( WT) problem to calculate the Minimum Word Transportation Cost( MWTC) as the similarity between queries and documents, So we propose a secure metamorphosis to transfigure WT problems into arbitrary Linear Programming( LP) problems to gain the translated MWTC for verifiability, we explore the duality theorem of LP to design a verification medium using the intermediate data produced in matching process to corroborate the correctness of hunt results. Security analysis demonstrates that our scheme can give the verifiability and confidentiality to give high delicacy than other schemes.