Lattice-based undeniable signature scheme

Kunal Dey, Mansi Goyal, Aditi Kar Gangopadhyay +1 more

Satyam Omar, Sahadeo Padhye, Dhananjoy Dey +1 more

Kaoru Kurosawa, Jun Furukawa

Akanksha Singh, Harish Chandra, Saurabh Rana

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.

Frank Nauheimer

Shuang Li, Chen Wang, Maozhi Xu +1 more

In this paper, we give a first example of identity based undeniable signature from NTRU lattice. We extend to the identity based setting the security model for the notions of invisibility and anonymity given by Galbraith and Mao in 2003 and we prove that our scheme is existentially unforgeable under the assumption in the random oracle model. We also prove that it has the unfogreability and anonymity property under our scheme.