Skip to main navigation Skip to search Skip to main content

A verifiable proxy re-encryption with keyword search without random oracle

  • Lifeng Guo
  • , Bo Lu
  • , Xiangyu Li
  • , He Xu
  • Shanxi University
  • Beijing University of Posts and Telecommunications

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

Abstract

In 2010, Yau et al. introduced the notion of searchable proxy re-encryption with a designated tester (Re-dPEKS) and proposed a concrete construction of bidirectional Re-dPEKS which was secure in the random oracle model. In this paper, we present an efficient Re-dPEKS scheme which is proven secure against an adaptive chosen keyword attack in the adaptive corruption model without resorting to random oracle. Furthermore, our scheme is proven to resist off-line keyword guessing attacks.

Original languageEnglish
Title of host publicationProceedings - 9th International Conference on Computational Intelligence and Security, CIS 2013
Pages474-478
Number of pages5
DOIs
StatePublished - 2013
Externally publishedYes
Event9th International Conference on Computational Intelligence and Security, CIS 2013 - Emeishan, China
Duration: 14 Dec 201315 Dec 2013

Publication series

NameProceedings - 9th International Conference on Computational Intelligence and Security, CIS 2013

Conference

Conference9th International Conference on Computational Intelligence and Security, CIS 2013
Country/TerritoryChina
CityEmeishan
Period14/12/1315/12/13

Keywords

  • Bilinear pairing
  • Chosen-ciphertext security
  • Proxy re-encryption
  • Proxy re-encryption with keyword search

Fingerprint

Dive into the research topics of 'A verifiable proxy re-encryption with keyword search without random oracle'. Together they form a unique fingerprint.

Cite this