From af67501b777f3caf32f278e2dab9ffcba346aead Mon Sep 17 00:00:00 2001
From: Florian Dold <florian.dold@gmail.com>
Date: Tue, 25 Sep 2018 10:14:11 +0200
Subject: Sign_BS is a protocol, fix subscript

---
 taler-fc19/paper.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

(limited to 'taler-fc19/paper.tex')

diff --git a/taler-fc19/paper.tex b/taler-fc19/paper.tex
index f84f118..56e04ce 100644
--- a/taler-fc19/paper.tex
+++ b/taler-fc19/paper.tex
@@ -753,10 +753,10 @@ is the signer and $\mathcal{R}$ is the signature requester:
     to blind a message $m$ that is to be signed later.  The result is a blinded message $\overline{m}$ and
     a residual $r$ that allows to unblind a blinded signature on $m$ made by $\V{sk}$.
   \item $\algo{Sign}_{BS}(\mathcal{S}(\V{sk}), \mathcal{R}(\overline{m})) \mapsto
-    \overline{\sigma}$ is an algorithm to sign a blinded message $\overline{m}$.
+    \overline{\sigma}$ is a protocol to sign a blinded message $\overline{m}$.
     The result $\overline{\sigma}$ is a blinded signature that must be unblinded
     using the $r$ returned from the corresponding blinding operation before
-    verification.  We restrict \algo{Sign} to be a two-move protocol, where the
+    verification.  We restrict $\algo{Sign}_{BS}$ to be a two-move protocol, where the
     requester sends the first message, and the signer responds.
   \item $\algo{UnblindSig}_{BS}(r, m, \overline{\sigma}) \mapsto \sigma$
     is an algorithm to unblind a blinded signature.
-- 
cgit v1.2.3

