commit 2d48dc4f1810ed0b31d47abd4acc6b38537fbd72
parent 543bde4eb9a7367e01b72ebd83b8cc289d152a04
Author: Nils Gillmann <ng0@n0.is>
Date: Mon, 8 Oct 2018 13:43:33 +0000
gnunetbib.bib fixes
Signed-off-by: Nils Gillmann <ng0@n0.is>
Diffstat:
| M | gnunetbib.bib | | | 355 | ++++++++++++++++++++++++++++++++++++++++++++----------------------------------- |
1 file changed, 199 insertions(+), 156 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -48,7 +48,7 @@
www_section = {auctions, GNUnet, secure multi-party computation},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/thesis_0.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Markus Teich},
editor = {Totakura, Sree Harsha and Grothoff, Christian and Felix Brandt}
}
@@ -64,7 +64,7 @@
abstract = {In contrast to ubiquitous cloud-based solutions the telephony application GNUnet conversation provides fully-decentralized, secure voice communication and thus impedes mass surveillance. The aim of this thesis is to investigate why GNUnet conversation currently provides poor Quality of Experience under typical wide area network conditions and to propose optimization measures. After network shaping and the initialization of two isolated GNUnet peers had been automated, delay measurements were done. With emulated network characteristics network delay, cryptography delays and audio codec delays were measured and transmitted speech was recorded. An analysis of the measurement results and a subjective assessment of the speech recordings revealed that extreme outliers occur in most scenarios and impair QoE. Moreover it was shown that GNUnet conversation introduces a large delay that confines the environment in which good QoE is possible. In the measurement environment at least 23 ms always ocurred of which large parts are were caused by cryptography. It was shown that optimization in the cryptography part and other components are possible. Finally the conditions for currently reaching good QoE were determined and ideas for further investigations were presented},
www_section = {CADET, GNUnet, measurement, performance},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/lurchi-bs-thesis.pdf},
author = {Christian Ulrich}
}
@@ -73,7 +73,7 @@
booktitle = {International Conference on Availability, Reliability and Security (ARES)},
year = {2016},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/dold2016byzantine.pdf},
author = {Dold, Florian and Grothoff, Christian}
}
@@ -86,7 +86,7 @@
www_section = {byzantine fault tolerance, consensus, GNUnet},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/consensus2016.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Florian Dold and Christian Grothoff}
}
@conference {taler2016space,
@@ -101,7 +101,7 @@
www_section = {blind signatures, GNUnet, incentives, payments, Taler, web},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/taler2016space.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Jeffrey Burdges and Florian Dold and Christian Grothoff and Marcello Stanisci}
}
@mastersthesis {xrs2016,
@@ -117,7 +117,7 @@
www_section = {GNUnet, peer-to-peer},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/xrs2016.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Christian Ricardo K{\"u}hne}
}
@conference {2016,
@@ -131,7 +131,7 @@
abstract = {Today, user attributes are managed at centralized identity providers. However, two centralized identity providers dominate digital identity and access management on the web. This is increasingly becoming a privacy problem in times of mass surveillance and data mining for targeted advertisement. Existing systems for attribute sharing or credential presentation either rely on a trusted third party service or require the presentation to be online and synchronous. In this paper we propose a concept that allows the user to manage and share his attributes asynchronously with a requesting party using a secure, decentralized name system},
www_section = {Decentralisation, GNUnet, Identity and Access Management, User Attributes},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Martin Schanzenbach and Christian Banse}
}
@conference {p4t2016,
@@ -146,7 +146,7 @@
www_section = {abuse, GNUnet, Privacy preserving, reputation, Social networking},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p4t.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {{\'A}lvaro Garc{\'\i}a-Recuero and Jeffrey Burdges and Christian Grothoff}
}
@article {fk-2016-1-p46,
@@ -157,7 +157,7 @@
www_section = {Architecture, GNUnet, Internet},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fk-2016-1-p46.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Christian Ricardo K{\"u}hne}
}
@mastersthesis {ma_dold_consensus_21dec2015byzantine,
@@ -173,7 +173,7 @@
www_section = {byzantine consensus, GNUnet, secure multiparty computation, set reconciliation, voting},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ma_dold_consensus_21dec2015.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Florian Dold}
}
@article {mcb-es2015,
@@ -186,7 +186,7 @@
journal = {unknown},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-es.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum}
}
@article {mcb-it2015,
@@ -199,7 +199,7 @@
journal = {unknown},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-it.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum and Luca Saiu}
}
@article {mcb-fr2015,
@@ -212,7 +212,7 @@
journal = {unknown},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-fr.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum and Ludovic Courtes}
}
@article {mcb-en2015,
@@ -225,7 +225,7 @@
journal = {unknown},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-en.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum}
}
@mastersthesis {mwachs2014,
@@ -260,7 +260,7 @@
www_section = {GNUnet, home router, intrusion detection, memory erasure, Panic, physical access},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/panic.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Nicolas Bene{\v s}}
}
@conference {paper_short2014,
@@ -275,7 +275,7 @@
www_section = {GNUnet, resource allocation},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/paper_short.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Matthias Wachs and Fabian Oehlmann and Christian Grothoff}
}
@book {pir2014,
@@ -293,6 +293,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
doi = {10.1007/978-3-319-08506-7_4},
url = {http://dx.doi.org/10.1007/978-3-319-08506-7_4},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pir_0.pdf},
+ www_section = unsorted,
author = {Devet, Casey and Goldberg, Ian},
editor = {De Cristofaro, Emiliano and Murdoch, StevenJ}
}
@@ -305,7 +306,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
www_section = {CADET, encryption, GNUnet, routing},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cadet.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Polot, Bartlomiej and Christian Grothoff}
}
@conference {DistributedSearch2014Hermann,
@@ -315,7 +316,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
abstract = {The vast majority of Internet users are relying on centralized search engine providers to conduct their web searches. However, search results can be censored and search queries can be recorded by these providers without the user{\textquoteright}s knowledge. Distributed web search engines based on peer-to-peer networks have been proposed to mitigate these threats. In this paper we analyze the three most popular real-world distributed web search engines: Faroo, Seeks and Yacy, with respect to their censorship resistance and privacy protection. We show that none of them provides an adequate level of protection against an adversary with modest resources. Recognizing these flaws, we identify security properties a censorship-resistant and privacy-preserving distributed web search engine should provide. We propose two novel defense mechanisms called node density protocol and webpage verification protocol to achieve censorship resistance and show their effectiveness and feasibility with simulations. Finally, we elaborate on how state-of-the-art defense mechanisms achieve privacy protection in distributed web search engines},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DistributedSearch2014Hermann.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Michael Herrmann and Ren Zhang and Kai-Chun Ning and Claudia Diaz}
}
@conference {CANS2014camera-ready,
@@ -328,7 +329,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
www_section = {DNS, GNU Name System, GNUnet, PKI},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/paper_cans2014_camera_ready.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Matthias Wachs and Martin Schanzenbach and Christian Grothoff}
}
@mastersthesis {scheibner-thesis2014,
@@ -344,7 +345,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
www_section = {event-driven, flow control, GNUnet, static analysis},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/scheibner_thesis.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Florian Scheibner}
}
@mastersthesis {morales2014cryogenic,
@@ -363,7 +364,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
www_section = {cooperative, cryogenic, GNUnet, Linux, POSIX, power},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/morales2014cryogenic.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Alejandra Morales}
}
@mastersthesis {dold-thesis2014voting,
@@ -381,7 +382,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
www_section = {GNUnet, secure multiparty computation, voting},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ba_dold_voting_24aug2014.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Florian Dold}
}
@mastersthesis {decmon2014,
@@ -396,7 +397,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
www_section = {anomaly, censorship, detection, GNUnet},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/decmon_0.pdf},
www_section = unsorted,
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Omar Tarabai}
}
@book {anonymity_and_cover_traffic2014,
@@ -431,7 +432,7 @@ designed to not require any long-term secrets and provide perfect forward secrec
as an evaluation of its performance},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DP5\%3A\%20A\%20Private\%20Presence\%20Service.pdf},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Borisov, Nikita and Danezis, George and Goldberg, Ian}
}
@book {obfuscation_osn2014,
@@ -448,6 +449,7 @@ as an evaluation of its performance},
doi = {10.1007/978-3-319-08506-7_3},
url = {http://dx.doi.org/10.1007/978-3-319-08506-7_3},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/obfuscation_osn.pdf},
+ www_section = unsorted,
author = {Chen, Terence and Boreli, Roksana and Kaafar, Mohamed-Ali and Friedman, Arik},
editor = {De Cristofaro, Emiliano and Murdoch, StevenJ}
}
@@ -462,8 +464,7 @@ as an evaluation of its performance},
address = {Saarbruecken},
abstract = {Distributed Hash Tables (DHTs) are a key data structure for construction of a peer to peer systems. They provide an efficient way to distribute the storage and retrieval of key-data pairs among the participating peers. DHTs should be scalable, robust against churn and resilient to attacks. X-Vine is a DHT protocol which offers security against Sybil attacks. All communication among peers is performed over social network links, with the presumption that a friend can be trusted. This trust can be extended to a friend of a friend. It uses the tested Chord Ring topology as an overlay, which has been proven to be scalable and robust. The aim of the thesis is to experimentally compare two DHTs, R5 N and X-Vine. GNUnet is a free software secure peer to peer framework, which uses R 5N . In this thesis, we have presented the implementation of X-Vine on GNUnet, and compared the performance of R5 N and X-Vine},
www_section = {DHT, GNUnet, performance analysis, testbed, X-vine},
- www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SupritiSinghMasterThesis.pdf},
author = {Supriti Singh}
}
@@ -485,6 +486,7 @@ distributed encryption scheme that is much more efficient for small plaintext do
doi = {10.1007/978-3-319-08506-7_7},
url = {http://dx.doi.org/10.1007/978-3-319-08506-7_7},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/foward_secure_encryption.pdf},
+ www_section = unsorted,
author = {Lueks, Wouter and Hoepman, Jaap-Henk and Kursawe, Klaus},
editor = {De Cristofaro, Emiliano and Murdoch, StevenJ}
}
@@ -502,7 +504,7 @@ This thesis also describes Knock, a free software implementation of TCP Stealth
www_section = {GNUnet, Hacienda, Knock, TCP Stealth},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ma_kirsch_2014_0.pdf},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Julian Kirsch}
}
@conference {strint2014,
@@ -516,7 +518,7 @@ This thesis also describes Knock, a free software implementation of TCP Stealth
www_section = {GNU Name System, GNUnet, KBR, PKI},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/strint2014.pdf},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Christian Grothoff and Polot, Bartlomiej and Carlo von Loesch}
}
@mastersthesis {oehlmann2014machinelearning,
@@ -541,7 +543,7 @@ The design is evaluated with the help of simulation and a realistic implementati
www_section = {bandwidth allocation, GNUnet, machine learning},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/oehlmann2014machinelearning.pdf},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Fabian Oehlmann}
}
@mastersthesis {arias2014bs,
@@ -560,7 +562,7 @@ obtained with different parameter sets and different test cases are presented an
www_section = {GNUnet, linear programming, secure multi-party computation},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/arias2014bs.pdf},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Raphael Arias}
}
@conference {DBLP:conf/stoc/Ullman13,
@@ -569,7 +571,7 @@ obtained with different parameter sets and different test cases are presented an
year = {2013},
pages = {361--370},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Jonathan Ullman}
}
@book {Broadening2013Chatzikokolakis,
@@ -587,6 +589,7 @@ In this paper we explore the implications of differential privacy when the indis
doi = {10.1007/978-3-642-39077-7_5},
url = {http://dx.doi.org/10.1007/978-3-642-39077-7_5},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Brodening2013Chatzikokolakis.pdf},
+ www_section = unsorted,
author = {Chatzikokolakis, Konstantinos and Andr{\'e}s, MiguelE. and Bordenabe, Nicol{\'a}sEmilio and Palamidessi, Catuscia},
editor = {De Cristofaro, Emiliano and Wright, Matthew}
}
@@ -602,7 +605,7 @@ In this paper we explore the implications of differential privacy when the indis
www_section = {GNS, GNUnet, PSYC, social networks},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/gnunet-psyc.pdf},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Gabor X Toth}
}
@conference {fps2013wachs,
@@ -619,7 +622,7 @@ This paper maps the design space and gives design requirements for censorship re
www_section = {DNS, GNS, GNU Name System, GNUnet, PKI, SDSI, Zooko{\textquoteright}s Triangle},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fps2013wachs.pdf},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Matthias Wachs and Martin Schanzenbach and Christian Grothoff}
}
@conference {DBLP:conf/netys/BoutetFJKR13,
@@ -628,7 +631,7 @@ This paper maps the design space and gives design requirements for censorship re
year = {2013},
pages = {58--73},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Antoine Boutet and Davide Frey and Arnaud Jegou and Anne-Marie Kermarrec and Heverson B. Ribeiro}
}
@mastersthesis {2013_1,
@@ -650,7 +653,7 @@ We specifically target HPC systems like compute clusters and supercomputers and
www_section = {emulation, GNUnet, large scale testing, protocol evaluation, testbed},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/thesis_lowres.pdf , https://gnunet.org/git/bibliography.git/tree/docs/thesis.pdf},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Totakura, Sree Harsha}
}
@mastersthesis {2013_2,
@@ -668,7 +671,7 @@ In this paper we describe the problems that occur when debugging widely distribu
www_section = {automatic, clustering, debugging, GDB, GNUnet, report, Tor},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/main_0.pdf},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Markus Teich}
}
@conference {2013_3,
@@ -694,7 +697,7 @@ In this paper we describe the problems that occur when debugging widely distribu
author = {DeCew, Judith},
publisher = {unknown},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
editor = {Edward N. Zalta}
}
@article {2013_4,
@@ -705,7 +708,7 @@ In this paper we describe the problems that occur when debugging widely distribu
journal = {unknown},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tofu-pinning.pdf},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Gabor X Toth},
editor = {Tjebbe Vlieg}
}
@@ -728,7 +731,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
www_section = {anonymity, HTTP, privacy, spdy, Tor},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/uzunov2013torspdy.pdf},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Andrey Uzunov}
}
@article {Kermarrec2013,
@@ -742,7 +745,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
issn = {1364-503X},
doi = {10.1098/rsta.2012.0380},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Kermarrec, Anne-Marie}
}
@conference {2013_6,
@@ -753,7 +756,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
doi = {10.1109/SP.2013.15},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Trawling_for_tor_HS.pdf},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Biryukov, A. and Pustogarov, I. and Weinmann, R.}
}
@conference {2013_7,
@@ -765,7 +768,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
abstract = {We present WHATSUP, a collaborative filtering system for disseminating news items in a large-scale dynamic setting with no central authority. WHATSUP constructs an implicit social network based on user profiles that express the opinions of users about the news items they receive (like-dislike). Users with similar tastes are clustered using a similarity metric reflecting long-standing and emerging (dis)interests. News items are disseminated through a novel heterogeneous gossip protocol that (1) biases the orientation of its targets towards those with similar interests, and (2) amplifies dissemination based on the level of interest in every news item. We report on an extensive evaluation of WHATSUP through (a) simulations, (b) a ModelNet emulation on a cluster, and (c) a PlanetLab deployment based on real datasets. We show that WHATSUP outperforms various alternatives in terms of accurate and complete delivery of relevant news items while preserving the fundamental advantages of standard gossip: namely, simplicity of deployment and robustness},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/whatsup.pdf},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Antoine Boutet and Davide Frey and Rachid Guerraoui and Arnaud Jegou and Anne-Marie Kermarrec}
}
@article {knight2012autonetkit,
@@ -798,6 +801,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
doi = {10.1007/978-3-642-33536-5_20},
url = {http://dx.doi.org/10.1007/978-3-642-33536-5_20},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BLIP2012Alaggan.pdf},
+ www_section = unsorted,
author = {Alaggan, Mohammad and Gambs, S{\'e}bastien and Kermarrec, Anne-Marie},
editor = {Richa, Andr{\'e}aW. and Scheideler, Christian}
}
@@ -810,7 +814,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
abstract = {Tor, an anonymity network formed by volunteer nodes, uses the estimated bandwidth of the nodes as a central feature of its path selection algorithm. The current load on nodes is not considered in this algorithm, however, and we observe that some nodes persist in being under-utilized or congested. This can degrade the network{\textquoteright}s performance, discourage Tor adoption, and consequently reduce the size of Tor{\textquoteright}s anonymity set. In an effort to reduce congestion and improve load balancing, we propose a congestion-aware path selection algorithm. Using latency as an indicator of congestion, clients use opportunistic and lightweight active measurements to evaluate the congestion state of nodes, and reject nodes that appear congested. Through experiments conducted on the live Tor network, we verify our hypothesis that clients can infer congestion using latency and show that congestion-aware path selection can improve performance},
www_section = {algorithms, Tor, volunteer nodes},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FC\%2712\%20-\%20Congestion-aware\%20Path\%20Selection\%20for\%20Tor.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Tao Wang and Kevin Bauer and Clara Forero and Ian Goldberg}
}
@conference {2012_1,
@@ -835,7 +839,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
month = feb,
abstract = {While the Internet was conceived as a decentralized network, the most widely used web applications today tend toward centralization. Control increasingly rests with centralized service providers who, as a consequence, have also amassed unprecedented amounts of data about the behaviors and personalities of individuals. Developers, regulators, and consumer advocates have looked to alternative decentralized architectures as the natural response to threats posed by these centralized services. The result has been a great variety of solutions that include personal data stores (PDS), infomediaries, Vendor Relationship Management (VRM) systems, and federated and distributed social networks. And yet, for all these efforts, decentralized personal data architectures have seen little adoption. This position paper attempts to account for these failures, challenging the accepted wisdom in the web community on the feasibility and desirability of these approaches. We start with a historical discussion of the development of various categories of decentralized personal data architectures. Then we survey the main ideas to illustrate the common themes among these efforts. We tease apart the design characteristics of these systems from the social values that they (are intended to) promote. We use this understanding to point out numerous drawbacks of the decentralization paradigm, some inherent and others incidental. We end with recommendations for designers of these systems for working towards goals that are achievable, but perhaps more limited in scope and ambition},
www_section = {distributed social networks, economics, personal data stores, policy, privacy, web},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CoRR\%20-\%20Critical\%20look\%20at\%20decentralization.pdf},
author = {Arvind Narayanan and Vincent Toubiana and Solon Barocas and Helen Nissenbaum and Dan Boneh}
}
@@ -851,7 +855,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
abstract = {This thesis presents a novel approach for decentralized evaluation of regular expressions for capability discovery in DHT-based overlays. The system provides support for announcing capabilities expressed as regular expressions and discovering participants offering adequate capabilities. The idea behind our approach is to convert regular expressions into finite automatons and store the corresponding states and transitions in a DHT. We show how locally constructed DFA are merged in the DHT into an NFA without the knowledge of any NFA already present in the DHT and without the need for any central authority. Furthermore we present options of optimizing the DFA. There exist several possible applications for this general approach of decentralized regular expression evaluation. However, in this thesis we focus on the application of discovering users that are willing to provide network access using a specified protocol to a particular destination. We have implemented the system for our proposed approach and conducted a simulation. Moreover we present the results of an emulation of the implemented system in a cluster},
www_section = {DFA, distributed hash table, GNUnet, NFA, regular expressions, search},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/szengel2012ms.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Maximilian Szengel}
}
@mastersthesis {2012_3,
@@ -866,7 +870,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
abstract = {This thesis presents the design and implementation of the GNU Alternative Domain System (GADS), a decentralized, secure name system providing memorable names for the Internet as an alternative to the Domain Name System (DNS). The system builds on ideas from Rivest{\textquoteright}s Simple Distributed Security Infrastructure (SDSI) to address a central issue with providing a decentralized mapping of secure identifiers to memorable names: providing a global, secure and memorable mapping is impossible without a trusted authority. SDSI offers an alternative by linking local name spaces; GADS uses the transitivity provided by the SDSI design to build a decentralized and censorship resistant name system without a trusted root based on secure delegation of authority. Additional details need to be considered in order to enable GADS to integrate smoothly with the World Wide Web. While following links on the Web matches following delegations in GADS, the existing HTTP-based infrastructure makes many assumptions about globally unique names; however, proxies can be used to enable legacy applications to function with GADS. This work presents the fundamental goals and ideas behind GADS, provides technical details on how GADS has been implemented and discusses deployment issues for using GADS with existing systems. We discuss how GADS and legacy DNS can interoperate during a transition period and what additional security advantages GADS offers over DNS with Security Extensions (DNSSEC). Finally, we present the results of a survey into surfing behavior, which suggests that the manual introduction of new direct links in GADS will be infrequent},
www_section = {censorship resistance, decentralized, DNS, GNU Name System, GNUnet},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/schanzen2012msc.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Martin Schanzenbach}
}
@book {2012_4,
@@ -885,6 +889,7 @@ Interestingly, the design of our mechanism is quite different from the tradition
doi = {10.1007/978-3-642-32009-5_29},
url = {http://dx.doi.org/10.1007/978-3-642-32009-5_29},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DPwithImperfectRandomness2012Dodis.pdf},
+ www_section = unsorted,
author = {Dodis, Yevgeniy and L{\'o}pez-Alt, Adriana and Mironov, Ilya and Vadhan, Salil},
editor = {Safavi-Naini, Reihaneh and Canetti, Ran}
}
@@ -911,7 +916,7 @@ accuracy of the protocol},
www_section = {GNUnet, network security, network size estimation, peer-to-peer networking},
journal = {unknown},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/nse-techreport.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Nathan S Evans and Polot, Bartlomiej and Christian Grothoff}
}
@conference {2012_6,
@@ -940,7 +945,7 @@ accuracy of the protocol},
address = {Prague, CZ},
www_section = {network size estimation},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Gossipico.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Ruud van de Bovenkamp and Fernando Kuipers and Piet Van Mieghem}
}
@conference {DBLP:conf/tridentcom/HermenierR12,
@@ -950,7 +955,7 @@ accuracy of the protocol},
pages = {287--304},
www_section = {emulab, emulation, testbed},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/how-to-build-a-better-testbed.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Fabien Hermenier and Robert Ricci}
}
@conference {2012_7,
@@ -963,7 +968,7 @@ accuracy of the protocol},
In this paper, we propose privacy-preserving location-based matching as a fundamental platform primitive and as an alternative to exposing low-level, latitude-longitude (lat-long) coordinates to applications. Applications set rich location-based triggers and have these be fired based on location updates either from the local device or from a remote device (e.g., a friend{\textquoteright}s phone). Our Koi platform, comprising a privacy-preserving matching service in the cloud and a phone-based agent, realizes this primitive across multiple phone and browser platforms. By masking low-level lat-long information from applications, Koi not only avoids leaking privacy-sensitive information, it also eases the task of programmers by providing a higher-level abstraction that is easier for applications to build upon. Koi{\textquoteright}s privacy-preserving protocol prevents the cloud service from tracking users. We verify the non-tracking properties of Koi using a theorem prover, illustrate how privacy guarantees can easily be added to a wide range of location-based applications, and show that our public deployment is performant, being able to perform 12K matches per second on a single core},
www_section = {location privacy, matching},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/nsdi12-koi.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Saikat Guha and Mudit Jain and Venkata Padmanabhan}
}
@conference {oakland2012-lap,
@@ -979,7 +984,7 @@ such that users can choose between the level of anonymity and usability. We prop
remote tracking. To show practicality, we demonstrate that LAP can work on top of the current Internet and proposed future Internet architectures},
www_section = {anonymous communication anonymity protection, LAP},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/LAP\%3A\%20Lightweight\%20Anonymity\%20and\%20Privacy.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Hsu-Chun Hsiao and Tiffany Hyun-Jin Kim and Adrian Perrig and Akira Yamada and Sam Nelson and Marco Gruteser and Wei Ming}
}
@conference {oakland2012-lastor,
@@ -1024,7 +1029,7 @@ latencies by 25\% while also reducing the false negative rate of
not detecting a potential snooping AS from 57\% to 11\%},
www_section = {anonymous communication, as, autonomous system, Tor},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/LASTor\%3A\%20A\%20Low-Latency\%20AS-Aware\%20Tor\%20Client.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Masoud Akhoondi and Curtis Yu and Harsha V. Madhyastha}
}
@book {2012_8,
@@ -1057,7 +1062,7 @@ We also simplify the lower bounds on noise for counting queries in [11] and also
publisher = {Springer},
www_section = {emulation, ModelNet, P2P emulation, traffic engineering},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/modelnet-si-ppna11.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Rossi, D. and Veglia, P. and Sammarco, M. and Larroca, F.}
}
@mastersthesis {2012_9,
@@ -1073,7 +1078,7 @@ We also simplify the lower bounds on noise for counting queries in [11] and also
In this master thesis we introduce Monkey, a new tool that provides a solution for automated classification, investigation and characterization of bugs, as well as a solution for comparing bug reports and avoiding duplicates. Our tool is particularly suitable for distributed systems due to its autonomy. We present Monkey{\textquoteright}s key design goals and architecture and give experimental results demonstrating the viability of our approach},
www_section = {automation, debugging, distributed systems},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/safey-thesis-monkey.pdf , https://gnunet.org/git/bibliography.git/tree/docs/safey-presentation-monkey.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Safey A. Halim}
}
@conference {2012_10,
@@ -1087,7 +1092,7 @@ significantly improves the success chance without requiring any user interaction
a small test setup with laptop computers and home NAT routers},
www_section = {FTP-ALG, NAT},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WHW_12-NTALG.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Wander, M. and Holzapfel, S. and Wacker, A. and Weis, T.}
}
@article {2012_11,
@@ -1114,7 +1119,7 @@ total upstream and downstream bandwidth to identify {\textemdash}with 98\% accur
purpose TA countermeasures can ever provide the type of security targeted in prior work},
www_section = {encrypted traffic, machine learning, padding, privacy, traffic analysis countermeasures},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Peek-a-Boo\%2C\%20I\%20Still\%20See\%20You\%3A\%20Why\%20Efficient\%20Traffic\%20Analysis\%20Countermeasures\%20Fail.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Kevin P. Dyer and Scott Coull and Thomas Ristenpart and Thomas Shrimpton}
}
@article {2012_12,
@@ -1137,7 +1142,7 @@ purpose TA countermeasures can ever provide the type of security targeted in pri
year = {2012},
pages = {400--409},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Cynthia Dwork and Moni Naor and Salil P. Vadhan}
}
@mastersthesis {moin:tel-00724121,
@@ -1147,7 +1152,7 @@ purpose TA countermeasures can ever provide the type of security targeted in pri
school = {Universit{\'e} Rennes 1},
type = {phd},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Moin, Afshin}
}
@article {handigol2012reproducible,
@@ -1156,7 +1161,7 @@ purpose TA countermeasures can ever provide the type of security targeted in pri
year = {2012},
www_section = {emulation, mininet, network, virtualization},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mininet-hifi.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Handigol, N. and Heller, B. and Jeyakumar, V. and Lantz, B. and McKeown, N.}
}
@article {2012_13,
@@ -1180,7 +1185,7 @@ providing fault tolerance over DHTs{\textemdash}but also that it can be applied
handle replication and, thus, to trade off replication costs for fair load distribution and fault tolerance},
www_section = {distributed hash table, load balancing, range queries, Saturn},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/saturn-range-dht.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Theoni Pitoura and Nikos Ntarmos and Peter Triantafillou}
}
@article {2012_14,
@@ -1209,7 +1214,7 @@ handle replication and, thus, to trade off replication costs for fair load distr
issn = {1943-068X},
doi = {10.1109/TCIAIG.2012.2186810},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Browne\%20et\%20al\%20-\%20A\%20survey\%20of\%20MCTS\%20methods.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Cameron Browne and Edward Powley and Daniel Whitehouse and Simon Lucas and Peter I. Cowling and Philipp Rohlfshagen and Stephen Tavener and Diego Perez and Spyridon Samothrakis and Simon Colton}
}
@article {2012_16,
@@ -1225,7 +1230,7 @@ handle replication and, thus, to trade off replication costs for fair load distr
doi = {10.1109/SURV.2011.031611.00024},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/TheoryandPracticeBloomFilter2011Tarkoma.pdf},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Tarkoma, S. and Rothenberg, C.E. and Lagerspetz, E.}
}
@conference {2012_17,
@@ -1253,7 +1258,7 @@ handle replication and, thus, to trade off replication costs for fair load distr
generalization properties. Finally, we present a new anonymity metric that does not exhibit these shortcomings. Our new metric is accurate as well as general},
www_section = {combinatorial matrix theory, probabilistic attacks, system-wide anonymity metric},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PETS\%2711\%20-\%20An\%20Accurate\%20System-Wide\%20Anonymity\%20Metric\%20for\%20Probabilistic\%20Attacks.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Rajiv Bagai and Huabo Lu and Rong Li and Bin Tang}
}
@conference { cset2011evans,
@@ -1266,7 +1271,7 @@ generalization properties. Finally, we present a new anonymity metric that does
abstract = {This paper presents details on the design and implementation of a scalable framework for evaluating peer-to-peer protocols. Unlike systems based on simulation, emulation-based systems enable the experimenter to obtain data that reflects directly on the concrete implementation in much greater detail. This paper argues that emulation is a better model for experiments with peer-to-peer protocols since it can provide scalability and high flexibility while eliminating the cost of moving from experimentation to deployment. We discuss our unique experience with large-scale emulation using the GNUnet peer-to-peer framework and provide experimental results to support these claims },
www_section = {distributed hash table, emulation, GNUnet, scalability, security analysis},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cset2011.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Nathan S Evans and Christian Grothoff}
}
@conference {bnymble11,
@@ -1279,7 +1284,7 @@ generalization properties. Finally, we present a new anonymity metric that does
BNymble is that we can achieve the anonymity goals of these more recent schemes by replacing only the infrequent {\textquotedblleft}User Registration{\textquotedblright} protocol from Nymble with asymmetric primitives. We prove the security of BNymble, and report on its efficiency},
www_section = {anonymous access, anonymous blacklisting, BNymble},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FC\%2711\%20-\%20BNymble.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Peter Lofgren and Nicholas J. Hopper}
}
@conference {wpes11-bridgespa,
@@ -1292,7 +1297,8 @@ BNymble is that we can achieve the anonymity goals of these more recent schemes
address = {Chicago, IL, United States},
abstract = {Tor is a network designed for low-latency anonymous communications. Tor clients form circuits through relays that are listed in a public directory, and then relay their encrypted traffic through these circuits. This indirection makes it difficult for a local adversary to determine with whom a particular Tor user is communicating. In response, some local adversaries restrict access to Tor by blocking each of the publicly listed relays. To deal with such an adversary, Tor uses bridges, which are unlisted relays that can be used as alternative entry points into the Tor network. Unfortunately, issues with Tor{\textquoteright}s bridge implementation make it easy to discover large numbers of bridges. An adversary that hoards this information may use it to determine when each bridge is online over time. If a bridge operator also browses with Tor on the same machine, this information may be sufficient to deanonymize him. We present BridgeSPA as a method to mitigate this issue. A client using BridgeSPA relies on innocuous single packet authorization (SPA) to present a time-limited key to a bridge. Before this authorization takes place, the bridge will not reveal whether it is online. We have implemented BridgeSPA as a working proof-of-concept, which is available under an open-source licence},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WPES\%2711\%20-\%20bridgeSPA.pdf},
- %url = {https://bibliography.gnunet.org},
+ www_section = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Rob Smits and Divam Jain and Sarah Pidcock and Ian Goldberg and Urs Hengartner}
}
@conference {ccs2011-cirripede,
@@ -1308,7 +1314,7 @@ We therefore propose Cirripede, a system that can be used for unobservable commu
Cirripede is designed to work scalably with routers that handle large volumes of traffic while imposing minimal overhead on ISPs and not disrupting existing traffic. This allows Cirripede proxies to be strategically deployed at central locations, making access to Cirripede very difficult to block. We built a proof-of-concept implementation of Cirripede and performed a testbed evaluation of its performance properties},
www_section = {censorship-resistance, unobservability},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CCS\%2711\%20-\%20Cirripede.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Amir Houmansadr and Giang T. K. Nguyen and Matthew Caesar and Borisov, Nikita}
}
@article {2011_0,
@@ -1346,7 +1352,7 @@ and sequences. It discusses some properties needed to implement non-trivial CRDT
journal = {unknown},
isbn = {0249-6399},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/crdt.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Marc Shapiro and Nuno Preguica and Carlos Baquero and Marek Zawirski}
}
@conference {2011_2,
@@ -1359,7 +1365,7 @@ and sequences. It discusses some properties needed to implement non-trivial CRDT
address = {Las Vegas, NV, USA},
abstract = {Traditionally complex queries have been performed over unstructured P2P networks by means of flooding, which is inherently inefficient due to the large number of redundant messages generated. While Distributed Hash Tables (DHTs) can provide very efficient look-up operations, they traditionally do not provide any methods for complex queries. By exploiting the structure inherent in DHTs we can perform complex querying over structured P2P networks by means of efficiently broadcasting the search query. This allows every node in the network to process the query locally, and hence is as powerful and flexible as flooding in unstructured networks, but without the inefficiency of redundant messages. While there have been various approaches proposed for broadcasting search queries over DHTs, the focus has not been on validation under churn. Comparing blind search methods for DHTs though simulation we see that churn, in particular nodes leaving the network, has a large impact on query success rate. In this paper we present novel results comparing blind search over Chord and Pastry while under varying levels of churn. We further consider how different data replication strategies can be used to enhance the query success rate},
www_section = {churn, complex querie, distributed hash table, search techniques},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
isbn = {978-1-4244-8789-9 },
doi = {http://dx.doi.org/10.1109/CCNC.2011.5766542},
author = {Jamie Furness and Mario Kolberg}
@@ -1374,7 +1380,7 @@ and sequences. It discusses some properties needed to implement non-trivial CRDT
is easily blocked) in order to provide circumvention. We show that if it is possible for a client to connect to any unblocked host/service, then decoy routing could be used to connect them to a blocked destination without cooperation from the host. This is accomplished by placing the circumvention service in the network itself -- where a single device could proxy traffic between a significant fraction of hosts -- instead of at the edge},
www_section = {decoy routing, Internet communication, network filter},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FOCI\%2711\%20-\%20Decoy\%20Routing\%3A\%20Toward\%20Unblockable\%20Internet\%20Communication.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Josh Karlin and Daniel Ellard and Alden W. Jackson and Christine E. Jones and Greg Lauer and David P. Mankins and W. Timothy Strayer}
}
@conference {pets2011-defenestrator,
@@ -1386,7 +1392,7 @@ is easily blocked) in order to provide circumvention. We show that if it is poss
abstract = {Tor is one of the most widely used privacy enhancing technologies for achieving online anonymity and resisting censorship. While conventional wisdom dictates that the level of anonymity offered by Tor increases as its user base grows, the most significant obstacle to Tor adoption continues to be its slow performance. We seek to enhance Tor{\textquoteright}s performance by offering techniques to control congestion and improve flow control, thereby reducing unnecessary delays. To reduce congestion, we first evaluate small fixed-size circuit windows and a dynamic circuit window that adaptively re-sizes in response to perceived congestion. While these solutions improve web page response times and require modification only to exit routers, they generally offer poor flow control and slower downloads relative to Tor{\textquoteright}s current design. To improve flow control while reducing congestion, we implement N23, an ATM-style per-link algorithm that allows Tor routers to explicitly cap their queue lengths and signal congestion via back-pressure. Our results show that N23 offers better congestion and flow control, resulting in improved web page response times and faster page loads compared to Tor{\textquoteright}s current design and other window-based approaches. We also argue that our proposals do not enable any new attacks on Tor users{\textquoteright} privacy},
www_section = {congestion, DefenestraTor, online anonymity, performance, privacy enhancing technologies, Tor, Windows},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PETS\%2711\%20-\%20DefenestraTor.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Mashael AlSabah and Kevin Bauer and Ian Goldberg and Dirk Grunwald and Damon McCoy and Stefan Savage and Geoffrey M. Voelker}
}
@article {2011_3,
@@ -1401,7 +1407,7 @@ We initiate an examination whether there are advantages to a paradigm where both
Our results also yield new separations between the local and global models of computations for private data analysis},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DistributedPrivateData2008Beimel.pdf},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Amos Beimel and Kobbi Nissim and Eran Omri}
}
@conference {cset11-experimentor,
@@ -1414,7 +1420,7 @@ Our results also yield new separations between the local and global models of co
conducting Tor research in a way that ensures safety and realism, we present the design of ExperimenTor, a large-scale Tor network emulation toolkit and testbed. We also report our early experiences with prototype testbeds currently deployed at four research institutions},
www_section = {experimentation, ExperimenTor, privacy enhancing technologies, Tor},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CSET\%2711\%20-\%20ExperimenTor.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Kevin Bauer and Micah Sherr and Damon McCoy and Dirk Grunwald}
}
@conference {acsac11-tortoise,
@@ -1427,7 +1433,7 @@ conducting Tor research in a way that ensures safety and realism, we present the
This paper argues the very counterintuitive notion that slowing down traffic on Tor will increase the bandwidth capacity of the network and consequently improve the experience of interactive web users. We introduce Tortoise, a system for rate limiting Tor at its ingress points. We demonstrate that Tortoise incurs little penalty for interactive web users, while significantly decreasing the throughput for filesharers. Our techniques provide incentives to filesharers to configure their Tor clients to also relay traffic, which in turn improves the network{\textquoteright}s overall performance. We present large-scale emulation results that indicate that interactive users will achieve a significant speedup if even a small fraction of clients opt to run relays},
www_section = {anonymity, performance, Tor},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ACSAC\%2711\%20-\%20Tortoise.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {W. Brad Moore and Chris Wacek and Micah Sherr}
}
@conference {acsac11-backlit,
@@ -1440,7 +1446,7 @@ This paper argues the very counterintuitive notion that slowing down traffic on
with high accuracy and few false positives},
www_section = {BACKLIT, detection system, invisible, network security, packet timing information, privacy, traffic watermark},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ACSAC\%2711\%20-\%20BACKLIT.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Xiapu Luo and Peng Zhou and Junjie Zhang and Roberto Perdisci and Wenke Lee and Rocky K. C. Chang}
}
@conference {wpes11-faust,
@@ -1455,7 +1461,7 @@ with high accuracy and few false positives},
authenticate in future sessions. Faust uses no trusted third parties and is one to two orders of magnitude more efficient than previous schemes without trusted third parties. The key idea behind Faust is to eliminate the explicit blacklist used in all previous approaches, and rely instead on an implicit whitelist, based on blinded authentication tokens},
www_section = {anonymous authentication, anonymous blacklisting, privacy-enhancing revocation},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WPES\%2711\%20-\%20FAUST.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Peter Lofgren and Nicholas J. Hopper}
}
@conference {Prusty:2011:FIO:2046707.2046731,
@@ -1472,7 +1478,7 @@ authenticate in future sessions. Faust uses no trusted third parties and is one
isbn = {978-1-4503-0948-6},
doi = {http://doi.acm.org/10.1145/2046707.2046731},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/prusty.ccs_.2011.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Prusty, Swagatika and Brian Neil Levine and Marc Liberatore}
}
@conference {oakland11-formalizing,
@@ -1487,7 +1493,7 @@ problem and survey the literature on anonymous blacklisting systems, comparing a
outline a set of new performance requirements that anonymous blacklisting systems should satisfy to maximize their potential for real-world adoption, and give formal definitions for several optional features already supported by some schemes in the literature},
www_section = {anonymity, anonymous blacklisting, authentication, privacy enhancing technologies, privacy-enhanced revocation},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Formalizing\%20Anonymous\%20Blacklisting\%20Systems.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Ryan Henry and Ian Goldberg}
}
@conference { grothoff2011syssec,
@@ -1498,7 +1504,7 @@ outline a set of new performance requirements that anonymous blacklisting system
abstract = {This paper introduces the current research and future plans of the Free Secure Network Systems Group at the Technische Universit\ät M\ünchen. In particular, we provide some insight into the development process and architecture of the GNUnet P2P framework and the challenges we are currently working on},
www_section = {anonymity, GNUnet, routing},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/syssec2011.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Christian Grothoff}
}
@article {2011_4,
@@ -1544,7 +1550,7 @@ outline a set of new performance requirements that anonymous blacklisting system
To better understand the security and performance properties of a popular low latency anonymity network, we characterize Tor, focusing on its application protocol distribution, geopolitical client and router distributions, and performance. For instance, we observe that peer-to-peer file sharing protocols use an unfair portion of the network{\textquoteright}s scarce bandwidth. To reduce the congestion produced by bulk downloaders in networks such as Tor, we design, implement, and analyze an anonymizing network tailored specifically for the BitTorrent peer-to-peer file sharing protocol. We next analyze Tor{\textquoteright}s security and anonymity properties and empirically show that Tor is vulnerable to practical end-to-end traffic correlation attacks launched by relatively weak adversaries that inflate their bandwidth claims to attract traffic and thereby compromise key positions on clients{\textquoteright} paths. We also explore the security and performance trade-offs that revolve around path length design decisions and we show that shorter paths offer performance benefits and provide increased resilience to certain attacks. Finally, we discover a source of performance degradation in Tor that results from poor congestion and flow control. To improve Tor{\textquoteright}s performance and grow its user base, we offer a fresh approach to congestion and flow control inspired by techniques from IP and ATM networks},
www_section = {low latency anonymous networks, performance, security},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kevin-thesis.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Kevin Bauer}
}
@conference {wk11-malice-vs-anon,
@@ -1556,7 +1562,7 @@ To better understand the security and performance properties of a popular low la
abstract = {In this paper we investigate the impact of missing replay protection as well as missing integrity protection concerning a local attacker in AN.ON. AN.ON is a low latency anonymity network mostly used to anonymize web traffic. We demonstrate that both protection mechanisms are important by presenting two attacks that become feasible as soon as the mechanisms are missing. We mount both attacks on the AN.ON network which neither implements replay protection nor integrity protection yet},
www_section = {AN.ON, anonymity network, integrity protection, replay protection},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FC\%2711\%20-\%20Malice\%20versus\%20AN.ON_.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Benedikt Westermann and Dogan Kesdogan}
}
@article {Tariq:2011:MSQ:2063320.2063330,
@@ -1599,7 +1605,7 @@ emulation framework capable of running a large number of nodes using our full co
isbn = {3-937201-26-2},
issn = {1868-2642},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NET-2011-08-1.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Nathan S Evans}
}
@article {2011_7,
@@ -1672,7 +1678,7 @@ We call our extension PEREA-Naughtiness. We prove the security of our constructi
well understood and relatively easy to analyze, as opposed to peer-to-peer designs that require analyzing extremely complex and dynamic systems. In particular, we demonstrate that reasonable parameters of our architecture provide equivalent security to that of the Tor network. Moreover, our experimental results show that the overhead of PIR-Tor is manageable even when the Tor network scales by two orders of magnitude},
www_section = {anonymous communication, peer to peer, PIR-Tor},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/USENIX\%20-\%20PIR-Tor.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Prateek Mittal and Femi Olumofin and Carmela Troncoso and Borisov, Nikita and Ian Goldberg}
}
@conference {DK11,
@@ -1687,7 +1693,7 @@ well understood and relatively easy to analyze, as opposed to peer-to-peer desig
abstract = {Cryptographic solutions to privacy-preserving multiparty linear programming are slow. This makes them unsuitable for many economically important applications, such as supply chain optimization, whose size exceeds their practically feasible input range. In this paper we present a privacy-preserving trans- formation that allows secure outsourcing of the linear program computation in an ef?cient manner. We evaluate security by quantifying the leakage about the input after the transformation and present implementation results. Using this transformation, we can mostly replace the costly cryptographic operations and securely solve problems several orders of magnitude larger},
www_section = {cryptography, SMC},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PASSAT\%2711\%20-\%20Multiparty\%20linear\%20programming.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Dreier, Jannik and Florian Kerschbaum}
}
@mastersthesis {2011_8,
@@ -1724,7 +1730,7 @@ the attack --- including experimental data from measurements against the
actual I2P network --- and discusses possible solutions},
www_section = {anonymity, attack, denial-of-service, I2P},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/herrmann2011mt.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Michael Herrmann}
}
@conference { herrmann2010pet,
@@ -1745,7 +1751,7 @@ victim with a denial-of-service attack while giving the victim the opportunity t
This paper provides the necessary background on I2P, gives details on the attack --- including experimental data from measurements against the actual I2P network --- and discusses possible solutions},
www_section = {anonymity, attack, Guard, I2P, onion routing},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pet2011i2p.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Michael Herrmann and Christian Grothoff}
}
@book {2011_9,
@@ -1778,7 +1784,7 @@ private mechanism, will only gain a negligible advantage (up to a privacy parame
abstract = {Many people currently use proxies to circumvent government censorship that blocks access to content on the Internet. Unfortunately, the dissemination channels used to distribute proxy server locations are increasingly being monitored to discover and quickly block these proxies. This has given rise to a large number of ad hoc dissemination channels that leverage trust networks to reach legitimate users and at the same time prevent proxy server addresses from falling into the hands of censors. To address this problem in a more principled manner, we present Proximax, a robust system that continuously distributes pools of proxies to a large number of channels. The key research challenge in Proximax is to distribute the proxies among the different channels in a way that maximizes the usage of these proxies while minimizing the risk of having them blocked. This is challenging because of two conflicting goals: widely disseminating the location of the proxies to fully utilize their capacity and preventing (or at least delaying) their discovery by censors. We present a practical system that lays out a design and analytical model that balances these factors},
www_section = {government censorship, Proximax, proxy},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FC\%2711\%20-\%20Proximax.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Kirill Levchenko and Damon McCoy}
}
@conference {DBLP:conf/dbsec/Kerschbaum11,
@@ -1786,7 +1792,8 @@ private mechanism, will only gain a negligible advantage (up to a privacy parame
booktitle = {Public-Key Encrypted Bloom Filters with Applications to Supply Chain Integrity},
year = {2011},
pages = {60--75},
- %url = {https://bibliography.gnunet.org},
+ www_section = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Florian Kerschbaum}
}
@conference {2011_10,
@@ -1801,7 +1808,7 @@ private mechanism, will only gain a negligible advantage (up to a privacy parame
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/nss2011.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Nathan S Evans and Christian Grothoff}
}
@conference {2011_11,
@@ -1818,6 +1825,7 @@ privacy and leakage, due to the graph symmetries induced by the adjacency relati
isbn = {978-3-642-22011-1},
url = {http://dl.acm.org/citation.cfm?id=2027223.2027228},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DifferentialPrivacy2011Alvim.pdf},
+ www_section = unsorted,
author = {Alvim, M{\'a}rio S. and Andr{\'e}s, Miguel E.}
}
@article {cryptoeprint:2011:232,
@@ -1898,7 +1906,8 @@ We analyzed the security of our protocols by developing formal definitions of th
booktitle = {Selling Privacy at Auction},
year = {2011},
pages = {199--208},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
+ www_section = unsorted,
author = {Arpita Ghosh and Aaron Roth}
}
@book {2011_14,
@@ -1916,6 +1925,7 @@ In this paper, we embrace the social aspects of the Web 2.0 by considering a nov
doi = {10.1007/978-3-642-24550-3_16},
url = {http://dx.doi.org/10.1007/978-3-642-24550-3_16},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SocialMarket2011Frey.pdf},
+ www_section = unsorted,
author = {Frey, Davide and J{\'e}gou, Arnaud and Kermarrec, Anne-Marie},
editor = {D{\'e}fago, Xavier and Petit, Franck and Villain, Vincent}
}
@@ -1933,7 +1943,7 @@ Such information leaks from a single Tor circuit can be combined over multiple c
than 1.5\% in under 5 minutes. Our attacks are also more accurate and require fewer resources than previous attacks on Tor},
www_section = {anonymity, attacks, throughput},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CCS\%2711\%20-\%20Throughput-fingerprinting.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Prateek Mittal and Ahmed Khurshid and Joshua Juen and Matthew Caesar and Borisov, Nikita}
}
@conference {2011_15,
@@ -1947,7 +1957,7 @@ scalable approach for flow correlation than passive traffic analysis. Previous d
attacks, marking each flow with a different pattern. SWIRL is robust to packet losses and network jitter, yet it introduces only small delays that are invisible to both benign users and determined adversaries. We analyze the performance of SWIRL both analytically and on the PlanetLab testbed, demonstrating very low error rates. We consider applications of SWIRL to stepping stone detection and linking anonymous communication. We also propose a novel application of watermarks to defend against congestion attacks on Tor},
www_section = {anonymity, SWIRL, traffic analysis, watermarking},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NDSS11-2.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Amir Houmansadr and Borisov, Nikita}
}
@conference {usenix11-telex,
@@ -1960,7 +1970,7 @@ attacks, marking each flow with a different pattern. SWIRL is robust to packet l
station but not to a censor. In addition, we use our tagging scheme to build a protocol that allows clients to connect to Telex stations while resisting both passive and active attacks. We also present a proof-of-concept implementation that demonstrates the feasibility of our system},
www_section = {anticensorship, network infrastructure state-level censorship, proxy, telex},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Telex\%3A\%20Anticensorship\%20in\%20the\%20Network\%20Infrastructure.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Eric Wustrow and Scott Wolchok and Ian Goldberg and J. Alex Halderman}
}
@conference {ccs2011-trust,
@@ -1974,7 +1984,7 @@ station but not to a censor. In addition, we use our tagging scheme to build a p
abstract = {We introduce a novel model of routing security that incorporates the ordinarily overlooked variations in trust that users have for different parts of the network. We focus on anonymous communication, and in particular onion routing, although we expect the approach to apply more broadly. This paper provides two main contributions. First, we present a novel model to consider the various security concerns for route selection in anonymity networks when users vary their trust over parts of the network. Second, to show the usefulness of our model, we present as an example a new algorithm to select paths in onion routing. We analyze its effectiveness against deanonymization and other information leaks, and particularly how it fares in our model versus existing algorithms, which do not consider trust. In contrast to those, we find that our trust-based routing strategy can protect anonymity against an adversary capable of attacking a significant fraction of the network},
www_section = {anonymous communication, onion routing, privacy, trust},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CCS\%2711\%20-\%20Trust-based\%20Anonymous\%20Communication1.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Aaron Johnson and Paul Syverson and Roger Dingledine and Nick Mathewson}
}
@conference {Yang:2011:USN:2068816.2068841,
@@ -2009,7 +2019,7 @@ results of existing works on a given state-of-the-art dataset in Tor from 3\% to
JAP, the detection rate decreases from 80\% to 4\% and for Tor it drops from 55\% to about 3\%},
www_section = {anonymous communication, pattern recognition, privacy, traffic analysis, website fingerprinting},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WPES\%2711\%20-\%20Fingerprinting.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Andriy Panchenko and Lukas Niessen and Andreas Zinnen and Thomas Engel}
}
@conference {Eppstein:2011:WDE:2018436.2018462,
@@ -2050,7 +2060,7 @@ In this paper, we develop algorithms which take a moderate amount of auxiliary i
www_section = {accuracy, Amazon, collaboration, collaborative filtering, commercial Web sites, consumer behaviour, Covariance matrix, customer transactions, data privacy, groupware, History, Hunch, Inference algorithms, inference attacks, inference mechanisms, information filtering, Internet, Internet user, Last.fm, Library Thing, privacy, privacy risks, recommender systems, Web sites},
doi = {10.1109/SP.2011.40},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Youmightlike2011Calandrino.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Calandrino, J.A. and Kilzer, A. and Narayanan, A. and Felten, E.W. and Shmatikov, V.}
}
@mastersthesis {bartsthesis,
@@ -2062,7 +2072,7 @@ In this paper, we develop algorithms which take a moderate amount of auxiliary i
address = {M{\"u}nchen},
www_section = {Botnet, distributed hash table, GNUnet},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Polot2010.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Polot, Bartlomiej}
}
@conference {2010_0,
@@ -2072,7 +2082,7 @@ In this paper, we develop algorithms which take a moderate amount of auxiliary i
month = sep,
www_section = {random walks, recommender system},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/opodis10_HAL.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Anne-Marie Kermarrec and Vincent Leroy and Afshin Moin and Christopher Thraves}
}
@article {2010_1,
@@ -2126,7 +2136,7 @@ method for establishing connections to peers behind NAT. The proposed method fo
abstract = {Distributed anonymous communication networks like Tor depend on volunteers to donate their resources. However, the efforts of Tor volunteers have not grown as fast as the demands on the Tor network.We explore techniques to incentivize Tor users to relay Tor traffic too; if users contribute resources to the Tor overlay, they should receive faster service in return. In our design, the central Tor directory authorities measure performance and publish a list of Tor relays that should be given higher priority when establishing circuits. Simulations of our proposed design show that conforming users receive significant improvements in performance, in some cases experiencing twice the network throughput of selfish users who do not relay traffic for the Tor network},
www_section = {Tor},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/incentives-fc10.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Tsuen-Wan {\textquoteleft}{\textquoteleft}Johnny{\textquoteright}{\textquoteright} Ngan and Roger Dingledine and Dan S. Wallach},
editor = {Radu Sion}
}
@@ -2172,7 +2182,7 @@ Beyond the theoretical interest in modeling KDFs, this work is intended to addre
abstract = {As the virtual world grows more complex, finding a standard way for storing data becomes increasingly important. Ideally, each data item would be brought into the computer system only once. References for data items need to be cryptographically verifiable, so the data can maintain its identity while being passed around. This way there will be only one copy of the users family photo album, while the user can use multiple tools to show or manipulate the album. Copies of users data could be stored on some of his family members computer, some of his computers, but also at some online services which he uses. When all actors operate over one replicated copy of the data, the system automatically avoids a single point of failure. Thus the data will not disappear with one computer breaking, or one service provider going out of business. One shared copy also makes it possible to delete a piece of data from all systems at once, on users request. In our research we tried to find a model that would make data manageable to users, and make it possible to have the same data stored at various locations. We studied three systems, Persona, Freenet, and GNUnet, that suggest different models for protecting user data. The main application areas of the systems studied include securing online social networks, providing anonymous web, and preventing censorship in file-sharing. Each of the systems studied store user data on machines belonging to third parties. The systems differ in measures they take to protect their users from data loss, forged information, censorship, and being monitored. All of the systems use cryptography to secure names used for the content, and to protect the data from outsiders. Based on the gained knowledge, we built a prototype platform called Peerscape, which stores user data in a synchronized, protected database. Data items themselves are protected with cryptography against forgery, but not encrypted as the focus has been disseminating the data directly among family and friends instead of letting third parties store the information. We turned the synchronizing database into peer-to-peer web by revealing its contents through an integrated http server. The REST-like http API supports development of applications in javascript. To evaluate the platform{\textquoteright}s suitability for application development we wrote some simple applications, including a public chat room, bittorrent site, and a flower growing game. During our early tests we came to the conclusion that using the platform for simple applications works well. As web standards develop further, writing applications for the platform should become easier. Any system this complex will have its problems, and we are not expecting our platform to replace the existing web, but are fairly impressed with the results and consider our work important from the perspective of managing user data},
www_section = {content centric, ECRS, Freenet, GNUnet, P2P, Peerscape, Persona},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/twr-dp2pwa.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Toni Ruottu}
}
@conference {continual,
@@ -2181,7 +2191,8 @@ Beyond the theoretical interest in modeling KDFs, this work is intended to addre
year = {2010},
month = {June},
pages = {715--724},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
+ www_section = unsorted,
author = {Dwork, Cynthia and Naor, Moni and Pitassi, Toniann and Rothblum, Guy N.}
}
@article {2010_4,
@@ -2193,6 +2204,7 @@ Beyond the theoretical interest in modeling KDFs, this work is intended to addre
abstract = {In 1977 Tore Dalenius articulated a desideratum for statistical databases: nothing about an individual should be learnable from the database that cannot be learned without access to the database. We give a general impossibility result showing that a natural formalization of Dalenius{\textquoteright} goal cannot be achieved if the database is useful. The key obstacle is the side information that may be available to an adversary. Our results hold under very general conditions regarding the database, the notion of privacy violation, and the notion of utility.</p> <p>Contrary to intuition, a variant of the result threatens the privacy even of someone not in the database. This state of affairs motivated the notion of differential privacy [15, 16], a strong ad omnia privacy which, intuitively, captures the increased risk to one{\textquoteright}s privacy incurred by participating in a database},
url = {http://research.microsoft.com/apps/pubs/default.aspx?id=135704},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DisclousrePrevention2010Dwork.pdf},
+ www_section = unsorted,
author = {Cynthia Dwork and Moni Naor}
}
@mastersthesis {vleroythesis,
@@ -2202,7 +2214,8 @@ Beyond the theoretical interest in modeling KDFs, this work is intended to addre
school = {IRISA},
type = {phd},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DistributingSocialApp2010Leroy.pdf},
- %url = {https://bibliography.gnunet.org},
+ www_section = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Vincent Leroy}
}
@book {2010_5,
@@ -2233,7 +2246,7 @@ process follows a geometric distribution. We then use this result to detect DHT
method detects the most efficient attacks with a very small false-negative rate, while countermeasures successfully filter almost all malicious peers involved in an attack. Moreover, our solution completely fits the current design of the KAD network and introduces no network overhead},
www_section = {attack detection, attack mitigation, distributed hash table, IDs distribution, KAD, Sybil attack},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/HotP2P\%2710\%20-\%20KAD\%20DHT\%20attack\%20mitigation.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Cholez, Thibault and Chrisment, Isabelle and Festor, Olivier}
}
@conference {Koch:2010:EPL:1827418.1827440,
@@ -2262,7 +2275,7 @@ method detects the most efficient attacks with a very small false-negative rate,
abstract = {While social networks provide news from old buddies, you can learn a lot more from people you do not know, but with whom you share many interests. We show in this paper how to build a network of anonymous social acquaintances using a gossip protocol we call Gossple, and how to leverage such a network to enhance navigation within Web 2.0 collaborative applications, {\`a} la LastFM and Delicious. Gossple nodes (users) periodically gossip digests of their interest profiles and compute their distances (in terms of interest) with respect to other nodes. This is achieved with little bandwidth and storage, fast convergence, and without revealing which profile is associated with which user. We evaluate Gossple on real traces from various Web 2.0 applications with hundreds of PlanetLab hosts and thousands of simulated nodes},
www_section = {gossple, social networks},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/gossple2010Bertier.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Marin Bertier and Davide Frey and Rachid Guerraoui and Anne-Marie Kermarrec and Vincent Leroy}
}
@article { duminuco:hierarchical,
@@ -2276,7 +2289,7 @@ method detects the most efficient attacks with a very small false-negative rate,
www_section = {dependability, erasure codes, peer-to-peer networking, reliability, storage},
doi = {10.1007/s12083-009-0044-8},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Duminuco\%20\%26\%20Biersack\%20-\%20Hierarchical\%20Codes.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Alessandro Duminuco and E W Biersack}
}
@conference {2010_7,
@@ -2318,7 +2331,7 @@ outperforms methods that use only one type of social content. Second, we present
pages = {3--18},
www_section = {autonetkit, emulation, netkit, network, testbed, virtualization},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/AutoNetkit_0.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Hung X. Nguyen and Roughan, Matthew and Knight, Simon and Nick Falkner and Maennel, Olaf and Randy Bush}
}
@mastersthesis {2010_8,
@@ -2353,7 +2366,7 @@ outperforms methods that use only one type of social content. Second, we present
pages = {401--411},
www_section = {distributed applications, emulation, GENI, PlanetLab, testbed},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/gush.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Jeannie R. Albrecht and Danny Yuxing Huang}
}
@conference {DBLP:conf/tridentcom/PeralaPML10,
@@ -2363,7 +2376,7 @@ outperforms methods that use only one type of social content. Second, we present
pages = {69--83},
www_section = {emulation, P2P, testbed},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/A\%20Novel\%20Testbed\%20for\%20P2P\%20Networks.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Pekka H. J. Per{\"a}l{\"a} and Jori P. Paananen and Milton Mukhopadhyay and Jukka-Pekka Laulajainen}
}
@conference {Locher:2010:PKN:2018057.2018085,
@@ -2392,7 +2405,8 @@ outperforms methods that use only one type of social content. Second, we present
pages = {141--152},
address = {Munich, Germany},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fessi_iptcomm_2010.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
+ www_section = unsorted,
author = {Fessi, Ali and Nathan S Evans and Heiko Niedermayer and Ralph Holz}
}
@article {Isdal:2010:PPD:1851275.1851198,
@@ -2425,7 +2439,7 @@ outperforms methods that use only one type of social content. Second, we present
issn = {1533-5399},
doi = {http://doi.acm.org/10.1145/1667067.1667071},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/privacy_preserving_similarity.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Pang, Hweehwa and Shen, Jialie and Krishnan, Ramayya}
}
@conference {2010_10,
@@ -2486,6 +2500,7 @@ outperforms methods that use only one type of social content. Second, we present
organization = {Springer},
address = {Trondheim, Norway},
url = {http://www.tm.uni-karlsruhe.de/itm/WebMan/view.php?view=publikationen_detail\&id=389\&lang=en},
+ www_section = unsorted,
author = {H{\"u}bsch, Christian and Mayer, Christoph P. and Oliver Waldhorst}
}
@conference {2010_12,
@@ -2494,7 +2509,7 @@ outperforms methods that use only one type of social content. Second, we present
year = {2010},
abstract = {Application-Layer Multicast has become a promising class of protocols since IP Multicast has not found wide area deployment in the Internet. Developing such protocols requires in-depth analysis of their properties even with large numbers of participants---a characteristic which is at best hard to achieve in real network experiments. Several well-known simulation frameworks have been developed and used in recent years, but none has proved to be fitting the requirements for analyzing large-scale application-layer networks. In this paper we propose the OverSim framework as a promising simulation environment for scalabe Application-Layer Multicast research. We show that OverSim is able to manage even overlays with several thousand participants in short time while consuming comparably little memory. We compare the framework{\textquoteright}s runtime properties with the two exemplary Application-Layer Mutlicast protocols Scribe and NICE. The results show that both simulation time and memory consumption grow linearly with the number of nodes in highly feasible dimensions},
www_section = {multicast, NICE, OverSim, Scribe},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Stephan Krause and H{\"u}bsch, Christian}
}
@conference {Burkhart:2010:SPA:1929820.1929840,
@@ -2518,7 +2533,8 @@ outperforms methods that use only one type of social content. Second, we present
title = {Unleashing Tor, BitTorrent \& Co.: How to Relieve TCP Deficiencies in Overlays},
booktitle = {LCN 2010: Proceedings of the 35th IEEE Conference on Local Computer Networks},
year = {2010},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
+ www_section = unsorted,
author = {Daniel Marks and Florian Tschorsch and Bjoern Scheuermann}
}
@conference {2010_13,
@@ -2537,6 +2553,7 @@ This work was partially funded as part of the Spontaneous Virtual Networks (SpoV
doi = {10.1007/978-3-642-12104-3},
url = {http://www.springerlink.com/content/t6k421560103540n/},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/User-Perceived\%20Performance\%20of\%20the\%20NICE\%20Application\%20Layer\%20Multicast\%20Protocol\%20in\%20Large\%20and\%20Highly\%20Dynamic\%20Groups_1.pdf},
+ www_section = unsorted,
author = {H{\"u}bsch, Christian and Mayer, Christoph P. and Oliver Waldhorst}
}
@conference {2010_14,
@@ -2545,7 +2562,8 @@ This work was partially funded as part of the Spontaneous Virtual Networks (SpoV
year = {2010},
note = {Demo},
address = {San Diego, CA, USA},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
+ www_section = unsorted,
author = {H{\"u}bsch, Christian and Mayer, Christoph P. and Sebastian Mies and Roland Bless and Oliver Waldhorst and Martina Zitterbart}
}
@conference {DBLP:conf/ccs/EdmanS09,
@@ -2580,6 +2598,7 @@ Five years ago a previous study examined the AS-level threat against client and
isbn = {978-3-642-10867-9},
doi = {http://dx.doi.org/10.1007/978-3-642-10868-6_17},
url = {http://dx.doi.org/10.1007/978-3-642-10868-6_17},
+ www_section = unsorted,
author = {Attrapadung, Nuttapong and Imai, Hideki}
}
@conference {DBLP:conf/ccs/TroncosoD09,
@@ -2638,7 +2657,7 @@ Five years ago a previous study examined the AS-level threat against client and
month = {April},
www_section = {Byzantine Resilient Sampling, Random Membership, random sampling},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Brahms-Comnet-Mar09.pdf , https://gnunet.org/git/bibliography.git/tree/docs/Brahms-rps-mar09.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Edward Bortnikov and Maxim Gurevich and Idit Keidar and Gabriel Kliot and Alexander Shraer}
}
@conference {DBLP:conf/sss/Kermarrec09,
@@ -2646,7 +2665,8 @@ Five years ago a previous study examined the AS-level threat against client and
booktitle = {Challenges in Personalizing and Decentralizing the Web: An Overview of GOSSPLE},
year = {2009},
pages = {1--16},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
+ www_section = unsorted,
author = {Anne-Marie Kermarrec}
}
@conference {2009_1,
@@ -2654,7 +2674,8 @@ Five years ago a previous study examined the AS-level threat against client and
booktitle = {CLIO/UNISONO: practical distributed and overlay-wide network measurement},
year = {2009},
abstract = {Building on previous work, we present an early version of our CLIO/UNISONO framework for distributed network measurements. CLIO/UNISONO is a generic measurement framework specifically aimed at overlays that need measurements for optimization purposes. In this talk, we briefly introduce the most important concepts and then focus on some more advanced mechanisms like measurements across connectivity domains and remote orders},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
+ www_section = unsorted,
author = {Ralph Holz and Dirk Haage}
}
@conference {2009_2,
@@ -2666,7 +2687,7 @@ Five years ago a previous study examined the AS-level threat against client and
www_section = {collaboration, collusion-resistant distributed protocol, Computer applications, computer networks, cryptographic protocols, cryptography, data privacy, distributed computing, homorphic encryption computation, Laboratories, Portable media players, privacy-preserving computation, Privacy-preserving computation of trust, private multiparty summation protocol, scalar product protocol, secure multi-party computation, Secure scalar product, security, Superposed sending., Telephony, trust computation},
doi = {10.1109/NCA.2009.48},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CollusionResistant2009Melchor.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Melchor, C.A. and Ait-Salem, B. and Gaborit, P.}
}
@article {DBLP:journals/tdp/NojimaK09,
@@ -2676,7 +2697,8 @@ Five years ago a previous study examined the AS-level threat against client and
number = {2},
year = {2009},
pages = {131--139},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
+ www_section = unsorted,
author = {Ryo Nojima and Youki Kadobayashi}
}
@conference {DBLP:conf/sp/NarayananS09,
@@ -2752,7 +2774,8 @@ We measure the empirical trade-off between accuracy and privacy in these adaptat
school = {Technische Universit{\"a}t M{\"u}nchen},
type = {Diplomarbeit},
address = {Munich, Germany},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
+ www_section = unsorted,
author = {Markus Bucher}
}
@conference {Cholez:2009:ESA:1574663.1574671,
@@ -2837,7 +2860,7 @@ This paper presents HEAP, HEterogeneity-Aware gossip Protocol, where nodes dynam
www_section = {churn, distributed hash table, KAD, Kademlia},
issn = {1063-6692},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Long\%20Term\%20Study\%20of\%20Peer\%20Behavior\%20in\%20the\%20kad\%20DHT.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Steiner, Moritz and En-Najjary, Taoufik and E W Biersack}
}
@conference {1551621,
@@ -2905,7 +2928,7 @@ In addition, the most effective improvements appeared to be the application of
pseudo-random simulations and limiting simulation lengths, while other techniques have been shown to be less effective or even ineffective. Overall, when applying the best performing techniques, an AI with advanced playing strength has been created, such that further research is likely to push this performance to a strength of expert level},
www_section = {artificial intelligence, MCTS, modern board game, Monte-Carlo Tree Search, search techniques},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Thesis\%20-\%20F.Schadd.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Frederik Christiaan Schadd}
}
@book {2009_7,
@@ -2975,7 +2998,7 @@ In this paper we establish the optimal trade-off between the round complexity an
address = {TU Dresden, Germany },
www_section = {I2P},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/I2P-PET-CON-2009.1.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Lars Schimmer}
}
@conference {p2p09-peersim,
@@ -3792,7 +3815,7 @@ Often, part of the problem is to access large files in a share way. Until now, t
year = {2008},
month = {August},
address = {Auckland, New Zealand},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Sihem Amer-Yahia and Michael Benedikt and Laks V. S. Lakshmanan and Julia Stoyanovich}
}
@conference {BecchiCrowley2008EfficientRegexEval,
@@ -14589,7 +14612,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
address = {Los Alamitos, CA, USA},
isbn = {0-7695-1503-7},
doi = {http://doi.ieeecomputersociety.org/10.1109/P2P.2001.990421},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Sherif Botros and Steve Waterhouse}
}
@article {cheap-pseudonyms,
@@ -14752,7 +14775,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
booktitle = {Workshop on Design Issues in Anonymity and Unobservability},
year = {2000},
pages = {1--9},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Andreas Pfitzmann and Marit K{\"o}hntopp}
}
@conference {mitkuro,
@@ -14895,7 +14918,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
type = {White Paper},
abstract = {This white paper, targeted at the technically savvy reader, offers a detailed look at the Freedom 2.0 System architecture. It is intended to give the reader a good understanding of the components that make up this system and the relationships between them, as well as to encourage analysis of the system},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/freedom2-arch.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Philippe Boucher and Adam Shostack and Ian Goldberg}
}
@conference {Clarke00freenet:a_0,
@@ -15020,7 +15043,7 @@ Results based on simulations confirm that Overcast provides its added functional
abstract = {It is desirable to store data on data storage servers such as mail servers and file servers in encrypted form to reduce security and privacy risks. But this usually implies that one has to sacrifice functionality for security. For example, if a client wishes to retrieve only documents containing certain words, it was not previously known how to let the data storage server perform the search and answer the query without loss of data confidentiality},
isbn = {0-7695-0665-8},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/encrypteddata.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Dawn Xiaodong Song and David Wagner and Adrian Perrig}
}
@conference {Shields00aprotocol,
@@ -15092,7 +15115,7 @@ Results based on simulations confirm that Overcast provides its added functional
pages = {0--232},
www_section = {set reconciliation},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/reconcile.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Yaron Minsky and Ari Trachtenberg and Richard Zippel}
}
@conference {Papadopouli00sevendegrees,
@@ -15317,7 +15340,7 @@ This exposition presents a model to formally study such algorithms. This model,
school = {University of Edinburgh},
abstract = {This report describes an algorithm which if executed by a group of interconnected nodes will provide a robust key-indexed information storage and retrieval system with no element of central control or administration. It allows information to be made available to a large group of people in a similar manner to the "World Wide Web". Improvements over this existing system include:--No central control or administration required--Anonymous information publication and retrieval--Dynamic duplication of popular information--Transfer of information location depending upon demand There is also potential for this system to be used in a modified form as an information publication system within a large organisation which may wish to utilise unused storage space which is distributed across the organisation. The system{\textquoteright}s reliability is not guaranteed, nor is its efficiency, however the intention is that the efficiency and reliability will be sufficient to make the system useful, and demonstrate that},
url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.32.3665\&rep=rep1\&type=pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Ian Clarke}
}
@conference {301333,
@@ -15331,7 +15354,7 @@ This exposition presents a model to formally study such algorithms. This model,
isbn = {1-58113-099-6},
doi = {http://doi.acm.org/10.1145/301308.301333},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/flash-mix.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Jakobsson, Markus}
}
@conference {syverson99,
@@ -15577,6 +15600,7 @@ This exposition presents a model to formally study such algorithms. This model,
publisher = {Cambridge University Press},
organization = {Cambridge University Press},
url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.11.2201\&rep=rep1\&type=pdf},
+ www_section = unsorted,
author = {Oded Goldreich}
}
@conference {stop-and-go,
@@ -15634,6 +15658,7 @@ This exposition presents a model to formally study such algorithms. This model,
abstract = {This paper describes a zero-knowledge proof that a mix in onion routing can perform in order to proof that it did route the messages properly. This allows the deployment of a mix-net where malicious mixes can be detected without using dummy-traffic to probe for correctness. Technical},
url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.19.357\&rep=rep1\&type=url\&i=0},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fault.dvi_.pdf},
+ www_section = unsorted,
author = {Wakaha Ogata and Kaoru Kurosawa and Kazue Sako and Kazunori Takatani}
}
@conference {Luby:1997:PLC:258533.258573,
@@ -15698,20 +15723,6 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.41.4031.pdf},
author = {Ian Goldberg and David Wagner}
}
-@conference {716407_0,
- title = {An Empirical Study of Delta Algorithms},
- booktitle = {ICSE {\textquoteright}96: Proceedings of the SCM-6 Workshop on System Configuration Management},
- year = {1996},
- pages = {49--66},
- publisher = {Springer-Verlag},
- organization = {Springer-Verlag},
- address = {London, UK},
- abstract = {Delta algorithms compress data by encoding one file in terms of another. This type of compression is useful in a number of situations: storing multiple versions of data, distributing updates, storing backups, transmitting video sequences, and others. This paper studies the performance parameters of several delta algorithms, using a benchmark of over 1300 pairs of files taken from two successive releases of GNU software. Results indicate that modern delta compression algorithms based on Ziv-Lempel techniques significantly outperform diff, a popular but older delta compressor, in terms of compression ratio. The modern compressors also correlate better with the actual difference between files; one of them is even faster than diff in both compression and decompression speed},
- isbn = {3-540-61964-X},
- doi = {10.1007/BFb0023076},
- url = {http://www.springerlink.com/content/584k258285p18x4g/},
- author = {Hunt, James J. and Vo, Kiem-Phong and Tichy, Walter F.}
-}
@conference {716407,
title = {An Empirical Study of Delta Algorithms},
booktitle = {ICSE {\textquoteright}96: Proceedings of the SCM-6 Workshop on System Configuration Management},
@@ -15724,6 +15735,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
isbn = {3-540-61964-X},
doi = {10.1007/BFb0023076},
url = {http://www.springerlink.com/content/584k258285p18x4g/},
+ www_section = unsorted,
author = {Hunt, James J. and Vo, Kiem-Phong and Tichy, Walter F.}
}
@conference {1267576,
@@ -15750,6 +15762,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
abstract = {The Internet was designed to provide a communications channel that is as resistant to denial of service attacks as human ingenuity can make it. In this note, we propose the construction of a storage medium with similar properties. The basic idea is to use redundancy and scattering techniques to replicate data across a large set of machines (such as the Internet), and add anonymity mechanisms to drive up the cost of selective service denial attacks. The detailed design of this service is an interesting scientific problem, and is not merely academic: the service may be vital in safeguarding individual rights against new threats posed by the spread of electronic publishing},
url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.16.1952\&rep=rep1\&type=pdf},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/eternity.pdf},
+ www_section = unsorted,
author = {Ross Anderson}
}
@conference {onion-routing:ih96,
@@ -15793,6 +15806,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
abstract = {Increasingly large numbers of people communicate today via electronic means such as email or news forums. One of the basic properties of the current electronic communication means is the identification of the end-points. However, at times it is desirable or even critical to hide the identity and/or whereabouts of the end-points (e.g., human users) involved. This paper discusses the goals and desired properties of anonymous email in general and introduces the design and salient features of Babel anonymous remailer. Babel allows email users to converse electronically while remaining anonymous with respect to each other and to other-- even hostile--parties. A range of attacks and corresponding countermeasures is considered. An attempt is made to formalize and quantify certain dimensions of anonymity and untraceable communication},
url = {http://eprints.kfupm.edu.sa/50994/1/50994.pdf},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/babel.pdf},
+ www_section = unsorted,
author = {Ceki Gulcu and Gene Tsudik}
}
@article {remailer-history,
@@ -15805,6 +15819,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
abstract = {Remailers have permitted Internet users to take advantage of the medium as a means to communicate with others globally on sensitive issues while maintaining a high degree of privacy. Recent events have clearly indicated that privacy is increasingly at risk on the global networks. Individual efforts have, so far, worked well in maintaining for most Internet users a modicum of anonymity. With the growth of increasingly sophisticated techniques to defeat anonymity, there will be a need for both standards and policies to continue to make privacy on the Internet a priority},
url = {http://131.193.153.231/www/issues/issue2/remailers/index.html},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Prospects\%20for\%20Remailers.pdf},
+ www_section = unsorted,
author = {Sameer Parekh}
}
@booklet {Stemm96reducingpower,
@@ -15813,7 +15828,8 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
abstract = {An important issue to be addressed for the next generation of wirelessly-connected hand-held devices is battery longevity. In this paper we examine this issue from the point of view of the Network Interface (NI). In particular, we measure the power usage of two PDAs, the Apple Newton Messagepad and Sony Magic Link, and four NIs, the Metricom Ricochet Wireless Modem, the AT\&T Wavelan operating at 915 MHz and 2.4 GHz, and the IBM Infrared Wireless LAN Adapter. These measurements clearly indicate that the power drained by the network interface constitutes a large fraction of the total power used by the PDA. We also conduct trace-driven simulation experiments and show that by using applicationspecific policies it is possible to },
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8384},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.39.8384.pdf},
- %url = {https://bibliography.gnunet.org},
+ www_section = unsorted,
+ url = {https://bibliography.gnunet.org},
author = {Mark Stemm and Paul Gauthier and Daishi Harada and Katz, Randy H.}
}
@conference {672869,
@@ -15828,6 +15844,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
isbn = {3-540-60220-8},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4081},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.34.4081.pdf},
+ www_section = unsorted,
author = {Kr{\"o}ll, Brigitte and Widmayer, Peter}
}
@article {224068,
@@ -15843,6 +15860,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
doi = {10.1145/224057.224068},
url = {http://portal.acm.org/citation.cfm?id=224068$\#$},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/s15.pdf},
+ www_section = unsorted,
author = {Lily B. Mummert and Maria Ebling and Satyanarayanan, Mahadev}
}
@booklet {Ramanathan95thefinal,
@@ -15865,6 +15883,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
abstract = {Even as wireless networks create the potential for access to information from mobile platforms, they pose a problem for privacy. In order to retrieve messages, users must periodically poll the network. The information that the user must give to the network could potentially be used to track that user. However, the movements of the user can also be used to hide the user{\textquoteright}s location if the protocols for sending and retrieving messages are carefully designed. We have developed a replicated memory service which allows users to read from memory without revealing which memory locations they are reading. Unlike previous protocols, our protocol is efficient in its use of computation and bandwidth. We show how this protocol can be used in conjunction with existing privacy preserving protocols to allow a user of a mobile computer to maintain privacy despite active attacks},
url = {http://portal.acm.org/citation.cfm?id=882491.884247},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cooper.pdf},
+ www_section = unsorted,
author = {David A. Cooper and Kenneth P. Birman}
}
@conference {pir,
@@ -15878,6 +15897,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
doi = {http://doi.acm.org/10.1145/293347.293350},
url = {http://portal.acm.org/citation.cfm?id=293347.293350},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pir.pdf},
+ www_section = unsorted,
author = {Benny Chor and Oded Goldreich and Eyal Kushilevitz and Madhu Sudan}
}
@conference {SK,
@@ -15891,6 +15911,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
doi = {10.1007/3-540-49264-X},
url = {http://www.springerlink.com/content/jhf7ccxn2fj2gfum/},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SK.pdf},
+ www_section = unsorted,
author = {Joe Kilian and Kazue Sako}
}
@booklet {Demers94thebayou,
@@ -15901,6 +15922,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
doi = {10.1109/WMCSA.1994.37},
url = {http://portal.acm.org/citation.cfm?id=1440028},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.40.8955.pdf},
+ www_section = unsorted,
author = {Alan Demers and Karin Petersen and Mike Spreitzer and Douglas Terry and Marvin Theimer and Brent Welch}
}
@conference {1267093,
@@ -15916,6 +15938,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
This paper describes WAFL (Write Anywhere File Layout), which is a file system designed specifically to work in an NFS appliance. The primary focus is on the algorithms and data structures that WAFL uses to implement Snapshotst, which are read-only clones of the active file system. WAFL uses a copy-on-write technique to minimize the disk space that Snapshots consume. This paper also describes how WAFL uses Snapshots to eliminate the need for file system consistency checking after an unclean shutdown},
url = {http://portal.acm.org/citation.cfm?id=1267093$\#$},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.40.3691.pdf},
+ www_section = unsorted,
author = {Hitz, Dave and Lau, James and Malcolm, Michael}
}
@conference {Manber94findingsimilar,
@@ -15926,6 +15949,7 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
abstract = {We present a tool, called sif, for finding all similar files in a large file system. Files are considered similar if they have significant number of common pieces, even if they are very different otherwise. For example, one file may be contained, possibly with some changes, in another file, or a file may be a reorganization of another file. The running time for finding all groups of similar files, even for as little as 25\% similarity, is on the order of 500MB to 1GB an hour. The amount of similarity and several other customized parameters can be determined by the user at a post-processing stage, which is very fast. Sif can also be used to very quickly identify all similar files to a query file using a preprocessed index. Application of sif can be found in file management, information collecting (to remove duplicates), program reuse, file synchronization, data compression, and maybe even plagiarism detection. 1. Introduction Our goal is to identify files that came from the same source },
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.3222},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.12.3222.pdf},
+ www_section = unsorted,
author = {Udi Manber}
}
@booklet {898770,
@@ -15964,6 +15988,7 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
doi = {http://doi.acm.org/10.1145/167088.167260},
url = {http://portal.acm.org/citation.cfm?id=167088.167260},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/rackoff93cryptographic.pdf},
+ www_section = unsorted,
author = {Charles Rackoff and Daniel R. Simon}
}
@conference {PIK,
@@ -15978,6 +16003,7 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
isbn = {3-540-57600-2},
url = {http://portal.acm.org/citation.cfm?id=188307.188351},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mix.pdf},
+ www_section = unsorted,
author = {Choonsik Park and Kazutomo Itoh and Kaoru Kurosawa}
}
@book {1993_1,
@@ -16002,6 +16028,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
abstract = {Eumel and its advanced successor L3 are operating systems built by GMD which have been used, for 13 years and 4 years respectively, as production systems in business and education. More than 2000 Eumel systems and 500 L3 systems have been shipped since 1979 and 1988. Both systems rely heavily on the paradigm of persistence (including fault-surviving persistence). Both data and processes, in principle all objects are persistent, files are implemented by means of persistent objects (not vice versa) etc. In addition to the principles and mechanisms of Eumel /L3, general and specific experiences are described: these relate to the design, implementation and maintenance of the systems over the last 13 years. For general purpose timesharing systems the idea is powerful and elegant, it can be efficiently implemented, but making a system really usable is hard work},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.7112},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.53.7112.pdf},
+ www_section = unsorted,
author = {Jochen Liedtke}
}
@inproceedings{627372,
@@ -16017,7 +16044,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
doi = {10.1109/FTCS.1993.627372},
ISSN = {0731-3071},
isbn = {0-8186-3680-7},
- %url = {https://ieeexplore.ieee.org/document/627372/authors#authors},
+ url = {https://ieeexplore.ieee.org/document/627372/authors#authors},
month={June},}
@conference {DBLP:conf/eurocrypt/ChaumP92,
title = {Transferred Cash Grows in Size},
@@ -16049,7 +16076,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
www_section = {artificial intelligence, DCOP, PARC, partially adversial cooperation},
journal = {unknown},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Tech\%20report\%20-\%20DCOP\%20as\%20a\%20formal\%20model\%20of\%20PARC.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Makoto Yokoo and Edmund H. Durfee}
}
@conference {Deswarte91intrusiontolerance,
@@ -16060,6 +16087,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
abstract = {An intrusion-tolerant distributed system is a system which is designed so that any intrusion into apart of the system will not endanger confidentiality, integrity and availability. This approach is suitable for distributed systems, because distribution enables isolation of elements so that an intrusion gives physical access to only a part of the system. By intrusion, we mean not only computer break-ins by non-registered people, but also attempts by registered users to exceed or to abuse their privileges. In particular, possible malice of security administrators is taken into account. This paper describes how some functions of distributed systems can be designed to tolerate intrusions, in particular security functions such as user authentication and authorization, and application functions such as file management},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.9968},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.56.9968.pdf},
+ www_section = unsorted,
author = {Yves Deswarte and Laurent Blain and Jean-charles Fabre}
}
@conference {ISDN-mixes,
@@ -16074,6 +16102,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
isbn = {3-540-53721-X},
url = {http://portal.acm.org/citation.cfm?id=645662.664536},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.43.4892.pdf},
+ www_section = unsorted,
author = {Andreas Pfitzmann and Birgit Pfitzmann and Michael Waidner}
}
@conference {Waidner:1990:DCD:111563.111630,
@@ -16127,6 +16156,7 @@ We also sketch applications of these signatures to a payment system, solving dis
doi = {10.1145/62212.62213},
url = {http://doi.acm.org/10.1145/62212.62213},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CompletelenessTheorems1988Ben-Or.pdf},
+ www_section = unsorted,
author = {Ben-Or, Michael and Goldwasser, Shafi and Wigderson, Avi}
}
@article {chaum-dc,
@@ -16169,6 +16199,7 @@ We also sketch applications of these signatures to a payment system, solving dis
doi = {10.1145/28395.28420},
url = {http://doi.acm.org/10.1145/28395.28420},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PlayMentalGame1987Goldreich.pdf},
+ www_section = unsorted,
author = {Goldreich, O. and Micali, S. and Wigderson, A.}
}
@article {37517,
@@ -16185,6 +16216,7 @@ We also sketch applications of these signatures to a payment system, solving dis
doi = {10.1145/37499.37517},
url = {http://portal.acm.org/citation.cfm?id=37499.37517$\#$},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/024-DatabasesPaper.pdf},
+ www_section = unsorted,
author = {Andrew D. Birrell and Michael B. Jones and Edward P. Wobber}
}
@conference {Stumm:1987:SDR:55482.55508,
@@ -16219,6 +16251,7 @@ We also sketch applications of these signatures to a payment system, solving dis
doi = {10.1007/3-540-39805-8_29},
url = {http://dx.doi.org/10.1007/3-540-39805-8_29},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NetworkWithoutUserObservabiliy1985Pfitzmann.pdf},
+ www_section = unsorted,
author = {Pfitzmann, Andreas and Waidner, Michael},
editor = {Pichler, Franz}
}
@@ -16236,6 +16269,7 @@ We also sketch applications of these signatures to a payment system, solving dis
doi = {10.1145/15042.15043},
url = {http://en.scientificcommons.org/42347723},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/r5rs.pdf},
+ www_section = unsorted,
author = {Rees, Jonathan and Clinger, William and Richard Kelsey}
}
@conference {Tanenbaum86usingsparse,
@@ -16246,6 +16280,7 @@ We also sketch applications of these signatures to a payment system, solving dis
abstract = {this paper we discuss a system, Amoeba, that uses capabilities for naming and protecting objects. In contrast to traditional, centralized operating systems, in which capabilities are managed by the operating system kernel, in Amoeba all the capabilities are managed directly by user code. To prevent tampering, the capabilities are protected cryptographically. The paper describes a variety of the issues involved, and gives four different ways of dealing with the access rights},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.7998},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.56.3350.pdf},
+ www_section = unsorted,
author = {Andrew Tanenbaum and Sape J. Mullender and Robbert Van Renesse}
}
@article {214121,
@@ -16262,6 +16297,7 @@ We also sketch applications of these signatures to a payment system, solving dis
doi = {10.1145/3149.214121},
url = {http://portal.acm.org/citation.cfm?id=214121$\#$},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pods06_paper01.pdf},
+ www_section = unsorted,
author = {Fischer, Michael J. and Lynch, Nancy A. and Paterson, Michael S.}
}
@conference {pfitzmann85,
@@ -16325,6 +16361,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
doi = {http://doi.acm.org/10.1145/4372.4373},
url = {http://portal.acm.org/citation.cfm?id=4373},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.48.4680.pdf},
+ www_section = unsorted,
author = {David Chaum}
}
@book {538134,
@@ -16336,6 +16373,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
isbn = {0932376223},
url = {http://portal.acm.org/citation.cfm?id=538134$\#$},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Preface.pdf},
+ www_section = unsorted,
author = {Levy, Henry M.}
}
@article {357176,
@@ -16351,6 +16389,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
doi = {10.1145/357172.357176},
url = {http://portal.acm.org/citation.cfm?id=357176$\#$},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/byz.pdf},
+ www_section = unsorted,
author = {Lamport, Leslie and Shostak, Robert and Pease, Marshall}
}
@conference {1982,
@@ -16363,6 +16402,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
doi = {10.1109/SFCS.1982.88},
url = {http://dx.doi.org/10.1109/SFCS.1982.88},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ProtocolSecurecomputations1982Yao.pdf},
+ www_section = unsorted,
author = {Yao, Andrew C.}
}
@article {chaum-mix,
@@ -16379,7 +16419,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
issn = {0001-0782 },
doi = {http://doi.acm.org/10.1145/358549.358563},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/chaum-mix_0.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {David Chaum}
}
@article {10.1109/SP.1980.10006,
@@ -16393,6 +16433,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
issn = {1540-7993},
doi = {10.1109/SP.1980.10006},
url = {http://www.computer.org/portal/web/csdl/doi/10.1109/SP.1980.10006},
+ www_section = unsorted,
author = {Ralph C. Merkle}
}
@conference {1979,
@@ -16404,6 +16445,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
abstract = {List structures provide a general mechanism for representing easily changed structured data, but can introduce inefficiencies in the use of space when fields of uniform size are used to contain pointers to data and to link the structure. Empirically determined regularity can be exploited to provide more space-efficient encodings without losing the flexibility inherent in list structures. The basic scheme is to provide compact pointer fields big enough to accommodate most values that occur in them and to provide {\textquotedblleft}escape{\textquotedblright} mechanisms for exceptional cases. Several examples of encoding designs are presented and evaluated, including two designs currently used in Lisp machines. Alternative escape mechanisms are described, and various questions of cost and implementation are discussed. In order to extrapolate our results to larger systems than those measured, we propose a model for the generation of list pointers and we test the model against data from two programs. We show that according to our model, list structures with compact cdr fields will, as address space grows, continue to be compacted well with a fixed-width small field. Our conclusion is that with a microcodable processor, about a factor of two gain in space efficiency for list structure can be had for little or no cost in processing time},
doi = {10.1145/357073.357081},
url = {http://portal.acm.org/citation.cfm?id=357081$\#$collab},
+ www_section = unsorted,
author = {Daniel G. Bobrow and Douglas W. Clark}
}
@article {padlipky78,
@@ -16429,7 +16471,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
abstract = {This thesis examines the issues relating to non-discretionary access controls for decentralized computing systems. Decentralization changes the basic character of a computing system from a set of processes referencing a data base to a set of processes sending and receiving messages. Because messages must be acknowledged, operations that were read-only in a centralized system become read-write operations. As a result, the lattice model of non-discretionary access control, which mediates operations based on read versus read-write considerations, does not allow direct transfer of algorithms from centralized systems to decentralized systems. This thesis develops new mechanisms that comply with the lattice model and provide the necessary functions for effective decentralized computation. Secure protocols at several different levels are presented in the thesis. At the lowest level, a host or host protocol is shown that allows communication between hosts with effective internal security controls. Above this level, a host independent naming scheme is presented that allows generic naming of services in a manner consistent with the lattice model. The use of decentralized processing to aid in the downgrading of information is shown in the design of a secure intelligent terminal. Schemes are presented to deal with the decentralized administration of the lattice model, and with the proliferation of access classes as the user community of a decentralized system become more diverse. Limitations in the use of end-to-end encryption when used with the lattice model are identified, and a scheme is presented to relax these limitations for broadcast networks. Finally, a scheme is presented for forwarding authentication information between hosts on a network, without transmitting passwords (or their equivalent) over a network},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/MIT-LCS-TR-179.pdf},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Paul A. Karger}
}
@article {1977,
@@ -16439,7 +16481,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
year = {1977},
pages = {2--1},
www_section = {database_privacy differential_privacy stat},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Dalenius, T.}
}
@article {1076,
@@ -16454,7 +16496,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
issn = {0018-9448},
doi = {10.1109/TIT.1976.1055638},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IEEE\%20Trans.\%20on\%20Info.\%20-\%20New\%20directions\%20in\%20cryptography.pdf},
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Whitfield Diffie and Martin E. Hellman}
}
@article {1971,
@@ -16480,8 +16522,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
abstract = {We consider the problem of partitioning the nodes of a graph with costs on its edges into subsets of given sizes so as to minimize the sum of the costs on all edges cut. This problem arises in several physical situations- for example, in assigning the components of electronic circuits to circuit boards to minimize the number of connections between boards. This paper presents a heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems},
www_section = {heuristic method, partitioning graphs},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Kernighan\%20\%26\%20Lin\%20-\%20An\%20Efficient\%20Heuristic\%20Procedure\%20for\%20Partitioning\%20Graphs\%250A.pdf},
- www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Brian W. Kernighan and S. Lin}
}
@article {1970_1,
@@ -16494,6 +16535,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
abstract = {I. Introduction, 488.--II. The model with automobiles as an example, 489.--III. Examples and applications, 492.--IV. Counteracting institutions, 499.--V. Conclusion, 500},
url = { http://www.jstor.org/stable/1879431},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/akerlof.pdf},
+ www_section = unsorted,
author = {George A. Akerlof}
}
@article {Bloom70space/timetrade-offs,
@@ -16515,7 +16557,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
pages = {1243--1248},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Science\%20-\%20Hardin\%20-\%20The\%20Tragedy\%20of\%20the\%20Commons.pdf},
www_section = unsorted,
- %url = {https://bibliography.gnunet.org},
+ url = {https://bibliography.gnunet.org},
author = {Garrett Hardin}
}
@article {1962,
@@ -16554,7 +16596,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
month = jan,
pages = {290--297},
www_section = {graphs, random, random graphs},
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Erd\%C5\%91s\%20\%26\%20R\%C3\%A9nyi\%20-\%20On\%20Random\%20Graphs.pdf},
author = {Paul Erd{\H o}s and Alfr{\'e}d R{\'e}nyi}
}
@@ -16570,6 +16612,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
issn = {0001-0782},
doi = {10.1145/368892.368907},
url = {http://portal.acm.org/citation.cfm?id=368907$\#$},
+ www_section = unsorted,
author = {Andrey Petrovych Ershov}
}
@article {1950,
@@ -16582,7 +16625,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
abstract = {One may define a concept of an n-person game in which each player has a finite set of pure strategies and in which a definite set of payments to the n players corresponds to each n-tuple of pure strategies, one strategy being taken for each player. For mixed strategies, which are probability distributions over the pure strategies, the pay-off functions are the expectations of the players, thus becoming polylinear forms},
www_section = {n-persona game, strategy},
doi = {10.1073/pnas.36.1.48},
- %url = unsorted,
+ url = {https://bibliography.gnunet.org},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PNAS\%20-\%20Nash\%20-\%20Equilibrium\%20points\%20in\%20n-person\%20games.pdf},
author = {John F. Nash Jr.}
}
