格上基于零知识证明的可追踪环签名方案OA

To address the problems of low signing efficiency as well as excessively large signature and public key sizes in existing lattice-based ring signature schemes when the number of ring members is large,a traceable ring signature scheme based on zero-knowledge proofs is proposed.By leveraging the extended module learning with errors(E-MLWE)problem and the module short integer solution(MSIS)problem,the public key size is reduced.A traceability mechanism is designed in combination with a rejection sampling algorithm.Moreover,a recursive algorithm is employed in the signing process to compress the size of commitments,further reducing the signature size.In the random oracle model,the proposed scheme is proven to satisfy linkability,anonymity,and non-frameability.Performance analysis shows that the signature size grows logarithmically with the number of ring members.When the ring size is large,the scheme exhibits significant advan-tages in terms of public key storage overhead and signature communication overhead.