<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.irtf-cfrg-sigma-protocols" target="https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-sigma-protocols-03">
   <front>
      <title>Sigma Proofs for Linear Relations</title>
      <author initials="M." surname="Orrù" fullname="Michele Orrù">
         <organization>CNRS</organization>
      </author>
      <author initials="C." surname="Yun" fullname="Cathie Yun">
         <organization>Apple, Inc.</organization>
      </author>
      <date month="August" day="16" year="2026" />
      <abstract>
	 <t>   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.

	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-irtf-cfrg-sigma-protocols-03" />
   
</reference>
