关键词: 可搜索加密, 匿名性, 双线性Diffie-Hellman问题, 安全性证明

Abstract: In 2004, Boneh using anonymous hierarchical identity-based encryption scheme constructed a public key searchable encryption scheme（Public Key Encryption with Keyword Search shorthand for PEKS）, which was proposed to solve the difficult task of the encrypted data to be retrieved under certain circumstances. For the existing searchable encryption schemes, the only purpose is to protect the information of keyword. In fact, a genuine safety PEKS should provide not only the security of keywords but also the security of users. So that, on the basis of existing anonymous hierarchical identity-based encryption scheme（ANO-IBE）, the scheme of Anonymous Identity Based Public Key Encryption with Keyword Search（ANO-IBEKS）is firstly proposed. The semantic security proof of ANO-IBEKS in the random oracle model is given. The program can provide the function of protecting both the information of keyword and identity of the users under the circumstance of a lot of data to the third party server storage（such as network storage）. In this scheme, severs cannot track exactly which user queries relevant information.

Key words: Public Key Encryption with Keyword Search（PEKS）, anonymity, Bilinear Diffie-Hellman（BDH）, security proof