HIERARCHICAL IDENTITY-BASED PROXY RE-ENCRYPTION WITHOUT RANDOM ORACLES

被引:4
作者
Ren, Yanli [1 ,2 ]
Gu, Dawu [1 ]
Wang, Shuozhong [2 ]
Zhang, Xinpengu [2 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200240, Peoples R China
[2] Shanghai Univ, Sch Commun & Informat Engn, Shanghai 200072, Peoples R China
关键词
Hierarchical; identity-based encryption; proxy re-encryption; multiple re-encryptions; without random oracles;
D O I
10.1142/S0129054110007726
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In a proxy re-encryption scheme, a semi-trusted proxy converts a ciphertext for Alice into a ciphertext for Bob without seeing the underlying plaintext. A number of solutions have been proposed in public key settings. Hierarchical identity-based cryptography is a generalization of identity-based encryption that mirrors an organizational hierarchy, which allows a root private key generator to distribute the work load by delegating private key generation and identity authentication to lower-level private key generators. In this paper, we propose a hierarchical identity-based proxy re-encryption (HIBPRE) scheme which achieves IND-PrID-CCA2 security without random oracles. This is the first HIBPRE scheme up to now, and our scheme satisfies unidirectionality, non-interactivity and permits multiple re-encryptions.
引用
收藏
页码:1049 / 1063
页数:15
相关论文
共 19 条
[1]  
[Anonymous], 10 ANN NETW DISTR SY
[2]  
[Anonymous], LNCS
[3]  
[Anonymous], 14 ACM C COMP COMM S
[4]  
[Anonymous], 12 ANN NETW DISTR SY
[5]  
Bellare M, 2004, LECT NOTES COMPUT SC, V3027, P171
[6]  
Blaze M, 1998, LECT NOTES COMPUT SC, V1403, P127, DOI 10.1007/BFb0054122
[7]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P223
[8]   Identity-based encryption from the Weil pairing [J].
Boneh, D ;
Franklin, M .
SIAM JOURNAL ON COMPUTING, 2003, 32 (03) :586-615
[9]   The random oracle methodology, revisited [J].
Canetti, R ;
Goldreich, O ;
Halevi, S .
JOURNAL OF THE ACM, 2004, 51 (04) :557-594
[10]  
Chu CK, 2007, LECT NOTES COMPUT SC, V4779, P189