1. Identity-Certifying Authority-Aided Identity-Based Searchable Encryption Framework in Cloud Systems
- Author
-
Raylin Tso, Yu-Chi Chen, Masahiro Mambo, Yi-Fan Tseng, and Zi-Yuan Liu
- Subjects
Scheme (programming language) ,Authenticated encryption ,Computer Networks and Communications ,Computer science ,business.industry ,Data_MISCELLANEOUS ,Cloud computing ,Encryption ,Computer security ,computer.software_genre ,Computer Science Applications ,System model ,Upload ,Control and Systems Engineering ,Identity (object-oriented programming) ,Confidentiality ,Electrical and Electronic Engineering ,business ,computer ,Information Systems ,computer.programming_language - Abstract
In the era of cloud computing, massive quantities of data are encrypted and uploaded to the cloud to realize a variety of applications and services while protecting user confidentiality. Accordingly, the formulation of methods for efficiently searching encrypted data has become a critical problem. Public-key encryption with keyword search is an efficient solution that allows the data owner to generate encrypted keywords for a given document while also allowing the data user to generate the corresponding trapdoor for searching. Huang and Li proposed a public-key authenticated encryption with keyword search (PAEKS) scheme to resist keyword guessing attacks, where the data owner not only encrypts keywords but also authenticates them. However, existing PAEKS-related schemes carry a tradeoff between efficiency, storage cost, and security. In this article, we introduce a novel framework called identity-certifying authority-aided identity-based searchable encryption, which has the advantage of reducing storage space while remaining the efficiency and security. We formally define the system model and desired security requirements to represent attacks in a real scenario. In addition, we propose a provably secure scheme based on the gap bilinear Diffie–Hellman assumption and experimentally evaluate our scheme in terms of its performance and theoretical features against its state-of-the-art counterparts.
- Published
- 2022