<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-discrete-mathematical-sciences-and-cryptography</journal-id>
      <journal-title-group>
        <journal-title>Journal of Discrete Mathematical Sciences and Cryptography</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-0065</issn>
      <issn publication-format="print">0972-0529</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JDMSC-2806</article-id>
      <title-group>
        <article-title>Discrete algebraic ring signatures on elliptic curves for privacy-preserving blockchain transaction authentication</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Choudhury</surname>
            <given-names>Ziaul Haque</given-names>
          </name>
          <aff>Department of Information Technology, School of Computing and Informatics, Vignan’s Foundation for Science, Technology and Research (Deemed to be University), Guntur, Andhra Pradesh, 522213, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Kalangi</surname>
            <given-names>Ruth Ramya</given-names>
          </name>
          <aff>Department of Computer Science and Engineering, Koneru Lakshmaiah Education Foundation, Vaddeswaram, Andhra Pradesh, 522302, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Rao</surname>
            <given-names>K. Koteswara</given-names>
          </name>
          <aff>Department Computer Science and Engineering, Prasad V. Potluri Siddhartha Institute of Technology, Vijayawada, Andhra Pradesh, 520007, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Katkam</surname>
            <given-names>Premnadh</given-names>
          </name>
          <aff>Department of Computer Science &amp; Engineering (Data Science), Sreenidhi Institute of Science and Technology, Hyderabad, Telangana, 501302, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Anandam</surname>
            <given-names>Ravi Thavasi</given-names>
          </name>
          <aff>Department of Computer Science and Engineering, Vel Tech Rangarajan Dr. Sagunthala R&amp;D Institute of Science and Technology, Avadi, Chennai, Tamil Nadu, 600062, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Sundaram</surname>
            <given-names>Ajith</given-names>
          </name>
          <aff>Amrita School of Business, Amrita Vishwa Vidyapeetham, Kochi, Kerala, 682041, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Chembian</surname>
            <given-names>W. T.</given-names>
          </name>
          <aff>Department of Computer Science and Engineering, Vel Tech High Tech Dr. Rangarajan Dr. Sakunthala Engineering College (Autonomous), Chennai, Tamil Nadu, 600062, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Athal</surname>
            <given-names>I.</given-names>
          </name>
          <aff>Department of Mathematics, R. V. S. College of Engineering (Autonomous), Dindigul, Tamil Nadu, 624005, India</aff>
        </contrib>
      </contrib-group>
      <volume>29</volume>
      <issue>9-B</issue>
      <fpage>3653</fpage>
      <lpage>3661</lpage>
      <pub-date date-type="pub">
        <day>30</day>
        <month>09</month>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>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.</p>
      </abstract>
      <kwd-group>
        <kwd>Ring signatures</kwd>
        <kwd>Elliptic curve cryptography</kwd>
        <kwd>Blockchain privacy</kwd>
        <kwd>CLSAG</kwd>
        <kwd>Key image</kwd>
        <kwd>Anonymity set</kwd>
        <kwd>Linkable signature</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
