Proxy Re-encryption with Keyword Search: New Definitions and Algorithms

We propose a new definition for searchable proxy re-encryption scheme (Re-PEKS), define the first known searchable proxy re-encryption scheme with a designated tester (Re-dPEKS), and then give concrete constructions of both Re-PEKS and Re-dPEKS schemes that are secure in the random oracle model.

Saved in:
Bibliographic Details
Published inSecurity Technology, Disaster Recovery and Business Continuity Vol. 122; pp. 149 - 160
Main Authors Yau, Wei-Chuen, Phan, Raphael C. -W., Heng, Swee-Huay, Goi, Bok-Min
Format Book Chapter
LanguageEnglish
Published Germany Springer Berlin / Heidelberg 2010
Springer Berlin Heidelberg
SeriesCommunications in Computer and Information Science
Subjects
public key encryption with keyword search
random oracle model
Searchable proxy re-encryption
Online AccessGet full text
ISBN3642176097
9783642176098
ISSN1865-0929
1865-0937
DOI10.1007/978-3-642-17610-4_17

Cover

More Information
Summary:We propose a new definition for searchable proxy re-encryption scheme (Re-PEKS), define the first known searchable proxy re-encryption scheme with a designated tester (Re-dPEKS), and then give concrete constructions of both Re-PEKS and Re-dPEKS schemes that are secure in the random oracle model.
Bibliography:Research supported by BGM Fund (MOSTI/BGM/R&D/500-2/8).
ISBN:3642176097
9783642176098
ISSN:1865-0929
1865-0937
DOI:10.1007/978-3-642-17610-4_17