.png){kind=icon}
.png){kind=icon}
Return
An efficient and secure undeniable signature scheme based on ring learning with error
.png){kind=icon}
PRE
AI
DOI：10.1504/IJAHUC.2026.153344.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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
Journal
IF:
0.7
Papers:
42
Citations:
317