Adaptive secure multicast in wireless networks

被引:22
作者
Han, Yiliang [1 ,2 ]
Gui, Xiaolin [1 ]
机构
[1] Xi An Jiao Tong Univ, Dept Comp Sci & Technol, Xian 710049, Peoples R China
[2] Engn Coll Armed Police Force, Keylab Networks & Informat Secur, Dept Elect Technol, Xian 710086, Peoples R China
关键词
secure multicast; secure group communication; signcryption; multi-recipient generalized signcryption; IDENTITY-BASED SIGNCRYPTION; PUBLIC-KEY CRYPTOSYSTEM; PROVABLY SECURE; MANAGEMENT; SCHEME; ENCRYPTION; EFFICIENT; SIGNATURE; PROOFS;
D O I
10.1002/dac.1023
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Secure multicast is one of the majority services in the near future. The frameworks for IP multicast cannot be directly applied in wireless networks. To address the natural issues of wireless multicast and enhance the efficiency, an adaptive secure multicast framework based on a new primitive called multi-recipient generalized signcryption and a multi-recipient generalized signcryption scheme based on the gap Diffie-Hellman problem (MGSC-GDH) are proposed. The key technologies to construct a high-performance adaptive scheme including identification function, randomness reusing are investigated. The framework provides separate or joint encryption and signature functions according to users' identities and requirements transparently, and has the ability to aggregate multiple unicast besides the common multicast service. Therefore, overheads are reduced sharply for multiple functions which are provided with a single primitive. By the precise reduction, the gap-bridge between the security of a base scheme and the corresponding multi-recipient generalized signcryption scheme is built, which is a direct measure to quantify the security. Analysis shows that MGSC-GDH is a semantic secure multi-recipient generalized signcryption scheme and more efficient than other similar schemes in computational and communicational aspects. It is suitable for dynamic environment for rekeying is avoided when membership changes. Copyright (C) 2009 John Wiley & Sons, Ltd.
引用
收藏
页码:1213 / 1239
页数:27
相关论文
共 52 条
[1]  
An JH, 2002, LECT NOTES COMPUT SC, V2332, P83
[2]  
[Anonymous], 1999, 2627 IETF RFC
[3]  
[Anonymous], 1999, X962 ANSI
[4]  
[Anonymous], 1997, 2093 IETF RFC
[5]   Formal proofs for the security of signcryption [J].
Baek, Joonsang ;
Steinfeld, Ron ;
Zheng, Yuliang .
JOURNAL OF CRYPTOLOGY, 2007, 20 (02) :203-235
[6]  
Baudron O, 2000, LECT NOTES COMPUT SC, V1853, P499
[7]  
BAUGHER M, 2003, 3547 IETF RFC
[8]  
Bellare M, 2003, LECT NOTES COMPUT SC, V2567, P85
[9]  
Bellare M, 2000, LECT NOTES COMPUT SC, V1807, P259
[10]  
Bellare M., 1993, C COMPUTER COMMUNICA, P62