An Effective Search Scheme Based on Semantic Tree Over Encrypted Cloud Data Supporting Verifiability

  title={An Effective Search Scheme Based on Semantic Tree Over Encrypted Cloud Data Supporting Verifiability},
  author={Zhangjie Fu and Jiangang Shu and Xingming Sun},
With the increasing popularity of cloud computing, more and more sensitive or private information is being outsourced to cloud server. For protecting data privacy, sensitive data are always encrypted before being outsourced. Although the existing searchable encryption schemes enable users to search over encrypted data, these schemes support only exact keyword search, which greatly affects data usability. Moreover, these schemes do not support verifiability of search result. To tackle the… 


Secure Ranked Keyword Search over Encrypted Cloud Data
This paper defines and solves the problem of effective yet secure ranked keyword search over encrypted cloud data, and proposes a definition for ranked searchable symmetric encryption, and gives an efficient design by properly utilizing the existing cryptographic primitive, order-preserving asymmetric encryption (OPSE).
Privacy-Preserving Multi-keyword Ranked Search over Encrypted Cloud Data
This paper defines and solves the challenging problem of privacy-preserving multi-keyword ranked search over encrypted cloud data (MRSE), and establishes a set of strict privacy requirements for such a secure cloud data utilization system to become a reality.
Fuzzy Keyword Search over Encrypted Data in Cloud Computing
This paper formalizes and solves the problem of effective fuzzy keyword search over encrypted cloud data while maintaining keyword privacy, and exploits edit distance to quantify keywords similarity and develops an advanced technique on constructing fuzzy keyword sets, which greatly reduces the storage and representation overheads.
Achieving Efficient Conjunctive Keyword Searches over Encrypted Data
This work presents two provably secure and efficient schemes for performing conjunctive keyword searches over symmetrically encrypted data based on Shamir Secret Sharing and an alternative based on bilinear pairings that yields constant size trapdoors.
Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System
This work constructs an efficient PECK scheme whose security is proven over a decisional linear Diffie-Hellman assumption in the random oracle model, and has the shortest ciphertext size and private key size, and requires a comparable computation overhead.
Practical techniques for searches on encrypted data
  • D. Song, D. Wagner, A. Perrig
  • Computer Science, Mathematics
    Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000
  • 2000
This work describes the cryptographic schemes for the problem of searching on encrypted data and provides proofs of security for the resulting crypto systems, and presents simple, fast, and practical algorithms that are practical to use today.
Secure Conjunctive Keyword Search over Encrypted Data
We study the setting in which a user stores encrypted documents (e.g. e-mails) on an untrusted server. In order to retrieve documents satisfying a certain search criterion, the user gives the server
Privacy Preserving Keyword Searches on Remote Encrypted Data
This paper offers solutions for the problem of efficiently retrieving some of the encrypted files containing (or indexed by) specific keywords, keeping the keywords themselves secret and not jeopardizing the security of the remotely stored files.
Conjunctive, Subset, and Range Queries on Encrypted Data
This work constructs public-key systems that support comparison queries on encrypted data as well as more general queries such as subset queries (x∈ S) and supports arbitrary conjunctive queries without leaking information on individual conjuncts.
Multi-Dimensional Range Query over Encrypted Data
It is shown that MRQED implies a solution to its dual problem, which enables investors to trade stocks through a broker in a privacy-preserving manner, and the security of the construction under the decision bilinear Diffie-Hellman and decision linear assumptions in certain bilInear groups is proved.