Multi-receiver certificate-based encryption and application to public key broadcast encryption

被引:13
作者
Sur, Chul [1 ]
Jung, Chae Duk [1 ]
Rhee, Kyung Hyune [1 ]
机构
[1] Pukyong Natl Univ, 599-1 Daeyon3 Dong, Pusan 608737, South Korea
来源
2007 ECSIS SYMPOSIUM ON BIO-INSPIRED, LEARNING, AND INTELLIGENT SYSTEMS FOR SECURITY, PROCEEDINGS | 2007年
关键词
multi-receiver encryption; certificate based encryption; key escrow free; pubic key broadcast encryption; bilinear pairing;
D O I
10.1109/BLISS.2007.23
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we firstly introduce the notion of multi-receiver certificate-based encryption that, avoids the inherent key escrow problem while preserving the implicit certification of multi-receiver identity-based encryption. We also construct a highly efficient multi-receiver certificate-based encryption scheme which eliminates pairing computation to encrypt a message for multiple receivers. Moreover the proposed scheme only needs one pairing computation for decrypting the ciphertext. We compare our scheme with the most efficient multi-receiver identity-based encryption scheme[2] in terms of the computational point of view, and show that our scheme provides better efficiency than [2]. Finally, we discuss how to properly transform our scheme into a new public key broadcast encryption scheme based on subset-cover framework, which enjoys the advantages of certificate-based encryption.
引用
收藏
页码:35 / +
页数:2
相关论文
共 16 条
[1]  
Al-Riyami SS, 2005, LECT NOTES COMPUT SC, V3386, P398
[2]  
Baek J, 2005, LECT NOTES COMPUT SC, V3386, P380
[3]  
Bellare M, 2003, LECT NOTES COMPUT SC, V2567, P85
[4]  
BELLARE M, 1993, ACM C COMP COMM SEC, P62
[5]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P223
[6]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P56
[7]  
BONEH D, 2001, LNCS, V2139
[8]  
CHEN L, 2005, 2005226 CRYPT EPR AR
[9]  
DODIS Y, 2002, ACM DRM
[10]   A PUBLIC KEY CRYPTOSYSTEM AND A SIGNATURE SCHEME BASED ON DISCRETE LOGARITHMS [J].
ELGAMAL, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (04) :469-472