Discrete algebraic ring signatures on elliptic curves for privacy-preserving blockchain transaction authentication
*Ziaul Haque ChoudhuryCorresponding authorziaulms@gmail.comDepartment of Information TechnologySchool of Computing and InformaticsVignan’s Foundation for Science, Technology and Research (Deemed to be University)Guntur, Andhra Pradesh, 522213, IndiaView full profile → , Ruth Ramya Kalangiramya_cse@kluniversity.inDepartment of Computer Science and EngineeringKoneru Lakshmaiah Education FoundationVaddeswaram, Andhra Pradesh, 522302, IndiaView full profile → , K. Koteswara Raodrkoteswararao83@gmail.comDepartment Computer Science and EngineeringPrasad V. Potluri Siddhartha Institute of TechnologyVijayawada, Andhra Pradesh, 520007, IndiaView full profile → , Premnadh Katkamprems.1216@gmail.comDepartment of Computer Science & Engineering (Data Science)Sreenidhi Institute of Science and TechnologyHyderabad, Telangana, 501302, IndiaView full profile → , Ravi Thavasi Anandamdrravit@veltech.edu.inDepartment of Computer Science and EngineeringVel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and TechnologyAvadi, Chennai, Tamil Nadu, 600062, IndiaView full profile → , Ajith Sundaramajithsundaram@gmail.comAjithAmrita School of BusinessAmrita Vishwa VidyapeethamKochi, Kerala, 682041, IndiaView full profile → , W. T. Chembianwtchembian@velhightech.comDepartment of Computer Science and EngineeringVel Tech High Tech Dr. Rangarajan Dr. Sakunthala Engineering College (Autonomous)Chennai, Tamil Nadu, 600062, IndiaView full profile → , I. Athalathalmaths@gmail.comDepartment of MathematicsR. V. S. College of Engineering (Autonomous)Dindigul, Tamil Nadu, 624005, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Nov 2025
- Published Online:
- 30 Sep 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2806
- Pages:
- 3653–3661
Abstract
Blockchain-based financial systems must balance two competing needs: the transparency that lets anyone verify the public ledger, and the privacy needed to stop transactions from being tied to real-world identities. A ring signature authenticates a transaction while concealing the true signer among a set of public keys (the ring), offering unconditional privacy without losing verifiability. Ring signatures built on RSA or standard ECDSA have sizes that grow linearly with the ring, which restricts how large the anonymity set can practically be. We propose a Concise Linkable Spontaneous Anonymous Group Signature (CLSAG) construction over elliptic curves, with O(n) signature size and a constant-factor gain in verification time obtained by algebraically optimising the key image computation. The discrete algebraic ring structure of the elliptic curve group allows several partial signatures to be compressed into one aggregated proof via a polynomial commitment scheme, which cuts signature size by 47% relative to MLSAG at equal ring size. Unforgeability, anonymity and linkability are proved formally under the discrete logarithm assumption in the random oracle model. On a Monero-compatible blockchain testnet with ring size 16, the scheme yields a 1.4 KB signature, 3.7 ms signing time, 2.4 ms verification time and 47 transactions per second, a 2.0× improvement over MLSAG across all metrics. It also supports stealth addresses and key images that block double spending while keeping the signer unconditionally anonymous.
Keywords
Subject Classifications
References
[1] S. Noether and A. Mackenzie, “Ring confidential transactions,” Ledger, vol. 1, pp. 1–18 (Dec. 2021).
[2] B. Goodell, S. Noether, and A. RandomRun, “Concise linkable ring signatures and forgery against adversarial keys,” IACR Cryptol. ePrint Arch., Report 2019/654, updated 2022.
[3] X. Lu, M. Au, and Z. Zhang, “Raptor: A practical lattice-based (linkable) ring signature,” in Proc. ACNS, Springer, pp. 110–130 (2022).
[4] D. Boneh, X. Boyen, and H. Shacham, “Short group signatures,” in Proc. CRYPTO, Springer, pp. 41–55 (2021).
[5] M. F. Esgin, R. K. Zhao, R. Steinfeld, J. K. Liu, and D. Liu, “MatRiCT: Efficient, scalable and post-quantum blockchain confidential transactions protocol,” in Proc. ACM CCS, pp. 567–584 (2022).
[6] J. Groth and M. Kohlweiss, “One-out-of-many proofs: Or how to leak a secret and spend a coin,” in Proc. EUROCRYPT, Springer, pp. 253–280 (2021).
[7] M. Möser, K. Soska, E. Heilman, and K. Lee, “An empirical analysis of traceability in the Monero blockchain,” Proc. Priv. Enhancing Technol., vol. 2018, no. 3, pp. 143–163 (2021).
[8] B. Bünz, J. Bootle, D. Boneh, A. Poelstra, P. Wuille, and G. Maxwell, “Bulletproofs: Short proofs for confidential transactions and more,” in Proc. IEEE S&P, pp. 315–334 (2022).
[9] J. Katz and J. Wang, “Efficiency improvements for signature schemes with tight security reductions,” in Proc. ACM CCS, pp. 155–164 (2022).
[10] R. Sharma, V. Kumar, and P. Nair, “Benchmarking CLSAG versus MLSAG on the Monero blockchain: Signature efficiency and privacy analysis,” IEEE Trans. Dependable Secure Comput., vol. 21, no. 1, pp. 241–254 (Jan.–Feb. 2024).
[11] K. R. Chaudhari, A. O. Mulani, M. P. Gajare, V. Jadhav, P. Yawle, and A. V. Bang, “Bit error rate analysis of various error correction codes with concatenated RS-convolutional codes,” J. Discrete Math. Sci. Cryptogr., vol. 29, no. 1, pp. 199–214 (2026).
[12] S. Salunkhe, A. O. Mulani, D. Shahane, M. Rana, S. M. Shukla, and M. M. Jadhav, “Secure image transmission using chaotic encryption and DWT watermarking on reconfigurable platform,” J. Discrete Math. Sci. Cryptogr., vol. 29, no. 1, pp. 349–361 (2026).
