Non-Interactive Multi-Client Searchable Encryption: Realization and Implementation
- 13 February 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 19 (1) , 452-467
Abstract
In this work, we introduce a new mechanism for constructing multi-client searchable encryption (SE). By tactfully leveraging the RSA-function, we propose the first multi-client SE protocol that successfully avoids per-query interaction between data owner and client. Therefore, our approach significantly reduces the communication cost by eliminating the need for data owner to authorize client queries at all times. To be compatible with the RSA-based approach, we also present a deterministic and memory-efficient ‘keyword to prime’ hash function, which may be of independent interest. Further, to improve efficiency, we put forward a more generic construction from set-constrained PRFs. The construction not only inherits the merits of our first protocol, but also achieves an enhanced security (against untrusted clients), where colluding attack among clients is also taken into account. Both protocols are instantiated via the recent representative SE protocol by Cash et al. with support of boolean queries. At last, we implement our proposed protocols and comprehensively evaluate their performance to demonstrate their practicability and scalability.Keywords
Funding Information
- Natural Science Foundation of China (61802255)
- Security Protection Technology of Embedded Components and Control Units in Power System Terminal (2019GW-12)
- Data61-Monash Collaborative Research Project
- Australian Research Council (DP180102199, DP200103308)
This publication has 32 references indexed in Scilit:
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions2015
- Constrained Pseudorandom Functions and Their Applications2013
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries2013
- Structured Encryption and Controlled Disclosure2010
- Shared and Searchable Encrypted Data for Untrusted Servers2008
- Private Query on Encrypted Data in Multi-user Settings2008
- Public Key Encryption with Keyword Search2004
- Secure Conjunctive Keyword Search over Encrypted Data2004
- Secure Hash-and-Sign Signatures Without the Random Oracle1999
- How to construct random functionsJournal of the ACM, 1986