Efficient Linkable Ring Signature Scheme over NTRU Lattice with Unconditional Anonymity

Area of Science:

• Cryptography
• Computer Science
• Information Security

Background:

• Data anonymity and sender authenticity are crucial in cloud and edge computing.
• Linkable ring signatures (LRS) offer signer anonymity and detect duplicate signatures.
• Existing lattice-based LRS schemes often lack unconditional anonymity or are inefficient.

Purpose of the Study:

• To propose an efficient lattice-based linkable ring signature (LRS) scheme.
• To achieve unconditional anonymity, improving upon prior lattice-based schemes.
• To enhance performance in terms of signature generation, verification, and size.

Main Methods:

• Developed a new LRS scheme based on the e-NTRU problem.
• Utilized preimage sampling, trapdoor generation, and rejection sampling algorithms.
• Implemented and compared the proposed scheme against existing lattice-based LRS schemes, including Torres et al.'s.

Main Results:

• The proposed scheme achieves unconditional anonymity.
• Demonstrated significant efficiency gains: 94.52% reduction in signature generation time, 97.18% in verification time, and 58.03% in signature size compared to Torres et al.'s scheme.
• Outperformed other evaluated lattice-based LRS schemes in efficiency.

Conclusions:

• The new lattice-based LRS scheme offers a highly efficient solution for unconditional anonymity.
• This advancement is particularly beneficial for secure data transmission in cloud and edge computing environments.
• The proposed scheme represents a substantial improvement over previous lattice-based LRS constructions.