File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TDSC.2020.2973633
- Scopus: eid_2-s2.0-85123604479
- WOS: WOS:000742730400032
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Non-Interactive Multi-Client Searchable Encryption: Realization and Implementation
Title | Non-Interactive Multi-Client Searchable Encryption: Realization and Implementation |
---|---|
Authors | |
Keywords | Protocols Encryption Databases Servers Sun |
Issue Date | 2022 |
Publisher | IEEE. The Journal's web site is located at http://www.ieee.org/portal/pages/pubs/transactions/tdsc.html |
Citation | IEEE Transactions on Dependable and Secure Computing, 2022, v. 19 n. 1, p. 452-467 How to Cite? |
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. |
Persistent Identifier | http://hdl.handle.net/10722/283002 |
ISSN | 2023 Impact Factor: 7.0 2023 SCImago Journal Rankings: 2.222 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sun, SF | - |
dc.contributor.author | Zuo, C | - |
dc.contributor.author | Liu, JK | - |
dc.contributor.author | Sakzad, A | - |
dc.contributor.author | Steinfeld, R | - |
dc.contributor.author | Yuen, TH | - |
dc.contributor.author | Yuan, X | - |
dc.contributor.author | Gu, D | - |
dc.date.accessioned | 2020-06-05T06:23:56Z | - |
dc.date.available | 2020-06-05T06:23:56Z | - |
dc.date.issued | 2022 | - |
dc.identifier.citation | IEEE Transactions on Dependable and Secure Computing, 2022, v. 19 n. 1, p. 452-467 | - |
dc.identifier.issn | 1545-5971 | - |
dc.identifier.uri | http://hdl.handle.net/10722/283002 | - |
dc.description.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. | - |
dc.language | eng | - |
dc.publisher | IEEE. The Journal's web site is located at http://www.ieee.org/portal/pages/pubs/transactions/tdsc.html | - |
dc.relation.ispartof | IEEE Transactions on Dependable and Secure Computing | - |
dc.rights | IEEE Transactions on Dependable and Secure Computing. Copyright © IEEE. | - |
dc.rights | ©20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | - |
dc.subject | Protocols | - |
dc.subject | Encryption | - |
dc.subject | Databases | - |
dc.subject | Servers | - |
dc.subject | Sun | - |
dc.title | Non-Interactive Multi-Client Searchable Encryption: Realization and Implementation | - |
dc.type | Article | - |
dc.identifier.email | Yuen, TH: johnyuen@hku.hk | - |
dc.identifier.authority | Yuen, TH=rp02426 | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/TDSC.2020.2973633 | - |
dc.identifier.scopus | eid_2-s2.0-85123604479 | - |
dc.identifier.hkuros | 310226 | - |
dc.identifier.volume | 19 | - |
dc.identifier.issue | 1 | - |
dc.identifier.spage | 452 | - |
dc.identifier.epage | 467 | - |
dc.identifier.isi | WOS:000742730400032 | - |
dc.publisher.place | United States | - |
dc.identifier.issnl | 1545-5971 | - |