diff options
author | Christian Grothoff <christian@grothoff.org> | 2013-01-03 14:22:34 +0000 |
---|---|---|
committer | Christian Grothoff <christian@grothoff.org> | 2013-01-03 14:22:34 +0000 |
commit | 2d4b8109d5e8f5c04b19232e359a76bea4c11303 (patch) | |
tree | c05f1ff51bfa29df312e8222d0d2de87ba13719c | |
parent | 498a88f823fa476a2928b182bb9ed38f82465bd4 (diff) | |
download | gnunet-java-2d4b8109d5e8f5c04b19232e359a76bea4c11303.tar.gz gnunet-java-2d4b8109d5e8f5c04b19232e359a76bea4c11303.zip |
-answers
-rw-r--r-- | ISSUES | 10 | ||||
-rw-r--r-- | doc/voting.pdf | bin | 180581 -> 175593 bytes | |||
-rw-r--r-- | doc/voting.tex | 2 |
3 files changed, 7 insertions, 5 deletions
@@ -43,14 +43,16 @@ | |||
43 | * Jan 02 22:03:52-356968 core-api-22511 INFO (Re)connecting to CORE service, monitoring messages of type 0 | 43 | * Jan 02 22:03:52-356968 core-api-22511 INFO (Re)connecting to CORE service, monitoring messages of type 0 |
44 | * how does that make sense? | 44 | * how does that make sense? |
45 | 45 | ||
46 | |||
46 | * IBF hash function: there's no need to have a cryptographic hash, as no randomization is possible, | 47 | * IBF hash function: there's no need to have a cryptographic hash, as no randomization is possible, |
47 | and the domain of the hash function actually is really small. To find one collision on an IBF with n buckets, on average | 48 | and the domain of the hash function actually is really small. To find one collision on an IBF with n buckets, on average |
48 | we only have to try n random values, there's no need to find a SHA-256 collision | 49 | we only have to try n random values, there's no need to find a SHA-256 collision |
50 | fine. | ||
49 | 51 | ||
50 | * when the client violates the protocol, what should the service do? | 52 | * when the client violates the protocol, what should the service do? Hang up (close TCP connection), keep going. |
51 | * most services use GNUNET_break? | 53 | * most services use GNUNET_break? Yes. |
52 | * which is not very helful, as developers for other bindings (e.g. java ;) have to look up the right line in the c code, | 54 | * which is not very helful, as developers for other bindings (e.g. java ;) have to look up the right line in the c code, |
53 | with no error message | 55 | with no error message; that's what you have the file name and line number for! |
54 | 56 | ||
55 | * GNUNET_APPLICATION_TYPE_END obvious, but not documented | 57 | * GNUNET_APPLICATION_TYPE_END obvious, but not documented -- eh, it is. |
56 | 58 | ||
diff --git a/doc/voting.pdf b/doc/voting.pdf index 93067ff..a4340c0 100644 --- a/doc/voting.pdf +++ b/doc/voting.pdf | |||
Binary files differ | |||
diff --git a/doc/voting.tex b/doc/voting.tex index d00bbaf..066e4b5 100644 --- a/doc/voting.tex +++ b/doc/voting.tex | |||
@@ -142,7 +142,7 @@ The details on how this protocol can be constructed from the discrete log protoc | |||
142 | $\xleftarrow{c}$ & $c \in_R Z_q$ \\ \\ | 142 | $\xleftarrow{c}$ & $c \in_R Z_q$ \\ \\ |
143 | 143 | ||
144 | $r_2 \leftarrow w - \alpha d_2$ & $r_1 \leftarrow w - \alpha d_1$ & | 144 | $r_2 \leftarrow w - \alpha d_2$ & $r_1 \leftarrow w - \alpha d_1$ & |
145 | $\xrightarrow{d_1,d_2,r_1,r_2}$ & $c \? d_1 + d_2$ \\ | 145 | $\xrightarrow{d_1,d_2,r_1,r_2}$ & $c \; \? d_1 + d_2$ \\ |
146 | \multicolumn{3}{c}{} & $a_1 \? g^{r1} x^{d_1}$ \\ | 146 | \multicolumn{3}{c}{} & $a_1 \? g^{r1} x^{d_1}$ \\ |
147 | \multicolumn{3}{c}{} & $b_1 \? h^{r1} (yG)^{d_1}$ \\ | 147 | \multicolumn{3}{c}{} & $b_1 \? h^{r1} (yG)^{d_1}$ \\ |
148 | \multicolumn{3}{c}{} & $a_2 \? g^{r2} x^{d_2}$ \\ | 148 | \multicolumn{3}{c}{} & $a_2 \? g^{r2} x^{d_2}$ \\ |