Elements of information theory
Elements of information theory
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On key distribution via true broadcasting
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
New protocols for third-party-based authentication and secure broadcast
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
On Some Methods for Unconditionally Secure Key Distributionand Broadcast Encryption
Designs, Codes and Cryptography - Special issue: selected areas in cryptography I
Secure group communications using key graphs
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Some New Results on Key Distribution Patterns and BroadcastEncryption
Designs, Codes and Cryptography
New constructions for multicast re-keying schemes using perfect hash families
Proceedings of the 7th ACM conference on Computer and communications security
Reliable group rekeying: a performance analysis
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Revocation and Tracing Schemes for Stateless Receivers
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Self-Healing Key Distribution with Revocation
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
ELK, a New Protocol for Efficient Large-Group Key Distribution
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
Efficient self-healing group key distribution with revocation capability
Proceedings of the 10th ACM conference on Computer and communications security
Design of Self-Healing Key Distribution Schemes
Designs, Codes and Cryptography
Sliding-window self-healing key distribution
Proceedings of the 2003 ACM workshop on Survivable and self-regenerative systems: in association with 10th ACM Conference on Computer and Communications Security
On the security of group communication schemes
Journal of Computer Security - Special Issue on Security of Ad-hoc and Sensor Networks
Efficient communication-storage tradeoffs for multicast encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
On threshold self-healing key distribution schemes
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Improved Constant Storage Self-healing Key Distribution with Revocation in Wireless Sensor Network
Information Security Applications
A Secure Group Rekeying Scheme with Compromised Node Revocation in Wireless Sensor Networks
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
A New Constant Storage Self-healing Key Distribution with Revocation in Wireless Sensor Networks
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Generalized self-healing key distribution using vector space access structure
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
A mutual-healing key distribution scheme in wireless sensor networks
Journal of Network and Computer Applications
Collusion attack on a self-healing key distribution with revocation in wireless sensor networks
WISA'10 Proceedings of the 11th international conference on Information security applications
KALwEN+: practical key management schemes for gossip-based wireless medical sensor networks
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Access polynomial based self-healing key distribution with improved security and performance
InfoSecHiComNet'11 Proceedings of the First international conference on Security aspects in information technology
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Collusion resistant self-healing key distribution in mobile wireless networks
International Journal of Wireless and Mobile Computing
Security and Communication Networks
Hi-index | 0.00 |
Security of group communication for large mobile wireless sensor network hinges on efficient key distribution and key management mechanism. As the wireless medium is characterized by its lossy nature, reliable communication cannot be assumed in the key distribution schemes. Therefore, self-healing is a good property for key distribution in wireless applications. The main idea of self-healing key distribution scheme is that even if during a certain session some broadcast messages are lost due to network faults, the users are capable of recovering lost session keys on their own, without requesting additional transmission from the group manager. The only requirement for a user to recover the lost session keys, is its membership in the group both before and after the sessions in which the broadcast packets containing the keys are sent. Self-healing approach of key distribution is stateless in the sense that a user who has been off-line for some period is able to recover the lost session keys immediately after coming back on-line. In this paper, we propose two constructions for scalable self-healing key distribution with trevocation capability. The novelty of our constructions are that we apply a different and more efficient self-healing mechanism compared to the ones in the literature using one-way key chain. The main improvements that our proposed schemes achieve over previous approaches are(a)communication bandwidth reduces from O((tj+ j茂戮驴 t茂戮驴 1)logq) to O((t+ 1)logq), and(b)computation costs for our first and second constructions reduce from O(2tj+ j) to O(2t+ 1) and O(2(t2+ t)) respectively,where mis the maximum number of sessions, jis the current session number, tis the maximum number of compromised group members that may collude and qis a large prime number. We achieve this result without any increase in the storage complexity. The schemes are scalable to very large groups in highly mobile, volatile and hostile network. We prove in an appropriate security framework that our constructions are computationally secure and achieve both forward secrecy and backward secrecy.