CRT-KPS: A key predistribution schemes using CRT

5Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

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).

Cite

CITATION STYLE

APA

Sarkar, P., Baranwal, M., & Nandi, S. (2018). CRT-KPS: A key predistribution schemes using CRT. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10946 LNCS, pp. 821–830). Springer Verlag. https://doi.org/10.1007/978-3-319-93638-3_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free