commit f537b22bb3a44cda18d9f8694f2bde728e78dfef
parent b477f4d33a2b0e98c3c62e84e4f3ab3290a28689
Author: ng0 <ng0@n0.is>
Date: Fri, 5 Jan 2018 19:13:50 +0000
braces yourselves
Diffstat:
1 file changed, 2 insertions(+), 3 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -16031,8 +16031,7 @@ assumes a reliable broadcast network. This assumption is unrealistic in some net
We present a protocol which guarantees unconditional untraceability, the original goal of the DC-net, onthe inseparability assumption (i.e. the attacker must be unable to prevent honest participants fromcommunicating, which is considerably less than reliable broadcast), and computationally secureserviceability: Computationally restricted disrupters can be identified and removed from the DC-net.
On the one hand, our solution is based on the lovely idea by David Chaum [Chau_88 {\textsection} 2.5] of setting traps for disrupters. He suggests a scheme to guarantee unconditional untraceability and computationally secure serviceability, too, but on the reliable broadcast assumption. The same scheme seems to be used by Bos and den Boer (these proceedings, = [BoBo_89]). We show that this scheme needs some changes and refinements before being secure, even on the reliable broadcast assumption.
On the other hand, our solution is based on the idea of digital signatures whose forgery by an unexpectedly powerful attacker is provable, which might be of independent interest. We propose such a (one-time) signature scheme based on claw-free permutation pairs; the forgery of signatures is equivalent to finding claws, thus in a special case to the factoring problem. In particular, with such signatures we can, for the first time, realize fail-stop Byzantine Agreement, and also adaptive Byzantine Agreement, i.e. Byzantine Agreement which can only be disrupted by an attacker who controls at least a third of all participants and who can forge signatures.
-We also sketch applications of these signatures to a payment system, solving disputes about shared secrets, and signatures which cannot be shown round.
-},
+We also sketch applications of these signatures to a payment system, solving disputes about shared secrets, and signatures which cannot be shown round.}},
keywords = {anonymity, arbitrary network, cryptology, DC-net},
isbn = {3-540-53433-4},
url = {http://dl.acm.org/citation.cfm?id=111563.111630},
@@ -16048,7 +16047,7 @@ We also sketch applications of these signatures to a payment system, solving dis
pages = {668{\textendash}676},
publisher = {ACM},
address = {New York, NY, USA},
- abstract = {{Skip lists are data structures that use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees.},
+ abstract = {{Skip lists are data structures that use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees.}},
keywords = {data structures, search},
issn = {0001-0782},
doi = {10.1145/78973.78977},
