Revocable public key encryption with authorized keyword search

Wujing Xu, Xiaolei Dong, Zhenfu Cao, Jiachen Shen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

In this paper, we propose a revocable public key encryption with authorized keyword search (RPEAKS) scheme. In RPEAKS, data and keywords are encrypted with one public key, users without corresponding private key need authorization from the manager if they want to search through the ciphertexts. The manager authorizes users by distributing authorized tokens to them and is able to revoke a user's search right when needed. Then we present a concrete RPEAKS construction, which is featured with constant size tokens and efficient revocation. Security analysis shows that the scheme is semantically secure against chosen keyword attack and is trapdoor unforgeability.

Original languageEnglish
Title of host publicationProceedings of 2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference, ITNEC 2019
EditorsBing Xu
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages857-860
Number of pages4
ISBN (Electronic)9781538662434
DOIs
StatePublished - Mar 2019
Event3rd IEEE Information Technology, Networking, Electronic and Automation Control Conference, ITNEC 2019 - Chengdu, China
Duration: 15 Mar 201917 Mar 2019

Publication series

NameProceedings of 2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference, ITNEC 2019

Conference

Conference3rd IEEE Information Technology, Networking, Electronic and Automation Control Conference, ITNEC 2019
Country/TerritoryChina
CityChengdu
Period15/03/1917/03/19

Keywords

  • Authorized
  • Key-word search
  • Public key encryption
  • Revocable

Fingerprint

Dive into the research topics of 'Revocable public key encryption with authorized keyword search'. Together they form a unique fingerprint.

Cite this