ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Key Predistribution Schemes Using Bent Functions in Distributed Sensor Networks

Dalai, Deepak Kumar and Sarkar, Pinaki (2017) Key Predistribution Schemes Using Bent Functions in Distributed Sensor Networks. In: 12th International Conference on Information Security and Cryptology, INSCRYPT 2016, November 4-6, 2016, Beijing, China, pp. 367-385.

Full text not available from this repository.
Official URL: https://doi.org/10.1007/978-3-319-54705-3_23


Key management is an essential functionality for developing secure cryptosystems; particularly for implementations to low cost devices of a Distributed Sensor Networks (DSN)–a prototype of Internet of Things (IoT). Low cost leads to constraints in various resources of constituent devices of a IoT (e.g., sensors of a DSN); thereby restricting implementations of computationally heavy public key cryptosystems. This leads to adaptation of the novel key predistribution trick in symmetric key platform to efficiently tackle the problem of key management for these resource starved networks. After a few initial proposals based on random graphs, most key predistribution schemes (KPS) use deterministic (combinatorial) approaches to assure essential design properties. Combinatorial designs like a (v, b, r, k)−configuration which forms a μ(v, b, r, k)−CID are effective schemes to design KPS [20]. In this paper, we use bent Boolean functions to generate four combinatorial designs for the purpose of designing deterministic KPS. Of particular interest are our later (two) schemes that are constructed over Dillon’s bent Boolean function. Effectiveness of our solutions in term of crucial metrics in comparison to prominent schemes has been theoretically established.

Item Type: Conference Paper
Publisher: Springer Verlag
Additional Information: The Copyright of this article belongs to the Springer
Keywords: Bent functions; Combinatorial designs; Distributed sensor networks; Internet of things; Key predistribution scheme(s); Partial spread; Boolean functions; Cryptography; Distributed computer systems; Internet of things; Public key cryptography; Security of data; Sensor networks; Bent function; Combinatorial design; Distributed sensor networks; Key predistribution scheme; Partial spreads; Network security
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 29 May 2022 06:19
Last Modified: 31 May 2022 04:53
URI: https://eprints.iisc.ac.in/id/eprint/72592

Actions (login required)

View Item View Item