Multi-Key Searchable Encryption with Designated Server

Abstract

This paper presents a novel multi-key searchable encryption with designated server based on the RA Popa’s multi-key searchable encryption and Rhee’s PEKS. As far as we know, it is the first multi-key searchable encryption based on asymmetric cryptographic approach. One advantage of our proposed scheme is that it allows a user to provide a single trapdoor to the server, though it allows the designated server to search for that trapdoor’s word in documents encrypted with different keys. Another advantage of our scheme is that only the designated server can identify whether a trapdoor matches the encrypted data or not.

Keywords:

• Searchable encryption
• multi-key
• designated server

Acknowledgements

The work was jointly supported by the National Social Science Foundation of China (No.14CTQ026), the National Natural Science Foundation of China (No.61472464, No.61272400), the Chongqing Research Program of Application Foundation and Advanced Technology (No.cstc2014jcyjA40028), Natural Science Foundation Project of CQ CSTC of P. R. China (No.cstc2011jjA40031) and the Scientific and Technological Research Program of Chongqing Municipal Education Commission (KJ120504), the Research Fund of Chongqing University of Posts and Telecommunications (No.A2011-52), the Natural Science Foundation of Shandong Province, China (No.ZR2015FL024), and the IOT Development Fund of Ministry of Industry and Information Technology of China(-2012-2-5).

Disclosure statement

No potential conflict of interest was reported by the authors.