Optimal Matching over Encrypted Data on Public Cloud: A Verifiable Semantic Searching Scheme

Abstract: Secure data recovery in the open cloud requires extensive semantic analysis of encoded data. Inconsistent word recovery administration is what it aims to provide, making inquiries and query elements flexible. Because they rely on predetermined watchwords to validate query items from the cloud and because the exact matching is carried out by enlarged semantically terms with specified catchphrases, existing semantic searching plans do not allow verified searching. In this study, we suggest a protected verified semantic searching through conspire. In order to calculate the base word transportation cost (MWTC) as the similarity between queries and archives for semantic ideal matching on ciphertext, we generate word transportation (WT) issues and provide a secure change to transform WT issues into arbitrary direct programming (LP) concerns. In order to design a verification component that uses the transitional information provided in the matching cycle to assess the precision of query items, we research the duality hypothesis of LP. The security analysis demonstrates how our plan may assure Verifiability and discretion. Our plan has a higher precision than other plans, according to the results from two datasets.