Title: An efficient and secure undeniable signature scheme based on ring learning with error

Authors: Akanksha Singh; Harish Chandra; Saurabh Rana

Addresses: Department of Mathematics and Scientific Computing, Madan Mohan Malaviya University of Technology, Gorakhpur – 273010, India ' Department of Mathematics and Scientific Computing, Madan Mohan Malaviya University of Technology, Gorakhpur – 273010, India ' Department of Mathematics (SCSET), Bennett University, Greater Noida, 201310, Uttar Pradesh, India

Abstract: This paper, proposes a novel undeniable signature scheme based on the ring learning with errors (RLWE) problem, a complex lattice problem. In our scheme, authentic signatures can be validated via an interactive protocol, which guarantees that adversaries cannot forge signatures. Moreover, it ensures that honest participants consistently finish the verification procedure. Thus, the scheme is a strong and effective quantum-resistant undeniable signature scheme. Our security analysis, demonstrates resilience against both classical and quantum adversaries, based on the RLWE problem's hardness assumptions. Additionally, the random Oracle model is utilised to evaluate our protocol's security, showing that our scheme satisfies important cryptographic properties like completeness, soundness, and unforgeability. Our work advances the feasibility of post-quantum undeniable signature schemes for real-world cryptographic applications.

Keywords: digital signature; undeniable signature; ring learning with errors; RLWE; lattice-based cryptography.

DOI: 10.1504/IJAHUC.2026.153344

International Journal of Ad Hoc and Ubiquitous Computing, 2026 Vol.51 No.4, pp.244 - 256

Received: 02 Feb 2025
Accepted: 12 May 2025
Published online: 01 May 2026 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article