Abstract
Key Predistribution Schemes (KPS) are efficient key management solutions that are well suited to establish lightweight symmetric keys even in resource starved environments, like low cost Internet of Things (IoT). This paper uses Chinese Remainder Theorem (CRT) to propose an energy efficient and deterministic KPS for distributed ad hoc networks, that we name as CRT-KPS. We theoretically establish the effectiveness of CRT-KPS in term of crucial metrics. Comparative study establishes that our proposals have better balance in overall performance as compared to state-of-the-art schemes and should find wide applications in IoT systems (specially for resource starved end devices).
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
Similar content being viewed by others
Notes
- 1.
We refer to an existing result as ‘Result’; while a ‘Theorem’ or ‘Corollary’ are new outcomes.
References
Bag, S., Dhar, A., Sarkar, P.: 100% connectivity for location aware code based KPD in clustered WSN: merging blocks. In: Gollmann, D., Freiling, F.C. (eds.) ISC 2012. LNCS, vol. 7483, pp. 136–150. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33383-5_9
Çamtepe, S.A., Yener, B.: Combinatorial design of key distribution mechanisms for wireless sensor networks. In: Samarati, P., Ryan, P., Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol. 3193, pp. 293–308. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30108-0_18
Daemen, J., Rijmen, V.: The block cipher rijndael. In: Quisquater, J.-J., Schneier, B. (eds.) CARDIS 1998. LNCS, vol. 1820, pp. 277–284. Springer, Heidelberg (2000). https://doi.org/10.1007/10721064_26
Dalai, D.K., Sarkar, P.: Enhancing resilience of KPS using bidirectional hash chains and application on sensornet. In: Yan, Z., Molva, R., Mazurczyk, W., Kantola, R. (eds.) NSS 2017. LNCS, vol. 10394, pp. 683–693. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-64701-2_54
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, CCS 2002, pp. 41–47. ACM (2002)
Gennaro, R., Halevi, S., Krawczyk, H., Rabin, T., Reidt, S., Wolthusen, S.D.: Strongly-resilient and non-interactive hierarchical key-agreement in MANETs. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 49–65. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-88313-5_4
Kendall, M., Martin, K.M.: Graph-theoretic design and analysis of key predistribution schemes. Des. Codes Crypt. 81(1), 11–34 (2016)
Koblitz, N.: A Course in Number Theory and Cryptography. Springer, New York (1987). https://doi.org/10.1007/978-1-4684-0310-7
Lee, J., Stinson, D.R.: A combinatorial approach to key predistribution for distributed sensor networks. In: IEEE Wireless Communications and Networking Conference, WCNC 2005, pp. 1200–1205 (2005)
Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. J. Assoc. Comput. Mach. 51(2), 231–262 (2004)
Paterson, M.B., Stinson, D.R.: A unified approach to combinatorial key predistribution schemes for sensor networks. Des. Codes Crypt. 71(3), 433–457 (2014)
Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)
Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: Symposium on Cryptography and Information Security – SCIS 2000 (2000). (In Japanese, English version available from the authors)
Acknowledgement
We sincerely thank Ministry of Electronics and Information Technology, Government of India for funding the post doctoral tenure of Pinaki Sarkar through “ISEA” project.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Sarkar, P., Baranwal, M., Nandi, S. (2018). CRT-KPS: A Key Predistribution Schemes Using CRT. In: Susilo, W., Yang, G. (eds) Information Security and Privacy. ACISP 2018. Lecture Notes in Computer Science(), vol 10946. Springer, Cham. https://doi.org/10.1007/978-3-319-93638-3_51
Download citation
DOI: https://doi.org/10.1007/978-3-319-93638-3_51
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-93637-6
Online ISBN: 978-3-319-93638-3
eBook Packages: Computer ScienceComputer Science (R0)