Multicast security: A taxonomy and some efficient constructions

被引:307
作者
Canetti, R [1 ]
Garay, J [1 ]
Itkis, G [1 ]
Micciancio, D [1 ]
Naor, M [1 ]
Pinkas, B [1 ]
机构
[1] IBM Corp, TJ Watson Res Ctr, Armonk, NY 10504 USA
来源
IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW | 1999年
关键词
D O I
10.1109/INFCOM.1999.751457
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multicast communication is becoming the basis for a growing number of applications. It is therefore critical to provide sound security mechanisms for multicast communication. Yet, existing security protocols for multicast offer only partial solutions. We first present a taxonomy of multicast scenarios on the Internet and point out relevant security concerns. Next we address two major security problems of multicast communication: source authentication, and key revocation. Maintaining authenticity in multicast protocols is a much more complex problem than for unicast; in particular, known solutions are prohibitively inefficient in many cases. We present a solution that is reasonable for a range of scenarios. Our approach can be regarded as a 'midpoint' between traditional Message Authentication Codes and digital signatures. We also present an improved solution to the key revocation problem.
引用
收藏
页码:708 / 716
页数:9
相关论文
共 29 条
[1]  
ALBANESE A, 1996, IEEE T INF TH, V42
[2]  
ALON N, 1991, EXTREMAL PROBLEMS FI, P39
[3]  
BALLARDIE AJ, 1995, THESIS U COLLEGE LON
[4]  
Bellare M., 1996, LNCS, V1109
[5]   HOW TO GENERATE CRYPTOGRAPHICALLY STRONG SEQUENCES OF PSEUDO-RANDOM BITS [J].
BLUM, M ;
MICALI, S .
SIAM JOURNAL ON COMPUTING, 1984, 13 (04) :850-864
[6]  
Blundo C., 1993, LNCS, V740, P471
[7]  
CANETTI R, 1997, CRYPTOBYTES, V3
[8]  
CANETTI R, 1998, TAXONOMY MULTICAST S
[9]  
DESMEDT Y, 1990, LECT NOTES COMPUT SC, V435, P307
[10]  
DESMEDT Y, IEEE INFOCOM 92, P2045