Abstract
In this paper we study the key predistribution schemes. Such schemes are used to reduce the total amount of secret information distributed to users of the network through secure channels, through which the secret key is calculated to establish a secure network connection between the participants. It is shown as a theoretical and practical advantage of the combined scheme in the scheme efficiency parameters with the help of computer experiments, as well as lower and sufficient estimates of the probabilistic algorithm synthesis of a key distribution patterns with mutually complementary correctness conditions of the two known schemes (KDP, Key Distribution Pattern and HARPS, Hashed Random Preloaded Subset Key Distribution). The concept of the information rate of the scheme is considered as a criterion for the efficiency of the key distribution scheme in the task of minimizing the distributed volume of secret information stored by the network participants. Calculated lower estimates shows potential advantage of combined correcntess conditions in addition to efficiency discovered previously.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Stinson, D.R.: On some methods for unconditionally secure key distribution and broadcast encryption. Des. Codes Cryptogr. 12, 215–243 (1997)
Frolov, A., Zatey, A.: Probabilistic synthesis of KDP satisfying mutually complementary correctness conditions. In: 2014 Proceedings of International Conference on Advances in Computing, Communication and Information Technology, 16–17 November 2014, Birmingham, UK
Dyer, M., Fenner, T., Frieze, A., Thomason, A.: On key storage in secure networks. J. Cryptol. 8, 189–200 (1995)
Mitchell, C., Piper, F.: Key storage in secure networks. Discret. Appl. Math. 21, 215–228 (1988)
Ramkumar, M., Memon, N.: An efficient key predistribution scheme for ad hoc network security. IEEE J. Sel. Areas Commun. 23(3), 611–621 (2005)
Frolov, A., Shchurov, I.: Non-centralized key predistribution in computer networks. In: IEEE Proceedings of International Conference on Dependability of computer Systems DepCos-RELCOMEX 2008, Szklarska Poreba, Poland. Computer Society Conference Publishing Services, Los Alamitos, California, Washington, Tokyo, pp. 179–188 (2008)
Ramkumar, M.: Symmetric Cryptographic Protocols. Springer, Berlin (2014)
Acknowledgment
The work was financially supported by the Russian Foundation for Basic Research, project No.17-01-00485a.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Zatey, A. (2019). An Information Rate of Key Predistribution Schemes with Mutually Complementary Correctness Conditions. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds) Contemporary Complex Systems and Their Dependability. DepCoS-RELCOMEX 2018. Advances in Intelligent Systems and Computing, vol 761. Springer, Cham. https://doi.org/10.1007/978-3-319-91446-6_52
Download citation
DOI: https://doi.org/10.1007/978-3-319-91446-6_52
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91445-9
Online ISBN: 978-3-319-91446-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)