A New Approach for Private Searches on Public-Key Encrypted Data

Abstract

Abstract. Public-key Encryption with Keyword Search (PEKS) allows authorized users to search by keywords on encrypted data by generating trapdoors for the desired keywords. Basically there are two requirements for the process of trapdoors generation. On one hand, it is important to allow users to privately search on encrypted data without revealing keywords to the Trapdoor Generation Entity T GE, and solutions proposed are based on the use of blinding protocols between user and T GE. On the other hand, in some applications it is necessary to prevent T GE from generating trapdoors on behalf of a legitimate user, this is done by splitting the T GE and generating trapdoors in distributed manner. Until now, these two requirements in PEKS were considered separately and many solutions were proposed dealing with each one. However, no solution is known to satisfy the two requirements at the same time.In this paper we present a new approach to deal with this issue. First, we extend the notion of anonymous Identity-Based Encryption with distributed Private Key Generator to handle the blind key-extraction protocols as in Blind IBE. We call such new schemes blind anonymous (n, t)-IBE, and we give concrete construction of such schemes. Second, we generically transform the blind anonymous (n, t)-IBE into a threshold PEKS with oblivious keyword search satisfying the requirements specified above.

A Keyword-Searchable ABE Scheme From Lattice in Cloud Storage Environment

“…In 2012, Nishioka [9] presented a new security definition for non-interactive PEKS, named perfect keyword privacy (PKP). Same year, Siad [10] extended the notion of anonymous IBE, and gave a method for converting the blind anonymous IBE to a threshold PEKS with oblivious keyword search. In 2015, Rhee and Dong [11] proposed PEKS with keyword updatability, where a tagged keyword can be updated upon the receiver's request.…”