@techreport{irtf-cfrg-sigma-protocols-03,
    number =    {draft-irtf-cfrg-sigma-protocols-03},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-irtf-cfrg-sigma-protocols/03/},
    author =    {Michele Orrù and Cathie Yun},
    title =     {{Sigma Proofs for Linear Relations}},
    pagetotal = 97,
    year =      2026,
    month =     aug,
    day =       16,
    abstract =  {This document describes Sigma Protocols for proving knowledge of preimages of linear maps in prime-order elliptic curve groups. These are sometimes also called \_Maurer Proofs\_, or \_proofs of knowledge of a preimage of a group homomorphism\_. Examples include zero-knowledge proofs for discrete logarithm relations, ElGamal encryptions, Pedersen commitments, and range proofs.},
}