论文信息 - On Improving the Performance of Public Key Encryption with Keyword Search

On Improving the Performance of Public Key Encryption with Keyword Search

Searchable encryption enables users to search over encrypted data without revealing original data. The public key encryption with keyword search (PEKS) is a construction of searchable encryption proposed by Boneh et al. using a public key system. In this paper, we investigate Boneh et al's PEKS construction under the case of full text search, and We design a new index structure which can accelerate the search procedure with a large keywords amount. We also analyze the security of the new construction in the random oracle model.

[1] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[2] Rafail Ostrovsky,et al. Searchable symmetric encryption: improved definitions and efficient constructions , 2006, CCS '06.

[3] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[4] Eu-Jin Goh,et al. Secure Indexes , 2003, IACR Cryptol. ePrint Arch..

[5] Antoine Joux,et al. The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems , 2002, ANTS.

[6] Rafail Ostrovsky,et al. Public Key Encryption with Keyword Search , 2004, EUROCRYPT.

[7] Mihir Bellare,et al. Efficiently-Searchable and Deterministic Asymmetric Encryption , 2006 .

[8] Kristin E. Lauter,et al. Cryptographic Cloud Storage , 2010, Financial Cryptography Workshops.