TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Hybrid ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Efficient key revocation in WSN with lattice-based cryptography

, , , , *

* Corresponding author · click or hover a name for details

pp. 339–348Vol. 27Issue 2-AMarch 2024DOI: 10.47974/JDMSC-1887 Crossmark XML
Published Online:
06 Apr 2024
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-1887
Pages:
339–348

Abstract

Strong security is crucial as Wireless Sensor Network (WSN) become more common. Dynamic Lattice-Based Key Revocation (DLBKR) is a novel method for improving key revocation in WSN. Lattice-based cryptography helps DLBKR overcome compromised keys and evolving security threats in dynamic sensor networks. Key revocation mechanisms are examined in detail, with a focus on their limitations in WSN. Due to these networks limited resources and ever-changing structure, we propose DLBKR as a novel way to minimize the security risks of compromised keys. DLBKR is featured as a flexible and reactive solution due to its ability to adapt to threat levels. Simulated network sizes from 250 to 2000 nodes were used to evaluate DLBKR. Traditional methods like CRL and OCSP were compared. Latency, revocation efficiency, computational overhead, communication overhead, and key replacement delay were assessed. DLBKR outperforms CRL and OCSP in all parameters, proving its efficiency in dynamic and resource-limited WSN key revocation. This method performs well and offers a flexible framework that incorporates with sensor networks. The DLBKR method help WSN to manage key complexity.

Keywords

Subject Classifications

Primary 93A30Secondary 49K15

References

[1] Abhilash M H and Amberker B B, “Efficient Dynamic Group Signature Scheme with Verifier Local Revocation and Time-Bound Keys using Lattices,” Int. J. Comput. Inf. Technol., vol. 10, no. 2 (2021), doi: 10.24203/ijcit.v10i2.93.
[2] S. Banupriya, K. Kottursamy, and A. K. Bashir, “Privacy-preserving hierarchical deterministic key generation based on a lattice of rings in public blockchain,” Peer-to-Peer Netw. Appl., vol. 14, no. 5, pp. 2813–2825 (2021), doi: 10.1007/s12083-021-01117-2.
[3] M. Ge, K. K. R. Choo, H. Wu, and Y. Yu, “Survey on key revocation mechanisms in wireless sensor networks,” J. Netw. Comput. Appl., vol. 63, pp. 24–38 (2016), doi: 10.1016/j.jnca.2016.01.012.
[4] X. He, M. Niedermeier, and H. De Meer, “Dynamic key management in wireless sensor networks: A survey,” J. Netw. Comput. Appl., vol. 36, no. 2, pp. 611–622 (2013), doi: 10.1016/j.jnca.2012.12.010.
[5] S. A. Khah, A. Barati, and H. Barati, “A dynamic and multi-level key management method in wireless sensor networks (WSNs),” Comput. Networks, vol. 236, no. February, p. 109997 (2023), doi: 10.1016/j.comnet.2023.109997.
[6] K. Raja, A. Deivasigamani, and V. Ravi, “A Reliant Certificate Revocation of Malicious Nodes in MANETs,” Wirel. Pers. Commun., vol. 90, no. 2, pp. 435–455 (2016), doi: 10.1007/s11277-015-3016-8.
[7] Sandeep Kumar Sharma, Anil Kumar, and Uday Pratap Singh.  Enhanced Edges Detection from Different Color Space. In Proceedings of the 4th International Conference on Information Management & Machine Intelligence (ICIMMI ‘22). Association for Computing Machinery, New York, NY, USA, Article 16, 1–6 (2023). https://doi.org/10.1145/3590837.3590853.
[8] W. Yu, L. Yang, and S. Wang, “New Lattice-Based Broadcast Authentication Protocol for Wireless Sensor Networks,” Secur. Commun. Networks, vol. 2022 (2022), doi: 10.1155/2022/6809875.
[9] S. Ling, K. Nguyen, A. Roux-Langlois, and H. Wang, “A lattice-based group signature scheme with verifier-local revocation,” Theor. Comput. Sci., vol. 730, pp. 1–20 (2018), doi: 10.1016/j.tcs.2018.03.027.
[10] S. Ling, K. Nguyen, H. Wang, and Y. Xu, “Lattice-based group signatures: Achieving full dynamicity (and deniability) with ease,” Theor. Comput. Sci., vol. 783, pp. 71–94 (2019), doi: 10.1016/j.tcs.2019.03.023.
[11] Anil Kumar & Sandeep Kumar Sharma. Information cryptography using cellular automata and digital image processing, Journal of Discrete Mathematical Sciences and Cryptography, 25:4, 1105-1111 (2022), DOI: 10.1080/09720529.2022.2072437.
[12] M. N. S. Perera and T. Koshiba, “Almost fully secured lattice-based group signatures with verifier-local revocation,” Cryptography, vol. 4, no. 4, pp. 1–28 (2020), doi: 10.3390/cryptography4040033.
[13] P. Mundhe, V. K. Yadav, S. Verma, and S. Venkatesan, “Efficient Lattice-Based Ring Signature for Message Authentication in VANETs,” IEEE Syst. J., vol. 14, no. 4, pp. 5463–5474 (2020), doi: 10.1109/JSYST.2020.2980297.
[14] J. Wang and C. Wang, “Full secure identity-based encryption scheme over lattices for wireless sensor networks in the standard model,” Int. J. High Perform. Comput. Netw., vol. 12, no. 2, pp. 111–117 (Jan. 2018), doi: 10.1504/IJHPCN.2018.094361.
[15] R. Chaudhary, A. Jindal, G. S. Aujla, N. Kumar, A. K. Das, and N. Saxena, “LSCSH: Lattice-Based Secure Cryptosystem for Smart Healthcare in Smart Cities Environment,” IEEE Commun. Mag., vol. 56, no. 4, pp. 24–32 (2018), doi: 10.1109/MCOM.2018.1700787.
[16] N. Saravanan and A. Umamakeswari, “Lattice based access control for protecting user data in cloud environments with hybrid security,” Comput. Secur., vol. 100, p. 102074 (2021), doi: https://doi.org/10.1016/j.cose.2020.102074.
[17] F. Wu, W. Yao, X. Zhang, and Z. Zheng, “Lattice based signature with outsourced revocation for Multimedia Social Networks in cloud computing,” Multimed. Tools Appl., vol. 78, no. 3, pp. 3511–3528 (2019), doi: 10.1007/s11042-018-6330-9.
[18] D. Dharminder and D. Mishra, “LCPPA: Lattice-based conditional privacy preserving authentication in vehicular communication,” Trans. Emerg. Telecommun. Technol., vol. 31, no. 2, p. e3810 (Feb. 2020), doi: https://doi.org/10.1002/ett.3810.

Views: 451Downloads: 67Citations: 2