Design of secure multicast key management schemes with communication budget constraint
暂无分享,去创建一个
We study the problem of distributing cryptographic keys to a secure multicast group with a single sender and multiple receivers. We show that the problem of designing key distribution model with specific communication overhead can be posed as a constraint optimization problem. Using the formulation, we show how to minimize the number of keys to be stored by the group controller. An explicit design algorithm with given key update communication budget is also presented.
[1] Mohamed G. Gouda,et al. Secure group communications using key graphs , 1998, SIGCOMM '98.
[2] Eric J. Harder,et al. Key Management for Multicast: Issues and Architectures , 1999, RFC.
[3] Ran Canetti,et al. Efficient Communication-Storage Tradeoffs for Multicast Encryption , 1999, EUROCRYPT.
[4] Mohamed G. Gouda,et al. Secure group communications using key graphs , 2000, TNET.