DocumentCode
3368596
Title
A Verifiable Proxy Re-encryption with Keyword Search without Random Oracle
Author
Lifeng Guo ; Bo Lu ; Xiangyu Li ; He Xu
Author_Institution
Sch. of Comput. & Inf. Technol., Shanxi Univ., Taiyuan, China
fYear
2013
fDate
14-15 Dec. 2013
Firstpage
474
Lastpage
478
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.
Keywords
public key cryptography; PEKS; adaptive chosen keyword attack; adaptive corruption model; bidirectional re-dPEKS construction; keyword search; offline keyword guessing attack resistance; public key encryption; searchable proxy reencryption; verifiable proxy reencryption; Adaptation models; Educational institutions; Games; Keyword search; Public key; bilinear pairing; chosen-ciphertext security; proxy re-encryption; proxy re-encryption with keyword search;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Security (CIS), 2013 9th International Conference on
Conference_Location
Leshan
Print_ISBN
978-1-4799-2548-3
Type
conf
DOI
10.1109/CIS.2013.106
Filename
6746442
Link To Document