Fully CCA2 secure identity based broadcast encryption without random oracles

被引:35
作者
Ren, Yanli [1 ]
Gu, Dawu [1 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200240, Peoples R China
基金
高等学校博士学科点专项科研基金;
关键词
Cryptography; Identity based; Broadcast encryption; IND-ID-CCA2; secure; Without random oracles; CONSTANT-SIZE CIPHERTEXTS;
D O I
10.1016/j.ipl.2009.01.017
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In broadcast encryption schemes, a broadcaster encrypts messages and transmits them to some subset S of users who are listening to a broadcast channel. Any user in S can use his private key to decrypt the broadcast. An identity based cryptosystem is a public key cryptorsystem where the public key can be represented as an arbitrary string. In this paper, we propose the first identity based broadcast encryption (IBBE) scheme that is IND-ID-CCA2 secure without random oracles. The public key and ciphertext are constant size, and the private key size is linear in the total number of receivers. To the best of our knowledge, it is the first IBBE scheme that is fully CCA2 secure without random oracles. Moreover, our IBBE scheme is collusion resistant for arbitrarily large collusion of users. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:527 / 533
页数:7
相关论文
共 17 条
[1]  
[Anonymous], 2001, LECT NOTES COMPUTER
[2]  
Boneh D, 2005, LECT NOTES COMPUT SC, V3621, P258
[3]   Hierarchical identity based encryption with constant size ciphertext [J].
Boneh, D ;
Boyen, X ;
Goh, EJ .
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2005,PROCEEDINGS, 2005, 3494 :440-456
[4]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3152, P443
[5]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P223
[6]   Identity-based encryption from the Weil pairing [J].
Boneh, D ;
Franklin, M .
SIAM JOURNAL ON COMPUTING, 2003, 32 (03) :586-615
[7]   Chosen-ciphertext security from identity-based encryption [J].
Canetti, R ;
Halevi, S ;
Katz, J .
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2004, PROCEEDINGS, 2004, 3027 :207-222
[8]  
Canetti R., 1998, Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, P131, DOI 10.1145/276698.276721
[9]  
Cocks C.C., 2001, Lecture Notes in Computer Science, P360, DOI [DOI 10.1007/3-540-45325-3, DOI 10.1007/3-540-45325-332]
[10]  
Delerablée C, 2007, LECT NOTES COMPUT SC, V4833, P200