1<!DOCTYPE html>
  2<html lang="en">
  3
  4  <head>
  5    <meta name="description" content="In this notes, we will cover the scheme proposed at 'New Blind Signature Schemes Based on the (Elliptic Curve) Discrete Logarithm Problem' paper by Hamid Mala & Nafiseh Nezhadansari." />
  6    <meta charset="utf-8">
  7    <title> Notes on blind signatures over elliptic curves - arnaucube - blog</title>
  8    <meta name="title" content=" Notes on blind signatures over elliptic curves - arnaucube - blog">
  9    <meta name="description" content="In this notes, we will cover the scheme proposed at 'New Blind Signature Schemes Based on the (Elliptic Curve) Discrete Logarithm Problem' paper by Hamid Mala & Nafiseh Nezhadansari.">
 10
 11    <meta property="og:title" content=" Notes on blind signatures over elliptic curves - arnaucube - blog" />
 12    <meta property="og:description" content="In this notes, we will cover the scheme proposed at 'New Blind Signature Schemes Based on the (Elliptic Curve) Discrete Logarithm Problem' paper by Hamid Mala & Nafiseh Nezhadansari." />
 13    <meta property="og:url" content="https://arnaucube.com/blog/blind-signatures-ec.html" />
 14    <meta property="og:type" content="article" />
 15    <meta property="og:image" content="https://arnaucube.com/blog/img/posts/blind-signatures-ec/flow1.png" />
 16    <meta name="twitter:title" content=" Notes on blind signatures over elliptic curves - arnaucube - blog">
 17    <meta name="twitter:description" content="In this notes, we will cover the scheme proposed at 'New Blind Signature Schemes Based on the (Elliptic Curve) Discrete Logarithm Problem' paper by Hamid Mala & Nafiseh Nezhadansari.">
 18    <meta name="twitter:image" content="https://arnaucube.com/blog/img/posts/blind-signatures-ec/flow1.png">
 19    <meta name="twitter:card" content="summary_large_image">
 20    <meta name="author" content="arnaucube">
 21
 22    <meta name="viewport" content="width=device-width, initial-scale=1">
 23
 24    <link href="css/bootstrap.min.css" rel="stylesheet">
 25    <link rel="stylesheet" href="css/style.css">
 26
 27    <!-- highlightjs -->
 28    <!-- <link rel="stylesheet" href="js/highlightjs/atom-one-dark.css"> -->
 29    <link rel="stylesheet" href="js/highlightjs/gruvbox-dark.css">
 30    <script src="js/highlightjs/highlight.pack.js"></script>
 31
 32    <!-- katex -->
 33    <link rel="stylesheet" href="js/katex/katex.min.css">
 34  </head>
 35
 36  <body>
 37
 38    <!-- o_gradient_background" -->
 39    <nav id="mainNav" class="navbar navbar-default navbar-fixed-top"
 40                      style="height:50px;font-size:130%;">
 41      <div class="container">
 42        <a href="/blog" style="color:#000;">Blog index</a>
 43        <div style="float:right;">
 44          <a href="/" style="color:#000;display:inline-block;">arnaucube.com</a>
 45          <div class="onoffswitch" style="margin:10px;display:inline-block;" title="change theme">
 46            <input onclick="switchTheme()" type="checkbox" name="onoffswitch" class="onoffswitch-checkbox"
 47              id="themeSwitcher">
 48            <label class="onoffswitch-label" for="themeSwitcher"></label>
 49          </div>
 50        </div>
 51      </div>
 52      <img style="height:5px; width:100%; margin-top:8px;" src="img/gradient-line.jpg" />
 53    </nav>
 54
 55
 56
 57    <div class="container" style="margin-top:40px;max-width:800px;">
 58      <h1>Notes on blind signatures over elliptic curves</h1>
 59
 60<p><em>2021-07-30</em></p>
 61
 62<blockquote>
 63<p><strong>Warning</strong>: I want to state clearly that I&rsquo;m not a mathematician, I&rsquo;m just an amateur on math studying in my free time, and this article is just an attempt to try to sort the notes that I took while reading about the blind signatures over elliptic curves.</p>
 64</blockquote>
 65
 66<h4>Blind signatures</h4>
 67
 68<p>Few years ago I read about the RSA blind signatures scheme (thanks to <a href="https://futur.upc.edu/JuanBautistaHernandezSerrano">Juan Hernández</a> who discovered it to me) and I was amazed on such thing being possible. You can read the step by step of the <em>RSA blind signatures</em> scheme in <a href="https://en.wikipedia.org/wiki/Blind_signature#Blind_RSA_signatures">this Wikipedia article</a>.
 69The main idea is that one party has a message and blinds it, then sends the blinded message to a signer. The signer generates a signature of that blinded message, who sends it to the initial party, who unblinds the signature, obtaining a valid signature for the original message, while the signer does not know what it is signing, but the signature can be verified for the original message for the signer&rsquo;s public key.</p>
 70
 71<p><div style="text-align:center; font-size:80%;">
 72    <img style="padding:50px;max-width:100%;" src="img/posts/blind-signatures-ec/flow0.png" />
 73    <i>Diagram showing the described steps.</i>
 74</div>
 75<br></p>
 76
 77<p>This has many applications, one of them could be to authenticate users in a &lsquo;traditional&rsquo; way (by user&amp;password, or by public key &amp; signature) in the Certification Authority (CA), and once the user is authenticated, the user can create a new key pair (ephemeral key), for which public key gets blinded and sent to the CA. The CA performs a blind signature on it, and sends the result back to the user. Then, the user can unblind the signature, and as result has their public key signed by the CA, but the CA does not know which is the public key (but the CA knows that the user while being authenticated by their &lsquo;traditional&rsquo; login, generated a new identity (key pair) and sent the public key blinded to the CA, who blindly signed it and returned the signature back to the user). Then the user has the ephemeral public key which is signed by the CA, and can use it to enter the system authenticating that they are an approved user without revealing which user they are.</p>
 78
 79<p>As most of the current ongoing protocols are using <em>elliptic curve</em> cryptography instead of <em>RSA</em>, the mentioned <em>RSA blind signatures</em> scheme is not much plugable in the existing systems that use <em>elliptic curve</em> keys. That&rsquo;s why I got interested into reading and learning about schemes that provide blind signatures over <em>elliptic curve</em>.</p>
 80
 81<h4>The scheme</h4>
 82
 83<p>In this notes, we will cover the scheme proposed at <em>&ldquo;<a href="https://sci-hub.do/10.1109/ICCKE.2013.6682844">New Blind Signature Schemes Based on the (Elliptic Curve) Discrete Logarithm Problem</a>&rdquo;</em> paper by Hamid Mala &amp; Nafiseh Nezhadansari (thanks to <a href="https://twitter.com/feministPLT">Daira Hopwood</a> who mentioned this paper in a Telegram group).</p>
 84
 85<p>First of all, the <em>signer</em> generates their key pair by generating a random scalar <span class="math inline">\(d \in \mathbb{Z}_n\)</span> (where <span class="math inline">\(\mathbb{Z}_n\)</span> is the elliptic curve field), which will be the <em>private key</em>. From <span class="math inline">\(d\)</span> they can compute the <em>public key</em> by <span class="math inline">\(Q = dG\)</span>, where <span class="math inline">\(G\)</span> is the generator point of <span class="math inline">\(\mathbb{G}\)</span> (the elliptic curve group).</p>
 86
 87<p>Appart from their key pair, the <em>signer</em> will generate for each request of signature another random value <span class="math inline">\(k \in \mathbb{Z}_n\)</span>, and its respective <span class="math inline">\(R'=kG\)</span>.</p>
 88
 89<p>The <em>user</em> has a message <em>m</em> that which they want to get signed by the <em>signer</em> (without the <em>signer</em> knowing the content of <em>m</em>). In order to achieve that, the user will generate a coupe of random values <span class="math inline">\(a, b \in \mathbb{Z}_n\)</span>, and from these parameters will compute the <em>blinding factor</em> <span class="math inline">\(R=aR' + bG = (ak + b)G\)</span>, and as <span class="math inline">\(R\)</span> is a point we can get <span class="math inline">\(R = (x, y)\)</span>.
 90The user can <em>blind</em> the message by computing <span class="math inline">\(m' = a^{-1} \cdot x \cdot h(m)\)</span>, where <span class="math inline">\(h(m)\)</span> is the hash of the message.</p>
 91
 92<p>Then, the <em>user</em> sends the <em>blinded message</em> (<span class="math inline">\(m'\)</span>) to the <em>signer</em>, who will perform the <em>blind signature</em> by computing <span class="math inline">\(s' = d m' + k\)</span>, which is sent back to the <em>user</em>.</p>
 93
 94<p>The <em>user</em> can unblind the signature by <span class="math inline">\(s = a s' + b\)</span>, and the complete signature will be <span class="math inline">\((R, s)\)</span>.</p>
 95
 96<p>And now, we are in a point where the signature can be verified by a third party for the <em>signer</em>&rsquo;s public key by checking <span class="math inline">\(sG == R + x h(m) Q\)</span>.</p>
 97
 98<p><div style="text-align:center; font-size:80%;">
 99    <img style="padding:50px;max-width:100%;" src="img/posts/blind-signatures-ec/flow1.png" />
100    <i>The previous diagram but with the operations from each step.</i>
101</div>
102<br></p>
103
104<p>From the verification <span class="math inline">\(sG == R + x h(m) Q\)</span>, we can unroll it and check that:</p>
105<p><span class="math display">\[
106\fbox{sG} = (a s' + b) G = (a (d m' + k) + b) G\newline
107= (a d m' + ak + b) G = ((a d (a^{-1} x h(m))) + ak + b) G\newline
108= (d x h(m) + ak + b) G\newline
109= dG x h(m) + (ak + b)G = \fbox{R + x h(m) Q}
110\]</span></p>
111<h4>Code</h4>
112
113<p>Here is an example of how this scheme on the <a href="https://en.bitcoin.it/wiki/Secp256k1">secp256k1</a> curve could be used using the implementation from <a href="https://github.com/arnaucube/go-blindsecp256k1">go-blindsecp256k1</a>.</p>
114
115<pre><code class="language-go">import (
116	[...]
117	&quot;github.com/arnaucube/go-blindsecp256k1&quot;
118)
119
120func main() {
121    // signer: create new signer key pair
122    sk := blindsecp256k1.NewPrivateKey()
123    signerPubK := sk.Public()
124
125    // signer: when user requests new R parameter to blind a new msg,
126    // create new signerR (public) with its secret k
127    k, signerR := blindsecp256k1.NewRequestParameters()
128
129    // user: blinds the msg using signer's R
130    msg := new(big.Int).SetBytes([]byte(&quot;test&quot;))
131    msgBlinded, userSecretData, err := blindsecp256k1.Blind(msg, signerR)
132    if err != nil {
133	panic(err)
134    }
135
136    // signer: signs the blinded message using its private key &amp; secret k
137    sBlind, err := sk.BlindSign(msgBlinded, k)
138    if err != nil {
139	panic(err)
140    }
141
142    // user: unblinds the blinded signature
143    sig := blindsecp256k1.Unblind(sBlind, userSecretData)
144
145    // signature can be verified with signer PublicKey
146    verified := blindsecp256k1.Verify(msg, sig, signerPubK)
147    if !verified {
148	fmt.Println(&quot;verification failed&quot;)
149    } else {
150	fmt.Println(&quot;blind signature verified&quot;)
151    }
152}
153</code></pre>
154
155<h4>Conclusions</h4>
156
157<p>Blind signatures are an interesting concept, which can be used in some use cases specially on voting systems. As we&rsquo;ve seen, the math background behind it&rsquo;s not quite complex compared for example to zkSNARKs, and it does not require <a href="https://medium.com/qed-it/diving-into-the-snarks-setup-phase-b7660242a0d7">trusted setups</a>. Although, for most of the cases zkSNARKs have more flexibility, and we could cover similar use cases by proving that the user knows some <em>private key</em> for which the corresponding <em>public key</em> is placed in a leaf of a <em>Merkle Tree</em> for a certain <em>Merkle Root</em> (but this would be out of scope for the current notes).</p>
158
159<p>An implementation of this scheme in Go can be found in: <a href="https://github.com/arnaucube/go-blindsecp256k1">https://github.com/arnaucube/go-blindsecp256k1</a> (and a compatible Typescript implementation <a href="https://github.com/arnaucube/blindsecp256k1-js">blindsecp256k1-js</a>). A next iteration could be to abstract the curve &amp; keys structures, to use the generic Go ones, so other curves and already existing keys could be used with the same code.</p>
160
161<p><em>Special thanks to <a href="https://github.com/dhole">@dhole</a> for reviewing this text.</em></p>
162
163    </div>
164
165    <footer style="text-align:center; margin-top:100px;margin-bottom:50px;">
166      <div class="container">
167        <div class="row">
168          <ul class="list-inline">
169            <li><a href="https://twitter.com/arnaucube"
170                   style="color:gray;text-decoration:none;"
171                   target="_blank">twitter.com/arnaucube</a>
172            </li>
173            <li><a href="https://github.com/arnaucube"
174                   style="color:gray;text-decoration:none;"
175                   target="_blank">github.com/arnaucube</a>
176            </li>
177          </ul>
178        </div>
179        <div class="row" style="display:inline-block;">
180          Blog made with <a href="http://github.com/arnaucube/blogo/"
181                            target="_blank" style="color: gray;text-decoration:none;">Blogo</a>
182        </div>
183      </div>
184    </footer>
185
186    <script>
187    </script>
188    <script src="js/external-links.js"></script>
189    <script>hljs.initHighlightingOnLoad();</script>
190    <script defer src="js/katex/katex.min.js"></script>
191    <script defer src="js/katex/auto-render.min.js"></script>
192    <script>
193      document.addEventListener("DOMContentLoaded", function() {
194        renderMathInElement(document.body, {
195          displayMode: false,
196          // customised options
197          // • auto-render specific keys, e.g.:
198          delimiters: [
199            {left: '$$', right: '$$', display: true},
200            {left: '$', right: '$', display: false},
201            {left: "\\[", right: "\\]", display: true},
202            {left: "\\(", right: "\\)", display: false},
203          ],
204          // • rendering keys, e.g.:
205          throwOnError : true
206        });
207      });
208
209      ///
210      let theme = localStorage.getItem("theme");
211      if ((theme === "light-theme")||(theme==null)) {
212          theme = "light-theme";
213          document.getElementById("themeSwitcher").checked = false;
214      } else if (theme === "dark-theme") {
215          theme = "dark-theme";
216          document.getElementById("themeSwitcher").checked = true;
217      }
218      document.body.className = theme;
219      localStorage.setItem("theme", theme);
220
221      function switchTheme() {
222        theme = localStorage.getItem("theme");
223        if (theme === "light-theme") {
224          theme = "dark-theme";
225          document.getElementById("themeSwitcher").checked = true;
226        } else {
227          theme = "light-theme";
228          document.getElementById("themeSwitcher").checked = false;
229        }
230        document.body.className = theme;
231        localStorage.setItem("theme", theme);
232
233        console.log(theme);
234      }
235    </script>
236  <script>
237    function tagLinks(tagName) {
238      var tags = document.getElementsByTagName(tagName);
239      for (var i=0, hElem; hElem =  tags[i]; i++) {
240        if (hElem.parentNode.className=="row postThumb") {
241          continue;
242        }
243        hElem.id = hElem.innerHTML.toLowerCase().replace(" ", "-");
244        hElem.innerHTML = "<a style='text-decoration:none;color:black;' href='#"+hElem.id+"'>"+hElem.innerHTML+"</a>";
245      }
246    }
247    tagLinks("h2");
248    tagLinks("h3");
249    tagLinks("h4");
250    tagLinks("h5");
251    </script>
252    <script src="js/mermaid.min.js"></script>
253
254
255  </body>
256</html>
257