Lattice-Based Traceable Ring Signatures with Range Proofs

The ring signature ensures the anonymity of the signer and the unforgeability of the message during communication. However, the presence of sensitive data in the message may expose the signer's identity to some extent. To address this issue, we propose an efficient lattice-based ring signature scheme with range proofs. The scheme uses a commitment mechanism to ensure the signer conceals sensitive data while allowing the verifier to effectively validate the data's range. Additionally, a tracking algorithm is introduced to mitigate abusive behavior by revealing the identity of the abuser. Furthermore, the accumulator technique is applied to reduce both the size of the signature and the number of ring members, achieving a logarithmic relationship. Security analysis demonstrates that the scheme satisfies anonymity, unforgeability, and excludability. Efficiency analysis shows that the signature size grows logarithmically with the number of ring members, and that the communication overhead for range proof validation is minimal, enabling this functionality with very low communication cost. This scheme is applicable in scenarios requiring privacy protection and regulatory compliance, such as electronic voting, anonymous financial transactions, and digital identity management.