Advertisement

Randomized and Set-System Based Collusion Resistant Key Predistribution Schemes (Brief Announcement)

  • Vasiliki LiagkouEmail author
  • Paul Spirakis
  • Yannis C. Stamatiou
Conference paper
  • 538 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11527)

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.

Keywords

Key management Key pre-distribution Ad-hoc network security Set systems 

References

  1. 1.
    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_33CrossRefGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Jukna, S.: Extremal Combinatorics: With Applications in Computer Science. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-17364-6CrossRefzbMATHGoogle Scholar
  8. 8.
    Lee, J., Stinson, D.R.: A combinatorial approach to key predistribution for distributed sensor networks. In: WCNC, pp. 1200–1205 (2005)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Vasiliki Liagkou
    • 1
    • 4
    Email author
  • Paul Spirakis
    • 2
    • 3
  • Yannis C. Stamatiou
    • 1
    • 5
  1. 1.Research and Academic Computer Technology Institute, N. KazantzakiUniversity of PatrasRioGreece
  2. 2.Department of Computer ScienceUniversity of LiverpoolLiverpoolUK
  3. 3.Department of Computer EngineeringUniversity of PatrasRioGreece
  4. 4.Department of Informatics and TelecommunicationsUniversity of IoanninaKoatakioi ArtaGreece
  5. 5.Department of Business AdministrationUniversity of PatrasRioGreece

Personalised recommendations