Proxy re-encryption with keyword search

被引:166
作者
Shao, Jun [2 ]
Cao, Zhenfu [1 ]
Liang, Xiaohui [1 ]
Lin, Huang [1 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai, Peoples R China
[2] Zhejiang Gongshang Univ, Sch Comp & Informat Engn, Hangzhou, Zhejiang, Peoples R China
基金
中国国家自然科学基金;
关键词
Proxy re-encryption with keyword search; Proxy re-encryption; Public key encryption with keyword search; Random oracle model; mDBDH; IDENTITY-BASED ENCRYPTION;
D O I
10.1016/j.ins.2010.03.026
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We introduce a new cryptographic primitive, called proxy re-encryption with keyword search, which is motivated by the following scenario in email systems: Charlie sends an encrypted email, which contains some keywords, such as "urgent", to Alice under Alice's public key, and Alice delegates her decryption rights to Bob via her mail server. The desired situations are: (1) Bob can decrypt mails delegated from Alice by using only his private key, (2) Bob's mail gateway, with a trapdoor from Bob, can test whether the email delegated from Alice contains some keywords, such as "urgent", (3) Alice and Bob do not wish to give the mail server or mail gateway the access to the content of emails. The function of proxy re-encryption with keyword search (PRES) is the combination of proxy re-encryption (PRE) and public key encryption with keyword search (PEKS). However, a PRES scheme cannot be obtained by directly combining those two schemes, since the resulting scheme is no longer proven secure in our security model. In this paper, a concrete construction is proposed, which is proven secure in the random oracle model, based on the modified Decisional Bilinear Diffie-Hellman assumption. (C) 2010 Elsevier Inc. All rights reserved.
引用
收藏
页码:2576 / 2587
页数:12
相关论文
共 18 条
[1]  
Abdalla M, 2005, LECT NOTES COMPUT SC, V3621, P205
[2]  
[Anonymous], INTERNET SOC ISOC ND
[3]  
[Anonymous], ACM CCS 2007
[4]  
Ateniese G., 2006, ACM Transactions on Information and Systems Security, V9, P1, DOI 10.1145/1127345.1127346
[5]  
Ateniese G., 2005, P 12 ACM C COMP COMM, P310
[6]  
Bellare M, 2007, LECT NOTES COMPUT SC, V4622, P535
[7]  
Blaze M, 1998, LECT NOTES COMPUT SC, V1403, P127, DOI 10.1007/BFb0054122
[8]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
[9]   Identity-based encryption from the Weil pairing [J].
Boneh, D ;
Franklin, M .
SIAM JOURNAL ON COMPUTING, 2003, 32 (03) :586-615
[10]  
BONEH D, 2001, LECT NOTES COMPUTER, V2139, P231