Abstract
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 t revocation 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 m is the maximum number of sessions, j is the current session number, t is the maximum number of compromised group members that may collude and q is 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.
Keywords
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Berkovits, S.: How to Broadcast a Secret. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 535–541. Springer, Heidelberg (1991)
Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., Yung, M.: Perfectly-Secure Key Distribution for Dynamic Conferences. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 471–486. Springer, Heidelberg (1993)
Blundo, C., Frota Mattos, L.A., Stinson, D.R.: Trade-offs between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 387–400. Springer, Heidelberg (1996)
Blundo, C., D’Arco, P., Santis, A., Listo, M.: Design of Self-healing Key Distribution Schemes. Design Codes and Cryptology 32, 15–44 (2004)
Blundo, C., D’Arco, P., De Santis, A.: Definitions and Bounds for Self-Healing Key Distribution Schemes. In: DÃaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 234–245. Springer, Heidelberg (2004)
Canetti, R., Garay, J., Itkis, G., Micciancio, D., Naor, M., Pinkas, B.: Multicast Security: A Taxonomy and Some Efficient Constructions. In: IEEE INFOCOMM’99 (1999)
Canetti, R., Malkin, T., Nissim, K.: Efficient Communication-Storage Tradeoffs for Multicast Encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 459–474. Springer, Heidelberg (1999)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, Chichester (1991)
Dutta, R., Mukhopadhyay, S.: Improved Self-Healing Key Distribution with Revocation in Wireless Sensor Network. In: the proceeding of the IEEE Wireless Communications and Networking Conference (WCNC 2007), will be held in Hong Kong, China, to appear (2007)
Fiat, A., Naor, M.: Broadcast Encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480–491. Springer, Heidelberg (1994)
Gong, L.: New Protocols for Third-Party-Based Authentication and Secure Broadcast. In: Proceedings of ACM CCS (1994)
Hong, D., Kang, J.: An Efficient Key Distribution Scheme with Self-healing Property. IEEE Communication Letters’05 9, 759–761 (2005)
Just, M., Kranakis, E., Krizanc, D., van Oorschot, P.: On Key Distribution via True Broadcasting. In: Proceedings of ACM CCS (1994)
Liu, D., Ning, P., Sun, K.: Efficient Self-healing Key Distribution with Revocation Capability. In: Proceedings of the 10th ACM CCS’03, pp. 27–31 (2003)
McGrew, D., Sherman, A.: Key Establishment in large dynamic groups using one-way function trees. TIS Report No. 0755 (1998)
More, S., Malkin, M., Staddon, J.: Sliding-window Self-healing Key Distribution with Revocation. In: ACM Workshop on Survivable and Self-regenerative Systems’03, pp. 82–90 (2003)
Naor, D., Naor, M., Lotspiech, J.: Revocation and Tracing Schemes for Stateless Receivers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 41–62. Springer, Heidelberg (2001)
Perrig, A., Song, D., Tygar, J.D.: ELK, a New Protocol for Efficient Large-Group Key Distribution. In: Proceedings of IEEE Symposium on Security and Privacy’01, pp. 247–262 (2001)
Sáez, G.: On Threshold Self-healing Key Distribution Schemes. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 340–354. Springer, Heidelberg (2005)
Safavi-Naini, R., Wang, H.: New Constructions of Secure Multicast Re-Keying Schemes using Perfect Hash Families. In: Proceedings of ACM CCS’00, pp. 228–234 (2000)
Setia, S., Koussih, S., Jajodia, S.: Kronos: A Scalable Group Re-Keying Approach for Secure Multicast. In: Proceedings of IEEE Symp. on Security and Privacy (2000)
Staddon, J., Miner, S., Franklin, M., Balfanz, D., Malkin, M., Dean, D.: Self-healing key distribution with Revocation. In: Proceedings of IEEE Symposium on Security and Privacy’02, pp. 224–240 (2002)
Stinson, D.R.: On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption. Designs, Codes and Cryptology 12, 215–243 (1997)
Stinson, D.R., van Trung, T.: Some New Results on Key Distribution Patterns and Broadcast Encryption. Designs, Codes and Cryptography 14, 261–279 (1998)
Wong, C., Gouda, M., Lam, S.: Secure Group Communications using Key Graphs. In: Proceedings of ACM SIGCOMM’98, pp. 68–79 (1998)
Xu, S.: On the security of group communication schemes. Journal of Computer Security 15(1), 129–169 (2007)
Yang, Y.R., Li, X.S., Zhang, X.B., Lam, S.S.: Reliable Group Re-Keying: A Performance Analysis. In: ACM SIGCOMM’01, pp. 27–38 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Dutta, R., Chang, EC., Mukhopadhyay, S. (2007). Efficient Self-healing Key Distribution with Revocation for Wireless Sensor Networks Using One Way Key Chains. In: Katz, J., Yung, M. (eds) Applied Cryptography and Network Security. ACNS 2007. Lecture Notes in Computer Science, vol 4521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72738-5_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-72738-5_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72737-8
Online ISBN: 978-3-540-72738-5
eBook Packages: Computer ScienceComputer Science (R0)