Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2410.19220 · Lecture notes in computer science

An Undeniable Signature Scheme Utilizing Module Lattices

Kunal Dey, Mansi Goyal, Aditi Kar Gangopadhyay, Bhupendra Singh

Published Jan 1, 2026• 2 citations
arXivHTMLPDF
DOI
10.1007/978-981-95-8034-7_27

Related papers

Lattice-based undeniable signature scheme

Swati Rawal, Sahadeo Padhye, Debiao He

Annals of Telecommunications•Jan 10, 2022•9 citations

A multivariate convertible undeniable signature scheme

Satyam Omar, Sahadeo Padhye, Dhananjoy Dey +1 more

Information and Computation•Feb 21, 2025•2 citations

An Efficient and Secure Undeniable Signature Scheme based on Ring Learning with Error

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.

International Journal of Ad Hoc and Ubiquitous Computing•Jan 1, 2026•1 citation

A novel identity based undeniable signature scheme

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.

IEEE Conference Anthology•Jan 1, 2013•1 citation

Improvement and Efficient Implementation of a Lattice-Based Signature Scheme

Rachid El Bansarkhani, Johannes A Buchmann

Lecture notes in computer science•Jan 1, 2014•60 citations

An Efficient Lattice-Based Signature Scheme with Provably Secure Instantiation

Sedat Akleylek, Nina Bindel, Johannes A Buchmann +2 more

Lecture notes in computer science•Jan 1, 2016•76 citations
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.