A Key Set Cipher for Wireless Sensor Networks
Subhash Kak

TL;DR
This paper introduces a novel key management scheme for wireless sensor networks using self-inverting matrices and ID randomization to enhance security in resource-limited environments.
Contribution
It presents a new cryptographic scheme combining Hilbert transform-based matrices with Blom's scheme, incorporating ID randomization for improved security.
Findings
The scheme enables secure key agreement despite ID changes.
It leverages mathematical properties of Hilbert transform matrices.
The randomized protocol enhances system security.
Abstract
This paper proposes the use of sets of keys, together with corresponding identifiers, for use in wireless sensor networks and similar resource-constrained applications. A specific cryptographic scheme described in the paper is based on the use of a family of self-inverting matrices derived from the number theoretic Hilbert transform in conjunction with the Blom's scheme. In a randomized version of this scheme, the users change their published IDs at will but the parties can still reach agreement on the key by using individual scaling factors. The random protocol increases the security of the system.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSecurity in Wireless Sensor Networks · Energy Efficient Wireless Sensor Networks · Chaos-based Image/Signal Encryption
