Abstract
One problem that frequently arises is the establishment of a secure connection between two network nodes. There are many key establishment protocols that are based on Trusted Third Parties or public key cryptography which are in use today. However, in the case of networks with frequently changing topology, such an approach is difficult to apply. In this paper we give a formal definition of collusion resistant key predistribution schemes and then propose such a scheme based on probabilistically created set systems. The resulting key sets are shown to have a number of desirable properties that ensure the confidentiality of communication sessions against collusion attacks by other network nodes. Moreover we associate our deterministic key pre-distribution scheme with the theory of set family construction methods showing that the mathematical properties possessed by the sets of such families lead to key sets with the aforementioned desirable properties.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
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). https://doi.org/10.1007/3-540-48071-4_33
Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensor networks. In: IEEE Symposium on Security and Privacy, Berkeley, California, vol. 197 (2003)
Delgosha, F., Fekri, F.: Key pre-distribution in wireless sensor networks using multivariate polynomials. In: 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, IEEE SECON 2005, pp. 118–129. IEEE (2005)
Du, X., Xiao, Y., Guizani, M., Chen, H.H.: An effective key management scheme for heterogeneous sensor networks. Ad Hoc Netw. 5(1), 24–34 (2007)
Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 41–47. ACM (2002)
Gandino, F., Ferrero, R., Rebaudengo, M.: A key distribution scheme for mobile wireless sensor networks: \( q \)-\( s \)-composite. IEEE Trans. Inf. Forensics Secur. 12(1), 34–47 (2017)
Jukna, S.: Extremal Combinatorics: With Applications in Computer Science. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-17364-6
Lee, J., Stinson, D.R.: A combinatorial approach to key predistribution for distributed sensor networks. In: WCNC, pp. 1200–1205 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Liagkou, V., Spirakis, P., Stamatiou, Y.C. (2019). Randomized and Set-System Based Collusion Resistant Key Predistribution Schemes (Brief Announcement). In: Dolev, S., Hendler, D., Lodha, S., Yung, M. (eds) Cyber Security Cryptography and Machine Learning. CSCML 2019. Lecture Notes in Computer Science(), vol 11527. Springer, Cham. https://doi.org/10.1007/978-3-030-20951-3_28
Download citation
DOI: https://doi.org/10.1007/978-3-030-20951-3_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-20950-6
Online ISBN: 978-3-030-20951-3
eBook Packages: Computer ScienceComputer Science (R0)