File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Non-Interactive Multi-Client Searchable Encryption: Realization and Implementation

TitleNon-Interactive Multi-Client Searchable Encryption: Realization and Implementation
Authors
KeywordsProtocols
Encryption
Databases
Servers
Sun
Issue Date2020
PublisherIEEE. 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, 2020, Epub 2020-02-13 How to Cite?
AbstractIn 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 Identifierhttp://hdl.handle.net/10722/283002
ISSN
2019 Impact Factor: 6.864
2015 SCImago Journal Rankings: 1.155

 

DC FieldValueLanguage
dc.contributor.authorSun, SF-
dc.contributor.authorZuo, C-
dc.contributor.authorLiu, JK-
dc.contributor.authorSakzad, A-
dc.contributor.authorSteinfeld, R-
dc.contributor.authorYuen, TH-
dc.contributor.authorYuan, X-
dc.contributor.authorGu, D-
dc.date.accessioned2020-06-05T06:23:56Z-
dc.date.available2020-06-05T06:23:56Z-
dc.date.issued2020-
dc.identifier.citationIEEE Transactions on Dependable and Secure Computing, 2020, Epub 2020-02-13-
dc.identifier.issn1545-5971-
dc.identifier.urihttp://hdl.handle.net/10722/283002-
dc.description.abstractIn 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.languageeng-
dc.publisherIEEE. The Journal's web site is located at http://www.ieee.org/portal/pages/pubs/transactions/tdsc.html-
dc.relation.ispartofIEEE Transactions on Dependable and Secure Computing-
dc.rightsIEEE 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.subjectProtocols-
dc.subjectEncryption-
dc.subjectDatabases-
dc.subjectServers-
dc.subjectSun-
dc.titleNon-Interactive Multi-Client Searchable Encryption: Realization and Implementation-
dc.typeArticle-
dc.identifier.emailYuen, TH: johnyuen@hku.hk-
dc.identifier.authorityYuen, TH=rp02426-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TDSC.2020.2973633-
dc.identifier.hkuros310226-
dc.identifier.volumeEpub 2020-02-13-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats