commit a77b88ef5fc1ef6df44de0f5f1382da2bf0fccf5
parent 1a130d4d67ee175efc17f61fc3f2be8fbe0cee4a
Author: Nils Gillmann <ng0@n0.is>
Date: Wed, 31 Oct 2018 16:41:59 +0000
rename record for r5n paper, tag it as selected, add file to collect ERATA until a way to display erata is implemented
Signed-off-by: Nils Gillmann <ng0@n0.is>
Diffstat:
2 files changed, 5 insertions(+), 3 deletions(-)
diff --git a/ERATA b/ERATA
@@ -0,0 +1,2 @@
+R5N, 2011 paper:
+The paper says "Our design also includes topology augmentation using a combination of distance-vector and onion-routing, a novel replication strategy and an API to verify content integrity.". This is false, as what is used is onion encryption (layered encryption) for the distance-vector path, but not onion routing (as the topology augmentation uses distance-vector routing).
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -1863,7 +1863,7 @@ private mechanism, will only gain a negligible advantage (up to a privacy parame
url = {https://bibliography.gnunet.org},
author = {Florian Kerschbaum}
}
-@conference {2011_10,
+@conference {R5N,
title = {R5N : Randomized Recursive Routing for Restricted-Route Networks},
booktitle = {5th International Conference on Network and System Security (NSS 2011)},
year = {2011},
@@ -1871,9 +1871,9 @@ private mechanism, will only gain a negligible advantage (up to a privacy parame
publisher = {IEEE},
organization = {IEEE},
address = {Milan, Italy},
- abstract = {This paper describes a new secure DHT routing algorithm for open,
-decentralized P2P networks operating in a restricted-route environment with malicious participants. We have implemented our routing algorithm and have evaluated its performance under various topologies and in the presence of malicious peers. For small-world topologies, our algorithm provides significantly better performance when compared to existing methods. In more densely connected topologies, our performance is better than or on par with other designs},
+ abstract = {This paper describes a new secure DHT routing algorithm for open, decentralized P2P networks operating in a restricted-route environment with malicious participants. We have implemented our routing algorithm and have evaluated its performance under various topologies and in the presence of malicious peers. For small-world topologies, our algorithm provides significantly better performance when compared to existing methods. In more densely connected topologies, our performance is better than or on par with other designs},
www_section = {distributed hash table, GNUnet, R5N, routing},
+ www_tags = selected,
www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/nss2011.pdf},
url = {https://bibliography.gnunet.org},
author = {Nathan S Evans and Christian Grothoff}