Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Open sidebar
belenios
belenios
Commits
65934311
Commit
65934311
authored
Jan 09, 2014
by
Stephane Glondu
Browse files
Minor fixes in specification
parent
b455ae2f
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
4 additions
and
4 deletions
+4
-4
doc/specification.tex
doc/specification.tex
+4
-4
No files found.
doc/specification.tex
View file @
65934311
...
...
@@ -53,12 +53,12 @@ The cryptography involved in Belenios needs a cyclic group $\G$ where
discrete logarithms are hard to compute. We will denote by
$
g
$
a
generator and
$
q
$
its order. We use a multiplicative notation for the
group operation. For practical purposes, we use a multiplicative
subgroup of
$
\F
_
p
$
(hence, all exponentiations are implicitly done
subgroup of
$
\F
^
*
_
p
$
(hence, all exponentiations are implicitly done
modulo
$
p
$
). We suppose the group parameters are agreed on
beforehand. Default group parameters are given as examples in
section~
\ref
{
default-group
}
(they are the same as Helios v3).
\section
{
P
rincipal
s
}
\section
{
P
artie
s
}
\begin{itemize}
\item
$
S
$
: voting server
...
...
@@ -549,8 +549,8 @@ $\result$ structure is then computed as follows:
\[
\resultlabel
_{
i,j
}
=
\log
_
g
\left
(
\frac
{
\betalabel
(
\etallylabel
_{
i,j
}
)
}{
F
_{
i,j
}}
\right
)
\]
Here, the discrete logarithm
logarithm
can be easily computed because
it is
bounded by
$
\ntallied
$
.
Here, the discrete logarithm can be easily computed because
it is
bounded by
$
\ntallied
$
.
After the election, the following data needs to be public in order to
verify the tally:
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment