aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMarkus Teich <markus.teich@stusta.mhn.de>2016-10-12 19:18:14 +0200
committerMarkus Teich <markus.teich@stusta.mhn.de>2016-10-12 19:18:14 +0200
commit6654fc3c01eeae08c81a847bfa1fd5e7394acf5b (patch)
tree789b76eeceac39be13f82d81d950d99e2a252bfb
parenteddab7698236e5fcc0f258e191409c64062753b4 (diff)
downloadlibbrandt-6654fc3c01eeae08c81a847bfa1fd5e7394acf5b.tar.gz
libbrandt-6654fc3c01eeae08c81a847bfa1fd5e7394acf5b.zip
typo
-rw-r--r--tex-stuff/math.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/tex-stuff/math.tex b/tex-stuff/math.tex
index b5cd37e..ae66608 100644
--- a/tex-stuff/math.tex
+++ b/tex-stuff/math.tex
@@ -210,7 +210,7 @@ M+1st highest bid.
210 210
211\subsubsection{Addition to Round 1: Encrypt bid} 211\subsubsection{Addition to Round 1: Encrypt bid}
212 212
213The Bidders also have to use Proof 2 to show that $\displaystyle ECDL_Y\left(\left(\sum_{j=1}^{k/n}\alpha_{a,jn+a}\right) - G\right) = ECDL_G\left(\sum_{j=1}^{k/n}\beta_{a,jn+a}\right)$. \\[2.0ex] 213The bidders also have to use Proof 2 to show that $\displaystyle ECDL_Y\left(\left(\sum_{j=1}^{k/n}\alpha_{a,jn+a}\right) - G\right) = ECDL_G\left(\sum_{j=1}^{k/n}\beta_{a,jn+a}\right)$. \\[2.0ex]
214This is to ensure bidders have only chosen valid bids for their bid index, since 214This is to ensure bidders have only chosen valid bids for their bid index, since
215in M+1st price auctions the amount of possible prices is multiplied by $n$ to 215in M+1st price auctions the amount of possible prices is multiplied by $n$ to
216prevent ties. This increases the message size by $96$ bytes. 216prevent ties. This increases the message size by $96$ bytes.