• DocumentCode
    1808011
  • Title

    Inverted index based multi-keyword public-key searchable encryption with strong privacy guarantee

  • Author

    Bing Wang ; Wei Song ; Wenjing Lou ; Hou, Y. Thomas

  • Author_Institution
    Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA
  • fYear
    2015
  • fDate
    April 26 2015-May 1 2015
  • Firstpage
    2092
  • Lastpage
    2100
  • Abstract
    With the growing awareness of data privacy, more and more cloud users choose to encrypt their sensitive data before outsourcing them to the cloud. Search over encrypted data is therefore a critical function facilitating efficient cloud data access given the high data volume that each user has to handle nowadays. Inverted index is one of the most efficient searchable index structures and has been widely adopted in plaintext search. However, securing an inverted index and its associated search schemes is not a trivial task. A major challenge exposed from the existing efforts is the difficulty to protect user´s query privacy. The challenge roots on two facts: 1) the existing solutions use a deterministic trapdoor generation function for queries; and 2) once a keyword is searched, the encrypted inverted list for this keyword is revealed to the cloud server. We denote this second property in the existing solutions as one-time-only search limitation. Additionally, conjunctive multi-keyword search, which is the most common form of query nowadays, is not supported in those works. In this paper, we propose a public-key searchable encryption scheme based on the inverted index. Our scheme preserves the high search efficiency inherited from the inverted index while lifting the one-time-only search limitation of the previous solutions. Our scheme features a probabilistic trapdoor generation algorithm and protects the search pattern. In addition, our scheme supports conjunctive multi-keyword search. Compared with the existing public key based schemes that heavily rely on expensive pairing operations, our scheme is more efficient by using only multiplications and exponentiations. To meet stronger security requirements, we strengthen our scheme with an efficient oblivious transfer protocol that hides the access pattern from the cloud. The simulation results demonstrate that our scheme is suitable for practical usage with moderate overhead.
  • Keywords
    cloud computing; data privacy; public key cryptography; cloud computing; cloud data access; cloud server; cloud users; conjunctive multikeyword search; data privacy; data volume; inverted index; multikeyword public key searchable encryption; plaintext search; probabilistic trapdoor generation algorithm; public key searchable encryption scheme; search pattern; searchable index structures; sensitive data; trapdoor generation function; user query privacy; Encryption; Indexes; Polynomials; Privacy; Public key; Servers;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Communications (INFOCOM), 2015 IEEE Conference on
  • Conference_Location
    Kowloon
  • Type

    conf

  • DOI
    10.1109/INFOCOM.2015.7218594
  • Filename
    7218594