An authenticated self-healing key distribution scheme based on bilinear pairings

Authors:
Biming Tian;Elizabeth Chang;Tharam S. Dillon;Song Han;Farookh K. Hussain
Affiliations:
DEBI Institute Curtin University of Technology, Australia;DEBI Institute Curtin University of Technology, Australia;DEBI Institute Curtin University of Technology, Australia;DEBI Institute Curtin University of Technology, Australia;DEBI Institute Curtin University of Technology, Australia
Venue:
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Year:
2009

Citing 5
Cited 0

Identity-based cryptosystems and signature schemes

Proceedings of CRYPTO 84 on Advances in cryptology
Self-Healing Key Distribution with Revocation

SP '02 Proceedings of the 2002 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
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
Efficient threshold self-healing key distribution with sponsorization for infrastructureless wireless networks

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Self-healing key distribution mechanism can be utilized for distributing session keys over an unreliable network. A self-healing key distribution scheme using bilinear pairings is proposed in this paper. As far as we know, it is the first pairing-based authenticated self-healing key distribution scheme. The scheme achieves a number of excellent properties. Firstly, the users can check the integrity and correctness of the ciphertext before carrying out more complex key recovery operations thus fruitless work can be avoided. Secondly, the scheme is collusion-free for any coalition of non-authorized users. Thirdly, the private key has nothing to do with the number of revoked users and can be reused as long as it is not disclosed. Finally, the storage overhead for each user is a constant.