Rename occurences of 'url =' to 'www_section ='. Add www_section to some entries where it is missing and use a gnunet.org subdomain. Make entries unique in ID. - gnunetbib

commit cc3bd88eb3d09cf6c1a331ae5d902fb706ccaa4c
parent 9ca6ed63f812efb18db65b601be7c4721f675510
Author: Nils Gillmann <ng0@n0.is>
Date:   Sat,  6 Oct 2018 13:35:39 +0000

Rename occurences of 'url =' to 'www_section ='. Add www_section to some entries where it is missing and use a gnunet.org subdomain. Make entries unique in ID.

Signed-off-by: Nils Gillmann <ng0@n0.is>

Diffstat:
M gnunetbib.bib  | 2193 ++++++++++++++++++++++++++++++++++++++++---------------------------------------

1 file changed, 1109 insertions(+), 1084 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -43,6 +43,7 @@
 	abstract = {In this thesis we translate Brandt{\textquoteright}s privacy preserving sealed-bid online auction protocol from RSA to elliptic curve arithmetic and analyze the theoretical and practical benefits. With Brandt{\textquoteright}s protocol, the auction outcome is completely resolved by the bidders and the seller without the need for a trusted third party. Loosing bids are not revealed to anyone. We present libbrandt, our implementation of four algorithms with different outcome and pricing properties, and describe how they can be incorporated in a real-world online auction system. Our performance measurements show a reduction of computation time and prospective bandwidth cost of over 90\% compared to an implementation of the RSA version of the same algorithms. We also evaluate how libbrandt scales in different dimensions and conclude that the system we have presented is promising with respect to an adoption in the real world},
 	keywords = {auctions, GNUnet, secure multi-party computation},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/thesis_0.pdf},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {Markus Teich},
 	editor = {Totakura, Sree Harsha and Grothoff, Christian and Felix Brandt}
 }
@@ -57,6 +58,7 @@
 	address = {Berlin},
 	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},
 	keywords = {CADET, GNUnet, measurement, performance},
+        www_section = {https://bibliography.gnunet.org/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/lurchi-bs-thesis.pdf},
 	author = {Christian Ulrich}
 }
@@ -64,6 +66,7 @@
 	title = {Byzantine Set-Union Consensus using Efficient Set Reconciliation},
 	booktitle = {International Conference on Availability, Reliability and Security (ARES)},
 	year = {2016},
+        www_section = {https://bibliography.gnunet.org/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/dold2016byzantine.pdf},
 	author = {Dold, Florian and Grothoff, Christian}
 }
@@ -75,6 +78,7 @@
 	abstract = {Applications of secure multiparty computation such as certain electronic voting or auction protocols require Byzantine agreement on large sets of elements. Implementations proposed in the literature so far have relied on state machine replication, and reach agreement on each individual set element in sequence. We introduce set-union consensus, a specialization of Byzantine consensus that reaches agreement over whole sets. This primitive admits an efficient and simple implementation by the composition of Eppstein{\textquoteright}s set reconciliation protocol with Ben-Or{\textquoteright}s ByzConsensus protocol. A free software implementation of this construction is available in GNUnet. Experimental results indicate that our approach results in an efficient protocol for very large sets, especially in the absence of Byzantine faults. We show the versatility of set-union consensus by using it to implement distributed key  generation, ballot collection and cooperative decryption for an electronic voting protocol implemented in GNUnet},
 	keywords = {byzantine fault tolerance, consensus, GNUnet},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/consensus2016.pdf},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {Florian Dold and Christian Grothoff}
 }
 @conference {taler2016space,
@@ -88,6 +92,7 @@
 	abstract = {GNU Taler is a new electronic online payment system which provides privacy for customers and accountability for merchants. It uses an exchange service to issue digital coins using blind signatures, and is thus not subject to the performance issues that plague Byzantine fault-tolerant consensus-based solutions. The focus of this paper is addressing the challenges payment systems face in the context of the Web.  We discuss how to address Web-specific challenges, such as handling bookmarks and sharing of links, as well as supporting users that have disabled JavaScript.  Web payment systems must also navigate various constraints imposed by modern Web browser security architecture, such as same-origin policies and the separation between browser extensions and Web pages.  While our analysis focuses on how Taler operates within the security infrastructure provided by the modern Web, the results partially generalize to other payment systems. We also include the perspective of merchants, as existing systems have often struggled with securing payment information at the merchant{\textquoteright}s side.  Here, challenges include avoiding database transactions for customers that do not actually go through with the purchase, as well as cleanly separating security-critical functions of the payment system from the rest of the Web service},
 	keywords = {blind signatures, GNUnet, incentives, payments, Taler, web},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/taler2016space.pdf},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {Jeffrey Burdges and Florian Dold and Christian Grothoff and Marcello Stanisci}
 }
 @mastersthesis {xrs2016,
@@ -102,6 +107,7 @@
 	abstract = {This thesis studies the GNUnet project comprising its history, ideas and the P2P network technology. It specifically investigates the question of emancipatory potentials with regard to forms of information power due to a widely deployed new Internet technology and tries to identify essential suspensions of power within the scope of an impact assessment. Moreover, we will see by contrasting the GNUnet project with the critical data protection project, founded on social theory, that both are heavily concerned about the problem of illegitimate and unrestrained information power, giving us additional insights for the assessment. Last but least I{\textquoteright}ll try to present a scheme of how both approaches may interact to realize their goals},
 	keywords = {GNUnet, peer-to-peer},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/xrs2016.pdf},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {Christian Ricardo K{\"u}hne}
 }
 @conference {2016,
@@ -114,6 +120,7 @@
 	address = {Crete, Greece},
 	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},
 	keywords = {Decentralisation, GNUnet, Identity and Access Management, User Attributes},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {Martin Schanzenbach and Christian Banse}
 }
 @conference {p4t2016,
@@ -127,6 +134,7 @@
 	abstract = {Future online social networks need to not only protect sensitive data of their users, but also protect them from abusive behavior coming from malicious participants in the network. We investigate the use of supervised learning techniques to detect abusive behavior and describe privacy-preserving protocols to compute the feature set required by abuse classification algorithms in a secure and privacy-preserving way.  While our method is not yet fully resilient against a strong adaptive adversary, our evaluation suggests that it will be useful to detect abusive behavior with a minimal impact on privacy},
 	keywords = {abuse, GNUnet, Privacy preserving, reputation, Social networking},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p4t.pdf},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {{\'A}lvaro Garc{\'\i}a-Recuero and Jeffrey Burdges and Christian Grothoff}
 }
 @article {fk-2016-1-p46,
@@ -136,6 +144,7 @@
 	chapter = {46},
 	keywords = {Architecture, GNUnet, Internet},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fk-2016-1-p46.pdf},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {Christian Ricardo K{\"u}hne}
 }
 @mastersthesis {ma_dold_consensus_21dec2015byzantine,
@@ -150,6 +159,7 @@
 	abstract = {Byzantine consensus is a fundamental and well-studied problem in the area of distributed system. It requires a group of peers to reach agreement on some value, even if a fraction of the peers is controlled by an adversary. This thesis proposes set union consensus, an efficient generalization of Byzantine consensus from single elements to sets. This is practically motivated by Secure Multiparty Computation protocols such as electronic voting, where a large set of elements must be collected and agreed upon. Existing practical implementations of Byzantine consensus are typically based on state machine replication and not well-suited for agreement on sets, since they must process individual agreements on all set elements in sequence. We describe and evaluate our implementation of set union consensus in GNUnet, which is based on a composition of Eppstein set reconciliation protocol with the simple gradecast consensus prococol described by Ben-Or},
 	keywords = {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 = {https://bibliography.gnunet.org/},
 	author = {Florian Dold}
 }
 @article {mcb-es2015,
@@ -160,6 +170,7 @@
 	address = {Muenchen},
 	keywords = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-es.pdf},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum}
 }
 @article {mcb-it2015,
@@ -170,6 +181,7 @@
 	address = {Muenchen},
 	keywords = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-it.pdf},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum and Luca Saiu}
 }
 @article {mcb-fr2015,
@@ -180,6 +192,7 @@
 	address = {Muenchen},
 	keywords = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-fr.pdf},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum and Ludovic Courtes}
 }
 @article {mcb-en2015,
@@ -190,6 +203,7 @@
 	address = {Muenchen},
 	keywords = {DNS, DNSSEC, MORECOWBELL, NAMECOIN, TLS},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-en.pdf},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum}
 }
 @mastersthesis {mwachs2014,
@@ -205,7 +219,7 @@
 	keywords = {Communication, GNU Name System, GNUnet, P2P, resilience},
 	isbn = {3-937201-45-9},
 	doi = {10.2313/NET-2015-02-1},
-	url = {http://nbn-resolving.de/urn/resolver.pl?urn:bvb:91-diss-20150225-1231854-0-7},
+	www_section = {http://nbn-resolving.de/urn/resolver.pl?urn:bvb:91-diss-20150225-1231854-0-7},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NET-2015-02-1.pdf},
 	author = {Matthias Wachs}
 }
@@ -223,6 +237,7 @@
         First, the motivation to use home routers for services besides routing and the need to protect their physical integrity is discussed. Second, the idea and functionality of the Panic! system is introduced and the high-level interactions between its components explained. Third, the software components to be run on the router are described. Fourth, the requirements of the measurement circuit are declared and a prototype is presented. Fifth, some characteristics of pressurized environments are discussed and the difficulties for finding adequate containments are explained. Finally, an outlook to tasks left for the future is given},
 	keywords = {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 = {https://bibliography.gnunet.org/},
 	author = {Nicolas Bene{\v s}}
 }
 @conference {paper_short2014,
@@ -236,6 +251,7 @@
         We begin by detailing the overall requirements for an algorithm for transport selection and resource allocation, and then compare three different solutions using (1) a heuristic, (2) linear optimisation, and (3) machine learning. To show the suitability and the specific benefits of each approach, we evaluate their performance with respect to usability, scalability and quality of the solution found in relation to application requirements},
 	keywords = {GNUnet, resource allocation},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/paper_short.pdf},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {Matthias Wachs and Fabian Oehlmann and Christian Grothoff}
 }
 @book {pir2014,
@@ -251,7 +267,7 @@
 We present a hybrid PIR protocol that combines two PIR protocols, one from each of these classes. Our protocol inherits many positive aspects of both classes and mitigates some of the negative aspects. For example, our hybrid protocol maintains partial privacy when the security assumptions of one of the component protocols is broken, mitigating the privacy loss in such an event. We have implemented our protocol as an extension of the Percy++ library so that it combines a PIR protocol by Aguilar Melchor and Gaborit with one by Goldberg. We show that our hybrid protocol uses less communication than either of these component protocols and that our scheme is particularly beneficial when the number of records in a database is large compared to the size of the records. This situation arises in applications such as TLS certificate verification, anonymous communications systems, private LDAP lookups, and others},
 	isbn = {978-3-319-08505-0},
 	doi = {10.1007/978-3-319-08506-7_4},
-	url = {http://dx.doi.org/10.1007/978-3-319-08506-7_4},
+	www_section = {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},
 	author = {Devet, Casey and Goldberg, Ian},
 	editor = {De Cristofaro, Emiliano and Murdoch, StevenJ}
@@ -264,6 +280,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each 
 	abstract = {This paper describes CADET, a new transport protocol for confidential and authenticated data transfer in decentralized networks. This transport protocol is designed to operate in restricted-route scenarios such as friend-to-friend or ad-hoc wireless networks. We have implemented CADET and evaluated its performance in various network scenarios, compared it to the well-known TCP/IP stack and tested its response to rapidly changing network topologies. While our current implementation is still significantly slower in high-speed low-latency networks, for typical Internet-usage our system provides much better connectivity and security with comparable performance to TCP/IP},
 	keywords = {CADET, encryption, GNUnet, routing},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cadet.pdf},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {Polot, Bartlomiej and Christian Grothoff}
 }
 @conference {DistributedSearch2014Hermann,
@@ -272,6 +289,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each 
 	year = {2014},
 	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 = {https://bibliography.gnunet.org/},
 	author = {Michael Herrmann and Ren Zhang and Kai-Chun Ning and Claudia Diaz}
 }
 @conference {CANS2014camera-ready,
@@ -283,6 +301,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each 
 	abstract = {The Domain Name System (DNS) is vital for access to information on the Internet.  This makes it a target for attackers whose aim is to suppress free access to information. This paper introduces the design and implementation of the GNU Name System (GNS), a fully decentralized and censorship-resistant name system.  GNS provides a privacy-enhancing alternative to DNS which preserves the desirable property of memorable names. Due to its design, it can also double as a partial replacement of public key infrastructures, such as X.509.  The design of GNS incorporates the capability to integrate and coexist with DNS.  GNS is based on the principle of a petname system and builds on ideas from the Simple Distributed Security Infrastructure (SDSI), addressing a central issue with the decentralized mapping of secure identifiers to memorable names: namely the impossibility of providing a global, secure and memorable mapping without a trusted authority. GNS uses the transitivity in the SDSI design to replace the trusted root with secure delegation of authority, thus making petnames useful to other users while operating under a very strong adversary model.  In addition to describing the GNS design, we also discuss some of the mechanisms that are needed to smoothly integrate GNS with existing processes and procedures in Web browsers.  Specifically, we show how GNS is able to transparently support many assumptions that the existing HTTP(S) infrastructure makes about globally unique names},
 	keywords = {DNS, GNU Name System, GNUnet, PKI},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/paper_cans2014_camera_ready.pdf},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {Matthias Wachs and Martin Schanzenbach and Christian Grothoff}
 }
 @mastersthesis {scheibner-thesis2014,
@@ -297,6 +316,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each 
 	abstract = {Static analysis is often used to automatically check for common bugs in programs. Compilers already check for some common programming errors and issue warnings; however, they do not do a very deep analysis because this would slow the compilation of the program down. Specialized tools like Coverity or Clang Static Analyzer look at possible runs of a program and track the state of variables in respect to function calls. This information helps to identify possible bugs. In event driven programs like GNUnet callbacks are registered for later execution. Normal static analysis cannot track these function calls. This thesis is an attempt to extend different static analysis tools so that they can handle this case as well. Different solutions were thought of and executed with Coverity and Clang.  This thesis describes the theoretical background of model checking and static analysis, the practical usage of wide spread static analysis tools, and how these tools can be extended in order to improve their usefulness},
 	keywords = {event-driven, flow control, GNUnet, static analysis},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/scheibner_thesis.pdf},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {Florian Scheibner}
 }
 @mastersthesis {morales2014cryogenic,
@@ -314,6 +334,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each 
         Although we ideally target mobile platforms, Cryogenic has been developed by means a new Linux module that integrates with the existing POSIX event loop system calls. This allows to use Cryogenic on many different platforms as long as they use a GNU/Linux distribution as the main operating system. An evidence of this can be found in this thesis, where we demonstrate the power savings on a single-board computer},
 	keywords = {cooperative, cryogenic, GNUnet, Linux, POSIX, power},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/morales2014cryogenic.pdf},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {Alejandra Morales}
 }
 @mastersthesis {dold-thesis2014voting,
@@ -330,6 +351,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each 
         This thesis describes the design and implementation of an electronic voting system in GNUnet, a framework for secure and decentralized networking. We provide a short survey of voting schemes and existing implementations. The voting scheme we implemented makes use of threshold cryptography, a technique which requires agreement among a large subset of the election officials to execute certain cryptographic operations. Since such protocols have applications outside of electronic voting, we describe their design and implementation in GNUnet separately},
 	keywords = {GNUnet, secure multiparty computation, voting},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ba_dold_voting_24aug2014.pdf},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {Florian Dold}
 }
 @mastersthesis {decmon2014,
@@ -343,6 +365,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each 
         We start by introducing background information about peer-to-peer networks, anomalies and anomaly detection techniques in literature. Then we present some of the related work regarding monitoring decentralized networks, anomaly detection and data aggregation in decentralized networks. Then we perform an analysis of the system objectives, target environment and the desired properties of the system. Then we design the system in terms of the overall structure and its individual components. We follow with details about the system implementation. Lastly, we evaluate the final system implementation against our desired objectives},
 	keywords = {anomaly, censorship, detection, GNUnet},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/decmon_0.pdf},
+        www_section = {https://bibliography.gnunet.org/},
 	author = {Omar Tarabai}
 }
 @book {anonymity_and_cover_traffic2014,
@@ -359,7 +382,7 @@ communication systems enable the reconstruction of user behavioral profiles. Pro
 	keywords = {anonymous communications, disclosure attacks, dummies},
 	isbn = {978-3-319-08505-0},
 	doi = {10.1007/978-3-319-08506-7_11},
-	url = {http://dx.doi.org/10.1007/978-3-319-08506-7_11},
+	www_section = {http://dx.doi.org/10.1007/978-3-319-08506-7_11},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/anonymity_and_cover_traffic.pdf},
 	author = {Oya, Simon and Troncoso, Carmela and P{\'e}rez-Gonz{\'a}lez, Fernando},
 	editor = {De Cristofaro, Emiliano and Murdoch, StevenJ}
@@ -390,7 +413,7 @@ as an evaluation of its performance},
 	abstract = {Data obfuscation is a well-known technique for protecting user privacy against inference attacks, and it was studied in diverse settings, including search queries, recommender systems, location-based services and Online Social Networks (OSNs). However, these studies typically take the point of view of a single user who applies obfuscation, and focus on protection of a single target attribute. Unfortunately, while narrowing the scope simplifies the problem, it overlooks some significant challenges that effective obfuscation would need to address in a more realistic setting. First, correlations between attributes imply that obfuscation conducted to protect a certain attribute, may influence inference attacks targeted at other attributes. In addition, when multiple users conduct obfuscation simultaneously, the combined effect of their obfuscations may be significant enough to affect the inference mechanism to their detriment. In this work we focus on the OSN setting and use a dataset of 1.9 million Facebook profiles to demonstrate the severity of these problems and explore possible solutions. For example, we show that an obfuscation policy that would limit the accuracy of inference to 45\% when applied by a single user, would result in an inference accuracy of 75\% when applied by 10\% of the users. We show that a dynamic policy, which is continuously adjusted to the most recent data in the OSN, may mitigate this problem. Finally, we report the results of a user study, which indicates that users are more willing to obfuscate their profiles using popular and high quality items. Accordingly, we propose and evaluate an obfuscation strategy that satisfies both user needs and privacy protection},
 	isbn = {978-3-319-08505-0},
 	doi = {10.1007/978-3-319-08506-7_3},
-	url = {http://dx.doi.org/10.1007/978-3-319-08506-7_3},
+	www_section = {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},
 	author = {Chen, Terence and Boreli, Roksana and Kaafar, Mohamed-Ali and Friedman, Arik},
 	editor = {De Cristofaro, Emiliano and Murdoch, StevenJ}
@@ -425,7 +448,7 @@ resulting scheme is forward secure. Finally, we present a provably secure batche
 distributed encryption scheme that is much more efficient for small plaintext domains, but that requires more storage},
 	isbn = {978-3-319-08505-0},
 	doi = {10.1007/978-3-319-08506-7_7},
-	url = {http://dx.doi.org/10.1007/978-3-319-08506-7_7},
+	www_section = {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},
 	author = {Lueks, Wouter and Hoepman, Jaap-Henk and Kursawe, Klaus},
 	editor = {De Cristofaro, Emiliano and Murdoch, StevenJ}
@@ -516,7 +539,7 @@ obtained with different parameter sets and different test cases are presented an
 In this paper we explore the implications of differential privacy when the indistinguishability requirement depends on an arbitrary notion of distance. We show that we can naturally express, in this way, (protection against) privacy threats that cannot be represented with the standard notion, leading to new applications of the differential privacy framework. We give intuitive characterizations of these threats in terms of Bayesian adversaries, which generalize two interpretations of (standard) differential privacy from the literature. We revisit the well-known results stating that universally optimal mechanisms exist only for counting queries: We show that, in our extended setting, universally optimal mechanisms exist for other queries too, notably sum, average, and percentile queries. We explore various applications of the generalized definition, for statistical databases as well as for other areas, such that geolocation and smart metering},
 	isbn = {978-3-642-39076-0},
 	doi = {10.1007/978-3-642-39077-7_5},
-	url = {http://dx.doi.org/10.1007/978-3-642-39077-7_5},
+	www_section = {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},
 	author = {Chatzikokolakis, Konstantinos and Andr{\'e}s, MiguelE. and Bordenabe, Nicol{\'a}sEmilio and Palamidessi, Catuscia},
 	editor = {De Cristofaro, Emiliano and Wright, Matthew}
@@ -555,7 +578,7 @@ This paper maps the design space and gives design requirements for censorship re
 	pages = {58{\textendash}73},
 	author = {Antoine Boutet and Davide Frey and Arnaud Jegou and Anne-Marie Kermarrec and Heverson B. Ribeiro}
 }
-@mastersthesis {2013,
+@mastersthesis {2013_1,
 	title = {Large Scale Distributed Evaluation of Peer-to-Peer Protocols},
 	volume = {Master of Science},
 	year = {2013},
@@ -575,7 +598,7 @@ We specifically target HPC systems like compute clusters and supercomputers and 
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/thesis_lowres.pdf , https://gnunet.org/git/bibliography.git/tree/docs/thesis.pdf},
 	author = {Totakura, Sree Harsha}
 }
-@mastersthesis {2013,
+@mastersthesis {2013_2,
 	title = {Monkey - Generating Useful Bug Reports Automatically},
 	volume = {Bachelor},
 	year = {2013},
@@ -591,7 +614,7 @@ In this paper we describe the problems that occur when debugging widely distribu
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/main_0.pdf},
 	author = {Markus Teich}
 }
-@conference {2013,
+@conference {2013_3,
 	title = {Persea: A Sybil-resistant Social DHT},
 	booktitle = {Proceedings of the Third ACM Conference on Data and Application Security and Privacy},
 	year = {2013},
@@ -602,7 +625,7 @@ In this paper we describe the problems that occur when debugging widely distribu
 	keywords = {security, social dht, Sybil attack},
 	isbn = {978-1-4503-1890-7},
 	doi = {10.1145/2435349.2435372},
-	url = {http://doi.acm.org.eaccess.ub.tum.de/10.1145/2435349.2435372},
+	www_section = {http://doi.acm.org.eaccess.ub.tum.de/10.1145/2435349.2435372},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p169-al-ameen.pdf},
 	author = {Al-Ameen, Mahdi N. and Matthew Wright}
 }
@@ -614,7 +637,7 @@ In this paper we describe the problems that occur when debugging widely distribu
 	author = {DeCew, Judith},
 	editor = {Edward N. Zalta}
 }
-@article {2013,
+@article {2013_4,
 	title = {Public Key Pinning for TLS Using a Trust on First Use Model},
 	year = {2013},
 	abstract = {Although the Public Key Infrastructure (PKI) using X.509 is meant to prevent the occurrence of man-in-the-middle attacks on TLS, there are still situations in which such attacks are possible due to the large number of Certification Authorities (CA) that has to be trusted. Recent incidents involving CA compromises, which lead to issuance of rogue certificates indicate the weakness of the PKI model. Recently various public key pinning protocols {\textendash} such as DANE or TACK {\textendash} have been proposed to thwart man-in-the-middle attacks on TLS connections. It will take a longer time, however, until any of these protocols reach wide deployment. We present an approach intended as an interim solution to bridge this gap and provide protection for connections to servers not yet using a pinning protocol. The presented method is based on public key pinning with a trust on first use model, and can be combined with existing notary approaches as well},
@@ -623,7 +646,7 @@ In this paper we describe the problems that occur when debugging widely distribu
 	author = {Gabor X Toth},
 	editor = {Tjebbe Vlieg}
 }
-@mastersthesis {2013,
+@mastersthesis {2013_5,
 	title = {Speeding Up Tor with SPDY},
 	volume = {Master{\textquoteright}s in Computer Science},
 	year = {2013},
@@ -655,7 +678,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
 	doi = {10.1098/rsta.2012.0380},
 	author = {Kermarrec, Anne-Marie}
 }
-@conference {2013,
+@conference {2013_6,
 	title = {Trawling for Tor Hidden Services: Detection, Measurement, Deanonymization},
 	booktitle = {Security and Privacy (SP), 2013 IEEE Symposium on},
 	year = {2013},
@@ -664,7 +687,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Trawling_for_tor_HS.pdf},
 	author = {Biryukov, A. and Pustogarov, I. and Weinmann, R.}
 }
-@conference {2013,
+@conference {2013_7,
 	title = {WhatsUp: A Decentralized Instant News Recommender},
 	booktitle = {IEEE 27th International Symposium on Parallel \& Distributed Processing},
 	year = {2013},
@@ -686,11 +709,11 @@ This thesis includes extensive measurement data highlighting the possible benefi
 	keywords = {automated configuration, emulation, Network management},
 	issn = {0146-4833},
 	doi = {10.1145/2377677.2377699},
-	url = {http://doi.acm.org/10.1145/2377677.2377699},
+	www_section = {http://doi.acm.org/10.1145/2377677.2377699},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/autonetkit-small.pdf},
 	author = {Knight, Simon and Jaboldinov, Askar and Maennel, Olaf and Phillips, Iain and Roughan, Matthew}
 }
-@book {2012,
+@book {2012_0,
 	title = {BLIP: Non-interactive Differentially-Private Similarity Computation on Bloom filters},
 	booktitle = {Stabilization, Safety, and Security of Distributed Systems},
 	series = {Lecture Notes in Computer Science},
@@ -702,7 +725,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
 	abstract = {In this paper, we consider the scenario in which the profile of a user is represented in a compact way, as a Bloom filter, and the main objective is to privately compute in a distributed manner the similarity between users by relying only on the Bloom filter representation. In particular, we aim at providing a high level of privacy with respect to the profile even if a potentially unbounded number of similarity computations take place, thus calling for a non-interactive mechanism. To achieve this, we propose a novel non-interactive differentially private mechanism called BLIP (for BLoom-and-flIP) for randomizing Bloom filters. This approach relies on a bit flipping mechanism and offers high privacy guarantees while maintaining a small communication cost. Another advantage of this non-interactive mechanism is that similarity computation can take place even when the user is offline, which is impossible to achieve with interactive mechanisms. Another of our contributions is the definition of a probabilistic inference attack, called the {\textquotedblleft}Profile Reconstruction attack{\textquotedblright}, that can be used to reconstruct the profile of an individual from his Bloom filter representation. More specifically, we provide an analysis of the protection offered by BLIP against this profile reconstruction attack by deriving an upper and lower bound for the required value of the differential privacy parameter ε},
 	isbn = {978-3-642-33535-8},
 	doi = {10.1007/978-3-642-33536-5_20},
-	url = {http://dx.doi.org/10.1007/978-3-642-33536-5_20},
+	www_section = {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},
 	author = {Alaggan, Mohammad and Gambs, S{\'e}bastien and Kermarrec, Anne-Marie},
 	editor = {Richa, Andr{\'e}aW. and Scheideler, Christian}
@@ -719,7 +742,7 @@ serve that some nodes persist in being under-utilized or congested. This can deg
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FC\%2712\%20-\%20Congestion-aware\%20Path\%20Selection\%20for\%20Tor.pdf},
 	author = {Tao Wang and Kevin Bauer and Clara Forero and Ian Goldberg}
 }
-@conference {2012,
+@conference {2012_1,
 	title = {CRISP: Collusion-resistant Incentive-compatible Routing and Forwarding in Opportunistic Networks},
 	booktitle = {Proceedings of the 15th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems},
 	year = {2012},
@@ -729,7 +752,7 @@ serve that some nodes persist in being under-utilized or congested. This can deg
 	keywords = {black-hole attack, collusion, credit schemes, delay tolerant networks, flooding, incentive schemes, mobile peer-to-peer networks, opportunistic networks},
 	isbn = {978-1-4503-1628-6},
 	doi = {10.1145/2387238.2387253},
-	url = {http://doi.acm.org/10.1145/2387238.2387253},
+	www_section = {http://doi.acm.org/10.1145/2387238.2387253},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/crisp-mswim.pdf},
 	author = {Sadiq, Umair and Kumar, Mohan and Wright, Matthew}
 }
@@ -746,7 +769,7 @@ This position paper attempts to account for these failures, challenging the acce
 	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}
 }
-@mastersthesis {2012,
+@mastersthesis {2012_2,
 	title = {Decentralized Evaluation of Regular Expressions for Capability Discovery in Peer-to-Peer Networks},
 	volume = {M.S},
 	year = {2012},
@@ -766,7 +789,7 @@ We have implemented the system for our proposed approach and conducted a simulat
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/szengel2012ms.pdf},
 	author = {Maximilian Szengel}
 }
-@mastersthesis {2012,
+@mastersthesis {2012_3,
 	title = {Design and Implementation of a Censorship Resistant and Fully Decentralized Name System},
 	volume = {M.Sc},
 	year = {2012},
@@ -784,7 +807,7 @@ This work presents the fundamental goals and ideas behind GADS, provides technic
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/schanzen2012msc.pdf},
 	author = {Martin Schanzenbach}
 }
-@book {2012,
+@book {2012_4,
 	title = {Differential Privacy with Imperfect Randomness},
 	booktitle = {Advances in Cryptology {\textendash} CRYPTO 2012},
 	series = {Lecture Notes in Computer Science},
@@ -798,12 +821,12 @@ We ask whether similar negative results also hold for a more recent notion of pr
 Interestingly, the design of our mechanism is quite different from the traditional {\textquotedblleft}additive-noise{\textquotedblright} mechanisms (e.g., Laplace mechanism) successfully utilized to achieve differential privacy with perfect randomness. Indeed, we show that any (non-trivial) {\textquotedblleft}SV-robust{\textquotedblright} mechanism for our problem requires a demanding property called consistent sampling, which is strictly stronger than differential privacy, and cannot be satisfied by any additive-noise mechanism},
 	isbn = {978-3-642-32008-8},
 	doi = {10.1007/978-3-642-32009-5_29},
-	url = {http://dx.doi.org/10.1007/978-3-642-32009-5_29},
+	www_section = {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},
 	author = {Dodis, Yevgeniy and L{\'o}pez-Alt, Adriana and Mironov, Ilya and Vadhan, Salil},
 	editor = {Safavi-Naini, Reihaneh and Canetti, Ran}
 }
-@article {2012,
+@article {2012_5,
 	title = {Efficient and Secure Decentralized Network Size Estimation},
 	year = {2012},
 	month = may,
@@ -827,7 +850,7 @@ accuracy of the protocol},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/nse-techreport.pdf},
 	author = {Nathan S Evans and Polot, Bartlomiej and Christian Grothoff}
 }
-@conference {2012,
+@conference {2012_6,
 	title = {Efficient and Secure Decentralized Network Size Estimation},
 	booktitle = {IFIP International Conferences on Networking (Networking 2012)},
 	year = {2012},
@@ -838,7 +861,7 @@ accuracy of the protocol},
 	address = {Prague, CZ},
 	abstract = {The size of a Peer-to-Peer (P2P) network is an important parameter for performance tuning of P2P routing algorithms.  This paper introduces and evaluates a new efficient method for participants in an unstructured P2P network to establish the size of the overall network. The presented method is highly efficient, propagating information about the current size of the network to all participants using O(|E|) operations where |E| is the number of edges in the network. Afterwards, all nodes have the same network size estimate, which can be made arbitrarily accurate by averaging results from multiple rounds of the protocol.  Security measures are included which make it prohibitively expensive for a typical active participating adversary to significantly manipulate the estimates.  This paper includes experimental results that demonstrate the viability, efficiency and accuracy of the protocol},
 	keywords = {byzantine fault tolerance, GNUnet, network size estimation, proof of work},
-	url = {http://grothoff.org/christian/rrsize2012.pdf},
+	www_section = {http://grothoff.org/christian/rrsize2012.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/paper-ifip.pdf},
 	author = {Nathan S Evans and Polot, Bartlomiej and Christian Grothoff}
 }
@@ -864,7 +887,7 @@ accuracy of the protocol},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/how-to-build-a-better-testbed.pdf},
 	author = {Fabien Hermenier and Robert Ricci}
 }
-@conference {2012,
+@conference {2012_7,
 	title = {Koi: A Location-Privacy Platform for Smartphone Apps},
 	booktitle = {Proceedings of the 9th Symposium on Networked Systems Design and Implementation (NSDI)},
 	year = {2012},
@@ -935,7 +958,7 @@ not detecting a potential snooping AS from 57\% to 11\%},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/LASTor\%3A\%20A\%20Low-Latency\%20AS-Aware\%20Tor\%20Client.pdf},
 	author = {Masoud Akhoondi and Curtis Yu and Harsha V. Madhyastha}
 }
-@book {2012,
+@book {2012_8,
 	title = {Lower Bounds in Differential Privacy},
 	booktitle = {Theory of Cryptography},
 	series = {Lecture Notes in Computer Science},
@@ -952,7 +975,7 @@ We also simplify the lower bounds on noise for counting queries in [11] and also
 	keywords = {Differential Privacy, LP decoding},
 	isbn = {978-3-642-28913-2},
 	doi = {10.1007/978-3-642-28914-9_18},
-	url = {http://dx.doi.org/10.1007/978-3-642-28914-9_18},
+	www_section = {http://dx.doi.org/10.1007/978-3-642-28914-9_18},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/LowerBoundsDP2012De.pdf},
 	author = {De, Anindya},
 	editor = {Cramer, Ronald}
@@ -967,7 +990,7 @@ We also simplify the lower bounds on noise for counting queries in [11] and also
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/modelnet-si-ppna11.pdf},
 	author = {Rossi, D. and Veglia, P. and Sammarco, M. and Larroca, F.}
 }
-@mastersthesis {2012,
+@mastersthesis {2012_9,
 	title = {Monkey: Automated debugging of deployed distributed systems},
 	volume = {M.S},
 	year = {2012},
@@ -982,7 +1005,7 @@ In this master thesis we introduce Monkey, a new tool that provides a solution f
 	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},
 	author = {Safey A. Halim}
 }
-@conference {2012,
+@conference {2012_10,
 	title = {NTALG - TCP NAT traversal with application-level gateways},
 	booktitle = {Consumer Communications and Networking Conference (CCNC), 2012 IEEE},
 	year = {2012},
@@ -995,13 +1018,13 @@ a small test setup with laptop computers and home NAT routers},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WHW_12-NTALG.pdf},
 	author = {Wander, M. and Holzapfel, S. and Wacker, A. and Weis, T.}
 }
-@article {2012,
+@article {2012_11,
 	title = {Octopus: A Secure and Anonymous DHT Lookup},
 	journal = {CoRR},
 	volume = {abs/1203.2668},
 	year = {2012},
 	keywords = {anonymity, distributed hash table},
-	url = {http://dblp.uni-trier.de/db/journals/corr/corr1203.html$\#$abs-1203-2668},
+	www_section = {http://dblp.uni-trier.de/db/journals/corr/corr1203.html$\#$abs-1203-2668},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/octopus_dht.pdf},
 	author = {Wang, Qiyan and Borisov, Nikita}
 }
@@ -1021,7 +1044,7 @@ purpose TA countermeasures can ever provide the type of security targeted in pri
 	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},
 	author = {Kevin P. Dyer and Scott Coull and Thomas Ristenpart and Thomas Shrimpton}
 }
-@article {2012,
+@article {2012_12,
 	title = {Personalization and privacy: a survey of privacy risks and remedies in personalization-based systems},
 	journal = {User Modeling and User-Adapted Interaction},
 	volume = {22},
@@ -1031,7 +1054,7 @@ purpose TA countermeasures can ever provide the type of security targeted in pri
 	keywords = {e-commerce, Human{\textendash}computer interaction, Location-based services, Personalization, privacy, social networks},
 	issn = {0924-1868},
 	doi = {10.1007/s11257-011-9110-z},
-	url = {http://dx.doi.org/10.1007/s11257-011-9110-z},
+	www_section = {http://dx.doi.org/10.1007/s11257-011-9110-z},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Personalization2012Toch.pdf},
 	author = {Toch, Eran and Wang, Yang and Cranor, LorrieFaith}
 }
@@ -1057,7 +1080,7 @@ purpose TA countermeasures can ever provide the type of security targeted in pri
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mininet-hifi.pdf},
 	author = {Handigol, N. and Heller, B. and Jeyakumar, V. and Lantz, B. and McKeown, N.}
 }
-@article {2012,
+@article {2012_13,
 	title = {Saturn: Range Queries, Load Balancing and Fault Tolerance in DHT Data Systems},
 	journal = {IEEE Transactions on Knowledge and Data Engineering},
 	volume = {24},
@@ -1080,7 +1103,7 @@ handle replication and, thus, to trade off replication costs for fair load distr
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/saturn-range-dht.pdf},
 	author = {Theoni Pitoura and Nikos Ntarmos and Peter Triantafillou}
 }
-@article {2012,
+@article {2012_14,
 	title = {The state-of-the-art in personalized recommender systems for social networking},
 	journal = {Artificial Intelligence Review},
 	volume = {37},
@@ -1090,11 +1113,11 @@ handle replication and, thus, to trade off replication costs for fair load distr
 	keywords = {recommender systems, Social networking, trust, User generated content, user profiles},
 	issn = {0269-2821},
 	doi = {10.1007/s10462-011-9222-1},
-	url = {http://dx.doi.org/10.1007/s10462-011-9222-1},
+	www_section = {http://dx.doi.org/10.1007/s10462-011-9222-1},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PersonalizedRecommender2012Zhou.pdf},
 	author = {Zhou, Xujuan and Xu, Yue and Li, Yuefeng and Josang, Audun and Cox, Clive}
 }
-@article {2012,
+@article {2012_15,
 	title = {A Survey of Monte Carlo Tree Search Methods},
 	journal = {IEEE Transactions on Computational Intelligence and AI in Games},
 	volume = {4},
@@ -1108,7 +1131,7 @@ handle replication and, thus, to trade off replication costs for fair load distr
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Browne\%20et\%20al\%20-\%20A\%20survey\%20of\%20MCTS\%20methods.pdf},
 	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,
+@article {2012_16,
 	title = {Theory and Practice of Bloom Filters for Distributed Systems},
 	journal = {Communications Surveys Tutorials, IEEE},
 	volume = {14},
@@ -1122,7 +1145,7 @@ handle replication and, thus, to trade off replication costs for fair load distr
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/TheoryandPracticeBloomFilter2011Tarkoma.pdf},
 	author = {Tarkoma, S. and Rothenberg, C.E. and Lagerspetz, E.}
 }
-@conference {2012,
+@conference {2012_17,
 	title = {User Interests Driven Web Personalization Based on Multiple Social Networks},
 	booktitle = {Proceedings of the 4th International Workshop on Web Intelligence \&\#38; Communities},
 	year = {2012},
@@ -1133,7 +1156,7 @@ handle replication and, thus, to trade off replication costs for fair load distr
 	keywords = {interest analysis, search refinement, web personalization},
 	isbn = {978-1-4503-1189-2},
 	doi = {10.1145/2189736.2189749},
-	url = {http://doi.acm.org/10.1145/2189736.2189749},
+	www_section = {http://doi.acm.org/10.1145/2189736.2189749},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WebPersonalization2012Zeng.pdf},
 	author = {Zeng, Yi and Zhong, Ning and Ren, Xu and Wang, Yan}
 }
@@ -1200,7 +1223,7 @@ Cirripede is designed to work scalably with routers that handle large volumes of
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CCS\%2711\%20-\%20Cirripede.pdf},
 	author = {Amir Houmansadr and Giang T. K. Nguyen and Matthew Caesar and Borisov, Nikita}
 }
-@article {2011,
+@article {2011_0,
 	title = {Collaborative Personalized Top-k Processing},
 	journal = {ACM Trans. Database Syst},
 	volume = {36},
@@ -1210,11 +1233,11 @@ Cirripede is designed to work scalably with routers that handle large volumes of
 	keywords = {gossip, Peer-to-peer networks, Personalization, top-k processing},
 	issn = {0362-5915},
 	doi = {10.1145/2043652.2043659},
-	url = {http://doi.acm.org/10.1145/2043652.2043659},
+	www_section = {http://doi.acm.org/10.1145/2043652.2043659},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/TopK-Processing2011Bai.pdf},
 	author = {Bai, Xiao and Guerraoui, Rachid and Kermarrec, Anne-Marie and Leroy, Vincent}
 }
-@article {2011,
+@article {2011_1,
 	title = {A comprehensive study of Convergent and Commutative Replicated Data Types},
 	number = {7506},
 	year = {2011},
@@ -1236,7 +1259,7 @@ and sequences. It discusses some properties needed to implement non-trivial CRDT
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/crdt.pdf},
 	author = {Marc Shapiro and Nuno Preguica and Carlos Baquero and Marek Zawirski}
 }
-@conference {2011,
+@conference {2011_2,
 	title = {Considering Complex Search Techniques in DHTs under Churn},
 	booktitle = {CCNC 2011 - IEEE Consumer Communications and Networking Conference},
 	year = {2011},
@@ -1273,7 +1296,7 @@ is easily blocked) in order to provide circumvention. We show that if it is poss
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PETS\%2711\%20-\%20DefenestraTor.pdf},
 	author = {Mashael AlSabah and Kevin Bauer and Ian Goldberg and Dirk Grunwald and Damon McCoy and Stefan Savage and Geoffrey M. Voelker}
 }
-@article {2011,
+@article {2011_3,
 	title = {Distributed Private Data Analysis: On Simultaneously Solving How and What},
 	journal = {CoRR},
 	volume = {abs/1103.2626},
@@ -1376,7 +1399,7 @@ outline a set of new performance requirements that anonymous blacklisting system
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/syssec2011.pdf},
 	author = {Christian Grothoff}
 }
-@article {2011,
+@article {2011_4,
 	title = {High-speed high-security signatures},
 	journal = {Journal of Cryptographic Engineering},
 	volume = {2},
@@ -1385,11 +1408,11 @@ outline a set of new performance requirements that anonymous blacklisting system
 	pages = {77--89},
 	chapter = {77},
 	keywords = {ECC, Ed25519, EdDSA, GNUnet},
-	url = {http://ed25519.cr.yp.to/papers.html},
+	www_section = {http://ed25519.cr.yp.to/papers.html},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ed25519-20110926.pdf},
 	author = {Daniel J. Bernstein and Niels Duif and Tanja Lange and Peter Schwabe and Bo-Yin Hang}
 }
-@book {2011,
+@book {2011_5,
 	title = {How Much Is Enough? Choosing ε for Differential Privacy},
 	booktitle = {Information Security},
 	series = {Lecture Notes in Computer Science},
@@ -1402,7 +1425,7 @@ outline a set of new performance requirements that anonymous blacklisting system
 	keywords = {Differential Privacy, Privacy Parameter, ε},
 	isbn = {978-3-642-24860-3},
 	doi = {10.1007/978-3-642-24861-0_22},
-	url = {http://dx.doi.org/10.1007/978-3-642-24861-0_22},
+	www_section = {http://dx.doi.org/10.1007/978-3-642-24861-0_22},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Choosing-\%CE\%B5-2011Lee.pdf},
 	author = {Lee, Jaewoo and Clifton, Chris},
 	editor = {Lai, Xuejia and Zhou, Jianying and Li, Hui}
@@ -1444,11 +1467,11 @@ To better understand the security and performance properties of a popular low la
 	keywords = {content-based, publish/subscribe, QoS},
 	issn = {1532-0626},
 	doi = {10.1002/cpe.1751},
-	url = {http://dx.doi.org/10.1002/cpe.1751},
+	www_section = {http://dx.doi.org/10.1002/cpe.1751},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Tariq2011Meeting.pdf},
 	author = {Tariq, Muhammad Adnan and Boris Koldehofe and Gerald G. Koch and Khan, Imran and Kurt Rothermel}
 }
-@mastersthesis {2011,
+@mastersthesis {2011_6,
 	title = {Methods for Secure Decentralized Routing in Open Networks},
 	volume = {Dr. rer. nat},
 	year = {2011},
@@ -1474,7 +1497,7 @@ emulation framework capable of running a large number of nodes using our full co
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NET-2011-08-1.pdf},
 	author = {Nathan S Evans}
 }
-@article {2011,
+@article {2011_7,
 	title = {Multi-objective optimization based privacy preserving distributed data mining in Peer-to-Peer networks},
 	journal = {Peer-to-Peer Networking and Applications},
 	volume = {4},
@@ -1484,7 +1507,7 @@ emulation framework capable of running a large number of nodes using our full co
 	keywords = {Data mining, peer-to-peer, Privacy preserving},
 	issn = {1936-6442},
 	doi = {10.1007/s12083-010-0075-1},
-	url = {http://dx.doi.org/10.1007/s12083-010-0075-1},
+	www_section = {http://dx.doi.org/10.1007/s12083-010-0075-1},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Privacy_PPNA2011Das.pdf},
 	author = {Das, Kamalika and Bhaduri, Kanishka and Kargupta, Hillol}
 }
@@ -1498,7 +1521,7 @@ emulation framework capable of running a large number of nodes using our full co
 	address = {Boston, United States},
 	abstract = {Tor is a popular low-latency anonymity network. However, Tor does not protect against the exploitation of an insecure application to reveal the IP address of, or trace, a TCP stream. In addition, because of the linkability of Tor streams sent together over a single circuit, tracing one stream sent over a circuit traces them all. Surprisingly, it is unknown whether this linkability allows in practice to trace a significant number of streams originating from secure (i.e., proxied) applications. In this paper, we show that linkability allows us to trace 193\% of additional streams, including 27\% of HTTP streams possibly originating from {\textquoteleft}{\textquoteleft}secure{\textquoteright}{\textquoteright} browsers. In particular, we traced 9\% of Tor streams carried by our instrumented exit nodes. Using BitTorrent as the insecure application, we design two attacks tracing BitTorrent users on Tor. We run these attacks in the wild for 23 days and reveal 10,000 IP addresses of Tor users. Using these IP addresses, we then profile not only the BitTorrent downloads but also the websites visited per country of origin of Tor users. We show that BitTorrent users on Tor are over-represented in some countries as compared to BitTorrent users outside of Tor. By analyzing the type of content downloaded, we then explain the observed behaviors by the higher concentration of pornographic content downloaded at the scale of a country. Finally, we present results suggesting the existence of an underground BitTorrent ecosystem on Tor},
 	keywords = {anonymity, Tor},
-	url = {http://hal.inria.fr/inria-00574178/PDF/btor.pdf},
+	www_section = {http://hal.inria.fr/inria-00574178/PDF/btor.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/btor.pdf},
 	author = {Le Blond, Stevens and Manils, Pere and Abdelberi, Chaabane and Kaafar, Mohamed Ali and Claude Castelluccia and Legout, Arnaud and Dabbous, Walid}
 }
@@ -1519,7 +1542,7 @@ We call our extension PEREA-Naughtiness. We prove the security of our constructi
 	keywords = {anonymous authentication, anonymous blacklisting, privacy, privacy-enhanced revocation, user misbehavior},
 	issn = {1094-9224},
 	doi = {http://doi.acm.org/10.1145/2043628.2043630},
-	url = {http://doi.acm.org/10.1145/2043628.2043630},
+	www_section = {http://doi.acm.org/10.1145/2043628.2043630},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/TISSEC\%20-\%20PEREA.pdf},
 	author = {Man Ho Au and Patrick P. Tsang and Apu Kapadia}
 }
@@ -1531,7 +1554,7 @@ We call our extension PEREA-Naughtiness. We prove the security of our constructi
 	month = {September},
 	chapter = {68},
 	keywords = {Gauger, GNUnet},
-	url = {http://www.linuxjournaldigital.com/linuxjournal/201109$\#$pg68},
+	www_section = {http://www.linuxjournaldigital.com/linuxjournal/201109$\#$pg68},
 	author = {Polot, Bartlomiej and Christian Grothoff}
 }
 @conference {usenix11-pirtor,
@@ -1560,7 +1583,7 @@ well understood and relatively easy to analyze, as opposed to peer-to-peer desig
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PASSAT\%2711\%20-\%20Multiparty\%20linear\%20programming.pdf},
 	author = {Dreier, Jannik and Florian Kerschbaum}
 }
-@mastersthesis {2011,
+@mastersthesis {2011_8,
 	title = {Privacy-Implications of Performance-Based Peer Selection by Onion-Routers: A Real-World Case Study using I2P},
 	volume = {M.S},
 	year = {2011},
@@ -1616,7 +1639,7 @@ This paper provides the necessary background on I2P, gives details on the attack
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pet2011i2p.pdf},
 	author = {Michael Herrmann and Christian Grothoff}
 }
-@book {2011,
+@book {2011_9,
 	title = {Private Similarity Computation in Distributed Systems: From Cryptography to Differential Privacy},
 	booktitle = {Principles of Distributed Systems},
 	series = {Lecture Notes in Computer Science},
@@ -1632,7 +1655,7 @@ private mechanism, will only gain a negligible advantage (up to a privacy parame
 	keywords = {Differential Privacy, homomorphic encryption, privacy, similarity measure},
 	isbn = {978-3-642-25872-5},
 	doi = {10.1007/978-3-642-25873-2_25},
-	url = {http://dx.doi.org/10.1007/978-3-642-25873-2_25},
+	www_section = {http://dx.doi.org/10.1007/978-3-642-25873-2_25},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PrivateSimilarity2011Alaggan.pdf},
 	author = {Alaggan, Mohammad and Gambs, S{\'e}bastien and Kermarrec, Anne-Marie},
 	editor = {Fern{\`a}ndez Anta, Antonio and Lipari, Giuseppe and Roy, Matthieu}
@@ -1654,7 +1677,7 @@ private mechanism, will only gain a negligible advantage (up to a privacy parame
 	pages = {60{\textendash}75},
 	author = {Florian Kerschbaum}
 }
-@conference {2011,
+@conference {2011_10,
 	title = {R5N : Randomized Recursive Routing for Restricted-Route Networks},
 	booktitle = {5th International Conference on Network and System Security (NSS 2011)},
 	year = {2011},
@@ -1668,7 +1691,7 @@ decentralized P2P networks operating in a restricted-route environment with mali
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/nss2011.pdf},
 	author = {Nathan S Evans and Christian Grothoff}
 }
-@conference {2011,
+@conference {2011_11,
 	title = {On the Relation Between Differential Privacy and Quantitative Information Flow},
 	booktitle = {Proceedings of the 38th International Conference on Automata, Languages and Programming - Volume Part II},
 	year = {2011},
@@ -1680,7 +1703,7 @@ decentralized P2P networks operating in a restricted-route environment with mali
 In this paper, we analyze critically the notion of differential privacy in light of the conceptual framework provided by the R ́enyi min information theory. We show that there is a close relation between differential
 privacy and leakage, due to the graph symmetries induced by the adjacency relation. Furthermore, we consider the utility of the randomized answer, which measures its expected degree of accuracy. We focus on certain kinds of utility functions called {\textquotedblleft}binary{\textquotedblright}, which have a close correspondence with the R ́enyi min mutual information. Again, it turns out that there can be a tight correspondence between differential privacy and utility, depending on the symmetries induced by the adjacency relation and by the query. Depending on these symmetries we can also build an optimal-utility randomization mechanism while preserving the required level of differential privacy. Our main contribution is a study of the kind of structures that can be induced by the adjacency relation and the query, and how to use them to derive bounds on the leakage and achieve the optimal utility},
 	isbn = {978-3-642-22011-1},
-	url = {http://dl.acm.org/citation.cfm?id=2027223.2027228},
+	www_section = {http://dl.acm.org/citation.cfm?id=2027223.2027228},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DifferentialPrivacy2011Alvim.pdf},
 	author = {Alvim, M{\'a}rio S. and Andr{\'e}s, Miguel E.}
 }
@@ -1693,11 +1716,11 @@ privacy and leakage, due to the graph symmetries induced by the adjacency relati
 	abstract = {For over two decades, timing attacks have been an active area of research within applied cryptography. These attacks exploit cryptosystem or protocol implementations that do not run in constant time. When implementing an elliptic curve cryptosystem with a goal to provide side-channel resistance, the scalar multiplication routine is a critical component. In such instances, one attractive method often suggested in the literature is Montgomery{\textquoteright}s ladder that performs a fixed sequence of curve and field operations. This paper describes a timing attack vulnerability in OpenSSL{\textquoteright}s ladder implementation for curves over binary fields. We use this vulnerability to steal the private key of a TLS server where the server authenticates with ECDSA signatures. Using the timing of the exchanged messages, the messages themselves, and the signatures, we mount a lattice attack that recovers the private key. Finally, we describe and implement an effective countermeasure},
 	keywords = {elliptic curve cryptography, lattice attacks, public-key cryptography, side-channel attacks, timing attacks},
 	issn = {2011/232},
-	url = {http://eprint.iacr.org/2011/232},
+	www_section = {http://eprint.iacr.org/2011/232},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Brumley\%20\%26\%20Tuveri\%20-\%20Timing\%20Attacks.pdf},
 	author = {Billy Bob Brumley and Nicola Tuveri}
 }
-@conference {2011,
+@conference {2011_12,
 	title = {Scalability \& Paranoia in a Decentralized Social Network},
 	booktitle = {Federated Social Web},
 	year = {2011},
@@ -1705,7 +1728,7 @@ privacy and leakage, due to the graph symmetries induced by the adjacency relati
 	address = {Berlin, Germany},
 	abstract = {There{\textquoteright}s a lot of buzz out there about "replacing" Facebook with a privacy-enhanced, decentralized, ideally open source something. In this talk we{\textquoteright}ll focus on how much privacy we should plan for (specifically about how we cannot entrust our privacy to modern virtual machine technology) and the often underestimated problem of getting such a monster network to function properly. These issues can be considered together or separately: Even if you{\textquoteright}re not as concerned about privacy as we are, the scalability problem still persists },
 	keywords = {GNUnet, privacy, social networks},
-	url = {http://secushare.org/2011-FSW-Scalability-Paranoia},
+	www_section = {http://secushare.org/2011-FSW-Scalability-Paranoia},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/2011-FSW-Scalability-Paranoia.pdf},
 	author = {Carlo v. Loesch and Gabor X Toth and Mathias Baumann}
 }
@@ -1723,11 +1746,11 @@ privacy and leakage, due to the graph symmetries induced by the adjacency relati
 	keywords = {auction mechanisms, auctions, economy, egalitarism, schedule coordination},
 	issn = {0924-669X},
 	doi = {10.1007/s10489-009-0178-7},
-	url = {http://dx.doi.org/10.1007/s10489-009-0178-7},
+	www_section = {http://dx.doi.org/10.1007/s10489-009-0178-7},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Applied\%20Intelligence\%20-\%20Combinatorial\%20Auctions.pdf},
 	author = {Murillo, Javier and Mu{\~n}oz, V{\'\i}ctor and Busquets, D{\'\i}dac and L{\'o}pez, Beatriz}
 }
-@article {2011,
+@article {2011_13,
 	title = {Secure collaborative supply chain planning and inverse optimization - The JELS model},
 	journal = {European Journal of Operations Research},
 	volume = {208},
@@ -1737,7 +1760,7 @@ privacy and leakage, due to the graph symmetries induced by the adjacency relati
 	abstract = {It is a well-acknowledged fact that collaboration between different members of a supplychain yields a significant potential to increase overall supplychain performance. Sharing private information has been identified as prerequisite for collaboration and, at the same time, as one of its major obstacles. One potential avenue for overcoming this obstacle is Secure Multi-Party Computation (SMC). SMC is a cryptographic technique that enables the computation of any (well-defined) mathematical function by a number of parties without any party having to disclose its input to another party. In this paper, we show how SMC can be successfully employed to enable joint decision-making and benefit sharing in a simple supplychain setting. We develop secure protocols for implementing the well-known {\textquotedblleft}Joint Economic Lot Size (JELS) Model{\textquotedblright} with benefit sharing in such a way that none of the parties involved has to disclose any private (cost and capacity) data. Thereupon, we show that although computation of the model{\textquoteright}s outputs can be performed securely, the approach still faces practical limitations. These limitations are caused by the potential of {\textquotedblleft}inverseoptimization{\textquotedblright}, i.e., a party can infer another party{\textquoteright}s private data from the output of a collaborativeplanning scheme even if the computation is performed in a secure fashion. We provide a detailed analysis of {\textquotedblleft}inverseoptimization{\textquotedblright} potentials and introduce the notion of {\textquotedblleft}stochastic security{\textquotedblright}, a novel approach to assess the additional information a party may learn from joint computation and benefit sharing. Based on our definition of {\textquotedblleft}stochastic security{\textquotedblright} we propose a stochastic benefit sharing rule, develop a secure protocol for this benefit sharing rule, and assess under which conditions stochastic benefit sharing can guarantee secure collaboration},
 	keywords = {collaboration, information sharing, secure multi-party computation, SMC, supplychain management},
 	doi = {http://dx.doi.org/10.1016/j.ejor.2010.08.018},
-	url = {http://www.sciencedirect.com/science/article/pii/S0377221710005552},
+	www_section = {http://www.sciencedirect.com/science/article/pii/S0377221710005552},
 	author = {Richard Pibernik and Yingying Zhang and Florian Kerschbaum and Axel Schr{\"o}pfer}
 }
 @conference {conf/ndss/BackesMP11,
@@ -1752,7 +1775,7 @@ privacy and leakage, due to the graph symmetries induced by the adjacency relati
 includes methods for establishing social relations and for sharing resources. The cryptographic protocols implementing these methods use pseudonyms to hide user identities, signatures on these pseudonyms to establish social relations, and zero-knowledge proofs of knowledge of such signatures to demonstrate the existence of social relations without sacrificing user anonymity. As we do not put any constraints on the underlying social network, our framework is generally applicable and, in particular, constitutes an ideal plug-in for decentralized social networks.
 We analyzed the security of our protocols by developing formal definitions of the aforementioned security properties and by verifying them using ProVerif, an automated theorem prover for cryptographic protocols. Finally, we built a prototypical implementation and conducted an experimental evaluation to demonstrate the efficiency and the scalability of our framework},
 	keywords = {API, online-social-networks, security},
-	url = {http://www.lbs.cs.uni-saarland.de/publications/sapi.pdf },
+	www_section = {http://www.lbs.cs.uni-saarland.de/publications/sapi.pdf },
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NDSS\%2711\%20-\%20Security\%20API\%20for\%20Distributed\%20Social\%20Networks.pdf},
 	author = {Michael Backes and Maffei, Matteo and Pecina, Kim}
 }
@@ -1762,7 +1785,7 @@ We analyzed the security of our protocols by developing formal definitions of th
 	pages = {199{\textendash}208},
 	author = {Arpita Ghosh and Aaron Roth}
 }
-@book {2011,
+@book {2011_14,
 	title = {Social Market: Combining Explicit and Implicit Social Networks},
 	booktitle = {Stabilization, Safety, and Security of Distributed Systems},
 	series = {Lecture Notes in Computer Science},
@@ -1775,7 +1798,7 @@ We analyzed the security of our protocols by developing formal definitions of th
 In this paper, we embrace the social aspects of the Web 2.0 by considering a novel problem. We build a distributed social market that combines interest-based social networks with explicit networks like Facebook. Our Social Market (SM) allows users to identify and build connections to other users that can provide interesting goods, or information. At the same time, it backs up these connections with trust, by associating them with paths of trusted users that connect new acquaintances through the explicit network. This convergence of implicit and explicit networks yields TAPS, a novel gossip protocol that can be applied in applications devoted to commercial transactions, or to add robustness to standard gossip applications like dissemination or recommendation systems},
 	isbn = {978-3-642-24549-7},
 	doi = {10.1007/978-3-642-24550-3_16},
-	url = {http://dx.doi.org/10.1007/978-3-642-24550-3_16},
+	www_section = {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},
 	author = {Frey, Davide and J{\'e}gou, Arnaud and Kermarrec, Anne-Marie},
 	editor = {D{\'e}fago, Xavier and Petit, Franck and Villain, Vincent}
@@ -1796,7 +1819,7 @@ than 1.5\% in under 5 minutes. Our attacks are also more accurate and require fe
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CCS\%2711\%20-\%20Throughput-fingerprinting.pdf},
 	author = {Prateek Mittal and Ahmed Khurshid and Joshua Juen and Matthew Caesar and Borisov, Nikita}
 }
-@conference {2011,
+@conference {2011_15,
 	title = {SWIRL: A Scalable Watermark to Detect Correlated Network Flows},
 	booktitle = {NDSS{\textquoteright}11 - Proceedings of the Network and Distributed Security Symposium},
 	year = {2011},
@@ -1848,7 +1871,7 @@ station but not to a censor. In addition, we use our tagging scheme to build a p
 	keywords = {online social networks, sybil, sybil accountsm},
 	isbn = {978-1-4503-1013-0},
 	doi = {10.1145/2068816.2068841},
-	url = {http://doi.acm.org/10.1145/2068816.2068841},
+	www_section = {http://doi.acm.org/10.1145/2068816.2068841},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%2711\%20-\%20Uncovering\%20social\%20network\%20sybils.pdf},
 	author = {Yang, Zhi and Wilson, Christo and Wang, Xiao and Gao, Tingting and Ben Y. Zhao and Dai, Yafei}
 }
@@ -1880,7 +1903,7 @@ JAP, the detection rate decreases from 80\% to 4\% and for Tor it drops from 55\
 	keywords = {difference digest, GNUnet, invertible bloom filter, set difference},
 	isbn = {978-1-4503-0797-0},
 	doi = {10.1145/2018436.2018462},
-	url = {http://doi.acm.org/10.1145/2018436.2018462},
+	www_section = {http://doi.acm.org/10.1145/2018436.2018462},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EppGooUye-SIGCOMM-11.pdf},
 	author = {Eppstein, David and Goodrich, Michael T. and Uyeda, Frank and Varghese, George}
 }
@@ -1892,11 +1915,11 @@ JAP, the detection rate decreases from 80\% to 4\% and for Tor it drops from 55\
 	month = sep,
 	abstract = {Distributed hash tables suffer from several security and privacy vulnerabilities, including the problem of Sybil attacks. Existing social network-based solutions to mitigate the Sybil attacks in DHT routing have a high state requirement and do not provide an adequate level of privacy. For instance, such techniques require a user to reveal their social network contacts. We design X-Vine, a protection mechanism for distributed hash tables that operates entirely by communicating over social network links. As with traditional peer-to-peer systems, X-Vine provides robustness, scalability, and a platform for innovation. The use of social network links for communication helps protect participant privacy and adds a new dimension of trust absent from previous designs. X-Vine is resilient to denial of service via Sybil attacks, and in fact is the first Sybil defense that requires only a logarithmic amount of state per node, making it suitable for large-scale and dynamic settings. X-Vine also helps protect the privacy of users social network contacts and keeps their IP addresses hidden from those outside of their social circle, providing a basis for pseudonymous communication. We first evaluate our design with analysis and simulations, using several real world large-scale social networking topologies. We show that the constraints of X-Vine allow the insertion of only a logarithmic number of Sybil identities per attack edge; we show this mitigates the impact of malicious attacks while not affecting the performance of honest nodes. Moreover, our algorithms are efficient, maintain low stretch, and avoid hot spots in the network. We validate our design with a PlanetLab implementation and a Facebook plugin},
 	keywords = {anonymity, cryptography, dblp, distributed hash table, for:isp, routing, security, social-network-routing},
-	url = {http://dblp.uni-trier.de/db/journals/corr/corr1109.html$\#$abs-1109-0971},
+	www_section = {http://dblp.uni-trier.de/db/journals/corr/corr1109.html$\#$abs-1109-0971},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CoRR\%20-\%20X-Vine.pdf},
 	author = {Prateek Mittal and Matthew Caesar and Borisov, Nikita}
 }
-@conference {2011,
+@conference {2011_16,
 	title = {"You Might Also Like:" Privacy Risks of Collaborative Filtering},
 	booktitle = {Security and Privacy (SP), 2011 IEEE Symposium on},
 	year = {2011},
@@ -1919,7 +1942,7 @@ In this paper, we develop algorithms which take a moderate amount of auxiliary i
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Polot2010.pdf},
 	author = {Polot, Bartlomiej}
 }
-@conference {2010,
+@conference {2010_0,
 	title = {Application of Random Walks to Decentralized Recommender Systems},
 	booktitle = {14th International Conference on Principles of Distributed Systems},
 	year = {2010},
@@ -1928,7 +1951,7 @@ In this paper, we develop algorithms which take a moderate amount of auxiliary i
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/opodis10_HAL.pdf},
 	author = {Anne-Marie Kermarrec and Vincent Leroy and Afshin Moin and Christopher Thraves}
 }
-@article {2010,
+@article {2010_1,
 	title = {The Ariba Framework for Application Development using Service Overlays},
 	journal = {Praxis der Informationsverarbeitung und Kommunikation},
 	volume = {33},
@@ -1938,10 +1961,10 @@ In this paper, we develop algorithms which take a moderate amount of auxiliary i
 	keywords = {overlay networks},
 	issn = {1865-8342},
 	doi = {10.1515/piko.2010.003},
-	url = {http://www.reference-global.com/doi/abs/10.1515/piko.2010.003},
+	www_section = {http://www.reference-global.com/doi/abs/10.1515/piko.2010.003},
 	author = {H{\"u}bsch, Christian and Mayer, Christoph P. and Oliver Waldhorst}
 }
-@conference {2010,
+@conference {2010_2,
 	title = {Autonomous NAT Traversal},
 	booktitle = {10th IEEE International Conference on Peer-to-Peer Computing (IEEE P2P{\textquoteright}10)},
 	year = {2010},
@@ -1951,7 +1974,7 @@ In this paper, we develop algorithms which take a moderate amount of auxiliary i
 	abstract = {Traditional NAT traversal methods require the help of a third party for signalling.  This paper investigates a new autonomous
 method for establishing connections to peers behind NAT.  The proposed method for Autonomous NAT traversal uses fake ICMP messages to initially contact the NATed peer.  This paper presents how the method is supposed to work in theory, discusses some possible variations, introduces various concrete implementations of the proposed approach and evaluates empirical results of a measurement study designed to evaluate the efficacy of the idea in practice},
 	keywords = {GNUnet, ICMP, NAT, P2P},
-	url = {http://grothoff.org/christian/pwnat.pdf},
+	www_section = {http://grothoff.org/christian/pwnat.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pwnat.pdf},
 	author = {Andreas  M{\"u}ller and Nathan S Evans and Christian Grothoff and Samy Kamkar}
 }
@@ -1967,7 +1990,7 @@ method for establishing connections to peers behind NAT.  The proposed method fo
 	keywords = {agent cooperation, BnB-ADOPT, DCOP, distributed constraint optimization, distributed problem solving},
 	issn = {1076-9757},
 	doi = {10.1613/jair.2849},
-	url = {http://www.jair.org/papers/paper2849.html},
+	www_section = {http://www.jair.org/papers/paper2849.html},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Journal\%20of\%20AI\%20-\%20BnB-ADOPT.pdf},
 	author = {Yeoh, William and Felner, Ariel and Koenig, Sven}
 }
@@ -1994,7 +2017,7 @@ method for establishing connections to peers behind NAT.  The proposed method fo
 	keywords = {QoS},
 	isbn = {978-1-60558-927-5},
 	doi = {10.1145/1827418.1827424},
-	url = {http://portal.acm.org/citation.cfm?id=1827424\&dl=GUIDE\&coll=portal\&CFID=97675623\&CFTOKEN=70931453$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1827424\&dl=GUIDE\&coll=portal\&CFID=97675623\&CFTOKEN=70931453$\#$},
 	author = {Gerald G. Koch and Boris Koldehofe and Kurt Rothermel}
 }
 @booklet {cryptoeprint:2010:264,
@@ -2007,11 +2030,11 @@ Beyond the theoretical interest in modeling KDFs, this work is intended to addre
 
 (The HMAC-based scheme presented here, named HKDF, is being standardized by the IETF.)},
 	keywords = {GNUnet, HKDF, HMAC, key derivation},
-	url = {http://eprint.iacr.org/2010/264},
+	www_section = {http://eprint.iacr.org/2010/264},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/264.pdf},
 	author = {Hugo Krawczyk}
 }
-@mastersthesis {2010,
+@mastersthesis {2010_3,
 	title = {Developing Peer-to-Peer Web Applications},
 	volume = {M.S},
 	year = {2010},
@@ -2058,14 +2081,14 @@ To evaluate the platform{\textquoteright}s suitability for application developme
 	pages = {715{\textendash}724},
 	author = {Dwork, Cynthia and Naor, Moni and Pitassi, Toniann and Rothblum, Guy N.}
 }
-@article {2010,
+@article {2010_4,
 	title = {On the Difficulties of Disclosure Prevention in Statistical Databases or The Case for Differential Privacy},
 	journal = {Journal of Privacy and Confidentiality},
 	volume = {2},
 	year = {2010},
 	pages = {93-107},
 	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_section = {http://research.microsoft.com/apps/pubs/default.aspx?id=135704},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DisclousrePrevention2010Dwork.pdf},
 	author = {Cynthia Dwork and Moni Naor}
 }
@@ -2078,7 +2101,7 @@ To evaluate the platform{\textquoteright}s suitability for application developme
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DistributingSocialApp2010Leroy.pdf},
 	author = {Vincent Leroy}
 }
-@book {2010,
+@book {2010_5,
 	title = {Drac: An Architecture for Anonymous Low-Volume Communications},
 	booktitle = {Privacy Enhancing Technologies},
 	series = {Lecture Notes in Computer Science},
@@ -2090,12 +2113,12 @@ To evaluate the platform{\textquoteright}s suitability for application developme
 	keywords = {anonymous communication, anonymous IM, anonymous voice, Drac, F2F},
 	isbn = {978-3-642-14526-1},
 	doi = {10.1007/978-3-642-14527-8_12},
-	url = {http://dx.doi.org/10.1007/978-3-642-14527-8_12},
+	www_section = {http://dx.doi.org/10.1007/978-3-642-14527-8_12},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/drac-pet2010.pdf},
 	author = {Danezis, George and Claudia Diaz and Troncoso, Carmela and Laurie, Ben},
 	editor = {Atallah, MikhailJ. and Hopper, NicholasJ.}
 }
-@conference {2010,
+@conference {2010_6,
 	title = {Efficient DHT attack mitigation through peers{\textquoteright} ID distribution },
 	booktitle = {HOTP2P{\textquoteright}10 - International Workshop on Hot Topics in Peer-to-Peer Systems},
 	year = {2010},
@@ -2121,7 +2144,7 @@ method detects the most efficient attacks with a very small false-negative rate,
 	keywords = {content-based publish/subscribe, distributed complex event processing, multi-player online game},
 	isbn = {978-1-60558-927-5},
 	doi = {http://doi.acm.org/10.1145/1827418.1827440},
-	url = {http://doi.acm.org/10.1145/1827418.1827440},
+	www_section = {http://doi.acm.org/10.1145/1827418.1827440},
 	author = {Gerald G. Koch and Tariq, Muhammad Adnan and Boris Koldehofe and Kurt Rothermel}
 }
 @conference {DBLP:conf/middleware/BertierFGKL10,
@@ -2149,7 +2172,7 @@ method detects the most efficient attacks with a very small false-negative rate,
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Duminuco\%20\%26\%20Biersack\%20-\%20Hierarchical\%20Codes.pdf},
 	author = {Alessandro Duminuco and E W Biersack}
 }
-@conference {2010,
+@conference {2010_7,
 	title = {How Accurately Can One{\textquoteright}s Interests Be Inferred from Friends?},
 	booktitle = {Proceedings of the 19th International Conference on World Wide Web},
 	year = {2010},
@@ -2163,7 +2186,7 @@ outperforms methods that use only one type of social content. Second, we present
 	keywords = {accuracy, social networks, user modeling},
 	isbn = {978-1-60558-799-8},
 	doi = {10.1145/1772690.1772875},
-	url = {http://doi.acm.org/10.1145/1772690.1772875},
+	www_section = {http://doi.acm.org/10.1145/1772690.1772875},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/InterestsInference2010Wen.pdf},
 	author = {Wen, Zhen and Lin, Ching-Yung}
 }
@@ -2177,7 +2200,7 @@ outperforms methods that use only one type of social content. Second, we present
 	keywords = {anonymity, latency, Tor},
 	isbn = {978-1-59593-703-2},
 	doi = {10.1145/1315245.1315257},
-	url = {http://portal.acm.org/citation.cfm?id=1315245.1315257},
+	www_section = {http://portal.acm.org/citation.cfm?id=1315245.1315257},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tissec-latency-leak.pdf},
 	author = {Nicholas J. Hopper and Eugene Y. Vasserman and Eric Chan-Tin}
 }
@@ -2190,7 +2213,7 @@ outperforms methods that use only one type of social content. Second, we present
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/AutoNetkit_0.pdf},
 	author = {Hung X. Nguyen and Roughan, Matthew and Knight, Simon and Nick Falkner and Maennel, Olaf and Randy Bush}
 }
-@mastersthesis {2010,
+@mastersthesis {2010_8,
 	title = {Incentive-driven QoS in peer-to-peer overlays},
 	volume = {PhD},
 	year = {2010},
@@ -2200,17 +2223,17 @@ outperforms methods that use only one type of social content. Second, we present
 	address = {London},
 	abstract = {A well known problem in peer-to-peer overlays is that no single entity has control over the software, hardware and configuration of peers. Thus, each peer can selfishly adapt its behaviour to maximise its benefit from the overlay. This thesis is concerned with the modelling and design of incentive mechanisms for QoS-overlays: resource allocation protocols that provide strategic peers with participation incentives, while at the same time optimising the performance of the peer-to-peer distribution overlay. The contributions of this thesis are as follows. First, we present PledgeRoute, a novel contribution accounting system that can be used, along with a set of reciprocity policies, as an incentive mechanism to encourage peers to contribute resources even when users are not actively consuming overlay services. This mechanism uses a decentralised credit network, is resilient to sybil attacks, and allows peers to achieve time and space deferred contribution reciprocity. Then, we present a novel, QoS-aware resource allocation model based on Vickrey auctions that uses PledgeRoute as a substrate. It acts as an incentive mechanism by providing efficient overlay construction, while at the same time allocating increasing service quality to those peers that contribute more to the network. The model is then applied to lagsensitive chunk swarming, and some of its properties are explored for different peer delay distributions. When considering QoS overlays deployed over the best-effort Internet, the quality received by a client cannot be adjudicated completely to either its serving peer or the intervening network between them. By drawing parallels between this situation and well-known hidden action situations in microeconomics, we propose a novel scheme to ensure adherence to advertised QoS levels. We then apply it to delay-sensitive chunk distribution overlays and present the optimal contract payments required, along with a method for QoS contract enforcement through reciprocative strategies. We also present a probabilistic model for application-layer delay as a function of the prevailing network conditions. Finally, we address the incentives of managed overlays, and the prediction of their behaviour. We propose two novel models of multihoming managed overlay incentives in which overlays can freely allocate their traffic flows between different ISPs. One is obtained by optimising an overlay utility function with desired properties, while the other is designed for data-driven least-squares fitting of the cross elasticity of demand. This last model is then used to solve for ISP profit maximisation},
 	keywords = {BitTorrent, Freeloading, game theory, incentives, PeerLive, prices, QoS},
-	url = {http://eprints.ucl.ac.uk/19490/},
+	www_section = {http://eprints.ucl.ac.uk/19490/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/19490.pdf},
 	author = {Raul Leonardo Landa Gamiochipi}
 }
-@article {2010,
+@article {2010_9,
 	title = {Malugo: A peer-to-peer storage system},
 	year = {2010},
 	abstract = {We consider the problem of routing locality in peer-to-peer storage systems where peers store and exchange data among themselves. With the global information, peers will take the data locality into consideration when they implement their replication mechanisms to keep a number of file replicas all over the systems. In this paper, we mainly propose a peer-to-peer storage system - Malugo. Algorithms for the implementation of the peers{\textquoteright} locating and file operation processes are also presented. Simulation results show that the proposed system successfully constructs an efficient and stable peer-to-peer storage environment with considerations of data and routing locality among peers},
 	keywords = {distributed storage, Malugo, peer-to-peer storage},
 	doi = {10.1504/IJAHUC.2010.032995},
-	url = {http://www.ingentaconnect.com/content/ind/ijahuc/2010/00000005/00000004/art00002;jsessionid=kcpun0o76hoe.alexandra},
+	www_section = {http://www.ingentaconnect.com/content/ind/ijahuc/2010/00000005/00000004/art00002;jsessionid=kcpun0o76hoe.alexandra},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Malugo.pdf},
 	author = {Chan, Yu-Wei and Ho, Tsung-Hsuan and Shih, Po-Chi and Chung, Yeh-Ching}
 }
@@ -2246,7 +2269,7 @@ outperforms methods that use only one type of social content. Second, we present
 	keywords = {distributed hash table, KAD},
 	isbn = {3-642-11321-4, 978-3-642-11321-5},
 	doi = {http://dx.doi.org/10.1007/978-3-642-11322-2_22},
-	url = {http://dl.acm.org/citation.cfm?id=2018057.2018085},
+	www_section = {http://dl.acm.org/citation.cfm?id=2018057.2018085},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ICDCN\%2710\%20-\%20Poisoning\%20the\%20Kad\%20Network.pdf},
 	author = {Thomas Locher and Mysicka, David and Stefan Schmid and Roger Wattenhofer}
 }
@@ -2272,7 +2295,7 @@ outperforms methods that use only one type of social content. Second, we present
 	keywords = {anonymity, OneSwarm, p2p network},
 	issn = {0146-4833},
 	doi = {10.1145/1851275.1851198},
-	url = {http://doi.acm.org/10.1145/1851275.1851198},
+	www_section = {http://doi.acm.org/10.1145/1851275.1851198},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/oneswarm_SIGCOMM.pdf},
 	author = {Isdal, Tomas and Piatek, Michael and Krishnamurthy, Arvind and Anderson, Thomas}
 }
@@ -2292,7 +2315,7 @@ outperforms methods that use only one type of social content. Second, we present
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/privacy_preserving_similarity.pdf},
 	author = {Pang, Hweehwa and Shen, Jialie and Krishnan, Ramayya}
 }
-@conference {2010,
+@conference {2010_10,
 	title = {Private Record Matching Using Differential Privacy},
 	booktitle = {Proceedings of the 13th International Conference on Extending Database Technology},
 	year = {2010},
@@ -2303,7 +2326,7 @@ outperforms methods that use only one type of social content. Second, we present
 	keywords = {Differential Privacy, privacy, record matching, security},
 	isbn = {978-1-60558-945-9},
 	doi = {10.1145/1739041.1739059},
-	url = {http://doi.acm.org/10.1145/1739041.1739059},
+	www_section = {http://doi.acm.org/10.1145/1739041.1739059},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PrivateRecordMatching2010Inan.pdf},
 	author = {Inan, Ali and Kantarcioglu, Murat and Ghinita, Gabriel and Bertino, Elisa}
 }
@@ -2319,7 +2342,7 @@ outperforms methods that use only one type of social content. Second, we present
 	keywords = {P2P, publish/subscribe},
 	isbn = {978-1-60558-927-5},
 	doi = {10.1145/1827418.1827425},
-	url = {http://portal.acm.org/citation.cfm?id=1827418.1827425\&coll=portal\&dl=GUIDE$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1827418.1827425\&coll=portal\&dl=GUIDE$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DIP_2872.pdf},
 	author = {Tariq, Muhammad Adnan and Boris Koldehofe and Altaweel, Ala and Kurt Rothermel}
 }
@@ -2336,11 +2359,11 @@ outperforms methods that use only one type of social content. Second, we present
 	keywords = {heterogeneity, overlay networks, P2P},
 	issn = {0146-4833},
 	doi = {10.1145/1672308.1672334},
-	url = {http://portal.acm.org/citation.cfm?doid=1672308.1672334$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?doid=1672308.1672334$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p131-v40n1n-huebschA.pdf},
 	author = {H{\"u}bsch, Christian and Mayer, Christoph P. and Sebastian Mies and Roland Bless and Oliver Waldhorst and Martina Zitterbart}
 }
-@conference {2010,
+@conference {2010_11,
 	title = {On Runtime Adaptation of Application-Layer Multicast Protocol Parameters},
 	booktitle = {Proceedings of Networked Services and Applications {\textendash} Engineering, Control and Management (EUNICE)},
 	series = {Lecture Notes in Computer Science},
@@ -2349,10 +2372,10 @@ outperforms methods that use only one type of social content. Second, we present
 	publisher = {Springer},
 	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 = {http://www.tm.uni-karlsruhe.de/itm/WebMan/view.php?view=publikationen_detail\&id=389\&lang=en},
 	author = {H{\"u}bsch, Christian and Mayer, Christoph P. and Oliver Waldhorst}
 }
-@conference {2010,
+@conference {2010_12,
 	title = {Scalable Application-Layer Multicast Simulations with OverSim},
 	booktitle = {7th Annual IEEE Consumer Communiations \& Networking Conference},
 	year = {2010},
@@ -2373,7 +2396,7 @@ outperforms methods that use only one type of social content. Second, we present
 	abstract = {Secure multiparty computation (MPC) allows joint privacy-preserving computations on data of multiple parties. Although MPC has been studied substantially, building solutions that are practical in terms of computation and communication cost is still a major challenge. In this paper, we investigate the practical usefulness of MPC for multi-domain network security and monitoring. We first optimize MPC comparison operations for processing high volume data in near real-time. We then design privacy-preserving protocols for event correlation and aggregation of network traffic statistics, such as addition of volume metrics, computation of feature entropy, and distinct item count. Optimizing performance of parallel invocations, we implement our protocols along with a complete set of basic operations in a library called SEPIA. We evaluate the running time and bandwidth requirements of our protocols in realistic settings on a local cluster as well as on PlanetLab and show that they work in near real-time for up to 140 input providers and 9 computation nodes. Compared to implementations using existing general-purpose MPC frameworks, our protocols are significantly faster, requiring, for example, 3 minutes for a task that takes 2 days with general-purpose frameworks. This improvement paves the way for new applications of MPC in the area of networking. Finally, we run SEPIA{\textquoteright}s protocols on real traffic traces of 17 networks and show how they provide new possibilities for distributed troubleshooting and early anomaly detection},
 	keywords = {privacy, secure multi-party computation, SMC},
 	isbn = {888-7-6666-5555-4},
-	url = {http://dl.acm.org/citation.cfm?id=1929820.1929840},
+	www_section = {http://dl.acm.org/citation.cfm?id=1929820.1929840},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/USENIX\%20Security\%2710\%20-\%20SEPIA.pdf},
 	author = {Burkhart, Martin and Strasser, Mario and Many, Dilip and Dimitropoulos, Xenofontas}
 }
@@ -2383,7 +2406,7 @@ outperforms methods that use only one type of social content. Second, we present
 	year = {2010},
 	author = {Daniel Marks and Florian Tschorsch and Bjoern Scheuermann}
 }
-@conference {2010,
+@conference {2010_13,
 	title = {User-perceived Performance of the NICE Application Layer Multicast Protocol in Large and Highly Dynamic Groups},
 	booktitle = {Proceedings of 15th International GI/ITG Conference on "Measurement, Modelling and Evaluation of Computing Systems"},
 	year = {2010},
@@ -2397,11 +2420,11 @@ outperforms methods that use only one type of social content. Second, we present
 This work was partially funded as part of the Spontaneous Virtual Networks (SpoVNet) project by the Landesstiftung Baden-W{\"u}rttemberg within the BW-FIT program and as part of the Young Investigator Group Controlling Heterogeneous and Dynamic Mobile Grid and Peer-to-Peer Systems (CoMoGriP) by the Concept for the Future of Karlsruhe Institute of Technology (KIT) within the framework of the German Excellence Initiative},
 	isbn = {978-3-642-12103-6},
 	doi = {10.1007/978-3-642-12104-3},
-	url = {http://www.springerlink.com/content/t6k421560103540n/},
+	www_section = {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},
 	author = {H{\"u}bsch, Christian and Mayer, Christoph P. and Oliver Waldhorst}
 }
-@conference {2010,
+@conference {2010_14,
 	title = {Using Legacy Applications in Future Heterogeneous Networks with ariba},
 	booktitle = {Proceedings of IEEE INFOCOM},
 	year = {2010},
@@ -2422,7 +2445,7 @@ Five years ago a previous study examined the AS-level threat against client and 
 	keywords = {anonymity, autonomous systems, privacy, Tor},
 	isbn = {978-1-60558-894-0},
 	doi = {10.1145/1653662.1653708},
-	url = {http://portal.acm.org/citation.cfm?id=1653662.1653708},
+	www_section = {http://portal.acm.org/citation.cfm?id=1653662.1653708},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EdmanS09.pdf},
 	author = {Matthew Edman and Paul Syverson},
 	editor = {Ehab Al-Shaer and Somesh Jha and Angelos D. Keromytis}
@@ -2440,7 +2463,7 @@ Five years ago a previous study examined the AS-level threat against client and 
 	abstract = {Attribute-based encryption (ABE) enables an access control mechanism over encrypted data by specifying access policies among private keys and ciphertexts. In this paper, we focus on ABE that supports revocation. Currently, there are two available revocable ABE schemes in the literature. Their revocation mechanisms, however, differ in the sense that they can be considered as direct and indirect methods. <em>Direct revocation</em> enforces revocation directly by the sender who specifies the revocation list while encrypting. <em>Indirect revocation</em> enforces revocation by the key authority who releases a key update material periodically in such a way that only non-revoked users can update their keys (hence, revoked users{\textquoteright} keys are implicitly rendered useless). An advantage of the indirect method over the direct one is that it does not require senders to know the revocation list. In contrast, an advantage of the direct method over the other is that it does not involve key update phase for all non-revoked users interacting with the key authority. In this paper, we present the first <em>Hybrid Revocable ABE</em> scheme that allows senders to select on-the-fly when encrypting whether to use either direct or indirect revocation mode; therefore, it combines best advantages from both methods},
 	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 = {http://dx.doi.org/10.1007/978-3-642-10868-6_17},
 	author = {Attrapadung, Nuttapong and Imai, Hideki}
 }
 @conference {DBLP:conf/ccs/TroncosoD09,
@@ -2454,7 +2477,7 @@ Five years ago a previous study examined the AS-level threat against client and 
 	keywords = {anonymity, Markov chain, traffic analysis},
 	isbn = {978-1-60558-894-0},
 	doi = {10.1145/1653662.1653707},
-	url = {http://portal.acm.org/citation.cfm?id=1653662.1653707},
+	www_section = {http://portal.acm.org/citation.cfm?id=1653662.1653707},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/TroncosoD09.pdf},
 	author = {Carmela Troncoso and George Danezis},
 	editor = {Ehab Al-Shaer and Somesh Jha and Angelos D. Keromytis}
@@ -2471,7 +2494,7 @@ Five years ago a previous study examined the AS-level threat against client and 
 	keywords = {Bloom filter, overlay networks, pocket switched network},
 	isbn = {978-1-60558-751-6},
 	doi = {10.1145/1658997.1659021},
-	url = {http://portal.acm.org/citation.cfm?doid=1658997.1659021$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?doid=1658997.1659021$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/conext09-phdworkshop-cameraready.pdf},
 	author = {Mayer, Christoph P.}
 }
@@ -2489,10 +2512,10 @@ Five years ago a previous study examined the AS-level threat against client and 
 	keywords = {automated, bootstrapping, decentralized, efficient, IRC, P2P, peer-to-peer networking},
 	isbn = {978-0-7695-3683-5},
 	doi = {http://dx.doi.org/10.1109/WETICE.2009.40},
-	url = {http://dx.doi.org/10.1109/WETICE.2009.40},
+	www_section = {http://dx.doi.org/10.1109/WETICE.2009.40},
 	author = {Knoll, Mirko and Helling, Matthias and Arno Wacker and Holzapfel, Sebastian and Weis, Torben}
 }
-@article {2009,
+@article {2009_0,
 	title = {Brahms: Byzantine Resilient Random Membership Sampling},
 	journal = {Computer Networks Journal (COMNET), Special Issue on Gossiping in Distributed Systems},
 	year = {2009},
@@ -2507,13 +2530,13 @@ Five years ago a previous study examined the AS-level threat against client and 
 	pages = {1{\textendash}16},
 	author = {Anne-Marie Kermarrec}
 }
-@conference {2009,
+@conference {2009_1,
 	title = {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},
 	author = {Ralph Holz and Dirk Haage}
 }
-@conference {2009,
+@conference {2009_2,
 	title = {A Collusion-Resistant Distributed Scalar Product Protocol with Application to Privacy-Preserving Computation of Trust},
 	booktitle = {Network Computing and Applications, 2009. NCA 2009. Eighth IEEE International Symposium on},
 	year = {2009},
@@ -2547,7 +2570,7 @@ We present a framework for analyzing privacy and anonymity in social networks an
 Our de-anonymization algorithm is based purely on the network topology, does not require creation of a large number of dummy "sybil" nodes, is robust to noise and all existing defenses, and works even when the overlap between the target network and the adversary{\textquoteright}s auxiliary information is small},
 	keywords = {anonymity, network topology, privacy},
 	isbn = {978-0-7695-3633-0},
-	url = {http://randomwalker.info/social-networks/},
+	www_section = {http://randomwalker.info/social-networks/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NarayananS09.pdf},
 	author = {Arvind Narayanan and Vitaly Shmatikov}
 }
@@ -2564,11 +2587,11 @@ Our de-anonymization algorithm is based purely on the network topology, does not
 	keywords = {Celeste, fault-tolerance, peer-to-peer networking, storage},
 	issn = {0743-7315},
 	doi = {10.1016/j.jpdc.2009.03.003},
-	url = {http://dl.acm.org/citation.cfm?id=1550962.1551186},
+	www_section = {http://dl.acm.org/citation.cfm?id=1550962.1551186},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Journal\%20of\%20Parallel\%20\%26\%20Distributed\%20Computing\%20-\%20Deleting\%20files\%20in\%20the\%20Celeste\%20p2p\%20storage\%20systems.pdf},
 	author = {Badishi, Gal and Caronni, Germano and Keidar, Idit and Rom, Raphael and Scott, Glenn}
 }
-@conference {2009,
+@conference {2009_3,
 	title = {Differentially Private Recommender Systems: Building Privacy into the Netflix Prize Contenders},
 	booktitle = {Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining},
 	year = {2009},
@@ -2585,21 +2608,21 @@ We measure the empirical trade-off between accuracy and privacy in these adaptat
 	keywords = {Differential Privacy, Netflix, recommender systems},
 	isbn = {978-1-60558-495-9},
 	doi = {10.1145/1557019.1557090},
-	url = {http://doi.acm.org/10.1145/1557019.1557090},
+	www_section = {http://doi.acm.org/10.1145/1557019.1557090},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PrivateRecommender2009McSherry.pdf},
 	author = {McSherry, Frank and Mironov, Ilya}
 }
-@conference {2009,
+@conference {2009_4,
 	title = {Enhancing Application-Layer Multicast Solutions by Wireless Underlay Support},
 	booktitle = {Kommunikation in Verteilten Systemen (KiVS) 2009, Kassel, Germany},
 	year = {2009},
 	abstract = {Application Layer Multicast (ALM) is an attractive solution to overcome the deployment problems of IP-Multicast. We show how to cope with the challenges of incorporating wireless devices into ALM protocols. As a rst approach we extend the NICE protocol, significantly increasing its performance in scenarios with many devices connected through wireless LAN},
 	keywords = {multicast},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.143.2935},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.143.2935},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/nice-wli.pdf},
 	author = {H{\"u}bsch, Christian and Oliver Waldhorst}
 }
-@mastersthesis {2009,
+@mastersthesis {2009_5,
 	title = {Evaluation of Current P2P-SIP Proposals with Respect to the Igor/SSR API },
 	volume = {Computer Science},
 	year = {2009},
@@ -2623,7 +2646,7 @@ We measure the empirical trade-off between accuracy and privacy in these adaptat
 	keywords = {defense, distributed hash table, KAD, p2p network, security, Sybil attack},
 	isbn = {978-3-642-02626-3},
 	doi = {http://dx.doi.org/10.1007/978-3-642-02627-0_6},
-	url = {http://dx.doi.org/10.1007/978-3-642-02627-0_6},
+	www_section = {http://dx.doi.org/10.1007/978-3-642-02627-0_6},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/AIMS\%2709\%20-\%20Sybil\%20attacks\%20protection\%20schemes\%20in\%20KAD.pdf},
 	author = {Cholez, Thibault and Chrisment, Isabelle and Festor, Olivier}
 }
@@ -2643,7 +2666,7 @@ We measure the empirical trade-off between accuracy and privacy in these adaptat
 	keywords = {anonymous credentials, bilinear gruop, privacy, secret sharing, SMC, symbolic evaluation},
 	isbn = {978-3-642-03548-7},
 	doi = {10.1007/978-3-642-03549-4_20},
-	url = {http://dx.doi.org/10.1007/978-3-642-03549-4_20},
+	www_section = {http://dx.doi.org/10.1007/978-3-642-03549-4_20},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Bogetoft\%20et\%20al.\%20-\%20Secure\%20multiparty\%20computation\%20goes\%20live.pdf},
 	author = {Bogetoft, Peter and Christensen, Dan Lund and Damg{\'a}rd, Ivan and Geisler, Martin and Jakobsen, Thomas and Kr{\o}igaard, Mikkel and Nielsen, Janus Dam and Nielsen, Jesper Buus and Nielsen, Kurt and Pagter, Jakob and Schwartzbach, Michael and Toft, Tomas},
 	editor = {Roger Dingledine and Philippe Golle}
@@ -2659,7 +2682,7 @@ We measure the empirical trade-off between accuracy and privacy in these adaptat
 	keywords = {anonymity, denial-of-service, P2P},
 	isbn = {978-1-60558-783-7},
 	doi = {10.1145/1655188.1655199},
-	url = {http://portal.acm.org/citation.cfm?id=1655188.1655199},
+	www_section = {http://portal.acm.org/citation.cfm?id=1655188.1655199},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/wpes09-dht-attack.pdf},
 	author = {Andrew Tran and Nicholas J. Hopper and Yongdae Kim}
 }
@@ -2675,7 +2698,7 @@ We measure the empirical trade-off between accuracy and privacy in these adaptat
 
 This paper presents HEAP, HEterogeneity-Aware gossip Protocol, where nodes dynamically adapt their contribution to the gossip dissemination according to their bandwidth capabilities. Using a continuous, itself gossip-based, approximation of relative bandwidth capabilities, HEAP dynamically leverages the most capable nodes by increasing their fanout, while decreasing by the same proportion that of less capable nodes. HEAP preserves the simple and proactive (churn adaptation) nature of gossip, while significantly improving its effectiveness. We extensively evaluate HEAP in the context of a video streaming application on a testbed of 270 PlanetLab nodes. Our results show that HEAP significantly improves the quality of the streaming over standard homogeneous gossip protocols, especially when the stream rate is close to the average available bandwidth},
 	keywords = {heterogeneity, load balancing},
-	url = {http://portal.acm.org/citation.cfm?id=1656984$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1656984$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/middleware-monod.pdf},
 	author = {Frey, Davide and Rachid Guerraoui and Anne-Marie Kermarrec and Boris Koldehofe and Mogensen, Martin and Monod, Maxime and Qu{\'e}ma, Vivien}
 }
@@ -2704,7 +2727,7 @@ This paper presents HEAP, HEterogeneity-Aware gossip Protocol, where nodes dynam
 	keywords = {globally accessible objects, single system image},
 	isbn = {978-1-60558-587-1},
 	doi = {10.1145/1551609.1551621},
-	url = {http://portal.acm.org/citation.cfm?id=1551609.1551621$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1551609.1551621$\#$},
 	author = {Bjoern Saballus and Thomas Fuhrmann}
 }
 @conference { moscibroda:on,
@@ -2733,12 +2756,12 @@ This paper presents HEAP, HEterogeneity-Aware gossip Protocol, where nodes dynam
 	keywords = {membership concealment, P2P, privacy},
 	isbn = {978-1-60558-894-0},
 	doi = {10.1145/1653662.1653709},
-	url = {http://portal.acm.org/citation.cfm?id=1653662.1653709},
+	www_section = {http://portal.acm.org/citation.cfm?id=1653662.1653709},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/VassermanJTHK09.pdf},
 	author = {Eugene Y. Vasserman and Rob Jansen and James Tyra and Nicholas J. Hopper and Yongdae Kim},
 	editor = {Ehab Al-Shaer and Somesh Jha and Angelos D. Keromytis}
 }
-@mastersthesis {2009,
+@mastersthesis {2009_6,
 	title = {Monte-Carlo Search Techniques in the Modern Board Game Thurn and Taxis},
 	volume = {Master Science of Artificial Intelligence},
 	year = {2009},
@@ -2759,7 +2782,7 @@ pseudo-random simulations and limiting simulation lengths, while other technique
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Thesis\%20-\%20F.Schadd.pdf},
 	author = {Frederik Christiaan Schadd}
 }
-@book {2009,
+@book {2009_7,
 	title = {Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security},
 	booktitle = {Cryptology and Network Security},
 	series = {Lecture Notes in Computer Science},
@@ -2772,7 +2795,7 @@ pseudo-random simulations and limiting simulation lengths, while other technique
 	keywords = {Multiparty Computation, Privacy preserving Set operations},
 	isbn = {978-3-642-10432-9},
 	doi = {10.1007/978-3-642-10433-6_2},
-	url = {http://dx.doi.org/10.1007/978-3-642-10433-6_2},
+	www_section = {http://dx.doi.org/10.1007/978-3-642-10433-6_2},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/MultiParty2009Narayanan.pdf},
 	author = {Sathya Narayanan, G. and Aishwarya, T. and Agrawal, Anugrah and Patra, Arpita and Choudhary, Ashish and Pandu Rangan, C},
 	editor = {Garay, JuanA. and Miyaji, Atsuko and Otsuka, Akira}
@@ -2786,11 +2809,11 @@ pseudo-random simulations and limiting simulation lengths, while other technique
 	keywords = {authentication, privacy},
 	issn = {1545-5971},
 	doi = {10.1109/TDSC.2009.38},
-	url = {http://www.computer.org/portal/web/csdl/doi/10.1109/TDSC.2009.38},
+	www_section = {http://www.computer.org/portal/web/csdl/doi/10.1109/TDSC.2009.38},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/nymble-tdsc.pdf},
 	author = {Patrick P. Tsang and Apu Kapadia and Cory Cornelius and Sean Smith}
 }
-@book {2009,
+@book {2009_8,
 	title = {An Optimally Fair Coin Toss},
 	booktitle = {Theory of Cryptography},
 	series = {Lecture Notes in Computer Science},
@@ -2803,21 +2826,21 @@ pseudo-random simulations and limiting simulation lengths, while other technique
 In this paper we establish the optimal trade-off between the round complexity and the bias of two-party coin-flipping protocols. Under standard assumptions (the existence of oblivious transfer), we show that Cleve{\textquoteright}s lower bound is tight: we construct an r-round protocol with bias O(1/r)},
 	isbn = {978-3-642-00456-8},
 	doi = {10.1007/978-3-642-00457-5_1},
-	url = {http://dx.doi.org/10.1007/978-3-642-00457-5_1},
+	www_section = {http://dx.doi.org/10.1007/978-3-642-00457-5_1},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/OptimallyFairCoinToss2009Moran.pdf},
 	author = {Moran, Tal and Naor, Moni and Segev, Gil},
 	editor = {Reingold, Omer}
 }
-@conference {2009,
+@conference {2009_9,
 	title = {Optimization of distributed services with UNISONO},
 	booktitle = {GI/ITG KuVS Fachgespr{\"a}ch NGN Service Delivery Platforms \& Service Overlay Networks},
 	year = {2009},
 	abstract = {Distributed services are a special case of P2P networks where nodes have several distinctive tasks. Based on previous work, we show how UNISONO provides a way to optimize these services to increase performance, efficiency and user experience. UNISONO is a generic framework for host-based distributed network measurements. In this talk, we present UNISONO as an Enabler for self-organizing Service Delivery Plattforms. We give a short overview of the UNISONO concept and show how distributed services benefit from its usage},
 	keywords = {distributed systems, P2P},
-	url = {http://www.net.in.tum.de/de/mitarbeiter/holz/},
+	www_section = {http://www.net.in.tum.de/de/mitarbeiter/holz/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/unisono_kuvs-ngn.pdf}
 }
-@conference {2009,
+@conference {2009_10,
 	title = {Peer Profiling and Selection in the I2P Anonymous Network},
 	booktitle = {PET-CON 2009.1},
 	year = {2009},
@@ -2838,7 +2861,7 @@ In this paper we establish the optimal trade-off between the round complexity an
 	keywords = {P2P, peer-to-peer networking, PeerSim, simulation},
 	isbn = {978-1-4244-5066-4 },
 	doi = {http://dx.doi.org/10.1109/P2P.2009.5284506},
-	url = {http://peersim.sourceforge.net/},
+	www_section = {http://peersim.sourceforge.net/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/P2P\%2709\%20-\%20PeerSim.pdf},
 	author = {Alberto Montresor and M{\'a}rk Jelasity and Gian Paolo Jesi and Spyros Voulgaris}
 }
@@ -2853,7 +2876,7 @@ In this paper we establish the optimal trade-off between the round complexity an
 	address = {San Francisco, CA, USA},
 	abstract = {Over the past five years, large-scale storage installations have required fault-protection beyond RAID-5, leading to a flurry of research on and development of erasure codes for multiple disk failures. Numerous open-source implementations of various coding techniques are available to the general public. In this paper, we perform a head-to-head comparison of these implementations in encoding and decoding scenarios. Our goals are to compare codes and implementations, to discern whether theory matches practice, and to demonstrate how parameter selection, especially as it concerns memory, has a significant impact on a code{\textquoteright}s performance. Additional benefits are to give storage system designers an idea of what to expect in terms of coding performance when designing their storage systems, and to identify the places where further erasure coding research can have the most impact},
 	keywords = {erasure coding, libraries, open-source, storage},
-	url = {http://www.usenix.org/event/fast09/tech/full_papers/plank/plank_html/},
+	www_section = {http://www.usenix.org/event/fast09/tech/full_papers/plank/plank_html/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FAST\%2709\%20-\%20Open-source\%20erasure\%20coding\%20libraries\%20for\%20storage.pdf},
 	author = {James S. Plank and Luo, Jianqiang and Schuman, Catherine D. and Lihao Xu and Wilcox-O{\textquoteright}Hearn, Zooko}
 }
@@ -2883,7 +2906,7 @@ false positives now that many other users are adding congestion at the same time
 
 We then strengthen the original congestion attack by combining it with a novel bandwidth amplification attack based on a flaw in the Tor design that lets us build long circuits that loop back on themselves. We show that this new combination attack is practical and effective by demonstrating a working attack on today{\textquoteright}s deployed Tor network. By coming up with a model to better understand Tor{\textquoteright}s routing behavior under congestion, we further provide a statistical analysis characterizing how effective our attack is in each case},
 	keywords = {anonymity, attack, denial-of-service, installation, Tor},
-	url = {http://grothoff.org/christian/tor.pdf},
+	www_section = {http://grothoff.org/christian/tor.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tor.pdf},
 	author = {Nathan S Evans and Roger Dingledine and Christian Grothoff}
 }
@@ -2901,11 +2924,11 @@ We then strengthen the original congestion attack by combining it with a novel b
 	keywords = {Backup Systems, erasure codes, evaluation, peer-to-peer networking, Regenerating Codes, storage},
 	isbn = {978-0-7695-3659-0},
 	doi = {http://dx.doi.org/10.1109/ICDCS.2009.14},
-	url = {http://dx.doi.org/10.1109/ICDCS.2009.14},
+	www_section = {http://dx.doi.org/10.1109/ICDCS.2009.14},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ICDCS\%2709\%20-\%20Regenerating\%20codes\%20for\%20p2p\%20backup\%20systems.pdf},
 	author = {Alessandro Duminuco and E W Biersack}
 }
-@conference {2009,
+@conference {2009_11,
 	title = {Privacy Integrated Queries: An Extensible Platform for Privacy-preserving Data Analysis},
 	booktitle = {Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data},
 	year = {2009},
@@ -2916,7 +2939,7 @@ We then strengthen the original congestion attack by combining it with a novel b
 	keywords = {anonymization, confidentiality, Differential Privacy, linq},
 	isbn = {978-1-60558-551-2},
 	doi = {10.1145/1559845.1559850},
-	url = {http://doi.acm.org.eaccess.ub.tum.de/10.1145/1559845.1559850},
+	www_section = {http://doi.acm.org.eaccess.ub.tum.de/10.1145/1559845.1559850},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PrivacyIntergratedQueries2009McSherry.pdf},
 	author = {McSherry, Frank D.}
 }
@@ -2931,7 +2954,7 @@ We then strengthen the original congestion attack by combining it with a novel b
 	keywords = {publish/subscribe, QoS},
 	isbn = {978-3-540-92666-5},
 	doi = {10.1007/978-3-540-92666-5},
-	url = {http://www.springerlink.com/content/x36578745jv7wr88/},
+	www_section = {http://www.springerlink.com/content/x36578745jv7wr88/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/QoS_pubsub.pdf},
 	author = {Tariq, Muhammad Adnan and Boris Koldehofe and Gerald G. Koch and Kurt Rothermel}
 }
@@ -2962,11 +2985,11 @@ We then strengthen the original congestion attack by combining it with a novel b
 	keywords = {blocking resistance},
 	isbn = {978-1-60558-783-7},
 	doi = {10.1145/1655188.1655193},
-	url = {http://portal.acm.org/citation.cfm?id=1655193},
+	www_section = {http://portal.acm.org/citation.cfm?id=1655193},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/wpes09-bridge-attack.pdf},
 	author = {Jon McLachlan and Nicholas J. Hopper}
 }
-@article {2009,
+@article {2009_12,
 	title = {Robust Random Number Generation for Peer-to-Peer Systems},
 	journal = {Theor. Comput. Sci},
 	volume = {410},
@@ -2976,7 +2999,7 @@ We then strengthen the original congestion attack by combining it with a novel b
 	keywords = {Join-leave attacks, Peer-to-peer systems, Random number generation},
 	issn = {0304-3975},
 	doi = {10.1016/j.tcs.2008.10.003},
-	url = {http://dx.doi.org/10.1016/j.tcs.2008.10.003},
+	www_section = {http://dx.doi.org/10.1016/j.tcs.2008.10.003},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/OPODIS-116b.pdf},
 	author = {Awerbuch, Baruch and Scheideler, Christian}
 }
@@ -2994,7 +3017,7 @@ In this paper, we propose Scalable Landmark Flooding (SLF), a new routing protoc
 	keywords = {wireless sensor network},
 	isbn = {978-1-60558-751-6},
 	doi = {10.1145/1658997.1658999},
-	url = {http://portal.acm.org/citation.cfm?id=1658997.1658999$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1658997.1658999$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/di09slf.pdf},
 	author = {Di, Pengfei and Thomas Fuhrmann}
 }
@@ -3011,21 +3034,21 @@ Unlike previous proposals for P2P anonymity schemes, Torsk does not require all 
 	keywords = {P2P},
 	isbn = {978-1-60558-894-0},
 	doi = {10.1145/1653662.1653733},
-	url = {http://portal.acm.org/citation.cfm?id=1653662.1653733},
+	www_section = {http://portal.acm.org/citation.cfm?id=1653662.1653733},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ccs09-torsk.pdf},
 	author = {Jon McLachlan and Andrew Tran and Nicholas J. Hopper and Yongdae Kim}
 }
-@conference {2009,
+@conference {2009_13,
 	title = {Security and Privacy Challenges in the Internet of Things},
 	booktitle = {Proceedings of KiVS Workshop on Global Sensor Networks (GSN09)},
 	year = {2009},
 	note = {http://eceasst.cs.tu-berlin.de/index.php/eceasst/article/download/208/205},
 	abstract = {The future Internet of Things as an intelligent collaboration of miniaturized sensors poses new challenges to security and end-user privacy. The ITU has identified that the protection of data and privacy of users is one of the key challenges in the Internet of Things [Int05]: lack of confidence about privacy will result in decreased adoption among users and therefore is one of the driving factors in the success of the Internet of Things. This paper gives an overview, categorization, and analysis of security and privacy challenges in the Internet of Things},
-	url = {http://doc.tm.uka.de/2009/security-gsn-camera-ready.pdf},
+	www_section = {http://doc.tm.uka.de/2009/security-gsn-camera-ready.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/gsn09-security-mayer.pdf},
 	author = {Mayer, Christoph P.}
 }
-@book {2009,
+@book {2009_14,
 	title = {Self-organized Data Redundancy Management for Peer-to-Peer Storage Systems},
 	booktitle = {Self-Organizing Systems},
 	series = {Lecture Notes in Computer Science},
@@ -3036,11 +3059,11 @@ Unlike previous proposals for P2P anonymity schemes, Torsk does not require all 
 	keywords = {distributed storage, Markov chain},
 	issn = {978-3-642-10864-8},
 	doi = {10.1007/978-3-642-10865-5},
-	url = {http://www.springerlink.com/content/28660w27373vh408/},
+	www_section = {http://www.springerlink.com/content/28660w27373vh408/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fulltext3.pdf},
 	author = {Yaser Houri and Manfred Jobmann and Thomas Fuhrmann}
 }
-@conference {2009,
+@conference {2009_15,
 	title = {ShadowWalker: Peer-to-peer Anonymous Communication Using Redundant Structured Topologies},
 	booktitle = {Proceedings of the 16th ACM Conference on Computer and Communications Security},
 	year = {2009},
@@ -3071,11 +3094,11 @@ mous communication},
 	keywords = {anonymity, peer-to-peer, random walks},
 	isbn = {978-1-60558-894-0},
 	doi = {10.1145/1653662.1653683},
-	url = {http://doi.acm.org/10.1145/1653662.1653683},
+	www_section = {http://doi.acm.org/10.1145/1653662.1653683},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/shadowwalker-ccs09.pdf},
 	author = {Mittal, Prateek and Borisov, Nikita}
 }
-@article {2009,
+@article {2009_16,
 	title = {A Software and Hardware IPTV Architecture for Scalable DVB Distribution},
 	journal = {International Journal of Digital Multimedia Broadcasting},
 	volume = {2009},
@@ -3083,11 +3106,11 @@ mous communication},
 	abstract = {Many standards and even more proprietary technologies deal with IP-based television (IPTV). But none of them can transparently map popular public broadcast services such as DVB or ATSC to IPTV with acceptable effort. In this paper we explain why we believe that such a mapping using a light weight framework is an important step towards all-IP multimedia. We then present the NetCeiver architecture: it is based on well-known standards such as IPv6, and it allows zero configuration. The use of multicast streaming makes NetCeiver highly scalable. We also describe a low cost FPGA implementation of the proposed NetCeiver architecture, which can concurrently stream services from up to six full transponders},
 	keywords = {DVB, IPTV, multicast},
 	doi = {10.1155/2009/617203},
-	url = {http://www.hindawi.com/journals/ijdmb/2009/617203.html},
+	www_section = {http://www.hindawi.com/journals/ijdmb/2009/617203.html},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/617203.pdf},
 	editor = {Georg Acher and Detlef Fliegl and Thomas Fuhrmann}
 }
-@mastersthesis {2009,
+@mastersthesis {2009_17,
 	title = {Solving very large distributed constraint satisfaction problems},
 	volume = {Doctor of Philosophy},
 	year = {2009},
@@ -3116,28 +3139,28 @@ Finally, it is argued that any future development in distributed constraint sati
 	keywords = {anonymity, cryptography},
 	isbn = {978-0-7695-3633-0},
 	doi = {10.1109/SP.2009.15},
-	url = {http://portal.acm.org/citation.cfm?id=1607723.1608138},
+	www_section = {http://portal.acm.org/citation.cfm?id=1607723.1608138},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DanezisG09.pdf},
 	author = {George Danezis and Ian Goldberg}
 }
-@conference {2009,
+@conference {2009_18,
 	title = {SPINE : Adaptive Publish/Subscribe for Wireless Mesh Networks},
 	booktitle = {Proc of the 8th IEEE International Conference on Innovative Internet Community Systems (I2CS 2008)},
 	year = {2009},
 	abstract = {Application deployment on Wireless Mesh Networks (WMNs) is a challenging issue. First it requires communication abstractions that allow for interoperation with Internet applications and second the offered solution should be sensitive to the available resources in the underlying network. Loosely coupled communication abstractions, like publish/subscribe, promote interoperability, but unfortunately are typically implemented at the application layer without considering the available resources at the underlay imposing a significant degradation of application performance in the setting of Wireless Mesh Networks. In this paper we present SPINE, a content-based publish/subscribe system, which considers the particular challenges of deploying application-level services in Wireless Mesh Networks. SPINE is designed to reduce the overhead which stems from both publications and reconfigurations, to cope with the inherent capacity limitations on communication links as well as with mobility of the wireless mesh-clients. We demonstrate the effectiveness of SPINE by comparison with traditional approaches in implementing content-based publish/subscribe},
 	keywords = {mesh networks, publish/subscribe},
-	url = {http://studia.complexica.net/index.php?option=com_content\&view=article\&id=116\%3Aspine--adaptive-publishsubscribe-for-wireless-mesh-networks-pp-320-353\&catid=47\%3Anumber-3\&Itemid=89\&lang=fr},
+	www_section = {http://studia.complexica.net/index.php?option=com_content\&view=article\&id=116\%3Aspine--adaptive-publishsubscribe-for-wireless-mesh-networks-pp-320-353\&catid=47\%3Anumber-3\&Itemid=89\&lang=fr},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/RI070302.pdf},
 	author = {Jorge Alfonso Briones-Garc{\i}a and Boris Koldehofe and Kurt Rothermel}
 }
-@booklet {2009,
+@booklet {2009_19,
 	title = {SpoVNet Security Task Force Report},
 	volume = {ISSN 1613-849X},
 	number = {TM-2009-2},
 	year = {2009},
 	publisher = {Institute of Telematics, Universit{\"a}t Karlsruhe (TH)},
 	type = {Telematics Technical Report},
-	url = {http://doc.tm.uka.de/2009/TM-2009-3.pdf},
+	www_section = {http://doc.tm.uka.de/2009/TM-2009-3.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/TM-2009-3.pdf},
 	author = {Ralph Holz and Mayer, Christoph P. and Sebastian Mies and Heiko Niedermayer and Tariq, Muhammad Adnan}
 }
@@ -3170,7 +3193,7 @@ Finally, it is argued that any future development in distributed constraint sati
 	keywords = {indirect reciprocity, open currency, recommender system, reputation system, sybilproof, transitive trust},
 	isbn = {978-1-60558-458-4},
 	doi = {http://doi.acm.org/10.1145/1566374.1566423},
-	url = {http://doi.acm.org/10.1145/1566374.1566423},
+	www_section = {http://doi.acm.org/10.1145/1566374.1566423},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EC\%2709\%20-\%20Sybilproof\%20transitive\%20trust\%20protocols.pdf},
 	author = {Paul Resnick and Sami, Rahul}
 }
@@ -3181,11 +3204,11 @@ Finally, it is argued that any future development in distributed constraint sati
 	school = {Air Force Institute of Technology},
 	type = {phd},
 	abstract = {Any entity operating in cyberspace is susceptible to debilitating attacks. With cyber attacks intended to gather intelligence and disrupt communications rapidly replacing the threat of conventional and nuclear attacks, a new age of warfare is at hand. In 2003, the United States acknowledged that the speed and anonymity of cyber attacks makes distinguishing among the actions of terrorists, criminals, and nation states difficult. Even President Obama{\textquoteright}s Cybersecurity Chief-elect feels challenged by the increasing sophistication of cyber attacks. Indeed, the rising quantity and ubiquity of new surveillance technologies in cyberspace enables instant, undetectable, and unsolicited information collection about entities. Hence, anonymity and privacy are becoming increasingly important issues. Anonymization enables entities to protect their data and systems from a diverse set of cyber attacks and preserve privacy. This research provides a systematic analysis of anonymity degradation, preservation and elimination in cyberspace to enchance the security of information assets. This includes discovery/obfuscation of identities and actions of/from potential adversaries. First, novel taxonomies are developed for classifying and comparing the wide variety of well-established and state-of-the-art anonymous networking protocols. These expand the classical definition of anonymity and are the first known to capture the peer-to-peer and mobile ad hoc anonymous protocol family relationships. Second, a unique synthesis of state-of-the-art anonymity metrics is provided. This significantly aids an entities ability to reliably measure changing anonymity levels; thereby, increasing their ability to defend against cyber attacks. Finally, a novel epistemic-based model is created to characterize how an adversary reasons with knowledge to degrade anonymity},
-	url = {http://oai.dtic.mil/oai/oai?verb=getRecord\&metadataPrefix=html\&identifier=ADA495688},
+	www_section = {http://oai.dtic.mil/oai/oai?verb=getRecord\&metadataPrefix=html\&identifier=ADA495688},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Douglas-thesis.pdf},
 	author = {Douglas Kelly}
 }
-@conference {2009,
+@conference {2009_20,
 	title = {Towards End-to-End Connectivity for Overlays across Heterogeneous Networks},
 	booktitle = {Proc. Int. Workshop on the Network of the Future (Future-Net 2009), co-located with IEEE Int. Conf. on Communications (ICC 2009)},
 	year = {2009},
@@ -3193,10 +3216,10 @@ Finally, it is argued that any future development in distributed constraint sati
 	abstract = {The incremental adoption of IPv6, middle boxes (e.g., NATs, Firewalls) as well as completely new network types and protocols paint a picture of a future Internet that consists of extremely heterogeneous edge networks (e.g. IPv4, IPv6, industrial Ethernet, sensor networks) that are not supposed or able to communicate directly. This increasing heterogeneity imposes severe challenges for overlay networks, which are considered as a potential migration strategy towards the future Internet since they can add new functionality and services in a distributed and self-organizing manner. Unfortunately, overlays are based on end-to-end connectivity and, thus, their deployment is hindered by network heterogeneity. In this paper, we take steps towards a solution to enable overlay connections in such heterogeneous networks, building upon a model of heterogeneous networks that comprises several connectivity domains with direct connectivity, interconnected by relays. As major contribution, we present a distributed protocol that detects the boundaries of connectivity domains as well as relays using a gossiping approach. Furthermore, the protocol manages unique identifiers of connectivity domains and efficiently handles domain splitting and merging due to underlay changes. Simulation studies indicate that the algorithm can handle splitting and merging of connectivity domains in reasonable time and is scalable with respect to control overhead},
 	isbn = {978-1-4244-3437-4 },
 	doi = {10.1109/ICCW.2009.5207975  },
-	url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5207975},
+	www_section = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5207975},
 	author = {Sebastian Mies and Oliver Waldhorst and Hans Wippel}
 }
-@conference {2009,
+@conference {2009_21,
 	title = {Traffic Engineering vs. Content Distribution: A Game Theoretic Perspective},
 	booktitle = {INFOCOM 2009. The 28th IEEE International Conference on Computer Communications},
 	year = {2009},
@@ -3227,7 +3250,7 @@ techniques, we show how to optimally modify packets in real-time to reduce the a
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/morphing09.pdf},
 	author = {Charles Wright and Scott Coull and Fabian Monrose}
 }
-@book {2009,
+@book {2009_22,
 	title = {Tuning Vivaldi: Achieving Increased Accuracy and Stability},
 	booktitle = {Self-Organizing Systems},
 	series = {Lecture Notes in Computer Science},
@@ -3238,7 +3261,7 @@ techniques, we show how to optimally modify packets in real-time to reduce the a
 	isbn = {978-3-642-10864-8},
 	issn = {0302-9743},
 	doi = {10.1007/978-3-642-10865-5},
-	url = {http://www.springerlink.com/content/h7r3q58251x72155/},
+	www_section = {http://www.springerlink.com/content/h7r3q58251x72155/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fulltext.pdf},
 	author = {Benedikt Elser and Andreas F{\"o}rschler and Thomas Fuhrmann}
 }
@@ -3259,7 +3282,7 @@ We present simulation results which show the performance gain of the proposed im
 	keywords = {mobile Ad-hoc networks, P2P, routing, scalable source routing},
 	isbn = {978-1-60558-569-7},
 	doi = {10.1145/1582379.1582481},
-	url = {http://portal.acm.org/citation.cfm?id=1582481$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1582481$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/di09broadcastssr.pdf},
 	author = {Di, Pengfei and Thomas Fuhrmann}
 }
@@ -3277,7 +3300,7 @@ We present a novel method that applies common text mining techniques to the norm
 	keywords = {forensics, latency, text mining, traffic analysis},
 	isbn = {978-1-60558-784-4},
 	doi = {10.1145/1655008.1655013},
-	url = {http://portal.acm.org/citation.cfm?id=1655013\&dl=GUIDE\&coll=GUIDE\&CFID=83763210\&CFTOKEN=75697565},
+	www_section = {http://portal.acm.org/citation.cfm?id=1655013\&dl=GUIDE\&coll=GUIDE\&CFID=83763210\&CFTOKEN=75697565},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ccsw09-fingerprinting.pdf},
 	author = {Dominik Herrmann and Rolf Wendolsky and Hannes Federrath}
 }
@@ -3293,7 +3316,7 @@ We present a novel method that applies common text mining techniques to the norm
 	keywords = {FPGA, wireless sensor network},
 	isbn = {978-0-7695-3639-2},
 	doi = {10.1109/WAINA.2009.192},
-	url = {http://portal.acm.org/citation.cfm?id=1588304.1590633$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1588304.1590633$\#$},
 	author = {Potdar, Vidyasagar and Sharif, Atif and Chang, Elizabeth}
 }
 @conference {DBLP:conf/esorics/DanezisDKT09,
@@ -3309,7 +3332,7 @@ We present a novel method that applies common text mining techniques to the norm
 	keywords = {anonymity, Crowds, traffic analysis},
 	isbn = {978-3-642-04443-4},
 	doi = {10.1007/978-3-642-04444-1},
-	url = {http://www.springerlink.com/content/t6q86u137t4762k8/},
+	www_section = {http://www.springerlink.com/content/t6q86u137t4762k8/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DanezisDKT09.pdf},
 	author = {George Danezis and Claudia Diaz and Emilia K{\"a}sper and Carmela Troncoso},
 	editor = {Michael Backes and Peng Ning}
@@ -3327,11 +3350,11 @@ The solutions are efficient, with bandwidth and latency overheads of under 4\% a
 	keywords = {anonymity, onion routing, payment, privacy},
 	isbn = {978-1-60558-783-7 },
 	doi = {10.1145/1655188.1655195},
-	url = {http://portal.acm.org/citation.cfm?id=1655188.1655195},
+	www_section = {http://portal.acm.org/citation.cfm?id=1655188.1655195},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/wpes09-xpay.pdf},
 	author = {Yao Chen and Radu Sion and Bogdan Carbunar}
 }
-@conference {2008,
+@conference {2008_0,
 	title = {AmbiComp: A platform for distributed execution of Java programs on embedded systems by offering a single system image },
 	booktitle = {AmI-Blocks{\textquoteright}08, European Conference on Ambient Intelligence 2008 manuscript No},
 	year = {2008},
@@ -3341,12 +3364,12 @@ exible rmware including a Java Virtual Machine, and an Eclipse-based integrated
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/publ_2008_eickhold-fuhrmann-saballus-ua_ambicomp.pdf},
 	author = {Johannes Eickhold and Thomas Fuhrmann and Bjoern Saballus and Sven Schlender and Thomas Suchy}
 }
-@conference {2008,
+@conference {2008_1,
 	title = {Analyzing Unreal Tournament 2004 Network Traffic Characteristics},
 	booktitle = {CGAT{\textquoteright}08 Singapore, 28th-30th},
 	year = {2008},
 	abstract = {With increasing availability of high-speed access links in the private sector, online real-time gaming has become a major and still growing segment in terms of market and network impact today. One of the most popular games is Unreal Tournament 2004, a fast-paced action game that still ranks within the top 10 of the most-played multiplayer Internet-games, according to GameSpy [1]. Besides high demands in terms of graphical computation, games like Unreal also impose hard requirements regarding network packet delay and jitter, for small deterioration in these conditions influences gameplay recognizably. To make matters worse, such games generate a very specific network traffic with strong requirements in terms of data delivery. In this paper, we analyze the network traffic characteristics of Unreal Tournament 2004. The experiments include different aspects like variation of map sizes, player count, player behavior as well as hardware and game-specific configuration. We show how different operating systems influence network behavior of the game. Our work gives a promising picture of how the specific real-time game behaves in terms of network impact and may be used as a basis e.g. for the development of specialized traffic generators},
-	url = {http://www.tm.uka.de/itm/WebMan/view.php?view=publikationen_detail\&id=295},
+	www_section = {http://www.tm.uka.de/itm/WebMan/view.php?view=publikationen_detail\&id=295},
 	author = {H{\"u}bsch, Christian}
 }
 @conference {Zivan:2008:ALS:1402821.1402895,
@@ -3364,7 +3387,7 @@ exible rmware including a Java Virtual Machine, and an Eclipse-based integrated
 A general framework for implementing distributed local search algorithms for DisCOPs is proposed. The proposed framework makes use of a BFS-tree in order to accumulate the costs of the system{\textquoteright}s state in its different steps and to propagate the detection of a new best step when it is found. The resulting framework enhances local search algorithms for DisCOPs with the anytime property. The proposed framework does not require additional network load. Agents are required to hold a small (linear) additional space (beside the requirements of the algorithm in use). The proposed framework preserves privacy at a higher level than complete DisCOP algorithms which make use of a pseudo-tree (ADOPT, DPOP)},
 	keywords = {algorithms, BFS-Tree, DCOP, DisCOPs, framework},
 	isbn = {978-0-9817381-2-3},
-	url = {http://dl.acm.org/citation.cfm?id=1402821.1402895},
+	www_section = {http://dl.acm.org/citation.cfm?id=1402821.1402895},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/AAAI\%2708\%20-\%20Local\%20search\%20for\%20DCOP.pdf},
 	author = {Zivan, Roie}
 }
@@ -3390,7 +3413,7 @@ A general framework for implementing distributed local search algorithms for Dis
 	keywords = {auction, Internet, net-neutrality},
 	isbn = {978-1-60558-179-8},
 	doi = {http://doi.acm.org/10.1145/1403027.1403032},
-	url = {http://doi.acm.org/10.1145/1403027.1403032},
+	www_section = {http://doi.acm.org/10.1145/1403027.1403032},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NetEcon\%2708\%20-\%20Yang\%20-\%20Auction\%2C\%20but\%20don\%27t\%20block.pdf},
 	author = {Yang, Xiaowei}
 }
@@ -3408,7 +3431,7 @@ We present a simulation environment for such protocols that combines a declarati
 
 We use the simulator to compare representative protocols under identical conditions and rapidly explore the effects of changes in the costs of crypto operations, workloads, network conditions and faults. For example, we show that Zyzzyva outperforms protocols like PBFT and Q/U undermost but not all conditions, indicating that one-size-fits-all protocols may be hard if not impossible to design in practice},
 	isbn = {111-999-5555-22-1},
-	url = {http://portal.acm.org/citation.cfm?id=1387603$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1387603$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BFTSim-nsdi08.pdf},
 	author = {Singh, Atul and Das, Tathagata and Maniatis, Petros and Peter Druschel and Roscoe, Timothy}
 }
@@ -3423,7 +3446,7 @@ We use the simulator to compare representative protocols under identical conditi
 	abstract = {We present BitBlender, an efficient protocol that provides an anonymity layer for BitTorrent traffic. BitBlender works by creating an ad-hoc multi-hop network consisting of special peers called "relay peers" that proxy requests and replies on behalf of other peers. To understand the effect of introducing relay peers into the BitTorrent system architecture, we provide an analysis of the expected path lengths as the ratio of relay peers to normal peers varies. A prototype is implemented and experiments are conducted on Planetlab to quantify the performance overhead associated with the protocol. We also propose protocol extensions to add confidentiality and access control mechanisms, countermeasures against traffic analysis attacks, and selective caching policies that simultaneously increase both anonymity and performance. We finally discuss the potential legal obstacles to deploying an anonymous file sharing protocol. This work is among the first to propose a privacy enhancing system that is designed specifically for a particular class of peer-to-peer traffic},
 	keywords = {ad-hoc networks, anonymity, P2P, privacy},
 	doi = {10.1145/1461464.1461465},
-	url = {http://portal.acm.org/citation.cfm?id=1461465},
+	www_section = {http://portal.acm.org/citation.cfm?id=1461465},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/bauer-alpaca2008.pdf},
 	author = {Kevin Bauer and Damon McCoy and Dirk Grunwald and Douglas Sicker}
 }
@@ -3440,7 +3463,7 @@ We use the simulator to compare representative protocols under identical conditi
 	keywords = {auctions, BitTorrent, proportional share, tit-for-tat},
 	issn = {0146-4833},
 	doi = {http://doi.acm.org/10.1145/1402946.1402987},
-	url = {http://doi.acm.org/10.1145/1402946.1402987},
+	www_section = {http://doi.acm.org/10.1145/1402946.1402987},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%20Comput.\%20Commun.\%20Rev.\%20-\%20BitTorrent\%20is\%20an\%20Auction.pdf},
 	author = {Levin, Dave and LaCurts, Katrina and Spring, Neil and Bobby Bhattacharjee}
 }
@@ -3455,7 +3478,7 @@ We use the simulator to compare representative protocols under identical conditi
 	abstract = {In this paper, we present the first heuristic for fully distributed bootstrapping of peer-to-peer networks. Our heuristic generates a stream of promising IP addresses to be probed as entry points. This stream is generated using statistical profiles using the IP ranges of start-of-authorities (SOAs) in the domain name system (DNS). We
 present experimental results demonstrating that with this approach it is efficient and practical to bootstrap Gnutella-sized peer-to-peer networks --- without the need for centralized services or the public exposure of end-user{\textquoteright}s private IP addresses},
 	keywords = {bootstrapping, DNS, installation, P2P},
-	url = {http://grothoff.org/christian/bootstrap.pdf},
+	www_section = {http://grothoff.org/christian/bootstrap.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/bootstrap.pdf},
 	author = {Chis GauthierDickey and Christian Grothoff}
 }
@@ -3472,7 +3495,7 @@ present experimental results demonstrating that with this approach it is efficie
 	keywords = {attack, onion routing},
 	isbn = {978-3-540-70629-8},
 	doi = {10.1007/978-3-540-70630-4_7},
-	url = {http://portal.acm.org/citation.cfm?id=1428259.1428266},
+	www_section = {http://portal.acm.org/citation.cfm?id=1428259.1428266},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/shimshock-pet2008.pdf},
 	author = {Eric Shimshock and Matt Staats and Nicholas J. Hopper}
 }
@@ -3489,7 +3512,7 @@ present experimental results demonstrating that with this approach it is efficie
 	keywords = {anonymity, P2P, route bridging attack},
 	isbn = {978-3-540-70629-8},
 	doi = {10.1007/978-3-540-70630-4},
-	url = {http://www.springerlink.com/content/q2r7g81286026576/},
+	www_section = {http://www.springerlink.com/content/q2r7g81286026576/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/danezis-pet2008.pdf},
 	author = {George Danezis and Paul Syverson},
 	editor = {Borisov, Nikita and Ian Goldberg}
@@ -3507,7 +3530,7 @@ present experimental results demonstrating that with this approach it is efficie
 	keywords = {file-sharing, P2P},
 	issn = {1063-6692},
 	doi = {10.1109/TNET.2007.900406},
-	url = {http://portal.acm.org/citation.cfm?id=1373992$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1373992$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/stutzbach.pdf},
 	author = {Stutzbach, Daniel and Rejaie, Reza and Sen, Subhabrata}
 }
@@ -3524,7 +3547,7 @@ To evaluate our novel attack, we used a real-world anonymizing system, TOR. We s
 	keywords = {anonymity, attack, Tor},
 	isbn = {978-3-540-85884-3},
 	doi = {10.1007/978-3-540-85886-7_11},
-	url = {http://portal.acm.org/citation.cfm?id=1432478.1432493},
+	www_section = {http://portal.acm.org/citation.cfm?id=1432478.1432493},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/torspinISC08.pdf},
 	author = {Vasilis Pappas and Elias Athanasopoulos and Sotiris Ioannidis and Evangelos P. Markatos}
 }
@@ -3541,19 +3564,19 @@ To evaluate our novel attack, we used a real-world anonymizing system, TOR. We s
 	keywords = {communication system security, privacy},
 	isbn = {978-0-7695-3095-6},
 	doi = {10.1109/AINA.2008.117},
-	url = {http://portal.acm.org/citation.cfm?id=1395079.1395235},
+	www_section = {http://portal.acm.org/citation.cfm?id=1395079.1395235},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/MarPi08.pdf},
 	author = {Igor Margasinski and Michal Pioro}
 }
-@conference {2008,
+@conference {2008_2,
 	title = {Consistency Management for Peer-to-Peer-based Massively Multiuser Virtual Environments},
 	booktitle = { Proc. 1st Int.Workshop on Massively Multiuser Virtual Environments (MMVE{\textquoteright}08)},
 	year = {2008},
-	url = {http://www.spovnet.de/files/publications/MMVEConsistency.pdf/view},
+	www_section = {http://www.spovnet.de/files/publications/MMVEConsistency.pdf/view},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/MMVEConsistency.pdf},
 	author = {Gregor Schiele and Richard S{\"u}selbeck and Arno Wacker and Triebel, Tonio and Christian Becker}
 }
-@mastersthesis {2008,
+@mastersthesis {2008_3,
 	title = {The Decentralized File System Igor-FS as an Application for Overlay-Networks},
 	volume = {Engineering},
 	year = {2008},
@@ -3564,7 +3587,7 @@ To evaluate our novel attack, we used a real-world anonymizing system, TOR. We s
 	address = {Karlsruhe, Germany},
 	abstract = {Working in distributed systems is part of the information society. More and more people and organizations work with growing data volumes.
 Often, part of the problem is to access large files in a share way. Until now, there are two often used approaches to allow this kind off access. Either the files are tranfered via FTP, e-mail or similar medium before the access happens, or a centralized server provides file services. The first alternative has the disadvantage that the entire file has to be transfered before the first access can be successful. If only small parts in the file have been changed compared to a previous version, the entire file has to be transfered anyway. The centralized approach has disadvantages regarding scalability and reliability. In both approaches authorization and authentication can be difficult in case users are seperated by untrusted network segements},
-	url = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000009668},
+	www_section = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000009668},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Kutzner\%20-\%20The\%20descentralized\%20file\%20system\%20Igor-FS\%20as\%20an\%20application_0.pdf}
 }
 @article { vrancx:decentralized,
@@ -3592,7 +3615,7 @@ Often, part of the problem is to access large files in a share way. Until now, t
 	keywords = {anonymity service, link padding, traffic analysis},
 	isbn = {978-1-59593-810-7},
 	doi = {10.1145/1455770.1455812},
-	url = {http://portal.acm.org/citation.cfm?id=1455812},
+	www_section = {http://portal.acm.org/citation.cfm?id=1455812},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Dependent\%20Link\%20Padding\%20Algorithms\%20for.pdf},
 	author = {Wei Wang and Mehul Motani and Vikram Srinivasan},
 	editor = {Paul Syverson and Somesh Jha and Xiaolan Zhang}
@@ -3611,7 +3634,7 @@ Often, part of the problem is to access large files in a share way. Until now, t
 	keywords = {BitTorrent, blocking, network measurement},
 	isbn = {978-1-60558-334-1},
 	doi = {http://doi.acm.org/10.1145/1452520.1452523},
-	url = {http://doi.acm.org/10.1145/1452520.1452523},
+	www_section = {http://doi.acm.org/10.1145/1452520.1452523},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IMC\%2708\%20-\%20Detecting\%20BitTorrent\%20Blocking.pdf},
 	author = {Dischinger, Marcel and Mislove, Alan and Haeberlen, Andreas and P. Krishna Gummadi}
 }
@@ -3625,7 +3648,7 @@ Often, part of the problem is to access large files in a share way. Until now, t
 	abstract = {At Oakland 2005, Murdoch and Danezis described an attack on the Tor anonymity service that recovers the nodes in a Tor circuit, but not the client. We observe that in a peer-to-peer anonymity scheme, the client is part of the circuit and thus the technique can be of greater significance in this setting. We experimentally validate this conclusion by showing that "circuit clogging" can identify client nodes using the MorphMix peer-to-peer anonymity protocol. We also propose and empirically validate the use of the Stochastic Fair Queueing discipline on outgoing connections as an efficient and low-cost mitigation technique},
 	keywords = {anonymity, P2P, Tor},
 	doi = {10.1007/978-3-540-85230-8_3},
-	url = {http://portal.acm.org/citation.cfm?id=1428551},
+	www_section = {http://portal.acm.org/citation.cfm?id=1428551},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/clog-the-queue.pdf},
 	author = {Jon McLachlan and Nicholas J. Hopper}
 }
@@ -3650,7 +3673,7 @@ Often, part of the problem is to access large files in a share way. Until now, t
 	address = {New York, NY, USA},
 	isbn = {978-1-60558-346-4},
 	doi = {10.1145/1477942.1477950},
-	url = {http://doi.acm.org/10.1145/1477942.1477950},
+	www_section = {http://doi.acm.org/10.1145/1477942.1477950},
 	author = {Becchi, Michela and Crowley, Patrick}
 }
 @article {1373458,
@@ -3668,7 +3691,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
 	keywords = {mobile Ad-hoc networks, routing},
 	issn = {1063-6692},
 	doi = {10.1109/TNET.2007.897962},
-	url = {http://portal.acm.org/citation.cfm?id=1373458$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1373458$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.74.8097.pdf},
 	author = {Spyropoulos, Thrasyvoulos and Psounis, Konstantinos and Raghavendra, Cauligi S.}
 }
@@ -3692,7 +3715,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/LOCEntropy2008.pdf},
 	author = {Luke O{\textquoteright}Connor}
 }
-@book {2008,
+@book {2008_4,
 	title = {Estimating The Size Of Peer-To-Peer Networks Using Lambert{\textquoteright}s W Function},
 	booktitle = {Grid Computing - Achievements and Prospects},
 	year = {2008},
@@ -3704,7 +3727,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
 	keywords = {distributed computing, lambert w function, network size estimation, peer-to-peer networking},
 	isbn = {978-0-387-09456-4},
 	issn = {978-0-387-09456-4},
-	url = {http://eprints.adm.unipi.it/649/},
+	www_section = {http://eprints.adm.unipi.it/649/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Grid\%20Computing\%20-\%20Estimating\%20The\%20Size\%20Of\%20Peer-To-Peer\%20Networks.pdf},
 	author = {Javier Bustos-Jim{\'e}nez and Nicol{\'a}s Bersano and Satu Elisa Schaeffer and Jos{\'e} Miguel Piquer and Alexandru Iosup and Augusto Ciuffoletti}
 }
@@ -3721,7 +3744,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
 	abstract = {Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenarios using this formalism, mainly because of the complexity associated with those algorithms. In the present work we compare three complete algorithms for DCOP, aiming at studying how they perform in complex and dynamic scenarios of increasing sizes. In order to assess their performance we measure not only standard quantities such as number of cycles to arrive to a solution, size and quantity of exchanged messages, but also computing time and quality of the solution which is related to the particular domain we use. This study can shed light in the issues of how the algorithms perform when applied to problems other than those reported in the literature (graph coloring, meeting scheduling, and distributed sensor network)},
 	keywords = {coordination, DCOP, distributed constraint optimization, traffic control},
 	isbn = {978-0-9817381-1-6},
-	url = {http://dl.acm.org/citation.cfm?id=1402298.1402308},
+	www_section = {http://dl.acm.org/citation.cfm?id=1402298.1402308},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/AAMAS08\%20-\%20DCOP\%20algorithms\%20in\%20a\%20real\%20world\%20problem.pdf},
 	author = {Junges, Robert and Bazzan, Ana L. C.}
 }
@@ -3755,11 +3778,11 @@ To deal with such networks researchers have suggested to use flooding-based rout
 	keywords = {cryptography, secure multi-party computation, SMC},
 	isbn = {978-1-59593-810-7},
 	doi = {10.1145/1455770.1455804},
-	url = {http://doi.acm.org/10.1145/1455770.1455804},
+	www_section = {http://doi.acm.org/10.1145/1455770.1455804},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CCS\%2708\%20-\%20FairplayMP.pdf},
 	author = {Ben-David, Assaf and Nisan, Noam and Pinkas, Benny}
 }
-@article {2008,
+@article {2008_5,
 	title = {On the False-positive Rate of Bloom Filters},
 	journal = {Inf. Process. Lett},
 	volume = {108},
@@ -3769,7 +3792,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
 	keywords = {Analysis of algorithms, data structures},
 	issn = {0020-0190},
 	doi = {10.1016/j.ipl.2008.05.018},
-	url = {http://dx.doi.org/10.1016/j.ipl.2008.05.018},
+	www_section = {http://dx.doi.org/10.1016/j.ipl.2008.05.018},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FalsepositiverateBloomFilter2008Bose.pdf},
 	author = {Bose, Prosenjit and Guo, Hua and Kranakis, Evangelos and Maheshwari, Anil and Morin, Pat and Morrison, Jason and Smid, Michiel and Tang, Yihui}
 }
@@ -3786,7 +3809,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
 	keywords = {game theory, isp, Network management, Peering, Traffic model},
 	issn = {1389-1286},
 	doi = {10.1016/j.comnet.2008.06.014},
-	url = {http://dl.acm.org/citation.cfm?id=1412757.1412971},
+	www_section = {http://dl.acm.org/citation.cfm?id=1412757.1412971},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Computer\%20Networks\%20-\%20Wang\%2C\%20Chiu\%20\%26\%20Lui\%20-\%20Overlay\%20network\%20traffic\%20on\%20ISP\%20peering.pdf},
 	author = {Wang, Jessie Hui and Chiu, Dah Ming and Lui, John C. S.}
 }
@@ -3799,7 +3822,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
 	address = {Cap Esterel, France},
 	abstract = {As networked embedded sensors and actuators become more and more widespread, software developers encounter the difficulty to create applications that run distributed on these nodes: Typically, these nodes are heterogeneous, resource-limited, and there is no centralized control. The Ambicomp project tackles this problem. Its goal is to provide a distributed Java Virtual Machine (VM) that runs on the bare sensor node hardware. This VM creates a single system illusion across several nodes. Objects and threads can migrate freely between these nodes. In this paper, we address the problem of globally accessible objects. We describe how scalable source routing, a DHT-inspired routing protocol, can be used to allow access to objects regardless of their respective physical location and without any centralized component},
 	keywords = {distributed hash table},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/saballus08gaos.pdf},
 	author = {Bjoern Saballus and Johannes Eickhold and Thomas Fuhrmann}
 }
@@ -3807,16 +3830,16 @@ To deal with such networks researchers have suggested to use flooding-based rout
 	title = {Hash cash - a denial of service counter-measure},
 	year = {2008},
 	abstract = {Hashcash was originally proposed as a mechanism to throttle systematic abuse of un-metered internet resources such as email, and anonymous remailers in May 1997. Five years on, this paper captures in one place the various applications, improvements suggested and related subsequent publications, and describes initial experience from experiments using hashcash. The hashcash CPU cost-function computes a token which can be used as a proof-of-work. Interactive and non-interactive variants of cost-functions can be constructed which can be used in situations where the server can issue a challenge (connection oriented interactive protocol), and where it can not (where the communication is store - and - forward, or packet oriented) respectively},
-	url = {citeseer.ist.psu.edu/back02hashcash.html},
+	www_section = {citeseer.ist.psu.edu/back02hashcash.html},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/hashcash.pdf},
 	author = {Adam Back}
 }
-@conference {2008,
+@conference {2008_6,
 	title = {Higher Confidence in Event Correlation Using Uncertainty Restrictions},
 	booktitle = {28th International Conference on In Distributed Computing Systems Workshops},
 	year = {2008},
 	abstract = {Distributed cooperative systems that use event notification for communication can benefit from event correlation within the notification network. In the presence of uncertain data, however, correlation results easily become unreliable. The handling of uncertainty is therefore an important challenge for event correlation in distributed event notification systems. In this paper, we present a generic correlation model that is aware of uncertainty. We propose uncertainty constraints that event correlation can take into account and show how they can lead to higher confidence in the correlation result. We demonstrate that the application of this model allows to obtain a qualitative description of event correlation},
-	url = {http://www.citeulike.org/user/nmsx/article/4505416},
+	www_section = {http://www.citeulike.org/user/nmsx/article/4505416},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/koch08confidence.pdf},
 	author = {Gerald G. Koch and Boris Koldehofe and Kurt Rothermel}
 }
@@ -3832,7 +3855,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
 	abstract = {In recent years, there have been several proposals for anonymous communication systems that provide intentional weaknesses to allow anonymity to be circumvented in special cases. These anonymity revocation schemes attempt to retain the properties of strong anonymity systems while granting a special class of people the ability to selectively break through their protections. We evaluate the two dominant classes of anonymity revocation systems, and identify fundamental flaws in their architecture, leading to a failure to ensure proper anonymity revocation, as well as introducing additional weaknesses for users not targeted for anonymity revocation},
 	isbn = {978-3-540-70629-8},
 	doi = {10.1007/978-3-540-70630-4},
-	url = {http://www.springerlink.com/content/179453h161722821/},
+	www_section = {http://www.springerlink.com/content/179453h161722821/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/sassaman-pet2008.pdf},
 	author = {George Danezis and Len Sassaman},
 	editor = {Borisov, Nikita and Ian Goldberg}
@@ -3851,7 +3874,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
 	keywords = {IBE, identity-based encryption, provable security, revocation},
 	isbn = {978-1-59593-810-7},
 	doi = {http://doi.acm.org/10.1145/1455770.1455823},
-	url = {http://doi.acm.org/10.1145/1455770.1455823},
+	www_section = {http://doi.acm.org/10.1145/1455770.1455823},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CCS\%2708\%20-\%20Identity-based\%20encryption\%20with\%20efficient\%20revocation.pdf},
 	author = {Boldyreva, Alexandra and Goyal, Vipul and Kumar, Virendra}
 }
@@ -3863,7 +3886,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
 	abstract = {IgorFs is a distributed, decentralized peer-to-peer (P2P) file system that is completely transparent to the user. It is built on top of the Igor peer-to-peer overlay network, which is similar to Chord, but provides additional features like service orientation or proximity neighbor and route selection. IgorFs offers an efficient means to publish data files that are subject to frequent but minor modifications. In our demonstration we show two use cases for IgorFs: the first example is (static) software-distribution and the second example is (dynamic) file distribution},
 	keywords = {distributed storage, P2P},
 	doi = {10.1109/P2P.2008.19},
-	url = {http://www.pubzone.org/dblp/conf/p2p/AmannEHF08},
+	www_section = {http://www.pubzone.org/dblp/conf/p2p/AmannEHF08},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/amann08igorfs.pdf},
 	author = {Bernhard Amann and Benedikt Elser and Yaser Houri and Thomas Fuhrmann}
 }
@@ -3880,7 +3903,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
 	keywords = {anonymity, attack},
 	isbn = {978-3-540-70629-8},
 	doi = {10.1007/978-3-540-70630-4_4},
-	url = {http://portal.acm.org/citation.cfm?id=1428263},
+	www_section = {http://portal.acm.org/citation.cfm?id=1428263},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/diaz-pet2008.pdf},
 	author = {Claudia Diaz and Carmela Troncoso and Andrei Serjantov},
 	editor = {Borisov, Nikita and Ian Goldberg}
@@ -3895,7 +3918,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
 	address = {San Jose, CA, US},
 	abstract = {The Tor anonymisation network allows services, such as web servers, to be operated under a pseudonym. In previous work Murdoch described a novel attack to reveal such hidden services by correlating clock skew changes with times of increased load, and hence temperature. Clock skew measurement suffers from two main sources of noise: network jitter and timestamp quantisation error. Depending on the target{\textquoteright}s clock frequency the quantisation noise can be orders of magnitude larger than the noise caused by typical network jitter. Quantisation noise limits the previous attacks to situations where a high frequency clock is available. It has been hypothesised that by synchronising measurements to the clock ticks, quantisation noise can be reduced. We show how such synchronisation can be achieved and maintained, despite network jitter. Our experiments show that synchronised sampling significantly reduces the quantisation error and the remaining noise only depends on the network jitter (but not clock frequency). Our improved skew estimates are up to two magnitudes more accurate for low-resolution timestamps and up to one magnitude more accurate for high-resolution timestamps, when compared to previous random sampling techniques. The improved accuracy not only allows previous attacks to be executed faster and with less network traffic but also opens the door to previously infeasible attacks on low-resolution clocks, including measuring skew of a HTTP server over the anonymous channel},
 	keywords = {anonymity, pseudonym, Tor},
-	url = {http://portal.acm.org/citation.cfm?id=1496726},
+	www_section = {http://portal.acm.org/citation.cfm?id=1496726},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/improved-clockskew.pdf},
 	author = {Sebastian Zander and Steven J. Murdoch}
 }
@@ -3913,7 +3936,7 @@ Additionally, the open-source software projects latency proxy and libspe, which 
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/reardon-thesis.pdf},
 	author = {Reardon, Joel}
 }
-@conference {2008,
+@conference {2008_7,
 	title = {Improving User and ISP Experience through ISP-aided P2P Locality},
 	booktitle = {GI{\textquoteright}08. Proceedings of 11th IEEE Global Internet Symposium 2008},
 	year = {2008},
@@ -3942,7 +3965,7 @@ We study this trade-off in two P2P anonymous systems, Salsa and AP3. In both cas
 	keywords = {anonymity, attack, information leaks, P2P},
 	isbn = {978-1-59593-810-7},
 	doi = {10.1145/1455770.1455805},
-	url = {http://portal.acm.org/citation.cfm?id=1455805},
+	www_section = {http://portal.acm.org/citation.cfm?id=1455805},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ccs2008-mittal.pdf},
 	author = {Prateek Mittal and Borisov, Nikita},
 	editor = {Paul Syverson and Somesh Jha and Xiaolan Zhang}
@@ -3960,7 +3983,7 @@ We study this trade-off in two P2P anonymous systems, Salsa and AP3. In both cas
 	keywords = {distributed hash table, erasure coding, peer-to-peer networking, redundancy, Replication},
 	issn = {0920-8542},
 	doi = {10.1007/s11227-007-0126-4},
-	url = {http://dl.acm.org/citation.cfm?id=1331483.1331515},
+	www_section = {http://dl.acm.org/citation.cfm?id=1331483.1331515},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Journal\%20of\%20Supercomputing\%20-\%20Insight\%20into\%20redundancy\%20schemes\%20in\%20DHTs.pdf},
 	author = {Chen, Guihai and Qiu, Tongqing and Wu, Fan}
 }
@@ -3984,7 +4007,7 @@ We study this trade-off in two P2P anonymous systems, Salsa and AP3. In both cas
 	keywords = {BitTorrent, emulation, evaluation, network, peer-to-peer, virtualization},
 	issn = {1532-0634},
 	doi = {10.1002/cpe.1242},
-	url = {http://dx.doi.org/10.1002/cpe.1242},
+	www_section = {http://dx.doi.org/10.1002/cpe.1242},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p2plab-cpe.pdf},
 	author = {Nussbaum, Lucas and Richard, Olivier}
 }
@@ -3999,7 +4022,7 @@ We study this trade-off in two P2P anonymous systems, Salsa and AP3. In both cas
 
 Experiments on data sets from bioinformatics, text processing and computer security illustrate the efficiency of the proposed algorithms---enabling peak performances of up to 106 pairwise comparisons per second. The utility of distances and non-metric similarity measures for sequences as alternatives to string kernels is demonstrated in applications of text categorization, network intrusion detection and transcription site recognition in DNA},
 	issn = {1532-4435},
-	url = {http://portal.acm.org/citation.cfm?id=1390683$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1390683$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/jmlr08.pdf},
 	author = {Rieck, Konrad and Laskov, Pavel}
 }
@@ -4016,7 +4039,7 @@ Experiments on data sets from bioinformatics, text processing and computer secur
 	keywords = {scalable source routing},
 	issn = {1532-0626},
 	doi = {10.1002/cpe.v20:6},
-	url = {http://portal.acm.org/citation.cfm?id=1358302.1358311$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1358302.1358311$\#$},
 	author = {Di, Pengfei and Johannes Eickhold and Thomas Fuhrmann}
 }
 @conference {murdoch-pet2008,
@@ -4031,7 +4054,7 @@ Experiments on data sets from bioinformatics, text processing and computer secur
 	keywords = {anonymity, Tor},
 	isbn = {978-3-540-70629-8},
 	doi = {10.1007/978-3-540-70630-4_8},
-	url = {http://portal.acm.org/citation.cfm?id=1428259.1428267},
+	www_section = {http://portal.acm.org/citation.cfm?id=1428259.1428267},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/murdoch-pet2008.pdf},
 	author = {Steven J. Murdoch and Robert N. M. Watson},
 	editor = {Borisov, Nikita and Ian Goldberg}
@@ -4047,7 +4070,7 @@ Experiments on data sets from bioinformatics, text processing and computer secur
 	address = {ICST, Brussels, Belgium, Belgium},
 	keywords = {network emulation, routing, user-mode Linux, virtual laboratories},
 	isbn = {978-963-9799-24-0},
-	url = {http://dl.acm.org/citation.cfm?id=1390576.1390585},
+	www_section = {http://dl.acm.org/citation.cfm?id=1390576.1390585},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/a7-pizzonia.pdf},
 	author = {Pizzonia, Maurizio and Rimondini, Massimo}
 }
@@ -4064,7 +4087,7 @@ Experiments on data sets from bioinformatics, text processing and computer secur
 	keywords = {ad-hoc networks, byzantine fault tolerance, on-demand routing, security model},
 	issn = {1094-9224},
 	doi = {10.1145/1284680.1341892},
-	url = {http://portal.acm.org/citation.cfm?id=1284680.1341892$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1284680.1341892$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ODSBR-TISSEC.pdf},
 	author = {Awerbuch, Baruch and Curtmola, Reza and Holmer, David and Nita-Rotaru, Cristina and Rubens, Herbert}
 }
@@ -4082,7 +4105,7 @@ Experiments on data sets from bioinformatics, text processing and computer secur
 	keywords = {mechanism design, money burning, optimal mechanism design},
 	isbn = {978-1-60558-047-0},
 	doi = {http://doi.acm.org/10.1145/1374376.1374390},
-	url = {http://doi.acm.org/10.1145/1374376.1374390},
+	www_section = {http://doi.acm.org/10.1145/1374376.1374390},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/STOC\%2708\%20-\%20Optimal\%20mechanism\%20design\%20and\%20money\%20burning.pdf},
 	author = {Jason D. Hartline and Roughgarden, Tim}
 }
@@ -4099,7 +4122,7 @@ Experiments on data sets from bioinformatics, text processing and computer secur
 	keywords = {network application, network architecture, P2P},
 	issn = {0146-4833},
 	doi = {http://doi.acm.org/10.1145/1402946.1402999},
-	url = {http://doi.acm.org/10.1145/1402946.1402999},
+	www_section = {http://doi.acm.org/10.1145/1402946.1402999},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%20Comput.\%20Commun.\%20Rev.\%20-\%20P4P\%3A\%20Provider\%20Portal\%20for\%20Applications.pdf},
 	author = {Xie, Haiyong and Yang, Y. Richard and Krishnamurthy, Arvind and Liu, Yanbin Grace and Silberschatz, Abraham}
 }
@@ -4116,7 +4139,7 @@ Experiments on data sets from bioinformatics, text processing and computer secur
 In this paper, we demonstrate a payment scheme that can be used to compensate nodes which provide anonymity in Tor, an existing onion routing, anonymizing network. We show that current anonymous payment schemes are not suitable and introduce a hybrid payment system based on a combination of the Peppercoin Micropayment system and a new type of {\textquotedblleft}one use{\textquotedblright} electronic cash. Our system claims to maintain users{\textquoteright} anonymity, although payment techniques mentioned previously {\textendash} when adopted individually {\textendash} provably fail},
 	keywords = {anonymity, onion routing, Tor},
 	doi = {10.1007/978-3-540-70630-4},
-	url = {http://www.springerlink.com/content/r1h1046823587382/},
+	www_section = {http://www.springerlink.com/content/r1h1046823587382/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/raykova-pet2008.pdf},
 	author = {Elli Androulaki and Mariana Raykova and Shreyas Srivatsan and Angelos Stavrou and Steven M. Bellovin},
 	editor = {Borisov, Nikita and Ian Goldberg}
@@ -4133,7 +4156,7 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
 	keywords = {non-membership proofs, subjective blacklisting},
 	isbn = {978-1-59593-810-7},
 	doi = {10.1145/1455770.1455813},
-	url = {http://portal.acm.org/citation.cfm?id=1455813},
+	www_section = {http://portal.acm.org/citation.cfm?id=1455813},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/perea-ccs08.pdf},
 	author = {Patrick P. Tsang and Man Ho Au and Apu Kapadia and Sean Smith},
 	editor = {Paul Syverson and Somesh Jha and Xiaolan Zhang}
@@ -4149,7 +4172,7 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
 	address = {Leuven, Belgium},
 	abstract = {Traffic analysis is the best known approach to uncover relationships amongst users of anonymous communication systems, such as mix networks. Surprisingly, all previously published techniques require very specific user behavior to break the anonymity provided by mixes. At the same time, it is also well known that none of the considered user models reflects realistic behavior which casts some doubt on previous work with respect to real-life scenarios. We first present a user behavior model that, to the best of our knowledge, is the least restrictive scheme considered so far. Second, we develop the Perfect Matching Disclosure Attack, an efficient attack based on graph theory that operates without any assumption on user behavior. The attack is highly effective when de-anonymizing mixing rounds because it considers all users in a round at once, rather than single users iteratively. Furthermore, the extracted sender-receiver relationships can be used to enhance user profile estimations. We extensively study the effectiveness and efficiency of our attack and previous work when de-anonymizing users communicating through a threshold mix. Empirical results show the advantage of our proposal. We also show how the attack can be refined and adapted to different scenarios including pool mixes, and how precision can be traded in for speed, which might be desirable in certain cases },
 	keywords = {mix, traffic analysis},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.4953},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.4953},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/troncoso-pet2008.pdf},
 	author = {Carmela Troncoso and Benedikt Gierlichs and Bart Preneel and Ingrid Verbauwhede},
 	editor = {Borisov, Nikita and Ian Goldberg}
@@ -4166,7 +4189,7 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
 	keywords = {anonymity, performance, privacy, statistical analysis},
 	isbn = {978-0-7695-3297-4},
 	doi = {10.1109/SAINT.2008.69},
-	url = {http://portal.acm.org/citation.cfm?id=1441426.1441996},
+	www_section = {http://portal.acm.org/citation.cfm?id=1441426.1441996},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/loesing2008performance.pdf},
 	author = {Karsten Loesing and Werner Sandmann and Christian Wilms and Guido Wirtz}
 }
@@ -4185,11 +4208,11 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
 	keywords = {network size estimation, structured overlays},
 	isbn = {978-3-540-92156-1},
 	doi = {http://dx.doi.org/10.1007/978-3-540-92157-8_7},
-	url = {http://dx.doi.org/10.1007/978-3-540-92157-8_7},
+	www_section = {http://dx.doi.org/10.1007/978-3-540-92157-8_7},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IWSOS\%2708\%20-\%20Network\%20Size\%20Estimation\%20for\%20Structured\%20Overlays.pdf},
 	author = {Shafaat, Tallat M. and Ali Ghodsi and Seif Haridi}
 }
-@article {2008,
+@article {2008_8,
 	title = {Privacy guarantees through distributed constraint satisfaction},
 	number = {12},
 	year = {2008},
@@ -4212,7 +4235,7 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
 	isbn = {978-0-387-70992-5},
 	author = {Aggarwal, Charu C. and Yu, Philip S.}
 }
-@article {2008,
+@article {2008_9,
 	title = {Progressive Strategies for Monte-Carlo Tree Search},
 	journal = {New Mathematics and Natural Computation},
 	volume = {4},
@@ -4232,7 +4255,7 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
 	address = {St. Petersburg, U.S},
 	abstract = {Key based routing (KBR) enables peer-to-peer applications to create and use distributed services. KBR is more flexible than distributed hash tables (DHT). However, the broader the application area, the more important become performance issues for a KBR service. In this paper, we present a novel approach to provide a generic KBR service. Its key idea is to use a predictable address assignment scheme. This scheme allows peers to calculate the overlay address of the node that is responsible for a given key and application ID. A public DHT service such as OpenDHT can then resolve this overlay address to the transport address of the respective peer. We compare our solution to alternative proposals such as ReDiR and Diminished Chord. We conclude that our solution has a better worst case complexity for some important KBR operations and the required state. In particular, unlike ReDiR, our solution can guarantee a low latency for KBR route operations },
 	keywords = {distributed hash table, P2P},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/di08iptps.pdf},
 	author = {Di, Pengfei and Kendy Kutzner and Thomas Fuhrmann}
 }
@@ -4248,7 +4271,7 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
 	abstract = {We propose a probabilistic system model for anonymous ad hoc routing protocols that takes into account the a priori knowledge of the adversary, and illustrate how the information theoretical entropy can be used for quantification of the anonymity offered by a routing protocol as the adversary captures an increasing number of nodes in the network. The proposed measurement schema is applied to ANODR and ARM routing protocols},
 	keywords = {ad-hoc networks, anonymity, routing, security model},
 	doi = {10.1016/j.entcs.2009.07.041},
-	url = {http://portal.acm.org/citation.cfm?id=1619033},
+	www_section = {http://portal.acm.org/citation.cfm?id=1619033},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/quant-adhoc.pdf},
 	author = {Marie Elisabeth Gaup Moe}
 }
@@ -4266,7 +4289,7 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
 	keywords = {as, autonomus system, bgp, incentives},
 	isbn = {978-1-60558-175-0},
 	doi = {http://doi.acm.org/10.1145/1402958.1402989},
-	url = {http://doi.acm.org/10.1145/1402958.1402989},
+	www_section = {http://doi.acm.org/10.1145/1402958.1402989},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%2708\%20-\%20Rationality\%20and\%20traffic\%20attraction.pdf},
 	author = {Goldberg, Sharon and Halevi, Shai and Jaggard, Aaron D. and Ramachandran, Vijay and Wright, Rebecca N.}
 }
@@ -4283,12 +4306,12 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
 	keywords = {anonymity, P2P, pseudonym},
 	isbn = {978-3-540-70629-8},
 	doi = {10.1007/978-3-540-70630-4_13},
-	url = {http://portal.acm.org/citation.cfm?id=1428259.1428272},
+	www_section = {http://portal.acm.org/citation.cfm?id=1428259.1428272},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/getTechreport.pdf},
 	author = {Elli Androulaki and Seung Geol Choi and Steven M. Bellovin and Tal Malkin},
 	editor = {Borisov, Nikita and Ian Goldberg}
 }
-@conference {2008,
+@conference {2008_10,
 	title = {Robust De-anonymization of Large Sparse Datasets},
 	booktitle = {Proceedings of the 2008 IEEE Symposium on Security and Privacy},
 	year = {2008},
@@ -4299,7 +4322,7 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
 	keywords = {anonymity, attack, privacy},
 	isbn = {978-0-7695-3168-7},
 	doi = {10.1109/SP.2008.33},
-	url = {http://dx.doi.org/10.1109/SP.2008.33},
+	www_section = {http://dx.doi.org/10.1109/SP.2008.33},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Deanonymization2008narayanan.pdf},
 	author = {Narayanan, Arvind and Shmatikov, Vitaly}
 }
@@ -4318,7 +4341,7 @@ To sample the results, we show that web traffic makes up the majority of the con
 	keywords = {anonymity, Tor},
 	isbn = {978-3-540-70629-8},
 	doi = {10.1007/978-3-540-70630-4_5},
-	url = {http://portal.acm.org/citation.cfm?id=1428264},
+	www_section = {http://portal.acm.org/citation.cfm?id=1428264},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mccoy-pet2008.pdf},
 	author = {Damon McCoy and Kevin Bauer and Dirk Grunwald and Tadayoshi Kohno and Douglas Sicker},
 	editor = {Borisov, Nikita and Ian Goldberg}
@@ -4336,10 +4359,10 @@ To sample the results, we show that web traffic makes up the majority of the con
 	keywords = {distributed hash table, P2P, routing},
 	issn = {1389-1286},
 	doi = {10.1016/j.comnet.2008.07.014},
-	url = {http://portal.acm.org/citation.cfm?id=1461118$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1461118$\#$},
 	author = {Wang, Chih-Chiang and Harfoush, Khaled}
 }
-@booklet {2008,
+@booklet {2008_11,
 	title = {The Spontaneous Virtual Networks Architecture for Supporting Future Internet Services and Applications},
 	year = {2008},
 	note = {Vortrag auf dem Fachgespr{\"a}ch der GI/ITG-Fachgruppe {\textquoteleft}{\textquoteleft}Kommunikation und Verteilte Systeme{\textquoteright}{\textquoteright} Future Internet},
@@ -4370,7 +4393,7 @@ To sample the results, we show that web traffic makes up the majority of the con
 	publisher = {Microsoft Research},
 	abstract = {We present an overview of the field of anonymous communications, from its establishment in 1981 from David Chaum to today. Key systems are presented categorized according to their underlying principles: semi-trusted relays, mix systems, remailers, onion routing, and systems to provide robust mixing. We include extended discussions of the threat models and usage models that different schemes provide, and the trade-offs between the security properties offered and the communication characteristics different systems support},
 	keywords = {onion routing, robustness},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.7951},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.7951},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DD08Survey.pdf},
 	author = {George Danezis and Claudia Diaz}
 }
@@ -4397,7 +4420,7 @@ To sample the results, we show that web traffic makes up the majority of the con
 	keywords = {capabilities, fault-tolerance, P2P},
 	isbn = {978-1-60558-299-3},
 	doi = {10.1145/1456469.1456474},
-	url = {http://portal.acm.org/citation.cfm?id=1456474$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1456474$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/lafs.pdf},
 	author = {Wilcox-O{\textquoteright}Hearn, Zooko and Warner, Brian}
 }
@@ -4409,11 +4432,11 @@ To sample the results, we show that web traffic makes up the majority of the con
 	publisher = {Dept. of Computer Science, Universit{\"a}t Karlsruhe (TH)},
 	type = {Interner Bericht},
 	abstract = {Simulations have been a valuable and much used tool in networking research for decades. New protocols are evaluated by simulations. Often, competing designs are judged by their respective performance in simulations. Despite this great importance the state-of-the-art in network simulations is nevertheless still low. A recent survey showed that most publications in a top conference did not even give enough details to repeat the simulations. In this paper we go beyond repeatability and ask: Are different simulations comparable? We study various implementations of the IEEE 802.11 media access layer in ns-2 and OMNeT++ and report some dramatic differences. These findings indicate that two protocols cannot be compared meaningfully unless they are compared in the very same simulation environment. We claim that this problem limits the value of the respective publications because readers are forced to re-implement the work that is described in the paper rather than building on its results. Facing the additional problem that not all authors will agree on one simulator, we address ways of making different simulators comparable},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/towards_comparable_network_simulations.pdf},
 	author = {Di, Pengfei and Yaser Houri and Kendy Kutzner and Thomas Fuhrmann}
 }
-@conference {2008,
+@conference {2008_12,
 	title = {Towards Empirical Aspects of Secure Scalar Product},
 	booktitle = {Information Security and Assurance, 2008. ISA 2008. International Conference on},
 	year = {2008},
@@ -4437,7 +4460,7 @@ To sample the results, we show that web traffic makes up the majority of the con
 	keywords = {peer-to-peer networking, social-based, taste buddies},
 	issn = {1532-0626},
 	doi = {http://dx.doi.org/10.1002/cpe.v20:2},
-	url = {http://dl.acm.org/citation.cfm?id=1331115.1331119},
+	www_section = {http://dl.acm.org/citation.cfm?id=1331115.1331119},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Concurrency\%20and\%20Computation\%20-\%20TRIBLER.pdf},
 	author = {Johan Pouwelse and Garbacki, Pawel and Jun Wang and Arno Bakker and Jie Yang and Alexandru Iosup and Epema, Dick H. J. and Marcel J. T. Reinders and van Steen, Maarten and Henk J. Sips}
 }
@@ -4453,7 +4476,7 @@ To sample the results, we show that web traffic makes up the majority of the con
 	keywords = {authentication, distributed systems, P2P, PKI, trust},
 	isbn = {978-3-540-69484-7},
 	doi = {10.1007/978-3-540-69485-4},
-	url = {http://www.springerlink.com/content/k6786282r5378k42/},
+	www_section = {http://www.springerlink.com/content/k6786282r5378k42/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/AuthenticationEuroPKI2008.pdf},
 	author = {Ralph Holz and Heiko Niedermayer and Hauck, Peter and Carle, Georg}
 }
@@ -4467,11 +4490,11 @@ To sample the results, we show that web traffic makes up the majority of the con
 	abstract = {The Tor anonymous communication network uses selfreported bandwidth values to select routers for building tunnels. Since tunnels are allocated in proportion to this bandwidth, this allows a malicious router operator to attract tunnels for compromise. Since the metric used is insensitive to relative load, it does not adequately respond to changing conditions and hence produces unreliable performance, driving many users away. We propose an opportunistic bandwidth measurement algorithm to replace selfreported values and address both of these problems. We also propose a mechanisms to let users tune Tor performance to achieve higher performance or higher anonymity. Our mechanism effectively blends the traffic from users of different preferences, making partitioning attacks difficult. We implemented the opportunistic measurement and tunable performance extensions and examined their performance both analytically and in the real Tor network. Our results show that users can get dramatic increases in either performance or anonymity with little to no sacrifice in the other metric, or a more modest improvement in both. Our mechanisms are also invulnerable to the previously published low-resource attacks on Tor },
 	keywords = {anonymity, Tor},
 	doi = {10.1109/NCM.2009.205},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.7368},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.7368},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/snader08.pdf},
 	author = {Robin Snader and Borisov, Nikita}
 }
-@conference {2008,
+@conference {2008_13,
 	title = {The Underlay Abstraction in the Spontaneous Virtual Networks (SpoVNet) Architecture},
 	booktitle = {Proc. 4th EuroNGI Conf. on Next Generation Internet Networks (NGI 2008)},
 	year = {2008},
@@ -4479,19 +4502,19 @@ To sample the results, we show that web traffic makes up the majority of the con
 	address = {Krakow, Poland},
 	abstract = {Next generation networks will combine many heterogeneous access technologies to provide services to a large number of highly mobile users while meeting their demands for quality of service, robustness, and security. Obviously, this is not a trivial task and many protocols fulfilling some combination of these requirements have been proposed. However, non of the current proposals meets all requirements, and the deployment of new applications and services is hindered by a patchwork of protocols. This paper presents Spontaneous Virtual Networks (SpoVNet), an architecture that fosters the creation of new applications and services for next generation networks by providing an underlay abstraction layer. This layer applies an overlay-based approach to cope with mobility, multi-homing, and heterogeneity. For coping with network mobility, it uses a SpoVNet-specific addressing scheme, splitting node identifiers from network locators and providing persistent connections by transparently switching locators. To deal with multihoming it transparently chooses the most appropriate pair of network locators for each connection. To cope with network and protocol heterogeneity, it uses dedicated overlay nodes, e.g., for relaying between IPv4 and IPv6 hosts},
 	keywords = {heterogeneity, robustness},
-	url = {http://www.tm.uka.de/itm/WebMan/view.php?view=publikationen_detail\&id=283},
+	www_section = {http://www.tm.uka.de/itm/WebMan/view.php?view=publikationen_detail\&id=283},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/underlayabs-ngi08-final.pdf},
 	author = {Roland Bless and H{\"u}bsch, Christian and Sebastian Mies and Oliver Waldhorst}
 }
-@article {2008,
+@article {2008_14,
 	title = {Unerkannt. Anonymisierende Peer-to-Peer-Netze im {\"U}berblick},
 	journal = {iX magazin f{\"u}r professionelle informationstechnik},
 	year = {2008},
 	type = {Survey},
-	url = {http://www.heise.de/kiosk/archiv/ix/2008/9/88_Anonyme-Peer-to-Peer-Netze-im-Ueberblick},
+	www_section = {http://www.heise.de/kiosk/archiv/ix/2008/9/88_Anonyme-Peer-to-Peer-Netze-im-Ueberblick},
 	author = {Nils Durner and Nathan S Evans and Christian Grothoff}
 }
-@article {2008,
+@article {2008_15,
 	title = {What Can We Learn Privately?},
 	journal = {CoRR},
 	volume = {abs/0803.0924},
@@ -4514,11 +4537,11 @@ To sample the results, we show that web traffic makes up the majority of the con
 	keywords = {file-sharing, networks, P2P, peer-to-peer networking},
 	isbn = {978-1-60558-075-3},
 	doi = {http://doi.acm.org/10.1145/1409540.1409546},
-	url = {http://doi.acm.org/10.1145/1409540.1409546},
+	www_section = {http://doi.acm.org/10.1145/1409540.1409546},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EC\%2708\%20-\%20Why\%20share\%20in\%20peer-to-peer\%20networks.pdf},
 	author = {Jian, Lian and MacKie-Mason, Jeffrey K.}
 }
-@conference {Garbacki:2007:ATP:1270401.1271766,
+@conference {Garbacki:2007:ATP:1270401.1271766_0,
 	title = {An Amortized Tit-For-Tat Protocol for Exchanging Bandwidth instead of Content in P2P Networks},
 	booktitle = {SASO 2007. Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems},
 	series = {SASO {\textquoteright}07},
@@ -4532,7 +4555,7 @@ To sample the results, we show that web traffic makes up the majority of the con
 	keywords = {bandwidth exchange, p2p network, resource sharing, tit-for-tat},
 	isbn = {0-7695-2906-2},
 	doi = {http://dx.doi.org/10.1109/SASO.2007.9},
-	url = {http://dx.doi.org/10.1109/SASO.2007.9},
+	www_section = {http://dx.doi.org/10.1109/SASO.2007.9},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SASO\%2707\%20-\%20Garbacki\%2C\%20Epema\%20\%26\%20van\%20Steen.pdf},
 	author = {Garbacki, Pawel and Epema, Dick H. J. and van Steen, Maarten}
 }
@@ -4549,11 +4572,11 @@ To sample the results, we show that web traffic makes up the majority of the con
 	abstract = {Incentives for resource sharing are crucial for the proper operation of P2P networks. The principle of the incentive mechanisms in current content sharing P2P networks such as BitTorrent is to have peers exchange content of mutual interest. As a consequence, a peer can actively participate in the system only if it shares content that is of immediate interest to other peers. In this paper we propose to lift this restriction by using bandwidth rather than content as the resource upon which incentives are based. Bandwidth, in contrast to content, is independent of peer interests and so can be exchanged between any two peers. We present the design of a protocol called amortized tit-for-tat (ATFT) based on the bandwidth-exchange concept. This protocol defines mechanisms for bandwidth exchange corresponding to those in BitTorrent for content exchange, in particular for finding bandwidth borrowers that amortize the bandwidth borrowed in the past with their currently idle bandwidth. In addition to the formally proven incentives for bandwidth contributions, ATFT provides natural solutions to the problems of peer bootstrapping, seeding incentive, peer link asymmetry, and anonymity, which have previously been addressed with much more complex designs. Experiments with a realworld dataset confirm that ATFT is efficient in enforcing bandwidth contributions and results in download performance better than provided by incentive mechanisms based on content exchange},
 	isbn = {0-7695-2906-2},
 	doi = {http://dx.doi.org/10.1109/SASO.2007.9},
-	url = {http://dx.doi.org/10.1109/SASO.2007.9},
+	www_section = {http://dx.doi.org/10.1109/SASO.2007.9},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SASO\%2707\%20-\%20Garbacki\%2C\%20Epema\%20\%26\%20van\%20Steen.pdf},
 	author = {Garbacki, Pawel and Epema, Dick H. J. and van Steen, Maarten}
 }
-@article {2007,
+@article {2007_0,
 	title = {Analyzing Peer Behavior in KAD},
 	number = {RR-07-205},
 	year = {2007},
@@ -4564,7 +4587,7 @@ To sample the results, we show that web traffic makes up the majority of the con
 	abstract = {Distributed hash tables (DHTs) have been actively studied in literature and many different proposals have been made on how to organize peers in a DHT. However, very few DHTs have been implemented in real systems and deployed on a large scale. One exception is KAD, a DHT based on Kademlia, which is part of eDonkey2000, a peer-to-peer file sharing system with several million simultaneous users. We have been crawling KAD continuously for about six months and obtained information about geographical distribution of peers, session times, peer availability, and peer lifetime. We also evaluated to what extent information about past peer uptime can be used to predict the remaining uptime of the peer. Peers are identified by the so called KAD ID, which was up to now as- sumed to remain the same across sessions. However, we observed that this is not the case: There is a large number of peers, in particular in China, that change their KAD ID, sometimes as frequently as after each session. This change of KAD IDs makes it difficult to characterize end-user availability or membership turnover. By tracking end-users with static IP addresses, we could measure the rate of change of KAD ID per end-user},
 	keywords = {distributed hash table, KAD, peer behavior},
 	issn = {RR-07-205},
-	url = {http://www.eurecom.fr/~btroup/kadtraces/},
+	www_section = {http://www.eurecom.fr/~btroup/kadtraces/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Tech\%20Report\%20-\%20Analyzing\%20peer\%20behavior\%20in\%20KAD.pdf},
 	author = {Steiner, Moritz and En-Najjary, Taoufik and E W Biersack}
 }
@@ -4574,7 +4597,7 @@ To sample the results, we show that web traffic makes up the majority of the con
 	month = {October},
 	abstract = {The problem of security against packet timing based traffic analysis in wireless networks is considered in this work. An analytical measure of "anonymity" of routes in eavesdropped networks is proposed using the information-theoretic equivocation. For a physical layer with orthogonal transmitter directed signaling, scheduling and relaying techniques are designed to maximize achievable network performance for any desired level of anonymity. The network performance is measured by the total rate of packets delivered from the sources to destinations under strict latency and medium access constraints. In particular, analytical results are presented for two scenarios: For a single relay that forwards packets from m users, relaying strategies are provided that minimize the packet drops when the source nodes and the relay generate independent transmission schedules. A relay using such an independent scheduling strategy is undetectable by an eavesdropper and is referred to as a covert relay. Achievable rate regions are characterized under strict and average delay constraints on the traffic, when schedules are independent Poisson processes. For a multihop network with an arbitrary anonymity requirement, the problem of maximizing the sum-rate of flows (network throughput) is considered. A randomized selection strategy to choose covert relays as a function of the routes is designed for this purpose. Using the analytical results for a single covert relay, the strategy is optimized to obtain the maximum achievable throughput as a function of the desired level of anonymity. In particular, the throughput-anonymity relation for the proposed strategy is shown to be equivalent to an information-theoretic rate-distortion function},
 	keywords = {Rate-Distortion, secrecy, traffic analysis},
-	url = {http://cat.inist.fr/?aModele=afficheN\&cpsidt=20411836},
+	www_section = {http://cat.inist.fr/?aModele=afficheN\&cpsidt=20411836},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/0710.4903v1.pdf},
 	author = {Parvathinathan Venkitasubramaniam and Ting He and Lang Tong}
 }
@@ -4587,7 +4610,7 @@ To sample the results, we show that web traffic makes up the majority of the con
 	abstract = {A major problem in tracking objects in sensor networks is trading off update traffic and timeliness of the data that is available to a monitoring site. Typically, either all objects regularly update some central registry with their location information, or the monitoring instance floods the network with a request when it needs information for a particular object. More sophisticated approaches use a P2P-like distributed storage structure on top of geographic routing. The applicability of the latter is limited to certain topologies, and having separate storage and routing algorithms reduces efficiency. In this paper, we present a different solution which is based on the scalable source routing (SSR) protocol. SSR is a network layer routing protocol that has been inspired by distributed hash tables (DHT). It provides key-based routing in large networks of resource-limited devices such as sensor networks. We argue that this approach is more suitable for object tracking in sensor networks because it evenly spreads the updates over the whole network without being limited to a particular network topology. We support our argument with extensive simulations},
 	keywords = {distributed hash table, scalable source routing},
 	isbn = {978-1-4244-1454-3},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/di07mass.pdf},
 	author = {Di, Pengfei and Yaser Houri and Qing Wei and J{\"o}rg Widmer and Thomas Fuhrmann}
 }
@@ -4605,11 +4628,11 @@ To sample the results, we show that web traffic makes up the majority of the con
 	keywords = {ABE, BDH, Decisional bilinear diffie-hellman, encryption, non-monotonic access},
 	isbn = {978-1-59593-703-2},
 	doi = {http://doi.acm.org/10.1145/1315245.1315270},
-	url = {http://doi.acm.org/10.1145/1315245.1315270},
+	www_section = {http://doi.acm.org/10.1145/1315245.1315270},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CCS\%2707\%20-\%20ABE\%20with\%20non-monotonic\%20access\%20structures.pdf},
 	author = {Rafail Ostrovsky and Amit Sahai and Waters, Brent}
 }
-@book {2007,
+@book {2007_1,
 	title = {B.A.T.M.A.N Status Report},
 	year = {2007},
 	abstract = {This report documents the current status of the development and implementation of the B.A.T.M.A.N (better approach to mobile ad-hoc networking) routing protocol. B.A.T.M.A.N uses a simple and robust algorithm for establishing multi-hop routes in mobile ad-hoc networks.It ensures highly adaptive and loop-free routing while causing only low processing and traffic cost},
@@ -4629,7 +4652,7 @@ We present the first anonymous credential system in which services can "blacklis
 	keywords = {privacy, revocation, user misbehavior},
 	isbn = {978-1-59593-703-2},
 	doi = {10.1145/1315245.1315256},
-	url = {http://portal.acm.org/citation.cfm?id=1315245.1315256},
+	www_section = {http://portal.acm.org/citation.cfm?id=1315245.1315256},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ccs07-blac.pdf},
 	author = {Patrick P. Tsang and Man Ho Au and Apu Kapadia and Sean Smith}
 }
@@ -4650,7 +4673,7 @@ For validation, we simulate a network with one million low-end peers and show Bu
 	keywords = {exhaustive search, peer-to-peer networking, resilience, simulation},
 	issn = {0146-4833},
 	doi = {http://doi.acm.org/10.1145/1282427.1282387},
-	url = {http://doi.acm.org/10.1145/1282427.1282387},
+	www_section = {http://doi.acm.org/10.1145/1282427.1282387},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%20Computers\%20Communication\%20Review\%20-\%20Bubblestorm.pdf},
 	author = {Terpstra, Wesley W. and Jussi Kangasharju and Leng, Christof and Buchmann, Alejandro P.}
 }
@@ -4662,7 +4685,7 @@ For validation, we simulate a network with one million low-end peers and show Bu
 	publisher = {Katholieke Universiteit Leuven},
 	abstract = {Over the last several decades, there have been numerous proposals for systems which can preserve the anonymity of the recipient of some data. Some have involved trusted third-parties or trusted hardware; others have been constructed on top of link-layer anonymity systems or mix-nets. In this paper, we evaluate a pseudonymous message system which takes the different approach of using Private Information Retrieval (PIR) as its basis. We expose a flaw in the system as presented: it fails to identify Byzantine servers. We provide suggestions on correcting the flaw, while observing the security and performance trade-offs our suggestions require},
 	keywords = {anonymity, private information retrieval, pseudonym},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.1013},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.1013},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cosic-2007-001.pdf},
 	author = {Len Sassaman and Bart Preneel}
 }
@@ -4677,7 +4700,7 @@ For validation, we simulate a network with one million low-end peers and show Bu
 	abstract = {Due to the high availability of the Internet, many large cross-organization collaboration projects, such as SourceForge, grid systems etc., have emerged. One of the fundamental requirements of these collaboration efforts is a storage system to store and exchange data. This storage system must be highly scalable and can efficiently aggregate the storage resources contributed by the participating organizations to deliver good performance for users. In this paper, we propose a storage system, Collaborative File Repository (CFR), for large scale collaboration projects. CFR uses peer-to-peer techniques to achieve scalability, efficiency, and ease of management. In CFR, storage nodes contributed by the participating organizations are partitioned according to geographical regions. Files stored in CFR are automatically replicated to all regions. Furthermore, popular files are duplicated to other storage nodes of the same region. By doing so, data transfers between users and storage nodes are confined within their regions and transfer efficiency is enhanced. Experiments show that our replication can achieve high efficiency with a small number of duplicates},
 	keywords = {P2P, storage},
 	isbn = {978-3-540-72359-2},
-	url = {http://portal.acm.org/citation.cfm?id=1759877\&dl=GUIDE\&coll=GUIDE$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1759877\&dl=GUIDE\&coll=GUIDE$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.108.7110.pdf},
 	author = {Lin, Meng-Ru and Lu, Ssu-Hsuan and Ho, Tsung-Hsuan and Lin, Peter and Chung, Yeh-Ching}
 }
@@ -4695,7 +4718,7 @@ While large-scale multiplayer games have typically used a client/server architec
 We propose solving the consistency problem through secure and scalable event ordering. While traditional event ordering requires all-to-all message passing and at least two rounds of communication, we argue that multiplayer games lend themselves naturally to a hierarchical decomposition of their state space so that we can reduce the communication cost of event ordering. We also argue that by using cryptography, a discrete view of time, and majority voting, we can totally order events in a real-time setting. By applying these two concepts, we can scale multiplayer games to millions of players.
 
 We develop our solution in two parts: a cheat-proof and real-time event ordering protocol and a scalable, hierarchical structure that organizes peers in a tree according to their scope of interest in the game. Our work represents the first, complete solution to this problem and we show through both proofs and simulations that our protocols allow the creation of large-scale, peer-to-peer games that are resistant to cheating while maintaining real-time responsiveness in the system},
-	url = {http://portal.acm.org/citation.cfm?id=1329865$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1329865$\#$},
 	author = {Chis GauthierDickey}
 }
 @article {Lee2007CISS,
@@ -4710,7 +4733,7 @@ We develop our solution in two parts: a cheat-proof and real-time event ordering
 	keywords = {distributed hash table, load balancing, Multi-dimensional range query, Object clustering, Peer-to-peer application},
 	issn = {1389-1286},
 	doi = {10.1016/j.comnet.2006.07.005},
-	url = {http://dx.doi.org/10.1016/j.comnet.2006.07.005},
+	www_section = {http://dx.doi.org/10.1016/j.comnet.2006.07.005},
 	author = {Lee, Jinwon and Lee, Hyonik and Kang, Seungwoo and Kim, Su Myeon and Song, Junehwa}
 }
 @conference {conf/acsac/ADC07,
@@ -4723,7 +4746,7 @@ We develop our solution in two parts: a cheat-proof and real-time event ordering
 	keywords = {latency, unobservability, VoIP},
 	isbn = {0-7695-3060-5},
 	doi = {10.1109/ACSAC.2007.34},
-	url = {http://www.computer.org/portal/web/csdl/doi/10.1109/ACSAC.2007.34},
+	www_section = {http://www.computer.org/portal/web/csdl/doi/10.1109/ACSAC.2007.34},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ADC07.pdf},
 	author = {Carlos Aguilar Melchor and Yves Deswarte and Julien Iguchi-Cartigny}
 }
@@ -4737,7 +4760,7 @@ We develop our solution in two parts: a cheat-proof and real-time event ordering
 	keywords = {anonymity},
 	isbn = {142441329X},
 	doi = {10.1109/ISI.2007.379497},
-	url = {http://www.mendeley.com/research/a-combinatorial-approach-to-measuring-anonymity/},
+	www_section = {http://www.mendeley.com/research/a-combinatorial-approach-to-measuring-anonymity/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EdmanSY07.pdf},
 	author = {Matthew Edman and Fikret Sivrikaya and B{\"u}lent Yener}
 }
@@ -4756,18 +4779,18 @@ In this paper, we demonstrate that in view of recent results in compact routing 
 	keywords = {compact routing, internet routing, routing scalability},
 	issn = {0146-4833},
 	doi = {10.1145/1273445.1273450},
-	url = {http://portal.acm.org/citation.cfm?id=1273450$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1273450$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.102.5763.pdf},
 	author = {Krioukov, Dmitri and Fall, Kevin and Brady, Arthur}
 }
-@mastersthesis {2007,
+@mastersthesis {2007_2,
 	title = {Cooperative Data Backup for Mobile Devices},
 	volume = {Ph.D},
 	year = {2007},
 	month = mar,
 	abstract = {Mobile devices such as laptops, PDAs and cell phones are increasingly relied on but are used in contexts that put them at risk of physical damage, loss or theft. However, few mechanisms are available to reduce the risk of losing the data stored on these devices. In this dissertation, we try to address this concern by designing a cooperative backup service for mobile devices. The service leverages encounters and spontaneous interactions among participating devices, such that each device stores data on behalf of other devices. We first provide an analytical evaluation of the dependability gains of the proposed service. Distributed storage mechanisms are explored and evaluated. Security concerns arising from thecooperation among mutually suspicious principals are identified, and core mechanisms are proposed to allow them to be addressed. Finally, we present our prototype implementation of the cooperative backup service},
 	keywords = {backup, dependability, P2P, ubiquitous computing},
-	url = {http://ethesis.inp-toulouse.fr/archive/00000544/},
+	www_section = {http://ethesis.inp-toulouse.fr/archive/00000544/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/phd-thesis.fr_en.pdf},
 	author = {Ludovic Courtes}
 }
@@ -4796,7 +4819,7 @@ In this paper, we demonstrate that in view of recent results in compact routing 
 	keywords = {anonymity, cover traffic, privacy},
 	isbn = {978-3-540-74834-2},
 	doi = {10.1007/978-3-540-74835-9},
-	url = {http://www.springerlink.com/content/k2146538700m71v7/},
+	www_section = {http://www.springerlink.com/content/k2146538700m71v7/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/MalleshW07.pdf},
 	author = {Nayantara Mallesh and Matthew Wright},
 	editor = {Joachim Biskup and Javier Lopez}
@@ -4813,7 +4836,7 @@ In the military context, for which multilevel secure systems were designed, cove
 I show how side channels (unintended information leakage) in anonymity networks may reveal the behaviour of users. While drawing on previous research on traffic analysis and covert channels, I avoid the traditional assumption of an omnipotent adversary. Rather, these attacks are feasible for an attacker with limited access to the network. The effectiveness of these techniques is demonstrated by experiments on a deployed anonymity network, Tor.
 Finally, I introduce novel covert and side channels which exploit thermal effects. Changes in temperature can be remotely induced through CPU load and measured by their effects on crystal clock skew. Experiments show this to be an effective attack against Tor. This side channel may also be usable for geolocation and, as a covert channel, can cross supposedly infallible air-gap security boundaries.
 This thesis demonstrates how theoretical models and generic methodologies relating to covert channels may be applied to find practical solutions to problems in real-world anonymity systems. These findings confirm the existing hypothesis that covert channel analysis, vulnerabilities and defences developed for multilevel secure systems apply equally well to anonymity systems},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.5142},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.5142},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/steven-thesis.pdf},
 	author = {Steven J. Murdoch}
 }
@@ -4828,7 +4851,7 @@ This thesis demonstrates how theoretical models and generic methodologies relati
 	keywords = {anonymity, attack, denial-of-service, reliability},
 	isbn = {978-1-59593-703-2},
 	doi = {10.1145/1315245.1315258},
-	url = {http://portal.acm.org/citation.cfm?id=1315258},
+	www_section = {http://portal.acm.org/citation.cfm?id=1315258},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ccs07-doa.pdf},
 	author = {Borisov, Nikita and George Danezis and Prateek Mittal and Parisa Tabriz}
 }
@@ -4843,7 +4866,7 @@ This thesis demonstrates how theoretical models and generic methodologies relati
 	abstract = {Mobile devices (e.g., laptops, PDAs, cell phones) are increasingly relied on but are used in contexts that put them at risk of physical damage, loss or theft. This paper discusses the dependability evaluation of a cooperative backup service for mobile devices. Participating devices leverage encounters with other devices to temporarily replicate critical data. Permanent backups are created when the participating devices are able to access the fixed infrastructure. Several data replication and scattering strategies are presented,including the use of erasure codes. A methodology to model and evaluate them using Petri nets and Markov chains is described. We demonstrate that our cooperative backup service decreases the probability of data loss by a factor up to the ad hoc to Internet connectivity ratio},
 	isbn = {0-7695-3054-0},
 	doi = {10.1109/PRDC.2007.29},
-	url = {http://portal.acm.org/citation.cfm?id=1345534.1345798$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1345534.1345798$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.65.8269_0.pdf},
 	author = {Ludovic Courtes and Hamouda, Ossama and Kaaniche, Mohamed and Killijian, Marc-Olivier and Powell, David}
 }
@@ -4860,11 +4883,11 @@ This thesis demonstrates how theoretical models and generic methodologies relati
 In this paper, we investigate this claim against other low latency anonymous networks, including Tarzan and Morphmix. Our results show that in contrast to the claim of the aforementioned paper, the attack may not be applicable in all cases. Based on our analysis, we draw design principles for secure low latency anonymous network system (also secure against the above attack)},
 	keywords = {anonymity, latency, Morphmix, Tarzan, timing attack, Tor},
 	isbn = {1-920-68285-X},
-	url = {http://portal.acm.org/citation.cfm?id=1274553},
+	www_section = {http://portal.acm.org/citation.cfm?id=1274553},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/wiangsripanawan-acsw07.pdf},
 	author = {Rungrat Wiangsripanawan and Willy Susilo and Rei Safavi-Naini}
 }
-@conference {Piatek:2007:IBR:1973430.1973431,
+@conference {Piatek:2007:IBR:1973430.1973431_0,
 	title = {Do incentives build robustness in BitTorrent?},
 	booktitle = {NSDI{\textquoteright}07. Proceedings of the 4th USENIX Conference on Networked Systems Design Implementation},
 	series = {NSDI{\textquoteright}07},
@@ -4876,7 +4899,7 @@ In this paper, we investigate this claim against other low latency anonymous net
 	address = {Cambridge, MA, USA},
 	abstract = {A fundamental problem with many peer-to-peer systems is the tendency for users to "free ride"--to consume resources without contributing to the system. The popular file distribution tool BitTorrent was explicitly designed to address this problem, using a tit-for-tat reciprocity strategy to provide positive incentives for nodes to contribute resources to the swarm. While BitTorrent has been extremely successful, we show that its incentive mechanism is not robust to strategic clients. Through performance modeling parameterized by real world traces, we demonstrate that all peers contribute resources that do not directly improve their performance. We use these results to drive the design and implementation of BitTyrant, a strategic BitTorrent client that provides a median 70\% performance gain for a 1 Mbit client on live Internet swarms. We further show that when applied universally, strategic clients can hurt average per-swarm performance compared to today{\textquoteright}s BitTorrent client implementations},
 	keywords = {BitTorrent, free riding, incentives, peer-to-peer networking},
-	url = {http://dl.acm.org/citation.cfm?id=1973430.1973431},
+	www_section = {http://dl.acm.org/citation.cfm?id=1973430.1973431},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NSDI\%2707\%20-\%20Do\%20incentives\%20build\%20robustness\%20in\%20BitTorrent.pdf},
 	author = {Piatek, Michael and Isdal, Tomas and Anderson, Thomas and Krishnamurthy, Arvind and Venkataramani, Arun}
 }
@@ -4891,7 +4914,7 @@ In this paper, we investigate this claim against other low latency anonymous net
 	organization = {USENIX Association},
 	address = {Cambridge, MA, USA},
 	abstract = {A fundamental problem with many peer-to-peer systems is the tendency for users to "free ride"--to consume resources without contributing to the system. The popular file distribution tool BitTorrent was explicitly designed to address this problem, using a tit-for-tat reciprocity strategy to provide positive incentives for nodes to contribute resources to the swarm. While BitTorrent has been extremely successful, we show that its incentive mechanism is not robust to strategic clients. Through performance modeling parameterized by real world traces, we demonstrate that all peers contribute resources that do not directly improve their performance. We use these results to drive the design and implementation of BitTyrant, a strategic BitTorrent client that provides a median 70\% performance gain for a 1 Mbit client on live Internet swarms. We further show that when applied universally, strategic clients can hurt average per-swarm performance compared to today{\textquoteright}s BitTorrent client implementations},
-	url = {http://dl.acm.org/citation.cfm?id=1973430.1973431},
+	www_section = {http://dl.acm.org/citation.cfm?id=1973430.1973431},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NSDI\%2707\%20-\%20Do\%20incentives\%20build\%20robustness\%20in\%20BitTorrent.pdf},
 	author = {Piatek, Michael and Isdal, Tomas and Anderson, Thomas and Krishnamurthy, Arvind and Venkataramani, Arun}
 }
@@ -4908,7 +4931,7 @@ In this paper, we investigate this claim against other low latency anonymous net
 	keywords = {anonymity measurement, entropy, mix, user profiles},
 	isbn = {978-1-59593-883-1},
 	doi = {10.1145/1314333.1314347},
-	url = {http://portal.acm.org/citation.cfm?id=1314333.1314347},
+	www_section = {http://portal.acm.org/citation.cfm?id=1314333.1314347},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/diaz-wpes2007.pdf},
 	author = {Claudia Diaz and Carmela Troncoso and George Danezis},
 	editor = {Ting Yu}
@@ -4919,7 +4942,7 @@ In this paper, we investigate this claim against other low latency anonymous net
 	abstract = {Although recent years provided many protocols for anonymous routing in overlay networks, they commonly rely on the same communication paradigm: Onion Routing. In Onion Routing a static tunnel through an overlay network is build via layered encryption. All traffic exchanged by its end points is relayed through this tunnel. In contrast, this paper introduces dynamic multipath Onion Routing to extend the static Onion Routing paradigm. This approach allows each packet exchanged between two end points to travel along a different path. To provide anonymity the first half of this path is selected by the sender and the second half by the receiver of the packet. The results are manifold: First, dynamic multipath Onion Routing increases the resilience against threats, especially pattern and timing based analysis attacks. Second, the dynamic paths reduce the impact of misbehaving and overloaded relays. Finally, inspired by Internet routing, the forwarding nodes do not need to maintain any state about ongoing flows and so reduce the complexity of the router. In this paper, we describe the design of our dynamic Multipath Onion RoutEr (MORE) for peer-to-peer overlay networks, and evaluate its performance. Furthermore, we integrate address virtualization to abstract from Internet addresses and provide transparent support for IP applications. Thus, no application-level gateways, proxies or modifications of applications are required to sanitize protocols from network level information. Acting as an IP-datagram service, our scheme provides a substrate for anonymous communication to a wide range of applications using TCP and UDP},
 	keywords = {onion routing, overlay networks, P2P},
 	isbn = {978-1-4244-1043-9 },
-	url = {http://ieeexplore.ieee.org/Xplore/login.jsp?url=http\%3A\%2F\%2Fieeexplore.ieee.org\%2Fiel5\%2F4410909\%2F4410910\%2F04410930.pdf\%3Farnumber\%3D4410930\&authDecision=-203},
+	www_section = {http://ieeexplore.ieee.org/Xplore/login.jsp?url=http\%3A\%2F\%2Fieeexplore.ieee.org\%2Fiel5\%2F4410909\%2F4410910\%2F04410930.pdf\%3Farnumber\%3D4410930\&authDecision=-203},
 	author = {Olaf Landsiedel and Alexis Pimenidis and Klaus Wehrle}
 }
 @conference {Coulom:2006:ESB:1777826.1777833,
@@ -4934,7 +4957,7 @@ In this paper, we investigate this claim against other low latency anonymous net
 	abstract = {A Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations. The method can serve as an evaluation function at the leaves of a min-max tree. This paper presents a new framework to combine tree search with Monte-Carlo evaluation, that does not separate between a min-max phase and a Monte-Carlo phase. Instead of backing-up the min-max value close to the root, and the average value at some depth, a more general backup operator is defined that progressively changes from averaging to minmax as the number of simulations grows. This approach provides a finegrained control of the tree growth, at the level of individual simulations, and allows efficient selectivity. The resulting algorithm was implemented in a 9 {\texttimes} 9 Go-playing program, Crazy Stone, that won the 10th KGS computer-Go tournament},
 	keywords = {framework, MCTS, Monte-Carlo Tree Search},
 	isbn = {3-540-75537-3, 978-3-540-75537-1},
-	url = {http://dl.acm.org/citation.cfm?id=1777826.1777833},
+	www_section = {http://dl.acm.org/citation.cfm?id=1777826.1777833},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CG\%2706\%20-\%20Selectivity\%20and\%20backup\%20operators\%20in\%20MCTS.pdf},
 	author = {Coulom, R{\'e}mi}
 }
@@ -4959,7 +4982,7 @@ In this paper, we investigate this claim against other low latency anonymous net
 	keywords = {overlay, PlanetLab, topology},
 	isbn = {0-7695-2805-8},
 	doi = {10.1109/ICN.2007.40},
-	url = {http://dl.acm.org/citation.cfm?id=1260204.1260647},
+	www_section = {http://dl.acm.org/citation.cfm?id=1260204.1260647},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ICN\%2707\%20-\%20PlanetLab.pdf},
 	author = {Tang, Li and Chen, Yin and Li, Fei and Zhang, Hui and Li, Jun}
 }
@@ -4983,7 +5006,7 @@ In this paper, we investigate this claim against other low latency anonymous net
 	pages = {2252{\textendash}2260},
 	abstract = {Dual-radio, dual-processor nodes are an emerging class of Wireless Sensor Network devices that provide both lowenergy operation as well as substantially increased computational performance and communication bandwidth for applications. In such systems, the secondary radio and processor operates with sufficiently low power that it may remain always vigilant, while the the main processor and primary, high-bandwidth radio remain off until triggered by the application. By exploiting the high energy efficiency of the main processor and primary radio along with proper usage, net operating energy benefits are enabled for applications. The secondary radio provides a constantly available multi-hop network, while paths in the primary network exist only when required. This paper describes a topology control mechanism for establishing an end-to-end path in a network of dual-radio nodes using the secondary radios as a control channel to selectively wake up nodes along the required end-to-end path. Using numerical models as well as testbed experimentation, we show that our proposed mechanism provides significant energy savings of more than 60 \% compared to alternative approaches, and that it incurs only moderately greater application latency},
 	keywords = {routing, wireless sensor network},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.8984},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.8984},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Stathopoulos07a.pdf},
 	author = {Thanos Stathopoulos and Heidemann, John and Martin Lukac and Deborah Estrin and William J. Kaiser}
 }
@@ -5000,7 +5023,7 @@ In this paper, we investigate this claim against other low latency anonymous net
 	abstract = {In structured peer-to-peer (P2P) networks participating peers can join or leave the system at arbitrary times, a process which is known as churn. Many recent studies revealed that churn is one of the main problems faced by any Distributed Hash Table (DHT). In this paper we discuss different possibilities of how to estimate the current churn rate in the system. In particular, we show how to obtain a robust estimate which is independent of the implementation details of the DHT. We also investigate the trade-offs between accuracy, overhead, and responsiveness to changes},
 	keywords = {churn, distributed hash table, P2P, peer-to-peer networking},
 	isbn = {978-3-540-72989-1},
-	url = {http://dl.acm.org/citation.cfm?id=1769187.1769257},
+	www_section = {http://dl.acm.org/citation.cfm?id=1769187.1769257},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ITC-20\%2707\%20-\%20Estimating\%20churn\%20in\%20structured\%20p2p\%20networks.pdf},
 	author = {Binzenh{\"o}fer, Andreas and Leibnitz, Kenji}
 }
@@ -5015,7 +5038,7 @@ In this paper, we investigate this claim against other low latency anonymous net
 	keywords = {P2P},
 	isbn = {978-1-4244-0992-1},
 	doi = {10.1109/WOWMOM.2007.4351805},
-	url = {http://www.computer.org/portal/web/csdl/doi/10.1109/WOWMOM.2007.4351805},
+	www_section = {http://www.computer.org/portal/web/csdl/doi/10.1109/WOWMOM.2007.4351805},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/oualno-070618.pdf},
 	author = {Nouha Oualha and Pietro Michiardi and Yves Roudier}
 }
@@ -5029,7 +5052,7 @@ In this paper, we investigate this claim against other low latency anonymous net
 	keywords = {anonymity, Gnutella},
 	isbn = {978-3-540-75650-7},
 	doi = {10.1007/978-3-540-75651-4},
-	url = {http://www.springerlink.com/content/8120788t0l354vj6/},
+	www_section = {http://www.springerlink.com/content/8120788t0l354vj6/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/AthanRAM07.pdf},
 	author = {Elias Athanasopoulos and Mema Roussopoulos and Kostas G. Anagnostakis and Evangelos P. Markatos}
 }
@@ -5049,11 +5072,11 @@ Peers are identified by the so called KAD ID, which was up to now assumed to rem
 	keywords = {distributed hash table, lookup, peer-to-peer networking},
 	isbn = {978-1-59593-908-1},
 	doi = {http://doi.acm.org/10.1145/1298306.1298323},
-	url = {http://doi.acm.org/10.1145/1298306.1298323},
+	www_section = {http://doi.acm.org/10.1145/1298306.1298323},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IMC\%2707\%20-\%20A\%20global\%20view\%20of\%20KAD.pdf},
 	author = {Steiner, Moritz and En-Najjary, Taoufik and E W Biersack}
 }
-@article {2007,
+@article {2007_3,
 	title = {Gossip-based Peer Sampling},
 	journal = {ACM Trans. Comput. Syst},
 	volume = {25},
@@ -5062,11 +5085,11 @@ Peers are identified by the so called KAD ID, which was up to now assumed to rem
 	keywords = {epidemic protocols, Gossip-based protocols, peer sampling service},
 	issn = {0734-2071},
 	doi = {10.1145/1275517.1275520},
-	url = {http://doi.acm.org/10.1145/1275517.1275520},
+	www_section = {http://doi.acm.org/10.1145/1275517.1275520},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/GossipPeerSampling2007Jelasity.pdf},
 	author = {Jelasity, M{\'a}rk and Voulgaris, Spyros and Guerraoui, Rachid and Kermarrec, Anne-Marie and van Steen, Maarten}
 }
-@article {2007,
+@article {2007_4,
 	title = {Gossiping in Distributed Systems},
 	journal = {SIGOPS Oper. Syst. Rev},
 	volume = {41},
@@ -5075,7 +5098,7 @@ Peers are identified by the so called KAD ID, which was up to now assumed to rem
 	abstract = {Gossip-based algorithms were first introduced for reliably disseminating data in large-scale distributed systems. However, their simplicity, robustness, and flexibility make them attractive for more than just pure data dissemination alone. In particular, gossiping has been applied to data aggregation, overlay maintenance, and resource allocation. Gossiping applications more or less fit the same framework, with often subtle differences in algorithmic details determining divergent emergent behavior. This divergence is often difficult to understand, as formal models have yet to be developed that can capture the full design space of gossiping solutions. In this paper, we present a brief introduction to the field of gossiping in distributed systems, by providing a simple framework and using that framework to describe solutions for various application domains},
 	issn = {0163-5980},
 	doi = {10.1145/1317379.1317381},
-	url = {http://doi.acm.org/10.1145/1317379.1317381},
+	www_section = {http://doi.acm.org/10.1145/1317379.1317381},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Gossiping2007Kermarrrec.pdf},
 	author = {Kermarrec, Anne-Marie and van Steen, Maarten}
 }
@@ -5106,7 +5129,7 @@ Peers are identified by the so called KAD ID, which was up to now assumed to rem
 	keywords = {robustness},
 	issn = {0163-5980},
 	doi = {10.1145/1317379.1317383},
-	url = {http://doc.utwente.nl/64132/},
+	www_section = {http://doc.utwente.nl/64132/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/robustgossip-final.pdf},
 	author = {Lorenzo Alvisi and Jeroen Doumen and Rachid Guerraoui and Boris Koldehofe and Harry Li and Robbert Van Renesse and Gilles Tredan}
 }
@@ -5123,7 +5146,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
 	keywords = {public key cryptography, re-encryption},
 	isbn = {978-3-540-70935-0},
 	doi = {10.1007/978-3-540-70936-7},
-	url = {http://www.springerlink.com/content/j6p730488x602r28/},
+	www_section = {http://www.springerlink.com/content/j6p730488x602r28/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/adida07.pdf},
 	author = {Ben Adida and Douglas Wikstr{\"o}m}
 }
@@ -5140,7 +5163,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
 	abstract = {This paper describes the first identity-based broadcast encryption scheme (IBBE) with constant size ciphertexts and private keys. In our scheme, the public key is of size linear in the maximal size m of the set of receivers, which is smaller than the number of possible users (identities) in the system. Compared with a recent broadcast encryption system introduced by Boneh, Gentry and Waters (BGW), our system has comparable properties, but with a better efficiency: the public key is shorter than in BGW. Moreover, the total number of possible users in the system does not have to be fixed in the setup},
 	keywords = {ciphertext, encryption, IBBE, private key},
 	isbn = {3-540-76899-8, 978-3-540-76899-9},
-	url = {http://dl.acm.org/citation.cfm?id=1781454.1781471},
+	www_section = {http://dl.acm.org/citation.cfm?id=1781454.1781471},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ASIACRYPT\%2707\%20-\%20IBBE\%20with\%20constant\%20size\%20ciphertexts\%20and\%20private\%20keys.pdf},
 	author = {Delerabl{\'e}e, C{\'e}cile}
 }
@@ -5157,7 +5180,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
 	keywords = {ad-hoc networks, anonymity, identity-free routing, neighborhood management, network complexity theory},
 	issn = {1536-1233},
 	doi = {10.1109/TMC.2007.1021},
-	url = {http://portal.acm.org/citation.cfm?id=1272127},
+	www_section = {http://portal.acm.org/citation.cfm?id=1272127},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/KongHG07.pdf},
 	author = {Jiejun Kong and Xiaoyan Hong and Mario Gerla}
 }
@@ -5168,7 +5191,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
 	month = may,
 	address = {Anchorage, AK},
 	keywords = {EGOIST, game theory, routing},
-	url = {www.cs.bu.edu/techreports/pdf/2006-019-selfish-neighbor-selection.pdf},
+	www_section = {www.cs.bu.edu/techreports/pdf/2006-019-selfish-neighbor-selection.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Infocom2007-sns.pdf},
 	author = {Nikolaos Laoutaris and Georgios Smaragdakis and Azer Bestavros and Byers, John W.}
 }
@@ -5183,7 +5206,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
 	abstract = {In this paper we demonstrate how to reduce the overhead and delay of circuit establishment in the Tor anonymizing network by using predistributed Diffie-Hellman values. We eliminate the use of RSA encryption and decryption from circuit setup, and we reduce the number of DH exponentiations vs. the current Tor circuit setup protocol while maintaining immediate forward secrecy. We also describe savings that can be obtained by precomputing during idle cycles values that can be determined before the protocol starts. We introduce the distinction of eventual vs. immediate forward secrecy and present protocols that illustrate the distinction. These protocols are even more efficient in communication and computation than the one we primarily propose, but they provide only eventual forward secrecy. We describe how to reduce the overhead and the complexity of hidden server connections by using our DH-values to implement valet nodes and eliminate the need for rendezvous points as they exist today. We also discuss the security of the new elements and an analysis of efficiency improvements},
 	keywords = {public key cryptography},
 	doi = {10.1007/978-3-540-75551-7},
-	url = {http://www.springerlink.com/content/j68v312681l8v874/},
+	www_section = {http://www.springerlink.com/content/j68v312681l8v874/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/overlier-pet2007.pdf},
 	author = {Lasse {\O}verlier and Paul Syverson},
 	editor = {Borisov, Nikita and Philippe Golle}
@@ -5201,7 +5224,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
 	keywords = {mobile Ad-hoc networks, routing, VCG mechanism},
 	issn = {1574-1192},
 	doi = {10.1016/j.pmcj.2007.02.001},
-	url = {http://portal.acm.org/citation.cfm?id=1290327$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1290327$\#$},
 	author = {Wang, Yongwei and Singhal, Mukesh}
 }
 @conference {goldberg-2007,
@@ -5215,7 +5238,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
 	keywords = {private information retrieval, robustness},
 	isbn = {0-7695-2848-1},
 	doi = {10.1109/SP.2007.23},
-	url = {http://portal.acm.org/citation.cfm?id=1264203},
+	www_section = {http://portal.acm.org/citation.cfm?id=1264203},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/goldberg-2007.pdf},
 	author = {Ian Goldberg}
 }
@@ -5226,11 +5249,11 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
 	month = {April},
 	abstract = {This paper proposes a new approach to anonymous communication called information slicing. Typically, anonymizers use onion routing, where a message is encrypted in layers with the public keys of the nodes along the path. Instead, our approach scrambles the message, divides it into pieces, and sends the pieces along disjoint paths. We show that information slicing addresses message confidentiality as well as source and destination anonymity. Surprisingly, it does not need any public key cryptography. Further, our approach naturally addresses the problem of node failures. These characteristics make it a good fit for use over dynamic peer-to-peer overlays. We evaluate the anonymity ofinformation slicing via analysis and simulations. Our prototype implementation on PlanetLab shows that it achieves higher throughput than onion routing and effectively copes with node churn},
 	keywords = {anonymity, onion routing, P2P, privacy},
-	url = {http://dspace.mit.edu/handle/1721.1/36344a},
+	www_section = {http://dspace.mit.edu/handle/1721.1/36344a},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/slicing07.pdf},
 	author = {Sachin Katti and Jeffery Cohen and Dina Katabi}
 }
-@book {2007,
+@book {2007_5,
 	title = {The Iterated Prisoner{\textquoteright}s Dilemma: 20 Years On},
 	series = {Advances in Natural Computation},
 	volume = {4},
@@ -5250,7 +5273,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
 	year = {2007},
 	abstract = {has been made resistant to jamming by the use of a secret key that is shared by the sender and receiver. There are no known methods for achieving jam resistance without that shared key. Unfortunately, wireless communication is now reaching a scale and a level of importance where such secret-key systems are becoming impractical. For example, the civilian side of the Global Positioning System (GPS) cannot use a shared secret, since that secret would have to be given to all 6.5 billion potential users, and so would no longer be secret. So civilian GPS cannot currently be protected from jamming. But the FAA has stated that the civilian airline industry will transition to using GPS for all navigational aids, even during landings. A terrorist with a simple jamming system could wreak havoc at a major airport. No existing system can solve this problem, and the problem itself has not even been widely discussed. The problem of keyless jam resistance is important. There is a great need for a system that can broadcast messages without any prior secret shared between the sender and receiver. We propose the first system for keyless jam resistance: the BBC algorithm. We describe the encoding, decoding, and broadcast algorithms. We then analyze it for expected resistance to jamming and error rates. We show that BBC can achieve the same level of jam resistance as traditional spread spectrum systems, at just under half the bit rate, and with no shared secret. Furthermore, a hybrid system can achieve the same average bit rate as traditional systems},
 	keywords = {GPS},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.8217},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.8217},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.91.8217.pdf},
 	author = {Leemon C. Baird and William L. Bahn and Michael D. Collins and Martin C. Carlisle and Sean C. Butler}
 }
@@ -5286,11 +5309,11 @@ We investigate how Tor{\^a}s routing optimizations impact its ability to pro
 	keywords = {anonymity, load balancing, Tor, traffic analysis},
 	isbn = {978-1-59593-883-1},
 	doi = {10.1145/1314333.1314336},
-	url = {http://portal.acm.org/citation.cfm?id=1314336},
+	www_section = {http://portal.acm.org/citation.cfm?id=1314336},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/bauer-wpes2007.pdf},
 	author = {Kevin Bauer and Damon McCoy and Dirk Grunwald and Tadayoshi Kohno and Douglas Sicker}
 }
-@article {2007,
+@article {2007_6,
 	title = {Mapping an Arbitrary Message to an Elliptic Curve when Defined over GF (2n)},
 	journal = {International Journal of Network Security},
 	volume = {8},
@@ -5347,7 +5370,7 @@ message to an elliptic curve},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/INFOCOM\%2707\%20-\%20Mesh\%20or\%20multiple-tree.pdf},
 	author = {Magharei, Nazanin and Rejaie, Reza}
 }
-@book {2007,
+@book {2007_7,
 	title = {Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol},
 	booktitle = {Public Key Cryptography {\textendash} PKC 2007},
 	series = {Lecture Notes in Computer Science},
@@ -5362,7 +5385,7 @@ The realized protocols as well as the original protocol are constant-round and r
 	keywords = {Bitwise Sharing, Multiparty Computation, secret sharing},
 	isbn = {978-3-540-71676-1},
 	doi = {10.1007/978-3-540-71677-8_23},
-	url = {http://dx.doi.org/10.1007/978-3-540-71677-8_23},
+	www_section = {http://dx.doi.org/10.1007/978-3-540-71677-8_23},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/MultiPartyComputation2007Nishide.pdf},
 	author = {Nishide, Takashi and Ohta, Kazuo},
 	editor = {Okamoto, Tatsuaki and Wang, Xiaoyun}
@@ -5380,7 +5403,7 @@ The realized protocols as well as the original protocol are constant-round and r
 	keywords = {computer networks, congestion avoidance, routing protocols},
 	issn = {1063-6692},
 	doi = {http://dx.doi.org/10.1109/TNET.2007.892850},
-	url = {http://dx.doi.org/10.1109/TNET.2007.892850},
+	www_section = {http://dx.doi.org/10.1109/TNET.2007.892850},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IEEE\%E2\%81\%84ACM\%20Banner\%20\%26\%20Orda.pdf},
 	author = {Banner, Ron and Orda, Ariel}
 }
@@ -5398,11 +5421,11 @@ The realized protocols as well as the original protocol are constant-round and r
 	keywords = {distributed storage, network coding, peer-to-peer storage, Regenerating Codes},
 	issn = {0018-9448},
 	doi = {http://dx.doi.org/10.1109/TIT.2010.2054295},
-	url = {http://dx.doi.org/10.1109/TIT.2010.2054295},
+	www_section = {http://dx.doi.org/10.1109/TIT.2010.2054295},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/INFOCOM\%2707\%20-\%20Network\%20coding\%20for\%20distributed\%20storage\%20systems.pdf},
 	author = {Dimakis, Alexandros G. and Godfrey, Brighten and Wu, Yunnan and Wainwright, Martin J. and Ramchandran, Kannan}
 }
-@conference {2007,
+@conference {2007_8,
 	title = {A New Efficient Privacy-preserving Scalar Product Protocol},
 	booktitle = {Proceedings of the Sixth Australasian Conference on Data Mining and Analytics - Volume 70},
 	year = {2007},
@@ -5416,17 +5439,17 @@ In privacy-preserving data mining, data is distributed across several parties. T
 Although several solutions exist in the relevant literature for this problem, the need for more efficient and more practical solutions still remains. In this paper, we present a very efficient and very practical secure scalar product protocol. We compare it to the most common scalar product protocols. We not only show that our protocol is much more efficient than the existing ones, we also provide experimental results by using a real life dataset},
 	keywords = {privacy preserving data mining},
 	isbn = {978-1-920682-51-4},
-	url = {http://dl.acm.org/citation.cfm?id=1378245.1378274},
+	www_section = {http://dl.acm.org/citation.cfm?id=1378245.1378274},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PrivacyPreserving2007Ambirbekyan.pdf},
 	author = {Amirbekyan, Artak and Estivill-Castro, Vladimir}
 }
-@conference {2007,
+@conference {2007_9,
 	title = {ParaNets: A Parallel Network Architecture for Challenged Networks},
 	year = {2007},
 	month = {March 2007 },
 	abstract = {Networks characterized by challenges, such as intermittent connectivity, network heterogeneity, and large delays, are called "challenged networks". We propose a novel network architecture for challenged networks dubbed Parallel Networks, or, ParaNets. The vision behind ParaNets is to have challenged network protocols operate over multiple heterogenous networks, simultaneously available, through one or more devices. We present the ParaNets architecture and discuss its short-term challenges and longterm implications. We also argue, based on current research trends and the ParaNets architecture, for the evolution of the conventional protocol stack to a more flexible cross-layered protocol tree. To demonstrate the potential impact of ParaNets, we use Delay Tolerant Mobile Networks (DTMNs) as a representative challenged network over which we evaluate ParaNets. Our ultimate goal in this paper is to open the way for further work in challenged networks using ParaNets as the underlying architecture},
 	isbn = {978-0-7695-3001-7},
-	url = {http://ieeexplore.ieee.org/Xplore/login.jsp?reload=true\&url=http\%3A\%2F\%2Fieeexplore.ieee.org\%2Fiel5\%2F4389542\%2F4389543\%2F04389561.pdf\%3Farnumber\%3D4389561\&authDecision=-203},
+	www_section = {http://ieeexplore.ieee.org/Xplore/login.jsp?reload=true\&url=http\%3A\%2F\%2Fieeexplore.ieee.org\%2Fiel5\%2F4389542\%2F4389543\%2F04389561.pdf\%3Farnumber\%3D4389561\&authDecision=-203},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/hotmobile07.pdf},
 	author = {Khaled A. Harras and Mike P. Wittie and Kevin C. Almeroth and Elizabeth M. Belding}
 }
@@ -5448,7 +5471,7 @@ Unlike OptAPO, PC-DPOP allows for a priory, exact predictions about privacy loss
 
 We also report strong efficiency gains over OptAPO in experiments on three problem domains},
 	keywords = {algorithms, distributed constraint optimization, DPOP, OptAPO, partial centralization technique},
-	url = {http://dl.acm.org/citation.cfm?id=1625275.1625301},
+	www_section = {http://dl.acm.org/citation.cfm?id=1625275.1625301},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IJCAI\%2707\%20-\%20PC-DPOP.pdf},
 	author = {Adrian Petcu and Boi Faltings and Mailler, Roger}
 }
@@ -5461,11 +5484,11 @@ We also report strong efficiency gains over OptAPO in experiments on three probl
 	address = {Obergurgl, Austria},
 	abstract = {Scalable source routing (SSR) is a novel routing approach for large unstructured networks such as mobile ad hoc networks, mesh networks, or sensor-actuator networks. It is especially suited for organically growing networks of many resource-limited mobile devices supported by a few fixed-wired nodes. SSR is a full-fledged network layer routing protocol that directly provides the semantics of a structured peer-to-peer network. Hence, it can serve as an efficient basis for fully decentralized applications on mobile devices. SSR combines source routing in the physical network with Chord-like routing in the virtual ring formed by the address space. Message forwarding greedily decreases the distance in the virtual ring while preferring physically short paths. Thereby, scalability is achieved without imposing artificial hierarchies or assigning location-dependent addresses},
 	keywords = {mobile Ad-hoc networks, P2P, scalable source routing},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann07wons.pdf},
 	author = {Thomas Fuhrmann}
 }
-@book {2007,
+@book {2007_10,
 	title = {Practical and Secure Solutions for Integer Comparison},
 	booktitle = {Public Key Cryptography {\textendash} PKC 2007},
 	series = {Lecture Notes in Computer Science},
@@ -5480,7 +5503,7 @@ In this paper, our focus is on the two-party case, although most of our results 
 	keywords = {homomorphic encryption, Millionaires{\textquoteright} problem, secure multi-party computation},
 	isbn = {978-3-540-71676-1},
 	doi = {10.1007/978-3-540-71677-8_22},
-	url = {http://dx.doi.org/10.1007/978-3-540-71677-8_22},
+	www_section = {http://dx.doi.org/10.1007/978-3-540-71677-8_22},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IntegerComparisonSolution2007Garay.pdf},
 	author = {Garay, Juan and Schoenmakers, Berry and Villegas, Jos{\'e}},
 	editor = {Okamoto, Tatsuaki and Wang, Xiaoyun}
@@ -5507,7 +5530,7 @@ In this paper, we follow a performance-driven approach to design PRIME, a scalab
 	keywords = {communication network, computer networks, Internet, multimedia communication, multimedia systems},
 	issn = {1063-6692},
 	doi = {http://dx.doi.org/10.1109/TNET.2008.2007434},
-	url = {http://dx.doi.org/10.1109/TNET.2008.2007434},
+	www_section = {http://dx.doi.org/10.1109/TNET.2008.2007434},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/INFOCOM\%2707\%20-\%20PRIME.pdf},
 	author = {Magharei, Nazanin and Rejaie, Reza}
 }
@@ -5563,7 +5586,7 @@ Anonymity protocols often use randomization to introduce noise, thus limiting th
 Then we aim at quantitative definitions of anonymity. We view protocols as noisy channels in the information-theoretic sense and we express their degree of anonymity as the converse of channel capacity. We apply this definition to two known anonymity protocols. We develop a monotonicity principle for the capacity, and use it to show a number of results for binary channels in the context of algebraic information theory. We then study the probability of error for the attacker in the context of Bayesian inference, showing that it is a piecewise linear function and using this fact to improve known bounds from the literature. 
 
 Finally we study a problem that arises when we combine probabilities with nondeterminism, where the scheduler is too powerful even for trivially secure protocols. We propose a process calculus which allows to express restrictions to the scheduler, and we use it in the analysis of an anonymity and a contract-signing protocol},
-	url = {http://www.win.tue.nl/~kostas/these/},
+	www_section = {http://www.win.tue.nl/~kostas/these/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kostas-thesis.pdf},
 	author = {Konstantinos Chatzikokolakis}
 }
@@ -5575,7 +5598,7 @@ Finally we study a problem that arises when we combine probabilities with nondet
 	keywords = {anonymity, privacy},
 	isbn = {0-7695-2819-8},
 	doi = {10.1109/CSF.2007.27},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.2620},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.2620},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ChatziPP07.pdf},
 	author = {Konstantinos Chatzikokolakis and Catuscia Palamidessi and Prakash Panangaden}
 }
@@ -5602,7 +5625,7 @@ Finally we study a problem that arises when we combine probabilities with nondet
 There exist two main strategies to reduce latency in the query routing process: Proximity Neighbor Selection and Proximity Route Selection. As a new proposal of PNS for the IGOR overlay network, Merivaldi is developed. Merivaldi represents a combination of two basic ideas: The first idea is the Meridian framework and its Closest-Node- Discovery without synthetic coordinates. The second idea is Vivaldi, a distributed algorithm for predicting Internet latency between arbitrary Internet hosts. Merivaldi is quite similar to Meridian. It differs in using no direct Round Trip Time measurements like Meridian does to obtain latency characteristics between hosts. Merivaldi obtains latency characteristics of nodes using the latency prediction derived from the Vivaldi-coordinates. A Merivaldi-node forms exponentially growing latency-rings, i.e., the rings correspond to latency distances to the Merivaldi-node itself. In these rings node-references are inserted with regard to their latency characteristics. These node-references are obtained through a special protocol. A Merivaldi-node finds latency-closest nodes through periodic querying its ring-members for closer nodes. If a closer node is found by a ring-member the query is forwarded to this one until no closer one can be found. The closest on this way reports itself to the Merivaldi-node.
 Exemplary analysis show that Merivaldi means only a modest burden for the network. Merivaldi uses O(log N) CND-hops at maximum to recognize a closest node, where N is the number of nodes. Empirical tests demonstrate this analysis. Analysis shows, the overhead for a Merivaldi-node is modest. It is shown that Merivaldi{\textquoteright}s Vivaldi works with high quality with the used PING-message type},
 	keywords = {IGOR, neighbor selection, overlay-network, proximity route selection},
-	url = {http://i30www.ira.uka.de/teaching/theses/pasttheses/},
+	www_section = {http://i30www.ira.uka.de/teaching/theses/pasttheses/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Kising\%20-\%20Proximity\%20Neighbor\%20Selection\%20for\%20IGOR.pdf},
 	author = {Yves Philippe Kising}
 }
@@ -5615,7 +5638,7 @@ Exemplary analysis show that Merivaldi means only a modest burden for the networ
 	organization = {USENIX Association},
 	address = {Berkeley, CA, USA},
 	abstract = {System configuration management is difficult because systems evolve in an undisciplined way: packages are upgraded, configuration files are edited, and so on. The management of existing operating systems is strongly imperative in nature, since software packages and configuration data (e.g., /bin and /etc in Unix) can be seen as imperative data structures: they are updated in-place by system administration actions. In this paper we present an alternative approach to system configuration management: a purely functional method, analogous to languages like Haskell. In this approach, the static parts of a configuration -- software packages, configuration files, control scripts -- are built from pure functions, i.e., the results depend solely on the specified inputs of the function and are immutable. As a result, realising a system configuration becomes deterministic and reproducible. Upgrading to a new configuration is mostly atomic and doesn{\textquoteright}t overwrite anything of the old configuration, thus enabling rollbacks. We have implemented the purely functional model in a small but realistic Linux-based operating system distribution called NixOS},
-	url = {http://portal.acm.org/citation.cfm?id=1361410$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1361410$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/dolstra.pdf},
 	author = {Dolstra, Eelco and Hemel, Armijn}
 }
@@ -5634,7 +5657,7 @@ in a testbed of 800 nodes using minor modifications to Clarke and Sandberg{\text
 
 We also discuss various proposed countermeasures designed to detect, thwart or limit the attack. While we were unable to find effective countermeasures, we hope that the presented analysis will be a first step towards the design of secure distributed routing algorithms for restricted-route topologies},
 	keywords = {denial-of-service, Freenet, installation, routing},
-	url = {http://grothoff.org/christian/pitchblack.pdf},
+	www_section = {http://grothoff.org/christian/pitchblack.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pitchblack.pdf},
 	author = {Nathan S Evans and Chis GauthierDickey and Christian Grothoff}
 }
@@ -5652,7 +5675,7 @@ We also discuss various proposed countermeasures designed to detect, thwart or l
 	author = {Steven J. Murdoch and Piotr Zieli{\'n}ski},
 	editor = {Borisov, Nikita and Philippe Golle}
 }
-@mastersthesis {2007,
+@mastersthesis {2007_11,
 	title = {Secure asynchronous change notifications for a distributed file system},
 	volume = {Computer Science},
 	year = {2007},
@@ -5681,7 +5704,7 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
 	abstract = {A fundamental building block of secure group communication is the establishment of a common group key. This can be divided into key agreement and key distribution. Common group key agreement protocols are based on the Diffie-Hellman (DH) key exchange and extend it to groups. Group key distribution protocols are centralized approaches which make use of one or more special key servers. In contrast to these approaches, we present a protocol which makes use of the Tree Parity Machine key exchange between multiple parties. It does not need a centralized server and therefore is especially suitable for ad-hoc networks of any kind},
 	keywords = {ad-hoc networks},
 	isbn = {978-3-8007-2980-7},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.9413},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.9413},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/saballus07secure.pdf},
 	author = {Bjoern Saballus and Sebastian Wallner and Markus Volkmer}
 }
@@ -5698,7 +5721,7 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
 	keywords = {internet coordinates-embedding systems, kalman filter, malicious behavior detection, network positioning systems, security},
 	issn = {0146-4833},
 	doi = {http://doi.acm.org/10.1145/1282427.1282388},
-	url = {http://doi.acm.org/10.1145/1282427.1282388},
+	www_section = {http://doi.acm.org/10.1145/1282427.1282388},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%20Comput.\%20Commun.\%20Rev.\%20-\%20Securing\%20Internet\%20Coordinate\%20Embedding\%20Systems.pdf},
 	author = {Kaafar, Mohamed Ali and Laurent Mathy and Barakat, Chadi and Salamatian, Kave and Turletti, Thierry and Dabbous, Walid}
 }
@@ -5717,7 +5740,7 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
 	keywords = {accounting, multimedia, peer-to-peer networking, security},
 	isbn = {978-1-59593-933-3},
 	doi = {http://doi.acm.org/10.1145/1377934.1377937},
-	url = {http://doi.acm.org/10.1145/1377934.1377937},
+	www_section = {http://doi.acm.org/10.1145/1377934.1377937},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/MDS\%2707\%20-\%20Conner\%20\%26\%20Nahrstedt\%20-\%20Securing\%20peer-to-peer\%20media\%20streaming\%20systems.pdf},
 	author = {Conner, William and Nahrstedt, Klara}
 }
@@ -5729,7 +5752,7 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
 	abstract = {Mobile devices (e.g., laptops, PDAs, cell phones) are increasingly relied on but are used in contexts that put them at risk of physical damage, loss or theft. This paper discusses security considerations that arise in the design of a cooperative backup service for mobile devices. Participating devices leverage encounters with other devices to temporarily replicate critical data. Anyone is free to participate in the cooperative service, without requiring any prior trust relationship with other participants. In this paper, we identify security threats relevant in this context as well as possible solutions and discuss how they map to low-level security requirements related to identity and trust establishment. We propose self-organized, policy-neutral mechanisms that allow the secure designation and identification of participating devices. We show that they can serve as a building block for a wide range of cooperation policies that address most of the security threats we are concerned with. We conclude on future directions},
 	keywords = {backup, reputation, self-organization},
 	doi = {10.1007/978-3-540-75294-3},
-	url = {http://www.springerlink.com/content/p210q274g22j8g77/},
+	www_section = {http://www.springerlink.com/content/p210q274g22j8g77/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.106.5673.pdf},
 	author = {Ludovic Courtes and Killijian, Marc-Olivier and Powell, David}
 }
@@ -5744,7 +5767,7 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
 	abstract = {Security is a common problem in completely decentralized peer-to-peer systems. Although several suggestions exist on how to create a secure key-based routing protocol, a practicable approach is still unattended. In this paper we introduce a secure key-based routing protocol based on Kademlia that has a high resilience against common attacks by using parallel lookups over multiple disjoint paths, limiting free nodeId generation with crypto puzzles and introducing a reliable sibling broadcast. The latter is needed to store data in a safe replicated way. We evaluate the security of our proposed extensions to the Kademlia protocol analytically and simulate the effects of multiple disjoint paths on lookup success under the influence of adversarial nodes},
 	isbn = {978-1-4244-1889-3},
 	doi = {10.1109/ICPADS.2007.4447808},
-	url = {http://portal.acm.org/citation.cfm?id=1396915$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1396915$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SKademlia2007.pdf},
 	author = {Baumgart, Ingmar and Sebastian Mies}
 }
@@ -5760,7 +5783,7 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
 	keywords = {distributed interactive applications, P2P},
 	isbn = {978-0-9804460-0-5},
 	doi = {10.1145/1326257.1326260},
-	url = {http://portal.acm.org/citation.cfm?id=1326260$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1326260$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Triebel2007a.pdf},
 	author = {Triebel, Tonio and Guthier, Benjamin and Effelsberg, Wolfgang}
 }
@@ -5774,17 +5797,17 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
 	address = {Tobago},
 	abstract = {Private keyword search is a technique that allows for searching and retrieving documents matching certain keywords without revealing the search criteria. We improve the space efficiency of the Ostrovsky et al. Private Search [9] scheme, by describing methods that require considerably shorter buffers for returning the results of the search. Our basic decoding scheme recursive extraction, requires buffers of length less than twice the number of returned results and is still simple and highly efficient. Our extended decoding schemes rely on solving systems of simultaneous equations, and in special cases can uncover documents in buffers that are close to 95 \% full. Finally we note the similarity between our decoding techniques and the ones used to decode rateless codes, and show how such codes can be extracted from encrypted documents },
 	keywords = {keywords, privacy},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.7014},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.7014},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/privsearch-aeolus.pdf},
 	author = {George Danezis and Claudia Diaz}
 }
-@conference {2007,
+@conference {2007_12,
 	title = {SpoVNet: An Architecture for Supporting Future Internet Applications},
 	booktitle = {Proc. 7th W{\"u}rzburg Workshop on IP: Joint EuroFGI and ITG Workshop on Visions of Future Generation Networks{\textquoteright}},
 	year = {2007},
 	address = {W{\"u}rzburg, Germany},
 	abstract = {This talk presents an approach for providing Spontaneous Virtual Networks (SpoVNets) that enable flexible, adaptive, and spontaneous provisioning of application-oriented and network-oriented services on top of heterogeneous networks. SpoVNets supply new and uniform communication abstrac-tions for future Internet applications so applications can make use of advanced services not supported by today{\textquoteright}s Internet. We expect that many functions, which are currently provided by SpoVNet on the application layer will become an integral part of future networks. Thus, SpoVNet will transparently use advanced services from the underlying network infrastructure as they become available (e.g., QoS-support in access networks or multicast in certain ISPs), enabling a seamless transition from current to future genera-tion networks without modifying the applications},
-	url = {http://www.tm.uka.de/itm/publications.php?bib=257},
+	www_section = {http://www.tm.uka.de/itm/publications.php?bib=257},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SpoVNet.pdf , https://gnunet.org/git/bibliography.git/tree/docs/Mies\%20-\%20SpoVNet.pdf},
 	author = {Sebastian Mies}
 }
@@ -5797,7 +5820,7 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
 	address = {Enschede,NL},
 	abstract = {Information-theoretic private information retrieval (PIR) protocols, such as those described by Chor et al. [5], provide a mechanism by which users can retrieve information from a database distributed across multiple servers in such a way that neither the servers nor an outside observer can determine the contents of the data being retrieved. More recent PIR protocols also provide protection against Byzantine servers, such that a user can detect when one or more servers have attempted to tamper with the data he has requested. In some cases (as in the protocols presented by Beimel and Stahl [1]), the user can still recover his data and protect the contents of his query if the number of Byzantine servers is below a certain threshold; this property is referred to as Byzantine-recovery. However, tampering with a user{\textquoteright}s data is not the only goal a Byzantine server might have. We present a scenario in which an arbitrarily sized coalition of Byzantine servers transforms the userbase of a PIR network into a signaling framework with varying levels of detectability by means of a subliminal channel [11]. We describe several such subliminal channel techniques, illustrate several use-cases for this subliminal channel, and demonstrate its applicability to a wide variety of PIR protocols},
 	keywords = {private information retrieval},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.9190},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.9190},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ringstwice07.pdf},
 	author = {Meredith L. Patterson and Len Sassaman}
 }
@@ -5815,7 +5838,7 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
 	address = {Aachen, Germany},
 	abstract = {One of the major drawbacks of small embedded systems such as sensor nodes is the need to program in a low level programming language like C or assembler. The resulting code is often unportable, system specific and demands deep knowledge of the hardware details. This paper motivates the use of Java as an alternative programming language. We focus on the tiny AmbiComp Virtual Machine (ACVM) which we currently develop as the main part of a more general Java based development platform for interconnected sensor nodes. This VM is designed to run on different small embedded devices in a distributed network. It uses the novel scalable source routing (SSR) algorithm to distribute and share data and workload. SSR provides key based routing which enables distributed hash table (DHT) structures as a substrate for the VM to disseminate and access remote code and objects. This approach allows all VMs in the network to collaborate. The result looks like one large, distributed VM which supports a subset of the Java language. The ACVM substitutes functionality of an operating system which is missing on the target platform. As this development is work in progress, we outline the ideas behind this approach to provide first insights into the upcoming problems},
 	keywords = {distributed hash table, scalable source routing},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.7724},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.7724},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/saballus07distributed.pdf},
 	author = {Bjoern Saballus and Johannes Eickhold and Thomas Fuhrmann}
 }
@@ -5829,7 +5852,7 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
 
 We pose a grand challenge for anonymity: the development of a network architecture that enables applications to customize routes that tradeoff between anonymity and performance. Towards this challenge, we present the Application-Aware Anonymity (A3) routing service. We envision that A3 will serve as a powerful and flexible anonymous communications layer that will spur the future development of anonymity services},
 	keywords = {anonymity, routing},
-	url = {http://portal.acm.org/citation.cfm?id=1361423},
+	www_section = {http://portal.acm.org/citation.cfm?id=1361423},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/a3.pdf},
 	author = {Micah Sherr and Boon Thau and Matt Blaze}
 }
@@ -5844,7 +5867,7 @@ We pose a grand challenge for anonymity: the development of a network architectu
 	abstract = {Event dissemination in large scale dynamic systems is typically claimed to be best achieved using decentralized peer-to-peer architectures. The rationale is to have every participant in the system act both as a client (information consumer) and as a server (information dissemination enabler), thus, precluding specific brokers which would prevent scalability and fault-tolerance. We argue that, for such decentralized architectures to be really meaningful, participants should serve the system as much as they benefit from it. That is, the system should be fair in the sense that the extend to which a participant acts as a server should depend on the extend to which it has the opportunity to act as a client. This is particularly crucial in selective information dissemination schemes where clients are not all interested in the same information. In this position paper, we discuss what a notion of fairness could look like, explain why current architectures are not fair, and raise several challenges towards achieving fairness},
 	isbn = {0-7695-2838-4},
 	doi = {10.1109/ICDCSW.2007.83},
-	url = {http://portal.acm.org/citation.cfm?id=1270388.1270971$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1270388.1270971$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.90.9758.pdf},
 	author = {Baehni, Sebastien and Rachid Guerraoui and Boris Koldehofe and Monod, Maxime}
 }
@@ -5863,7 +5886,7 @@ We pose a grand challenge for anonymity: the development of a network architectu
 	keywords = {traffic analysis},
 	isbn = {978-3-540-77369-6},
 	doi = {10.1007/978-3-540-77370-2},
-	url = {http://www.springerlink.com/content/h5r4j539833k1k78/},
+	www_section = {http://www.springerlink.com/content/h5r4j539833k1k78/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/troncoso-ih2007.pdf},
 	author = {Carmela Troncoso and Claudia Diaz and Orr Dunkelman and Bart Preneel}
 }
@@ -5877,12 +5900,12 @@ We pose a grand challenge for anonymity: the development of a network architectu
 	address = {Ottawa, Canada},
 	abstract = { We introduce a new traffic analysis attack: the Two-sided Statistical Disclosure Attack, that tries to uncover the receivers of messages sent through an anonymizing network supporting anonymous replies. We provide an abstract model of an anonymity system with users that reply to messages. Based on this model, we propose a linear approximation describing the likely receivers of sent messages. Using simulations, we evaluate the new attack given different traffic characteristics and we show that it is superior to previous attacks when replies are routed in the system },
 	keywords = {anonymity, traffic analysis},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.7347},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.7347},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/danezis-pet2007.pdf},
 	author = {George Danezis and Claudia Diaz and Carmela Troncoso},
 	editor = {Borisov, Nikita and Philippe Golle}
 }
-@conference {2007,
+@conference {2007_13,
 	title = {An Unconditionally Secure Protocol for Multi-Party Set Intersection},
 	booktitle = {Proceedings of the 5th International Conference on Applied Cryptography and Network Security},
 	year = {2007},
@@ -5893,7 +5916,7 @@ We pose a grand challenge for anonymity: the development of a network architectu
 	keywords = {privacy-preserving set ntersection, secure multi-party computation, unconditional security},
 	isbn = {978-3-540-72737-8},
 	doi = {10.1007/978-3-540-72738-5_15},
-	url = {http://dx.doi.org/10.1007/978-3-540-72738-5_15},
+	www_section = {http://dx.doi.org/10.1007/978-3-540-72738-5_15},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/UnconditionallySecureProtocol2007Li.pdf},
 	author = {Li, Ronghua and Wu, Chuankun}
 }
@@ -5910,7 +5933,7 @@ We pose a grand challenge for anonymity: the development of a network architectu
 	keywords = {anonymity, onion routing, privacy, Tor, usable security},
 	isbn = {978-1-59593-801-5},
 	doi = {10.1145/1280680.1280687},
-	url = {http://portal.acm.org/citation.cfm?id=1280680.1280687},
+	www_section = {http://portal.acm.org/citation.cfm?id=1280680.1280687},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tor-soups07.pdf},
 	author = {Jeremy Clark and Paul C. van Oorschot and Carlisle Adams}
 }
@@ -5922,7 +5945,7 @@ We pose a grand challenge for anonymity: the development of a network architectu
 	address = {Long Beach, CA},
 	abstract = {Novel routing algorithms such as scalable source routing (SSR) and virtual ring routing (VRR) need to set up and maintain a virtual ring structure among all the nodes in the network. The iterative successor pointer rewiring protocol (ISPRP) is one way to bootstrap such a network. Like its VRR-analogon, ISPRP requires one of the nodes to flood the network to guarantee consistency. Recent results on self-stabilizing algorithms now suggest a new approach to bootstrap the virtual rings of SSR and VRR. This so-called linearization method does not require any flooding at all. Moreover, it has been shown that linearization with shortcut neighbors has on average polylogarithmic convergence time, only},
 	keywords = {scalable source routing},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kutzner07linearization.pdf},
 	author = {Kendy Kutzner and Thomas Fuhrmann}
 }
@@ -5941,17 +5964,17 @@ In this paper we describe Valgrind, a DBI framework designed for building heavyw
 	keywords = {dynamic binary instrumentation},
 	issn = {0362-1340},
 	doi = {10.1145/1273442.1250746},
-	url = {http://portal.acm.org/citation.cfm?id=1250746},
+	www_section = {http://portal.acm.org/citation.cfm?id=1250746},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.108.4263.pdf},
 	author = {Nethercote, Nicholas and Seward, Julian}
 }
-@article {2007,
+@article {2007_14,
 	title = {Vielleicht anonym? Die Enttarnung von StealthNet-Nutzern},
 	journal = {c{\textquoteright}t magazin f{\"u}r computer technik},
 	year = {2007},
 	type = {Report},
 	keywords = {anonymity, file-sharing, Rshare, Stealthnet},
-	url = {http://www.heise.de/kiosk/archiv/ct/2007/21/218_Die-Enttarnung-von-StealthNet-Nutzern},
+	www_section = {http://www.heise.de/kiosk/archiv/ct/2007/21/218_Die-Enttarnung-von-StealthNet-Nutzern},
 	author = {Nils Durner and Nathan S Evans and Christian Grothoff}
 }
 @conference {garbacki062fast,
@@ -5966,11 +5989,11 @@ In this paper we describe Valgrind, a DBI framework designed for building heavyw
 	keywords = {2fast, bandwidth sharing, collaborative download, free-riding, P2P, p2p network, peer-to-peer networking},
 	isbn = {0-7695-2679-9 },
 	doi = {10.1109/P2P.2006.1  },
-	url = {http://www.arnetminer.org/viewpub.do?pid=525534},
+	www_section = {http://www.arnetminer.org/viewpub.do?pid=525534},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IEEE\%20Computer\%20Society\%20-\%202Fast.pdf},
 	author = {Garbacki, Pawel and Alexandru Iosup and Epema, Dick H. J. and van Steen, Maarten}
 }
-@mastersthesis {2006,
+@mastersthesis {2006_0,
 	title = {Access Control in Peer-to-Peer Storage Systems},
 	volume = {Communication Systems},
 	year = {2006},
@@ -5980,7 +6003,7 @@ In this paper we describe Valgrind, a DBI framework designed for building heavyw
 	type = {Master{\textquoteright}s Thesis},
 	address = {Zurich, Switzerland},
 	keywords = {access control, peer-to-peer storage system},
-	url = {http://webcache.googleusercontent.com/u/ethweb?oe=utf8\&GO.x=0\&GO.y=0\&hl=es\&q=cache:7sJLnyzj1TcJ:http://www.zisc.ethz.ch/events/ISC20067Slides/MA_Report_Erol_Koc.pdf+Erol+Ko\%C3\%A7\&ct=clnk},
+	www_section = {http://webcache.googleusercontent.com/u/ethweb?oe=utf8\&GO.x=0\&GO.y=0\&hl=es\&q=cache:7sJLnyzj1TcJ:http://www.zisc.ethz.ch/events/ISC20067Slides/MA_Report_Erol_Koc.pdf+Erol+Ko\%C3\%A7\&ct=clnk},
 	author = {Erol Ko{\c c}}
 }
 @article {Kumar2006Algorithms,
@@ -5995,7 +6018,7 @@ In this paper we describe Valgrind, a DBI framework designed for building heavyw
 	keywords = {deep packet inspection, DFA, regular expressions},
 	issn = {0146-4833},
 	doi = {10.1145/1151659.1159952},
-	url = {http://doi.acm.org/10.1145/1151659.1159952},
+	www_section = {http://doi.acm.org/10.1145/1151659.1159952},
 	author = {Kumar, Sailesh and Dharmapurikar, Sarang and Yu, Fang and Crowley, Patrick and Turner, Jonathan}
 }
 @article {Kumar2006Algorithms,
@@ -6010,7 +6033,7 @@ In this paper we describe Valgrind, a DBI framework designed for building heavyw
 	keywords = {deep packet inspection, DFA, regular expressions},
 	issn = {0146-4833},
 	doi = {10.1145/1151659.1159952},
-	url = {http://doi.acm.org/10.1145/1151659.1159952},
+	www_section = {http://doi.acm.org/10.1145/1151659.1159952},
 	author = {Kumar, Sailesh and Dharmapurikar, Sarang and Yu, Fang and Crowley, Patrick and Turner, Jonathan}
 }
 @conference {usability:weis2006,
@@ -6022,7 +6045,7 @@ In this paper we describe Valgrind, a DBI framework designed for building heavyw
 	abstract = {A growing field of literature is studying how usability impacts security [4]. One class of security software is anonymizing networks--- overlay networks on the Internet that provide privacy by letting users transact (for example, fetch a web page or send an email) without revealing their communication partners.
 In this position paper we focus on the network effects of usability on privacy and security: usability is a factor as before, but the size of the user base also becomes a factor. We show that in anonymizing networks, even if you were smart enough and had enough time to use every system perfectly, you would nevertheless be right to choose your system based in part on its usability for other users},
 	keywords = {anonymity, privacy},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.510},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.510},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/usability-weis2006.pdf},
 	author = {Roger Dingledine and Nick Mathewson},
 	editor = {Ross Anderson}
@@ -6039,7 +6062,7 @@ This work has been partially supported by the INRIA DREI {\'E}quipe Associ{\'e}e
 	isbn = {978-3-540-75333-9},
 	issn = {0302-9743},
 	doi = {10.1007/978-3-540-75336-0},
-	url = {http://www.springerlink.com/content/04247873k1719274/},
+	www_section = {http://www.springerlink.com/content/04247873k1719274/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.79.4460.pdf},
 	author = {Konstantinos Chatzikokolakis and Catuscia Palamidessi and Prakash Panangaden}
 }
@@ -6057,7 +6080,7 @@ This work has been partially supported by the INRIA DREI {\'E}quipe Associ{\'e}e
 	keywords = {access control, attribute-based encryption, audit logs, broadcast encryption, delegation, hierarchical identity-based encryption},
 	isbn = {1-59593-518-5},
 	doi = {http://doi.acm.org/10.1145/1180405.1180418},
-	url = {http://doi.acm.org/10.1145/1180405.1180418},
+	www_section = {http://doi.acm.org/10.1145/1180405.1180418},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CCS\%2706\%20-\%20Attributed-based\%20encryption\%20for\%20fine-grained\%20access\%20control\%20of\%20encrypted\%20data.pdf},
 	author = {Goyal, Vipul and Pandey, Omkant and Amit Sahai and Waters, Brent}
 }
@@ -6075,7 +6098,7 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
 	keywords = {anonymity},
 	isbn = {978-3-540-68790-0},
 	doi = {10.1007/11957454},
-	url = {http://www.springerlink.com/content/m23510526727k317/},
+	www_section = {http://www.springerlink.com/content/m23510526727k317/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/alpha-mixing-pet2006.pdf},
 	author = {Roger Dingledine and Andrei Serjantov and Paul Syverson},
 	editor = {George Danezis and Philippe Golle}
@@ -6089,7 +6112,7 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
 	abstract = {With the growing prevalence of wireless devices, infrastructure-less ad hoc networking is coming closer to reality. Research in this field has mainly been concerned with routing. However, to justify the relevance of ad hoc networks, there have to be applications. Distributed applications require basic services such as naming. In an ad hoc network, these services have to be provided in a decentralized way. We believe that structured peer-to-peer overlays are a good basis for their design. Prior work has been focused on the long-run performance of virtual peer-to-peer overlays over ad hoc networks. In this paper, we consider a vital functionality of any peer-to-peer network: bootstrapping. We formally show that the self-configuration process of a spontaneously deployed Chord network has a time complexity linear in the network size. In addition to that, its centralized bootstrapping procedure causes an unfavorable traffic load imbalance},
 	keywords = {ad-hoc networks, overlay networks, traffic analysis},
 	doi = {10.1109/PERCOMW.2006.28},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cramer06bootstrapping.pdf},
 	author = {Cramer, Curt and Thomas Fuhrmann}
 }
@@ -6103,7 +6126,7 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
 	abstract = {Universal Re-encryption allows El-Gamal ciphertexts to be re-encrypted without knowledge of their corresponding public keys. This has made it an enticing building block for anonymous communications protocols. In this work we analyze four schemes related to mix networks that make use of Universal Re-encryption and find serious weaknesses in all of them. Universal Re-encryption of signatures is open to existential forgery; two-mix schemes can be fully compromised by a passive adversary observing a single message close to the sender; the fourth scheme, the rWonGoo anonymous channel, turns out to be less secure than the original Crowds scheme, on which it is based. Our attacks make extensive use of unintended {\textquotedblleft}services{\textquotedblright} provided by the network nodes acting as decryption and re-routing oracles. Finally, our attacks against rWonGoo demonstrate that anonymous channels are not automatically composable: using two of them in a careless manner makes the system more vulnerable to attack},
 	keywords = {traffic analysis, universal re-encryption},
 	doi = {10.1007/s10207-007-0033-y},
-	url = {http://www.springerlink.com/content/x038u85171776236/},
+	www_section = {http://www.springerlink.com/content/x038u85171776236/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/UREbreak06.pdf},
 	author = {George Danezis}
 }
@@ -6120,7 +6143,7 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
 	keywords = {collusion detection, P2P},
 	isbn = {978-3-540-68790-0},
 	doi = {10.1007/11957454},
-	url = {http://www.springerlink.com/content/p2612108665331n7/},
+	www_section = {http://www.springerlink.com/content/p2612108665331n7/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/morphmix-pet2006.pdf},
 	author = {Parisa Tabriz and Borisov, Nikita},
 	editor = {George Danezis and Philippe Golle}
@@ -6138,7 +6161,7 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
 	keywords = {border gateway protocol, inter-domain routing, route diversity, routing},
 	issn = {0146-4833},
 	doi = {10.1145/1151659.1159937},
-	url = {http://portal.acm.org/citation.cfm?id=1159937$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1159937$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BuildingAnASTopologyModel.pdf},
 	author = {M{\"u}hlbauer, Wolfgang and Feldmann, Anja and Maennel, Olaf and Roughan, Matthew and Uhlig, Steve}
 }
@@ -6150,7 +6173,7 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
 	address = {Les M{\'e}nuires, France},
 	abstract = {Wireless on demand systems typically need authentication, authorization and accounting (AAA) services. In a peer-to-peer (P2P) environment these AAA-services need to be provided in a fully decentralized manner. This excludes many cryptographic approaches since they need and rely on a central trusted instance. One way to accomplish AAA in a P2P manner are de Bruijn-networks, since there data can be routed over multiple non-overlapping paths, thereby hampering malicious nodes from manipulation that data. Originally, de Bruijn-networks required a rather fixed network structure which made them unsuitable for wireless networks. In this paper we generalize de Bruijn-networks to an arbitrary number of nodes while keeping all their desired properties. This is achieved by decoupling link degree and character set of the native de Bruijn graph. Furthermore we describe how this makes the resulting network resistant against node churn},
 	keywords = {authentication, P2P},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/thiele06debruijn.pdf},
 	author = {Manuel Thiele and Kendy Kutzner and Thomas Fuhrmann}
 }
@@ -6162,11 +6185,11 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
 	pages = {35{\textendash}52},
 	abstract = {This paper proposes a classification for techniques that encourage, preserve, or enhance privacy in online environments. This classification encompasses both automated mechanisms (those that exclusively or primarily use computers and software to implement privacy techniques) and nonautomated mechanisms (those that exclusively or primarily use human means to implement privacy techniques). We give examples of various techniques and show where they fit within this classification. The importance of such a classification is discussed along with its use as a tool for the comparison and evaluation of privacy techniques},
 	keywords = {privacy},
-	url = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=999672},
+	www_section = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=999672},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/adams06.pdf},
 	author = {Carlisle Adams}
 }
-@conference {2006,
+@conference {2006_1,
 	title = {Combating Hidden Action in Unstructured Peer-to-Peer Systems},
 	booktitle = {ChinaCom {\textquoteright}06. First International Conference on Communications and Networking in China},
 	year = {2006},
@@ -6182,7 +6205,7 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ChinaCom\%2706\%20-\%20Combating\%20hidden\%20action\%20in\%20unstructured\%20p2p\%20systems.pdf},
 	author = {Qi Zhao and Jianzhong Zhang and Jingdong Xu}
 }
-@book {2006,
+@book {2006_2,
 	title = {Combinatorial Auctions},
 	year = {2006},
 	pages = {649},
@@ -6193,10 +6216,10 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
 	keywords = {combinatorial auctions, winner determination problem},
 	isbn = {0262033429},
 	issn = {978-0262033428},
-	url = {http://works.bepress.com/cramton/35},
+	www_section = {http://works.bepress.com/cramton/35},
 	author = {Peter Cramton and Yoav Shoham and Richard Steinberg}
 }
-@book {2006,
+@book {2006_3,
 	title = {Combining Virtual and Physical Structures for Self-organized Routing},
 	booktitle = {Self-Organizing Systems},
 	series = {Lecture Notes in Computer Science},
@@ -6207,16 +6230,16 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
 	keywords = {Chord, scalable source routing, self-organization},
 	issn = {978-3-540-37658-3},
 	doi = {10.1007/11822035},
-	url = {http://www.springerlink.com/content/4540535t4v2g2548/},
+	www_section = {http://www.springerlink.com/content/4540535t4v2g2548/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Combining\%20Virtual\%20and\%20Physical\%20Structures\%20for\%20Self-organized\%20Routing_0.pdf},
 	author = {Thomas Fuhrmann}
 }
-@article {2006,
+@article {2006_4,
 	title = {Communication Networks On the fundamental communication abstraction supplied by P2P overlay networks},
 	year = {2006},
 	abstract = {The disruptive advent of peer-to-peer (P2P) file sharing in 2000 attracted significant interest. P2P networks have matured from their initial form, unstructured overlays, to structured overlays like distributed hash tables (DHTs), which are considered state-of-the-art. There are huge efforts to improve their performance. Various P2P applications like distributed storage and application-layer multicast were proposed. However, little effort was spent to understand the communication abstraction P2P overlays supply. Only when it is understood, the reach of P2P ideas will significantly broaden. Furthermore, this clarification reveals novel approaches and highlights future directions. In this paper, we reconsider well-known P2P overlays, linking them to insights from distributed systems research. We conclude that the main communication abstraction is that of a virtual address space or application-specific naming. On this basis, P2P systems build a functional layer implementing, for example lookup, indirection and distributed processing. Our insights led us to identify interesting and unexplored points in the design space},
 	keywords = {distributed hash table, P2P},
-	url = {http://www3.interscience.wiley.com/journal/109858517/abstract},
+	www_section = {http://www3.interscience.wiley.com/journal/109858517/abstract},
 	author = {Cramer Curt and Thomas Fuhrmann}
 }
 @conference {1267366,
@@ -6228,11 +6251,11 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
 	organization = {USENIX Association},
 	address = {Berkeley, CA, USA},
 	abstract = {Compare-by-hash is the now-common practice used by systems designers who assume that when the digest of a cryptographic hash function is equal on two distinct files, then those files are identical. This approach has been used in both real projects and in research efforts (for example rysnc [16] and LBFS [12]). A recent paper by Henson criticized this practice [8]. The present paper revisits the topic from an advocate{\textquoteright}s standpoint: we claim that compare-by-hash is completely reasonable, and we offer various arguments in support of this viewpoint in addition to addressing concerns raised by Henson},
-	url = {http://portal.acm.org/citation.cfm?id=1267366$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1267366$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.125.4474.pdf},
 	author = {Black, John}
 }
-@article {2006,
+@article {2006_5,
 	title = {Complementary currency innovations: Self-guarantee in peer-to-peer currencies},
 	journal = {International Journal of Community Currency Research},
 	volume = {10},
@@ -6256,7 +6279,7 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
 	isbn = {0-7695-2720-5},
 	issn = {0272-5428},
 	doi = {10.1109/FOCS.2006.25},
-	url = {http://portal.acm.org/citation.cfm?id=1170505},
+	www_section = {http://portal.acm.org/citation.cfm?id=1170505},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ishai2006ca.pdf},
 	author = {Yuval Ishai and Eyal Kushilevitz and Rafail Ostrovsky and Amit Sahai}
 }
@@ -6273,11 +6296,11 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
 	keywords = {cryptographic tree structure, cryptree, hierarchy, untrusted storage},
 	isbn = {0-7695-2677-2},
 	doi = {http://dx.doi.org/10.1109/SRDS.2006.15},
-	url = {http://dl.acm.org/citation.cfm?id=1173705.1174355},
+	www_section = {http://dl.acm.org/citation.cfm?id=1173705.1174355},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SRDS\%2706\%20-\%20Cryptree.pdf},
 	author = {Dominik Grolimund and Luzius Meisser and Stefan Schmid and Roger Wattenhofer}
 }
-@conference {2006,
+@conference {2006_6,
 	title = {Curve25519: new Diffie-Hellman speed records},
 	booktitle = {PKC},
 	year = {2006},
@@ -6294,11 +6317,11 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
 	publisher = {Institut fur Telematik, Universitat Karsruhe (TH), Germany},
 	abstract = {The robustness of Peer-to-Peer (P2P) networks, in particular of DHT-based overlay networks, suffers significantly when a Sybil attack is performed. We tackle the issue of Sybil attacks from two sides. First, we clarify, analyze, and classify the P2P identifier assignment process. By clearly separating network participants from network nodes, two challenges of P2P networks under a Sybil attack become obvious: i) stability over time, and ii) identity differentiation. Second, as a starting point for a quantitative analysis of time-stability of P2P networks under Sybil attacks and under some assumptions with respect to identity differentiation, we propose an identity registration procedure called self-registration that makes use of the inherent distribution mechanisms of a P2P network},
 	keywords = {attack, P2P, robustness},
-	url = {http://dsn.tm.uni-karlsruhe.de/medien/publication-confs/dinger_dasp2p06_sybil.pdf},
+	www_section = {http://dsn.tm.uni-karlsruhe.de/medien/publication-confs/dinger_dasp2p06_sybil.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.60.8756.pdf},
 	author = {Jochen Dinger and Hannes Hartenstein}
 }
-@book {2006,
+@book {2006_7,
 	title = {Designing Economics Mechanisms},
 	year = {2006},
 	publisher = {Cambridge University Press},
@@ -6322,11 +6345,11 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
 	abstract = {Mix-networks, a family of anonymous messaging protocols, have been engineered to withstand a wide range of theoretical internal and external adversaries. An undetectable insider threat{\textemdash}voluntary partial trace disclosures by server administrators{\textemdash}remains a troubling source of vulnerability. An administrator{\textquoteright}s cooperation could be the resulting coercion, bribery, or a simple change of interests. While eliminating this insider threat is impossible, it is feasible to deter such unauthorized disclosures by bundling them with additional penalties. We abstract these costs with collateral keys, which grant access to customizable resources. This article introduces the notion of trace-deterring mix-networks, which encode collateral keys for every server-node into every end-to-end message trace. The network reveals no keying material when the input-to-output transitions of individual servers remain secret. Two permutation strategies for encoding key information into traces, mix-and-flip and all-or-nothing, are presented. We analyze their trade-offs with respect to computational efficiency, anonymity sets, and colluding message senders. Our techniques have sufficiently low overhead for deployment in large-scale elections, thereby providing a sort of publicly verifiable privacy guarantee},
 	keywords = {anonymity measurement, privacy, re-encryption},
 	doi = {10.1145/1698750.1698758},
-	url = {http://portal.acm.org/citation.cfm?id=1698750.1698758},
+	www_section = {http://portal.acm.org/citation.cfm?id=1698750.1698758},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Golle-sp2006.pdf},
 	author = {Philippe Golle and XiaoFeng Wang and Jakobsson, Markus and Alex Tsow}
 }
-@book {2006,
+@book {2006_8,
 	title = {Differential Privacy},
 	booktitle = {Automata, Languages and Programming},
 	series = {Lecture Notes in Computer Science},
@@ -6338,7 +6361,7 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
 	abstract = {In 1977 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 formalization of Dalenius{\textquoteright} goal along the lines of semantic security cannot be achieved. Contrary to intuition, a variant of the result threatens the privacy even of someone not in the database. This state of affairs suggests a new measure, differential privacy, which, intuitively, captures the increased risk to one{\textquoteright}s privacy incurred by participating in a database.The techniques developed in a sequence of papers [8, 13, 3], culminating in those described in [12], can achieve any desired level of privacy under this measure. In many cases, extremely accurate information about the database can be provided while simultaneously ensuring very high levels of privacy},
 	isbn = {978-3-540-35907-4},
 	doi = {10.1007/11787006_1},
-	url = {http://dx.doi.org/10.1007/11787006_1},
+	www_section = {http://dx.doi.org/10.1007/11787006_1},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DifferentialPrivacy2006Dwork_0.pdf},
 	author = {Dwork, Cynthia},
 	editor = {Bugliesi, Michele and Preneel, Bart and Sassone, Vladimiro and Wegener, Ingo}
@@ -6355,11 +6378,11 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
 	keywords = {mobile Ad-hoc networks},
 	isbn = {1-59593-306-9},
 	doi = {10.1145/1143549.1143821},
-	url = {http://portal.acm.org/citation.cfm?id=1143821$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1143821$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.103.426.pdf},
 	author = {Wang, Ying-Hong and Chao, Chih-Feng and Lin, Shih-Wei and Chen, Wei-Ting}
 }
-@mastersthesis {2006,
+@mastersthesis {2006_9,
 	title = {Distributed k-ary System: Algorithms for Distributed Hash Tables},
 	year = {2006},
 	month = dec,
@@ -6379,7 +6402,7 @@ Several group communication algorithms for structured overlay networks are prese
  
 The algorithms have been implemented in a middleware called the Distributed k-ary System (DKS), which is briefly described},
 	keywords = {distributed hash table, distributed k-ary system, DKS},
-	url = {http://eprints.sics.se/516/},
+	www_section = {http://eprints.sics.se/516/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Ghodsi\%20-\%20Distributed\%20k-ary\%20System.pdf},
 	author = {Ali Ghodsi}
 }
@@ -6394,7 +6417,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {matching, P2P, search},
 	isbn = {1-4244-0142-9},
 	doi = {10.1109/NOMS.2006.1687551},
-	url = {http://dx.doi.org/10.1109/NOMS.2006.1687551},
+	www_section = {http://dx.doi.org/10.1109/NOMS.2006.1687551},
 	author = {Ahmed, R. and Boutaba, R.}
 }
 @conference {sandberg06distrouting,
@@ -6405,11 +6428,11 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	organization = {SIAM},
 	abstract = {Theoretical basis for the routing protocol of Freenet 0.7 },
 	keywords = {small-world},
-	url = {http://www.math.chalmers.se/~ossa/wrt.html},
+	www_section = {http://www.math.chalmers.se/~ossa/wrt.html},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/swroute.pdf},
 	author = {Sandberg, Oskar}
 }
-@book {2006,
+@book {2006_10,
 	title = {DNS-Based Service Discovery in Ad Hoc Networks: Evaluation and Improvements},
 	volume = {Volume 4217/2006},
 	year = {2006},
@@ -6419,7 +6442,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {ad-hoc networks, DNS},
 	issn = {978-3-540-45174-7},
 	doi = {10.1007/11872153},
-	url = {http://www.springerlink.com/content/m8322m1006416270/},
+	www_section = {http://www.springerlink.com/content/m8322m1006416270/},
 	author = {Celeste Campo and Carlos Garc{\'\i}a-Rubio}
 }
 @conference {Md06e.:anonymous,
@@ -6432,7 +6455,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	abstract = {The main characteristic of a mobile ad-hoc network is its infrastructure-less, highly dynamic topology, which is subject to malicious traffic analysis. Malicious intermediate nodes in wireless mobile ad-hoc networks are a threat concerning security as well as anonymity of exchanged information. To protect anonymity and achieve security of nodes in mobile ad-hoc networks, an anonymous on-demand routing protocol, termed RIOMO, is proposed. For this purpose, pseudo IDs of the nodes are generated considering Pairing-based Cryptography. Nodes can generate their own pseudo IDs independently. As a result RIOMO reduces pseudo IDs maintenance costs. Only trust-worthy nodes are allowed to take part in routing to discover a route. To ensure trustiness each node has to make authentication to its neighbors through an anonymous authentication process. Thus RIOMO safely communicates between nodes without disclosing node identities; it also provides different desirable anonymous properties such as identity privacy, location privacy, route anonymity, and robustness against several attacks},
 	keywords = {ad-hoc networks, anonymity, routing},
 	doi = {10.1007/978-3-540-71789-8},
-	url = {http://www.springerlink.com/content/g6334148068w1254/},
+	www_section = {http://www.springerlink.com/content/g6334148068w1254/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.74.1585.pdf},
 	author = {Sk. Md. Mizanur Rahman and Atsuo Inomata and Takeshi Okamoto and Masahiro Mambo}
 }
@@ -6443,7 +6466,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	month = {June},
 	address = {Cambridge, UK},
 	abstract = {We present a model of surveillance based on social network theory, where observing one participant also leaks some information about third parties. We examine how many nodes an adversary has to observe in order to extract information about the network, but also how the method for choosing these nodes (target selection) greatly influences the resulting intelligence. Our results provide important insights into the actual security of anonymous communication, and their ability to minimise surveillance and disruption in a social network. They also allow us to draw interesting policy conclusions from published interception figures, and get a better estimate of the amount of privacy invasion and the actual volume of surveillance taking place},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.9384},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.9384},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/danezis-weis2006.pdf},
 	author = {George Danezis and Bettina Wittneben},
 	editor = {Ross Anderson}
@@ -6462,7 +6485,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {compression, energy-aware, lossless},
 	issn = {0734-2071},
 	doi = {10.1145/1151690.1151692},
-	url = {http://portal.acm.org/citation.cfm?id=1151692$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1151692$\#$},
 	author = {Kenneth Barr and Asanovi{\'c}, Krste}
 }
 @conference {1143660,
@@ -6477,7 +6500,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {delay tolerant network},
 	isbn = {1-59593-306-9},
 	doi = {10.1145/1143549.1143660},
-	url = {http://portal.acm.org/citation.cfm?id=1143549.1143660$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1143549.1143660$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.61.249.pdf},
 	author = {Liao, Yong and Tan, Kun and Zhang, Zhensheng and Gao, Lixin}
 }
@@ -6494,7 +6517,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {P2P},
 	issn = {0163-5980},
 	doi = {10.1145/1218063.1217950},
-	url = {http://portal.acm.org/citation.cfm?id=1218063.1217950$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1218063.1217950$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/epost-eurosys2006.pdf},
 	author = {Mislove, Alan and Post, Ansley and Haeberlen, Andreas and Peter Druschel}
 }
@@ -6507,7 +6530,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	address = {Santa Barbara, CA, USA},
 	abstract = {Despite its popularity, relatively little is known about the traf- fic characteristics of the Skype VoIP system and how they differ from other P2P systems. We describe an experimental study of Skype VoIP traffic conducted over a one month period, where over 30 million datapoints were collected regarding the population of online clients, the number of supernodes, and their traffic characteristics. The results indicate that although the structure of the Skype system appears to be similar to other P2P systems, particularly KaZaA, there are several significant differences in traffic. The number of active clients shows diurnal and work-week behavior, correlating with normal working hours regardless of geography. The population of supernodes in the system tends to be relatively stable; thus node churn, a significant concern in other systems, seems less problematic in Skype. The typical bandwidth load on a supernode is relatively low, even if the supernode is relaying VoIP traffic. The paper aims to aid further understanding of a signifi- cant, successful P2P VoIP system, as well as provide experimental data that may be useful for design and modeling of such systems. These results also imply that the nature of a VoIP P2P system like Skype differs fundamentally from earlier P2P systems that are oriented toward file-sharing, and music and video download applications, and deserves more attention from the research community},
 	keywords = {decentralized, indexing, overlay, P2P, skype, unstructured},
-	url = {http://saikat.guha.cc/pub/iptps06-skype/},
+	www_section = {http://saikat.guha.cc/pub/iptps06-skype/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IPTPS\%2706\%20-\%20Skype\%20p2p\%20VoIP\%20System.pdf},
 	author = {Saikat Guha and Daswani, Neil and Jain, Ravi}
 }
@@ -6524,7 +6547,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {economics, information trading},
 	isbn = {0-7695-2567-9},
 	doi = {10.1109/ARES.2006.62},
-	url = {http://dl.acm.org/citation.cfm?id=1130897.1131000},
+	www_section = {http://dl.acm.org/citation.cfm?id=1130897.1131000},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ARES\%2706\%20-\%20Fair\%20Trading\%20of\%20Information.pdf},
 	author = {Saito, Kenji and Morino, Eiichi and Murai, Jun}
 }
@@ -6540,7 +6563,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	abstract = {A P2P currency can be a powerful tool for promoting exchanges in a trusted way that make use of under-utilized resources both in computer networks and in real life. There are three classes of resource that can be exchanged in a P2P system: atoms (ex. physical goods by way of auctions), bits (ex. data files) and presences (ex. time slots for computing resources such as CPU, storage or bandwidth). If these are equally treated as commodities, however, the economy of the system is likely to collapse, because data files can be reproduced at a negligibly small cost whereas time slots for computing resources cannot even be stockpiled for future use. This paper clarifies this point by simulating a small world of traders, and proposes a novel way for applying the "reduction over time" feature[14] of i-WAT[11], a P2P currency. In the proposed new economic order (NEO), bits are freely shared among participants, whereas their producers are supported by peers, being given freedom to issue exchange tickets whose values are reduced over time},
 	isbn = {0-7695-2567-9},
 	doi = {10.1109/ARES.2006.62},
-	url = {http://dl.acm.org/citation.cfm?id=1130897.1131000},
+	www_section = {http://dl.acm.org/citation.cfm?id=1130897.1131000},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ARES\%2706\%20-\%20Fair\%20Trading\%20of\%20Information.pdf},
 	author = {Saito, Kenji and Morino, Eiichi and Murai, Jun}
 }
@@ -6556,7 +6579,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	abstract = {This paper describes and evaluates Fireflies, a scalable protocol for supporting intrusion-tolerant network overlays. While such a protocol cannot distinguish Byzantine nodes from correct nodes in general, Fireflies provides correct nodes with a reasonably current view of which nodes are live, as well as a pseudo-random mesh for communication. The amount of data sent by correct nodes grows linearly with the aggregate rate of failures and recoveries, even if provoked by Byzantine nodes. The set of correct nodes form a connected submesh; correct nodes cannot be eclipsed by Byzantine nodes. Fireflies is deployed and evaluated on PlanetLab},
 	issn = {0163-5980},
 	doi = {10.1145/1218063.1217937},
-	url = {http://portal.acm.org/citation.cfm?id=1218063.1217937$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1218063.1217937$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Fireflies.pdf},
 	author = {H{\r a}vard Johansen and Allavena, Andr{\'e} and Robbert Van Renesse}
 }
@@ -6566,7 +6589,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	year = {2006},
 	abstract = {While it is well-known that BitTorrent is vulnerable to selfish behavior, this paper demonstrates that even entire files can be downloaded without reciprocating at all in BitTorrent. To this end, we present BitThief, a free riding client that never contributes any real data. First, we show that simple tricks suffice in order to achieve high download rates, even in the absence of seeders. We also illustrate how peers in a swarm react to various sophisticated attacks. Moreover, our analysis reveals that sharing communities{\textemdash}communities originally intended to offer downloads of good quality and to promote cooperation among peers{\textemdash}provide many incentives to cheat},
 	keywords = {BitTorrent},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.9307},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.9307},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.67.9307.pdf},
 	author = {Thomas Locher and Patrick Moor and Stefan Schmid and Roger Wattenhofer}
 }
@@ -6592,7 +6615,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {anonymity, clock skew, covert channels, fingerprinting, Tor},
 	isbn = {1-59593-518-5},
 	doi = {10.1145/1180405.1180410},
-	url = {http://portal.acm.org/citation.cfm?id=1180410},
+	www_section = {http://portal.acm.org/citation.cfm?id=1180410},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/HotOrNot.pdf},
 	author = {Steven J. Murdoch}
 }
@@ -6608,7 +6631,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {clone detection, credentials, n-anonymous authentication},
 	isbn = {1-59593-518-5},
 	doi = {10.1145/1180405.1180431},
-	url = {http://portal.acm.org/citation.cfm?id=1180431},
+	www_section = {http://portal.acm.org/citation.cfm?id=1180431},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/clonewars.pdf},
 	author = {Jan Camenisch and Susan Hohenberger and Markulf Kohlweiss and Anna Lysyanskaya and Mira Meyerovich}
 }
@@ -6624,7 +6647,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {backup, P2P, reliability},
 	isbn = {0-7695-2612-8},
 	doi = {10.1109/ICPADS.2006.52},
-	url = {http://portal.acm.org/citation.cfm?id=1156431.1157518$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1156431.1157518$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.94.4826.pdf},
 	author = {Morcos, Faruck and Chantem, Thidapat and Little, Philip and Gasiba, Tiago and Thain, Douglas}
 }
@@ -6640,7 +6663,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	abstract = {The so-called {\textquotedblleft}Great Firewall of China{\textquotedblright} operates, in part, by inspecting TCP packets for keywords that are to be blocked. If the keyword is present, TCP reset packets (viz: with the RST flag set) are sent to both endpoints of the connection, which then close. However, because the original packets are passed through the firewall unscathed, if the endpoints completely ignore the firewall{\textquoteright}s resets, then the connection will proceed unhindered. Once one connection has been blocked, the firewall makes further easy-to-evade attempts to block further connections from the same machine. This latter behaviour can be leveraged into a denial-of-service attack on third-party machines},
 	isbn = {978-3-540-68790-0},
 	doi = {10.1007/11957454},
-	url = {http://www.springerlink.com/content/7224582654260k03/},
+	www_section = {http://www.springerlink.com/content/7224582654260k03/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/clayton-pet2006.pdf},
 	author = {Richard Clayton and Steven J. Murdoch and Robert N. M. Watson},
 	editor = {George Danezis and Philippe Golle}
@@ -6653,7 +6676,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	abstract = {Many GRID applications such as drug discovery in the pharmaceutical industry or simulations in meteorology and generally in the earth sciences rely on large data bases. Historically, these data bases are flat files on the order of several hundred megabytes each. Today, sites often need to download dozens or hundreds of such files before they can start a simulation or analysis run, even if the respective application accesses only small fractions of the respective files. The IGOR file system (which has been developed within the EU FP6 SIMDAT project), addresses the need for an easy and efficient way to access large files across the Internet. IGOR-FS is especially suited for (potentially globally) distributed sites that read or modify only small portions of the files. IGOR-FS provides fine grained versioning and backup capabilities; and it is built on strong cryptography to protect confidential data both in the network and on the local sites storage systems},
 	keywords = {file systems, GRID},
 	isbn = {83-915141-7-X} affiliation = {University of Karlsruhe, Germany},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.1091},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.1091},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kutzner06igor.pdf},
 	author = {Kendy Kutzner and Thomas Fuhrmann}
 }
@@ -6665,7 +6688,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	organization = {IEEE},
 	abstract = {During recent years, Distributed Hash Tables (DHTs) have been extensively studied through simulation and analysis. However, due to their limited deployment, it has not been possible to observe the behavior of a widely-deployed DHT in practice. Recently, the popular eMule file-sharing software incorporated a Kademlia-based DHT, called Kad, which currently has around one million simultaneous users. In this paper, we empirically study the performance of the key DHT operation, lookup, over Kad. First, we analytically derive the benefits of different ways to increase the richness of routing tables in Kademlia-based DHTs. Second, we empirically characterize two aspects of the accuracy of routing tables in Kad, namely completeness and freshness, and characterize their impact on Kad{\textquoteright}s lookup performance. Finally, we investigate how the efficiency and consistency of lookup in Kad can be improved by performing parallel lookup and maintaining multiple replicas, respectively. Our results pinpoint the best operating point for the degree of lookup parallelism and the degree of replication for Kad},
 	keywords = {distributed hash table, redundancy},
-	url = {http://dblp.uni-trier.de/db/conf/infocom/infocom2006.html$\#$StutzbachR06},
+	www_section = {http://dblp.uni-trier.de/db/conf/infocom/infocom2006.html$\#$StutzbachR06},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/infocom06-kad.pdf},
 	author = {Stutzbach, Daniel and Rejaie, Reza}
 }
@@ -6695,12 +6718,12 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {anonymity, P2P},
 	isbn = {978-3-540-68790-0},
 	doi = {10.1007/11957454},
-	url = {http://www.springerlink.com/content/v473127846n07255/},
+	www_section = {http://www.springerlink.com/content/v473127846n07255/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ciaccio-pet2006.pdf},
 	author = {Giuseppe Ciaccio},
 	editor = {George Danezis and Philippe Golle}
 }
-@conference {2006,
+@conference {2006_11,
 	title = {Improving traffic locality in BitTorrent via biased neighbor selection},
 	booktitle = {Proceedings of the 26th IEEE International Conference on Distributed Computing Systems},
 	year = {2006},
@@ -6731,7 +6754,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {border gateway protocol (BGP), distributed algorithmic mechanism design, interdomain routing},
 	isbn = {1-59593-236-4},
 	doi = {http://doi.acm.org/10.1145/1134707.1134722},
-	url = {http://doi.acm.org/10.1145/1134707.1134722},
+	www_section = {http://doi.acm.org/10.1145/1134707.1134722},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EC\%2706\%20-\%20Incentive-compatible\%20interdomain\%20routing.pdf},
 	author = {Feigenbaum, Joan and Ramachandran, Vijay and Schapira, Michael}
 }
@@ -6741,7 +6764,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	volume = {abs/cs/0611016},
 	year = {2006},
 	abstract = {Whoever has had his cell phone stolen knows how frustrating it is to be unable to get his contact list back. To avoid data loss when losing or destroying a mobile device like a PDA or a cell phone, data is usually backed-up to a fixed station. However, in the time between the last backup and the failure, important data can have been produced and then lost. To handle this issue, we propose a transparent collaborative backup system. Indeed, by saving data on other mobile devices between two connections to a global infrastructure, we can resist to such scenarios. In this paper, after a general description of such a system, we present a way to replicate data on mobile devices to attain a prerequired resilience for the backup},
-	url = {http://www.pubzone.org/dblp/journals/corr/abs-cs-0611016},
+	www_section = {http://www.pubzone.org/dblp/journals/corr/abs-cs-0611016},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/0611016v1.pdf},
 	author = {Damien Martin-Guillerez and Michel Ban{\^a}tre and Paul Couderc}
 }
@@ -6756,7 +6779,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	abstract = {Several fundamental security mechanisms for restricting access to network resources rely on the ability of a reference monitor to inspect the contents of traffic as it traverses the network. However, with the increasing popularity of cryptographic protocols, the traditional means of inspecting packet contents to enforce security policies is no longer a viable approach as message contents are concealed by encryption. In this paper, we investigate the extent to which common application protocols can be identified using only the features that remain intact after encryption---namely packet size, timing, and direction. We first present what we believe to be the first exploratory look at protocol identification in encrypted tunnels which carry traffic from many TCP connections simultaneously, using only post-encryption observable features. We then explore the problem of protocol identification in individual encrypted TCP connections, using much less data than in other recent approaches. The results of our evaluation show that our classifiers achieve accuracy greater than 90\% for several protocols in aggregate traffic, and, for most protocols, greater than 80\% when making fine-grained classifications on single connections. Moreover, perhaps most surprisingly, we show that one can even estimate the number of live connections in certain classes of encrypted tunnels to within, on average, better than 20\%},
 	keywords = {hidden Markov models, traffic classification},
 	issn = {1533-7928},
-	url = {http://portal.acm.org/citation.cfm?id=1248647},
+	www_section = {http://portal.acm.org/citation.cfm?id=1248647},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WrightMM06.pdf},
 	author = {Charles Wright and Fabian Monrose and Gerald M. Masson}
 }
@@ -6772,7 +6795,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {latency, network forensics, traffic analysis},
 	isbn = {1-59593-518-5},
 	doi = {10.1145/1180405.1180437},
-	url = {http://portal.acm.org/citation.cfm?id=1180437},
+	www_section = {http://portal.acm.org/citation.cfm?id=1180437},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Liberatore-2006.pdf},
 	author = {Marc Liberatore and Brian Neil Levine}
 }
@@ -6785,11 +6808,11 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	school = {Keio University,},
 	address = {Washington, DC, USA},
   keywords = {i-WAT, OpenPGP, WAT system},
-	url = {http://www.sfc.wide.ad.jp/dissertation/ks91_e.html},
+	www_section = {http://www.sfc.wide.ad.jp/dissertation/ks91_e.html},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Saito\%20-\%20i-WAT\%20Dissertation.pdf},
 	author = {Saito, Kenji}
 }
-@book {2006,
+@book {2006_12,
 	title = {Less Hashing, Same Performance: Building a Better Bloom Filter},
 	booktitle = {Algorithms {\textendash} ESA 2006},
 	series = {Lecture Notes in Computer Science},
@@ -6801,7 +6824,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	abstract = {A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi (x) = h1(x) + ih2(x). We demonstrate that this technique can be usefully applied to Bloom filters and related data structures. Specifically, only two hash functions are necessary to effectively implement a Bloom filter without any loss in the asymptotic false positive probability. This leads to less computation and potentially less need for randomness in practice},
 	isbn = {978-3-540-38875-3},
 	doi = {10.1007/11841036_42},
-	url = {http://dx.doi.org/10.1007/11841036_42},
+	www_section = {http://dx.doi.org/10.1007/11841036_42},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/LessHashing2006Kirsch.pdf},
 	author = {Kirsch, Adam and Mitzenmacher, Michael},
 	editor = {Azar, Yossi and Erlebach, Thomas}
@@ -6819,7 +6842,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {privacy, pseudonym},
 	isbn = {978-3-540-68790-0},
 	doi = {10.1007/11957454},
-	url = {http://www.springerlink.com/content/y6l6412387663581/},
+	www_section = {http://www.springerlink.com/content/y6l6412387663581/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cview-pet2006.pdf},
 	author = {Andreas Pashalidis and Bernd Meyer},
 	editor = {George Danezis and Philippe Golle}
@@ -6833,7 +6856,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	abstract = {Scalable source routing (SSR) is a self-organizing routing protocol designed for supporting peer-to-peer applications. It is especially suited for networks that do not have a well crafted structure, e. g. ad-hoc and mesh-networks. SSR is based on the combination of source routes and a virtual ring structure. This ring is used in a Chord-like manner to obtain source routes to destinations that are not yet in the respective router cache. This approach makes SSR more message efficient than flooding based ad-hoc routing protocols. Moreover, it directly provides the semantics of a structured routing overlay. In this paper we present Linyphi, an implementation of SSR for wireless accesses routers. Linyphi combines IPv6 and SSR so that unmodified IPv6 hosts have transparent connectivity to both the Linyphi mesh network and the IPv4/v6 Internet. We give a basic outline of the implementation and demonstrate its suitability in real-world mesh network scenarios. Linyphi is available for download (www.linyphi.net)},
 	keywords = {scalable source routing},
 	isbn = {1-4244-0054-6},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/di06linyphi.pdf},
 	author = {Di, Pengfei and Massimiliano Marcon and Thomas Fuhrmann}
 }
@@ -6848,7 +6871,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {anonymity measurement, Guard, Tor},
 	isbn = {0-7695-2574-1},
 	doi = {10.1109/SP.2006.24},
-	url = {http://portal.acm.org/citation.cfm?id=1130366},
+	www_section = {http://portal.acm.org/citation.cfm?id=1130366},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/hs-attack06.pdf},
 	author = {Lasse {\O}verlier and Paul Syverson}
 }
@@ -6861,7 +6884,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {anonymous multicast},
 	isbn = {0-7695-2540-7 },
 	doi = {10.1109/ICDCS.2006.53 },
-	url = {http://ieeexplore.ieee.org/Xplore/login.jsp?url=http\%3A\%2F\%2Fieeexplore.ieee.org\%2Fiel5\%2F10967\%2F34569\%2F01648846.pdf\%3Ftp\%3D\%26isnumber\%3D\%26arnumber\%3D1648846\&authDecision=-203},
+	www_section = {http://ieeexplore.ieee.org/Xplore/login.jsp?url=http\%3A\%2F\%2Fieeexplore.ieee.org\%2Fiel5\%2F10967\%2F34569\%2F01648846.pdf\%3Ftp\%3D\%26isnumber\%3D\%26arnumber\%3D1648846\&authDecision=-203},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/icdcs2006-m2.pdf},
 	author = {Ginger Perng and Michael K. Reiter and Chenxi Wang}
 }
@@ -6876,7 +6899,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {anonymity, privacy},
 	isbn = {1-59593-556-8},
 	doi = {10.1145/1179601.1179611},
-	url = {http://portal.acm.org/citation.cfm?id=1179611},
+	www_section = {http://portal.acm.org/citation.cfm?id=1179611},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ShWa-Relationship.pdf},
 	author = {Vitaly Shmatikov and Ming-Hsui Wang}
 }
@@ -6893,7 +6916,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {churn, distributed hash table, multicast, node selection},
 	issn = {0146-4833},
 	doi = {http://doi.acm.org/10.1145/1151659.1159931},
-	url = {http://doi.acm.org/10.1145/1151659.1159931},
+	www_section = {http://doi.acm.org/10.1145/1151659.1159931},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%20Comp.\%20Comm.\%20Rev.\%20-\%20Minimizing\%20churn\%20in\%20distributed\%20systems.pdf},
 	author = {Godfrey, Brighten and S Shenker and Ion Stoica}
 }
@@ -6902,7 +6925,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	year = {2006},
 	abstract = {Traditional backup methods are error prone, cumbersome and expensive. Distributed backup applications have emerged as promising tools able to avoid these disadvantages, by exploiting unused disk space of remote computers. In this paper we propose MyriadStore, a distributed peer-to-peer backup system. MyriadStore makes use of a trading scheme that ensures that a user has as much available storage space in the system as the one he/she contributes to it. A mechanism for making challenges between the system{\textquoteright}s nodes ensures that this restriction is fulfilled. Furthermore, MyriadStore minimizes bandwidth requirements and migration costs by treating separately the storage of the system{\textquoteright}s meta-data and the storage of the backed up data. This approach also offers great flexibility on the placement of the backed up data, a property that facilitates the deployment of the trading scheme},
 	keywords = {backup, P2P},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.6985},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.6985},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.126.5915.pdf},
 	author = {Birgir Stefansson and Antonios Thodis and Ali Ghodsi and Seif Haridi}
 }
@@ -6919,7 +6942,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {network coding},
 	issn = {0146-4833},
 	doi = {http://doi.acm.org/10.1145/1111322.1111337},
-	url = {http://doi.acm.org/10.1145/1111322.1111337},
+	www_section = {http://doi.acm.org/10.1145/1111322.1111337},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%20Comput.\%20Commun.\%20Rev\%20-\%20Network\%20Coding\%3A\%20an\%20Instant\%20Primer.pdf},
 	author = {Fragouli, Christina and Jean-Yves Le Boudec and J{\"o}rg Widmer}
 }
@@ -6935,7 +6958,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {oblivious circuits, public key cryptography, steganography, unobservability},
 	isbn = {1-59593-556-8},
 	doi = {10.1145/1179601.1179603 },
-	url = {http://portal.acm.org/citation.cfm?id=1179601.1179603},
+	www_section = {http://portal.acm.org/citation.cfm?id=1179601.1179603},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/wpes06-heydt-benjamin.pdf},
 	author = {Andrei Serjantov and Benessa Defend}
 }
@@ -6961,7 +6984,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	abstract = {As personal area networking becomes a reality, the collective management of storage in portable devices such as mobile phones, cameras and music players will grow in importance. The increasing wireless communication capability of such devices makes it possible for them to interact with each other and implement more advanced storage functionality. This paper introduces OmniStore, a system which employs a unified data management approach that integrates portable and backend storage, but also exhibits self-organizing behavior through spontaneous device collaboration},
 	isbn = {0-7695-2518-0},
 	doi = {10.1109/PERCOM.2006.40},
-	url = {http://portal.acm.org/citation.cfm?id=1128335$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1128335$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.96.4283.pdf},
 	author = {Alexandros Karypidis and Spyros Lalis}
 }
@@ -6977,11 +7000,11 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
 	keywords = {byzantine agreement, communication complexity, cryptographic security, information-theoretic security},
 	isbn = {1-59593-384-0},
 	doi = {10.1145/1146381.1146407},
-	url = {http://doi.acm.org/10.1145/1146381.1146407},
+	www_section = {http://doi.acm.org/10.1145/1146381.1146407},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FitHir06.pdf},
 	author = {Fitzi, Matthias and Hirt, Martin}
 }
-@conference {2006,
+@conference {2006_13,
 	title = {Our Data, Ourselves: Privacy via Distributed Noise Generation},
 	booktitle = {Proceedings of the 24th Annual International Conference on The Theory and Applications of Cryptographic Techniques},
 	year = {2006},
@@ -6995,7 +7018,7 @@ form sum over all rows {\textquoteright}i{\textquoteright} in the database of a 
 two shallow circuits: one for generating many arbitrarily but identically biased coins at an amortized cost of two unbiased random bits apiece, independent of the bias, and the other to combine bits of appropriate biases to obtain an exponential distribution},
 	isbn = {3-540-34546-9, 978-3-540-34546-6},
 	doi = {10.1007/11761679_29},
-	url = {http://dx.doi.org/10.1007/11761679_29},
+	www_section = {http://dx.doi.org/10.1007/11761679_29},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/OurData2006Dwork.pdf},
 	author = {Dwork, Cynthia and Kenthapadi, Krishnaram and McSherry, Frank and Mironov, Ilya and Naor, Moni}
 }
@@ -7004,7 +7027,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
 	year = {2006},
 	abstract = {Several techniques to improve anonymity have been proposed in the literature. They rely basically on multicast or on onion routing to thwart global attackers or local attackers respectively. None of the techniques provide a combined solution due to the incompatibility between the two components, as we show in this paper. We propose novel packet coding techniques that make the combination possible, thus integrating the advantages in a more complete and robust solution},
 	keywords = {anonymity, onion routing, robustness},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.2407},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.2407},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.88.2407_0.pdf},
 	author = {Imad Aad and Claude Castelluccia and Jean-Pierre Hubaux}
 }
@@ -7021,7 +7044,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
 	keywords = {multicasting, multiway cut, parameterized complexity, separator},
 	issn = {0304-3975},
 	doi = {10.1016/j.tcs.2005.10.007},
-	url = {http://dl.acm.org/citation.cfm?id=1140638.1140647},
+	www_section = {http://dl.acm.org/citation.cfm?id=1140638.1140647},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Marx\%20-\%20Parameterized\%20graph\%20separation\%20problems.pdf},
 	author = {Marx, D{\'a}niel}
 }
@@ -7036,7 +7059,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
 	address = {Washington, DC, USA},
 	isbn = {0-7695-2540-7},
 	doi = {10.1109/ICDCS.2006.63},
-	url = {http://dx.doi.org/10.1109/ICDCS.2006.63},
+	www_section = {http://dx.doi.org/10.1109/ICDCS.2006.63},
 	author = {Aekaterinidis, Ioannis and Triantafillou, Peter}
 }
 @conference {Massoulie:2006:PCS:1146381.1146402,
@@ -7053,11 +7076,11 @@ two shallow circuits: one for generating many arbitrarily but identically biased
 	keywords = {expander graphs, random walks, sampling},
 	isbn = {1-59593-384-0},
 	doi = {http://doi.acm.org/10.1145/1146381.1146402},
-	url = {http://doi.acm.org/10.1145/1146381.1146402},
+	www_section = {http://doi.acm.org/10.1145/1146381.1146402},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PODC\%2706\%20-\%20Peer\%20counting\%20and\%20sampling\%20in\%20overlay\%20networks.pdf},
 	author = {Massouli{\'e}, Laurent and Erwan Le Merrer and Anne-Marie Kermarrec and Ganesh, Ayalvadi}
 }
-@conference {2006,
+@conference {2006_14,
 	title = {Peer to peer size estimation in large and dynamic networks: A comparative study},
 	booktitle = {HPDC{\textquoteright}06 - 15th IEEE International Symposium on High Performance Distributed Computing},
 	year = {2006},
@@ -7084,7 +7107,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
 	keywords = {Chord, mobile Ad-hoc networks},
 	isbn = {1-59593-558-4},
 	doi = {10.1145/1161252.1161264},
-	url = {http://portal.acm.org/citation.cfm?id=1161264$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1161264$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p48-cramer_ACM2006.pdf},
 	author = {Cramer, Curt and Thomas Fuhrmann}
 }
@@ -7113,12 +7136,12 @@ two shallow circuits: one for generating many arbitrarily but identically biased
 	keywords = {anonymity, privacy, re-encryption},
 	isbn = {978-3-540-68790-0},
 	doi = {10.1007/11957454},
-	url = {http://www.springerlink.com/content/c75053mr42n82wv5/},
+	www_section = {http://www.springerlink.com/content/c75053mr42n82wv5/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/heydt-benjamin-pet2006.pdf},
 	author = {Thomas S. Heydt-Benjamin and Hee-Jin Chae and Benessa Defend and Kevin Fu},
 	editor = {George Danezis and Philippe Golle}
 }
-@conference {2006,
+@conference {2006_15,
 	title = {Privacy Preserving Nearest Neighbor Search},
 	booktitle = {Data Mining Workshops, 2006. ICDM Workshops 2006. Sixth IEEE International Conference on},
 	year = {2006},
@@ -7152,7 +7175,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
 	publisher = {Fakult{\"a}t f{\"u}r Informatik, Universit{\"a}t Karlsruhe},
 	type = {Interner Bericht},
 	abstract = {SCALABLE SOURCE ROUTING is a novel routing approach for large unstructured networks, for example hybrid mobile ad hoc networks (MANETs), mesh networks, or sensor-actuator networks. It is especially suited for organically growing networks of many resource-limited mobile devices supported by a few fixed-wired nodes. SCALABLE SOURCE ROUTING is a full-fledged routing protocol that directly provides the semantics of a structured peer-to-peer overlay. Hence, it can serve as an efficient basis for fully decentralized applications on mobile devices. SCALABLE SOURCE ROUTING combines source routing in the physical network with Chord-like routing in the virtual ring formed by the address space. Message forwarding greedily decreases the distance in the virtual ring while preferring physically short paths. Unlike previous approaches, scalability is achieved without imposing artificial hierarchies or assigning location-dependent addresses. SCALABLE SOURCE ROUTING enables any-to-any communication in a flat address space without maintaining any-to-any routes. Each node proactively discovers its virtual vicinity using an iterative process. Additionally, it passively caches a limited amount of additional paths. By means of extensive simulation, we show that SCALABLE SOURCE ROUTING is resource-efficient and scalable well beyond 10,000 nodes},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann06pushing.pdf},
 	author = {Thomas Fuhrmann and Di, Pengfei and Kendy Kutzner and Cramer, Curt}
 }
@@ -7186,7 +7209,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/raptor.pdf},
 	author = {M. Amin Shokrollahi}
 }
-@article {2006,
+@article {2006_16,
 	title = {Reactive Clustering in MANETs },
 	journal = { International Journal of Pervasive Computing and Communications},
 	volume = {2},
@@ -7195,7 +7218,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
 	abstract = {Many clustering protocols for mobile ad hoc networks (MANETs) have been proposed in the literature. With only one exception so far (1), all these protocols are proactive, thus wasting bandwidth when their function is not currently needed. To reduce the signalling traffic load, reactive clustering may be employed.We have developed a clustering protocol named {\textquotedblleft}On-Demand Group Mobility-Based Clustering{\textquotedblright} (ODGMBC) (2), (3) which is reactive. Its goal is to build clusters as a basis for address autoconfiguration and hierarchical routing. In contrast to the protocol described in ref. (1), the design process especially addresses the notions of group mobility and of multi-hop clusters in a MANET. As a result, ODGMBC maps varying physical node groups onto logical clusters. In this paper, ODGMBC is described. It was implemented for the ad hoc network simulator GloMoSim (4) and evaluated using several performance indicators. Simulation results are promising and show that ODGMBC leads to stable clusters. This stability is advantageous for autoconfiguration and routing mechansims to be employed in conjunction with the clustering algorithm},
 	keywords = {mobile Ad-hoc networks, multi-hop networks},
 	doi = {10.1108/17427370780000143},
-	url = {http://www.emeraldinsight.com/journals.htm?articleid=1615724\&show=pdf},
+	www_section = {http://www.emeraldinsight.com/journals.htm?articleid=1615724\&show=pdf},
 	author = {Cramer, Curt and Oliver Stanze and Kilian Weniger and Martina Zitterbart}
 }
 @article {regroup2006,
@@ -7211,10 +7234,10 @@ two shallow circuits: one for generating many arbitrarily but identically biased
 	keywords = {anonymity, mix, privacy},
 	issn = {1066-2243 },
 	doi = {10.1108/10662240610656528},
-	url = {http://www.emeraldinsight.com/Insight/viewContentItem.do;jsessionid=6C3CF32A99DF3971C2144B461C8F2CF5?contentType=Article\&hdAction=lnkpdf\&contentId=1550662},
+	www_section = {http://www.emeraldinsight.com/Insight/viewContentItem.do;jsessionid=6C3CF32A99DF3971C2144B461C8F2CF5?contentType=Article\&hdAction=lnkpdf\&contentId=1550662},
 	author = {Jin-Qiao Shi and Bin-Xing Fang and Li-Jie Shao}
 }
-@book {2006,
+@book {2006_17,
 	title = {Reputation Mechanisms},
 	booktitle = {Handbook on Information Systems and Economics},
 	year = {2006},
@@ -7230,7 +7253,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
 	year = {2006},
 	abstract = {Permission is hereby granted to make and distribute verbatim copies of this document without royalty or fee. Permission is granted to quote excerpts from this documented provided the original source is properly cited. ii When separately written programs are composed so that they may cooperate, they may instead destructively interfere in unanticipated ways. These hazards limit the scale and functionality of the software systems we can successfully compose. This dissertation presents a framework for enabling those interactions between components needed for the cooperation we intend, while minimizing the hazards of destructive interference. Great progress on the composition problem has been made within the object paradigm, chiefly in the context of sequential, single-machine programming among benign components. We show how to extend this success to support robust composition of concurrent and potentially malicious components distributed over potentially malicious machines. We present E, a distributed, persistent, secure programming language, and CapDesk, a virus-safe desktop built in E, as embodiments of the techniques we explain},
 	keywords = {robustness},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.4674},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.4674},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.101.4674.pdf},
 	author = {Mark Samuel Miller}
 }
@@ -7245,11 +7268,11 @@ two shallow circuits: one for generating many arbitrarily but identically biased
 	keywords = {P2P, privacy},
 	isbn = {1-59593-518-5},
 	doi = {10.1145/1180405.1180409},
-	url = {http://portal.acm.org/citation.cfm?id=1180409},
+	www_section = {http://portal.acm.org/citation.cfm?id=1180409},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Salsa.pdf},
 	author = {Arjun Nambiar}
 }
-@conference {2006,
+@conference {2006_18,
 	title = {Scalable Routing in Sensor Actuator Networks with Churn},
 	booktitle = {Sensor and Ad Hoc Communications and Networks, 2006. SECON {\textquoteright}06. 2006 3rd Annual IEEE Communications Society on },
 	year = {2006},
@@ -7258,7 +7281,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
 	keywords = {ad-hoc networks, scalable source routing},
 	isbn = {1-4244-0626-9 },
 	doi = {10.1109/SAHCN.2006.288406 },
-	url = {http://ieeexplore.ieee.org/Xplore/login.jsp?url=http\%3A\%2F\%2Fieeexplore.ieee.org\%2Fiel5\%2F4068086\%2F4068087\%2F04068105.pdf\%3Farnumber\%3D4068105\&authDecision=-203}
+	www_section = {http://ieeexplore.ieee.org/Xplore/login.jsp?url=http\%3A\%2F\%2Fieeexplore.ieee.org\%2Fiel5\%2F4068086\%2F4068087\%2F04068105.pdf\%3Farnumber\%3D4068105\&authDecision=-203}
 }
 @conference {Atallah2006,
 	title = {Secure Collaborative Planning, Forecasting, and Replenishment},
@@ -7281,7 +7304,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
 	pages = {205{\textendash}223},
 	abstract = {Individuals are increasingly confronted with requests to identify themselves when accessing services provided by government organizations, companies, and other service providers. At the same time, traditional transaction mechanisms are increasingly being replaced by electronic mechanisms that underneath their hood automatically capture and record globally unique identifiers. Taken together, these interrelated trends are currently eroding the privacy and security of individuals in a manner unimaginable just a few decades ago. Privacy activists are facing an increasingly hopeless battle against new privacy-invasive identification initiatives: the cost of computerized identification systems is rapidly going down, their accuracy and efficiency is improving all the time, much of the required data communication infrastructure is now in place, forgery of non-electronic user credentials is getting easier all the time, and data sharing imperatives have gone up dramatically. This paper argues that the privacy vs. identification debate should be moved into less polarized territory. Contrary to popular misbelief, identification and privacy are not opposite interests that need to be balanced: the same technological advances that threaten to annihilate privacy can be exploited to save privacy in an electronic age. The aim of this paper is to clarify that premise on the basis of a careful analysis of the concept of user identification itself. Following an examination of user identifiers and its purposes, I classify identification technologies in a manner that enables their privacy and security implications to be clearly articulated and contrasted. I also include an overview of a modern privacy-preserving approach to user identification},
 	keywords = {authentication, cryptography, data sharing, privacy},
-	url = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=999695},
+	www_section = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=999695},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/brands06.pdf},
 	author = {Stefan Brands}
 }
@@ -7293,7 +7316,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
 	address = {Budapest, Hungary},
 	abstract = {The Scalable Source Routing (SSR) protocol combines overlay-like routing in a virtual network structure with source routing in the physical network to a single cross-layer architecture. Thereby, it can provide indirect routing in networks that lack a well-crafted structure. SSR is well suited for mobile ad hoc networks, sensor-actuator networks, and especially for mesh networks. Moreover, SSR directly provides the routing semantics of a structured routing overlay, making it an efficient basis for the scalable implementation of fully decentralized applications. In this paper we analyze SSR with regard to security: We show where SSR is prone to attacks, and we describe protocol modifications that make SSR robust in the presence of malicious nodes. The core idea is to introduce cryptographic certificates that allow nodes to discover forged protocol messages. We evaluate our proposed modifications by means of simulations, and thus demonstrate that they are both effective and efficient},
 	keywords = {cryptography, scalable source routing, sensor networks},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kutzner06securessr.pdf},
 	author = {Kendy Kutzner and Christian Wallenta and Thomas Fuhrmann}
 }
@@ -7308,7 +7331,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
 	abstract = {This paper reviews the Internet-inspired security work on delay tolerant networking, in particular, as it might apply to space missions, and identifies some challenges arising, for both the Internet security community and for space missions. These challenges include the development of key management schemes suited for space missions as well as a characterization of the actual security requirements applying. A specific goal of this paper is therefore to elicit feedback from space mission IT specialists in order to guide the development of security mechanisms for delay tolerant networking},
 	isbn = {0-7695-2644-6},
 	doi = {10.1109/SMC-IT.2006.66},
-	url = {http://portal.acm.org/citation.cfm?id=1158336.1158641$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1158336.1158641$\#$},
 	author = {Farrell, Stephen and Cahill, Vinny}
 }
 @conference {tap:pet2006,
@@ -7324,7 +7347,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
 	keywords = {Tor},
 	isbn = {978-3-540-68790-0},
 	doi = {10.1007/11957454},
-	url = {http://www.springerlink.com/content/n77w19002743xu51/},
+	www_section = {http://www.springerlink.com/content/n77w19002743xu51/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tap-pet2006.pdf},
 	author = {Ian Goldberg},
 	editor = {George Danezis and Philippe Golle}
@@ -7340,10 +7363,10 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
 	address = {Washington, DC, USA},
 	isbn = {0-7695-2571-7},
 	doi = {10.1109/ICDEW.2006.137},
-	url = {http://dx.doi.org/10.1109/ICDEW.2006.137},
+	www_section = {http://dx.doi.org/10.1109/ICDEW.2006.137},
 	author = {Karnstedt, Marcel and Sattler, Kai-Uwe and Manfred Hauswirth and Roman Schmidt}
 }
-@proceedings {2006,
+@proceedings {2006_19,
 	title = {Software Engineering for Ambient Intelligence Systems},
 	year = {2006},
 	abstract = {AmbiComp is a new research project that will invest about 30 person years into the development of a new and simple software engineering approach for mobile embedded interactive systems. In order to achieve its ambitious goals, it will combine research from different fields such as mobile peer-to-peer networks and operating systems. As a result, developing applications across multiple embedded devices shall be greatly facilitated},
@@ -7362,7 +7385,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
 	abstract = {Mobile devices are increasingly relied on but are used in contexts that put them at risk of physical dam- age, loss or theft. We consider a fault-tolerance ap- proach that exploits spontaneous interactions to imple- ment a collaborative backup service. We define the con- straints implied by the mobile environment,analyze how they translate into the storage layer of such a backup system and examine various design options. The paper concludes with a presentation of our prototype imple- mentation of the storage layer, an evaluation of the im- pact of several compression methods,and directions for future work},
 	isbn = {0-7695-2648-9},
 	doi = {10.1109/EDCC.2006.26},
-	url = {http://portal.acm.org/citation.cfm?id=1170307$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1170307$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/slides.pdf},
 	author = {Ludovic Courtes and Killijian, Marc-Olivier and Powell, David}
 }
@@ -7376,11 +7399,11 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
 	address = {Amherst, MA},
 	abstract = {Many security mechanisms are based on specific assumptions of identity and are vulnerable to attacks when these assumptions are violated. For example, impersonation is the well-known consequence when authenticating credentials are stolen by a third party. Another attack on identity occurs when credentials for one identity are purposely shared by multiple individuals, for example to avoid paying twice for a service. In this paper, we survey the impact of the Sybil attack, an attack against identity in which an individual entity masquerades as multiple simultaneous identities. The Sybil attack is a fundamental problem in many systems, and it has so far resisted a universally applicable solution},
 	keywords = {anonymity, security, Sybil attack},
-	url = {http://prisms.cs.umass.edu/brian/pubs/levine.sybil.tr.2006.pdf},
+	www_section = {http://prisms.cs.umass.edu/brian/pubs/levine.sybil.tr.2006.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Tech\%20Report\%20-\%20A\%20Survey\%20of\%20Solutions\%20to\%20the\%20Sybil\%20Attack.pdf},
 	author = {Brian Neil Levine and Clay Shields and Margolin, N. Boris}
 }
-@article {2006,
+@article {2006_20,
 	title = {A survey on networking games in telecommunications},
 	journal = {Computers \& Operations Research},
 	volume = {33},
@@ -7408,7 +7431,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
 	keywords = {social networks, Sybil attack, sybilGuard},
 	isbn = {1-59593-308-5},
 	doi = {http://doi.acm.org/10.1145/1159913.1159945},
-	url = {http://doi.acm.org/10.1145/1159913.1159945},
+	www_section = {http://doi.acm.org/10.1145/1159913.1159945},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%2706\%20-\%20SybilGuard.pdf},
 	author = {Yu, Haifeng and Kaminsky, Michael and Gibbons, Phillip B. and Flaxman, Abraham}
 }
@@ -7423,7 +7446,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
 	abstract = {The field of peer-to-peer reputation systems has exploded in the last few years. Our goal is to organize existing ideas and work to facilitate system design. We present a taxonomy of reputation system components, their properties, and discuss how user behavior and technical constraints can conflict. In our discussion, we describe research that exemplifies compromises made to deliver a useable, implementable system},
 	keywords = {P2P, trust},
 	doi = {10.1016/j.comnet.2005.07.011},
-	url = {http://portal.acm.org/citation.cfm?id=1139713},
+	www_section = {http://portal.acm.org/citation.cfm?id=1139713},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Marti-ElsevierScienceSubmitted05_0.pdf},
 	author = {Marti, Sergio and Hector Garcia-Molina}
 }
@@ -7438,7 +7461,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
 	keywords = {anonymity},
 	isbn = {978-3-540-44601-9},
 	doi = {10.1007/11863908},
-	url = {http://www.springerlink.com/content/3n136578m4211484/},
+	www_section = {http://www.springerlink.com/content/3n136578m4211484/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ShWa-Timing06.pdf},
 	author = {Vitaly Shmatikov and Ming-Hsui Wang}
 }
@@ -7452,11 +7475,11 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
 	keywords = {ad-hoc networks},
 	isbn = {1-4244-0349-9 },
 	doi = {10.1109/CISS.2006.286695 },
-	url = {http://dblp.uni-trier.de/db/conf/infocom/infocom2006.html$\#$SunHYL06},
+	www_section = {http://dblp.uni-trier.de/db/conf/infocom/infocom2006.html$\#$SunHYL06},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Trust_infocom06_v4.pdf},
 	author = {Yan L. Sun and Zhu Han and Wei Yu and K. J. Ray Liu}
 }
-@book {2006,
+@book {2006_21,
 	title = {Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation},
 	booktitle = {Theory of Cryptography},
 	series = {Lecture Notes in Computer Science},
@@ -7469,7 +7492,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
 This result immediately implies solutions to other long-standing open problems such as constant-rounds and unconditionally secure protocols for deciding whether a shared number is zero, comparing shared numbers, raising a shared number to a shared exponent and reducing a shared number modulo a shared modulus},
 	isbn = {978-3-540-32731-8},
 	doi = {10.1007/11681878_15},
-	url = {http://dx.doi.org/10.1007/11681878_15},
+	www_section = {http://dx.doi.org/10.1007/11681878_15},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/UnconditionallySecure2006Damgard.pdf},
 	author = {Damg{\'a}rd, Ivan and Fitzi, Matthias and Kiltz, Eike and Nielsen, JesperBuus and Toft, Tomas},
 	editor = {Halevi, Shai and Rabin, Tal}
@@ -7488,7 +7511,7 @@ This result immediately implies solutions to other long-standing open problems s
 	keywords = {BitTorrent, churn, Gnutella, KAD, peer-to-peer networking, session length, uptime},
 	isbn = {1-59593-561-4},
 	doi = {http://doi.acm.org/10.1145/1177080.1177105},
-	url = {http://doi.acm.org/10.1145/1177080.1177105},
+	www_section = {http://doi.acm.org/10.1145/1177080.1177105},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IMC\%2706\%20-\%20Understanding\%20churn\%20in\%20p2p\%20networks.pdf},
 	author = {Stutzbach, Daniel and Rejaie, Reza}
 }
@@ -7505,7 +7528,7 @@ This result immediately implies solutions to other long-standing open problems s
 	keywords = {censorship resistance, information hiding},
 	isbn = {978-3-540-68790-0},
 	doi = {10.1007/11957454},
-	url = {http://www.springerlink.com/content/d58607007777r8l1/},
+	www_section = {http://www.springerlink.com/content/d58607007777r8l1/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/valet-pet2006.pdf},
 	author = {Lasse {\O}verlier and Paul Syverson},
 	editor = {George Danezis and Philippe Golle}
@@ -7522,7 +7545,7 @@ This result immediately implies solutions to other long-standing open problems s
 	keywords = {formal security model, paillier public-key system, privacy, verifiable shuffles},
 	issn = {1615-5262},
 	doi = {10.1007/s10207-006-0004-8},
-	url = {http://portal.acm.org/citation.cfm?id=1164438},
+	www_section = {http://portal.acm.org/citation.cfm?id=1164438},
 	author = {Lan Nguyen and Rei Safavi-Naini and Kaoru Kurosawa}
 }
 @booklet {Widmer_abstractnetwork,
@@ -7532,7 +7555,7 @@ This result immediately implies solutions to other long-standing open problems s
 	keywords = {ad-hoc networks, delay tolerant network, routing},
 	isbn = {1-59593-026-4},
 	doi = {10.1145/1080139.1080147},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.5368},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.5368},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.102.5368.pdf},
 	author = {J{\"o}rg Widmer}
 }
@@ -7548,7 +7571,7 @@ This result immediately implies solutions to other long-standing open problems s
 	keywords = {anonymity, mix},
 	isbn = {978-3-540-34745-3},
 	doi = {10.1007/11767831},
-	url = {http://www.springerlink.com/content/b0t0714165846m42/},
+	www_section = {http://www.springerlink.com/content/b0t0714165846m42/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pet05-borisov.pdf},
 	author = {Borisov, Nikita}
 }
@@ -7569,7 +7592,7 @@ This result immediately implies solutions to other long-standing open problems s
 	month = {May},
 	publisher = {EECS Department, University of California, Berkeley},
 	abstract = {Existing peer-to-peer systems that aim to provide anonymity to its users are based on networks with unstructured or loosely-structured routing algorithms. Structured routing offers performance and robustness guarantees that these systems are unable to achieve. We therefore investigate adding anonymity support to structured peer-to-peer networks. We apply an entropy-based anonymity metric to Chord and use this metric to quantify the improvements in anonymity afforded by several possible extensions. We identify particular properties of Chord that have the strongest effect on anonymity and propose a routing extension that allows a general trade-off between anonymity and performance. Our results should be applicable to other structured peer-to-peer systems},
-	url = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2005/6509.html},
+	www_section = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2005/6509.html},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CSD-05-1390.pdf},
 	author = {Borisov, Nikita and Waddle, Jason}
 }
@@ -7585,7 +7608,7 @@ We show that applying encoding based on universal re-encryption can solve many o
 	keywords = {onion routing, universal re-encryption},
 	isbn = {978-3-540-24302-1},
 	doi = {10.1007/b105088},
-	url = {http://www.springerlink.com/content/9023b6ad0thaf51p/},
+	www_section = {http://www.springerlink.com/content/9023b6ad0thaf51p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/sofem05-Klonowski.pdf},
 	author = {Marek Klonowski and Miroslaw Kutylowski and Filip Zagorski}
 }
@@ -7601,7 +7624,7 @@ We show that applying encoding based on universal re-encryption can solve many o
 	keywords = {ad-hoc networks, mesh networks, multi-hop networks, route metrics, wireless routing},
 	isbn = {1-59593-020-5},
 	doi = {10.1145/1080829.1080833},
-	url = {http://portal.acm.org/citation.cfm?id=1080833$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1080833$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.62.3119.pdf},
 	author = {Bicket, John and Aguayo, Daniel and Biswas, Sanjit and Robert Morris}
 }
@@ -7618,7 +7641,7 @@ We show that applying encoding based on universal re-encryption can solve many o
 	keywords = {byzantine fault tolerance, game theory, reliability},
 	issn = {0163-5980},
 	doi = {10.1145/1095809.1095816},
-	url = {http://portal.acm.org/citation.cfm?id=1095816$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1095816$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.80.713.pdf},
 	author = {Aiyer, Amitanand S. and Lorenzo Alvisi and Clement, Allen and Dahlin, Mike and Martin, Jean-Philippe and Porth, Carl}
 }
@@ -7651,7 +7674,7 @@ We show that applying encoding based on universal re-encryption can solve many o
 	keywords = {mix, traffic analysis},
 	isbn = {978-3-540-29039-1},
 	doi = {10.1007/11558859},
-	url = {http://www.springerlink.com/index/y78350424h77u578.pdf},
+	www_section = {http://www.springerlink.com/index/y78350424h77u578.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ih05-Luke.pdf},
 	author = {Luke O{\textquoteright}Connor}
 }
@@ -7666,7 +7689,7 @@ We show that applying encoding based on universal re-encryption can solve many o
 	abstract = {The emerging grids need an efficient replica location mechanism. In the experience of developing 1 ChinaGrid Supporting Platform (CGSP), a grid middleware that builds a uniform platform supporting multiple grid-based applications, we meet a challenge of utilizing the properties of locality in replica location process to construct a practical and high performance replica location mechanism. The key of the solution to this challenge is to design an efficient replica location algorithm that meets above requirements. Some previous works have been done to build a replica location mechanism, but they are not suitable for replica location in a grid environment with multiple applications like ChinaGrid. In this paper, we present a novel peer-to-peer algorithm for replica location mechanism, Boundary Chord, which has the merits of locality awareness, self-organization, and load balancing. Simulation results show that the algorithm has better performance than other structured peer-to-peer solutions to the replica location problem},
 	isbn = {0-7695-2509-1},
 	doi = {10.1109/ISPAN.2005.21},
-	url = {http://portal.acm.org/citation.cfm?id=1108067$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1108067$\#$},
 	author = {Jin, Hai and Wang, Chengwei and Chen, Hanhua}
 }
 @article {Pfister05capacity-achievingensembles,
@@ -7680,7 +7703,7 @@ We show that applying encoding based on universal re-encryption can solve many o
 	keywords = {BEC, coding theory, IRA, MBIOS},
 	isbn = {0-7803-8280-3  },
 	doi = {10.1109/ISIT.2004.1365246  },
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.3798},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.3798},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/0409026v1.pdf},
 	author = {Henry D. Pfister and Igal Sason and R{\"u}diger L. Urbanke}
 }
@@ -7691,7 +7714,7 @@ We show that applying encoding based on universal re-encryption can solve many o
 	publisher = {ACM/USENIX},
 	organization = {ACM/USENIX},
 	abstract = {Anonymous routing protects user communication from identification by third-party observers. Existing anonymous routing layers utilize Chaum-Mixes for anonymity by relaying traffic through relay nodes called mixes. The source defines a static forwarding path through which traffic is relayed to the destination. The resulting path is fragile and shortlived: failure of one mix in the path breaks the forwarding path and results in data loss and jitter before a new path is constructed. In this paper, we propose Cashmere, a resilient anonymous routing layer built on a structured peer-to-peer overlay. Instead of single-node mixes, Cashmere selects regions in the overlay namespace as mixes. Any node in a region can act as the MIX, drastically reducing the probability of a mix failure. We analyze Cashmere{\textquoteright}s anonymity and measure its performance through simulation and measurements, and show that it maintains high anonymity while providing orders of magnitude improvement in resilience to network dynamics and node failures},
-	url = {http://portal.acm.org/citation.cfm?id=1251203.1251225$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1251203.1251225$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cashmere.pdf},
 	author = {Li Zhuang and Feng Zhou and Ben Y. Zhao and Antony Rowstron}
 }
@@ -7707,11 +7730,11 @@ We show that applying encoding based on universal re-encryption can solve many o
 	keywords = {censorship resistance, private information retrieval},
 	isbn = {978-3-540-29039-1},
 	doi = {10.1007/11558859},
-	url = {http://www.springerlink.com/content/f08707qw34614340/},
+	www_section = {http://www.springerlink.com/content/f08707qw34614340/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ih05-csispir.pdf},
 	author = {Ginger Perng and Michael K. Reiter and Chenxi Wang}
 }
-@conference {2005,
+@conference {2005_0,
 	title = {Chainsaw: Eliminating Trees from Overlay Multicast},
 	booktitle = {4th International Workshop},
 	series = {Lecture Notes in Computer Science (Peer-to-peer Systems IV)},
@@ -7727,7 +7750,7 @@ We show that applying encoding based on universal re-encryption can solve many o
 	isbn = {978-3-540-29068-1},
 	issn = {1611-3349 (Online)},
 	doi = {10.1007/11558989},
-	url = {http://www.springerlink.com/content/l13550223q12l65v/about/},
+	www_section = {http://www.springerlink.com/content/l13550223q12l65v/about/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/chainsaw.pdf},
 	author = {Vinay Pai and Kapil Kumar and Karthik Tamilmani and Vinay Sambamurthy and Alexander E. Mohr},
 	editor = {Miguel Castro and Robbert Van Renesse}
@@ -7737,7 +7760,7 @@ We show that applying encoding based on universal re-encryption can solve many o
 	year = {2005},
 	abstract = {In recent years, the standards community has developed techniques for traversing NAT/firewall boxes with UDP (that is, establishing UDP flows between hosts behind NATs). Because of the asymmetric nature of TCP connection establishment, however, NAT traversal of TCP is more difficult. Researchers have recently proposed a variety of promising approaches for TCP NAT traversal. The success of these approaches, however, depend on how NAT boxes respond to various sequences of TCP (and ICMP) packets. This paper presents the first broad study of NAT behavior for a comprehensive set of TCP NAT traversal techniques over a wide range of commercial NAT products. We developed a publicly available software test suite that measures the NAT{\textquoteright}s responses both to a variety of isolated probes and to complete TCP connection establishments. We test sixteen NAT products in the lab, and 93 home NATs in the wild. Using these results, as well as market data for NAT products, we estimate the likelihood of successful NAT traversal for home networks. The insights gained from this paper can be used to guide both design of TCP NAT traversal protocols and the standardization of NAT/firewall behavior, including the IPv4-IPv6 translating NATs critical for IPv6 transition},
 	keywords = {firewall, NAT},
-	url = {http://portal.acm.org/citation.cfm?id=1251086.1251104},
+	www_section = {http://portal.acm.org/citation.cfm?id=1251086.1251104},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/imc05-tcpnat.pdf},
 	author = {Saikat Guha and Paul Francis}
 }
@@ -7755,7 +7778,7 @@ We show that applying encoding based on universal re-encryption can solve many o
 We then extend our scheme to our second result, the first e-cash scheme that provides traceable coins without a trusted third party. That is, once a user has double spent one of the 2^l coins in her wallet, all her spendings of these coins can be traced. We present two alternate constructions. One construction shares the same complexities with our first result but requires a strong bilinear map assumption that is only conjectured to hold on MNT curves. The second construction works on more general types of elliptic curves, but the price for this is that the complexity of the spending and of the withdrawal protocols becomes O(lk) and O(lk + k^2) bits, respectively, and wallets take O(lk) bits of storage. All our schemes are secure in the random oracle model},
 	isbn = {3-540-25910-4},
 	doi = {10.1007/b136415},
-	url = {http://www.springerlink.com/content/vwkgkfpdmrdky5a8/},
+	www_section = {http://www.springerlink.com/content/vwkgkfpdmrdky5a8/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/chl05-full-eurocrypt2005.pdf},
 	author = {Jan Camenisch and Susan Hohenberger and Anna Lysyanskaya},
 	editor = {Ronald Cramer}
@@ -7772,11 +7795,11 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
 	keywords = {countermeasure, mix},
 	isbn = {978-3-540-29039-1},
 	doi = {10.1007/11558859},
-	url = {http://www.springerlink.com/content/74461772r675l828/},
+	www_section = {http://www.springerlink.com/content/74461772r675l828/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ih05-danezisclulow.pdf},
 	author = {George Danezis and Jolyon Clulow}
 }
-@article {2005,
+@article {2005_1,
 	title = {Cooperation among strangers with limited information about reputation},
 	journal = {Journal of Public Economics},
 	volume = {89},
@@ -7786,11 +7809,11 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
 	abstract = {The amount of institutional intervention necessary to secure efficiency-enhancing cooperation in markets and organizations, in circumstances where interactions take place among essentially strangers, depends critically on the amount of information informal reputation mechanisms need transmit. Models based on subgame perfection find that the information necessary to support cooperation is recursive in nature and thus information generating and processing requirements are quite demanding. Models that do not rely on subgame perfection, on the other hand, suggest that the information demands may be quite modest. The experiment we present indicates that even without any reputation information there is a non-negligible amount of cooperation that is, however, quite sensitive to the cooperation costs. For high costs, providing information about a partner{\textquoteright}s immediate past action increases cooperation. Recursive information about the partners{\textquoteright} previous partners{\textquoteright} reputation further promotes cooperation, regardless of the cooperation costs},
 	keywords = {cooperation, experimental economics, reputation},
 	doi = {doi:10.1016/j.jpubeco.2004.03.008},
-	url = {doi:10.1016/j.jpubeco.2004.03.008},
+	www_section = {doi:10.1016/j.jpubeco.2004.03.008},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Journal\%20of\%20Public\%20Economics\%20-\%20Bolton\%2C\%20Katok\%20\%26\%20Ockenfels.pdf},
 	author = {Gary E. Bolton and Elena Katok and Axel Ockenfels}
 }
-@conference {2005,
+@conference {2005_2,
 	title = {Correctness of a gossip based membership protocol},
 	booktitle = {PDOC{\textquoteright}05},
 	year = {2005},
@@ -7825,7 +7848,7 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
 	keywords = {content distribution, file swarming, peer-to-peer networking},
 	isbn = {1-59593-022-1},
 	doi = {http://doi.acm.org/10.1145/1064212.1064215},
-	url = {http://doi.acm.org/10.1145/1064212.1064215},
+	www_section = {http://doi.acm.org/10.1145/1064212.1064215},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGMETRICS\%2705\%20-\%20Coupon\%20replication\%20systems.pdf},
 	author = {Massouli{\'e}, Laurent and Vojnovi{\'c}, Milan}
 }
@@ -7842,7 +7865,7 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
 	keywords = {decentralized, distributed systems, network size estimation},
 	isbn = {0-7695-2326-9},
 	doi = {10.1109/NCA.2005.15},
-	url = {http://dl.acm.org/citation.cfm?id=1097873.1098292},
+	www_section = {http://dl.acm.org/citation.cfm?id=1097873.1098292},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NCA\%2705\%20-\%20Decentralized\%20Schemes\%20for\%20Size\%20Estimation\%20in\%20Large\%20and\%20Dynamic\%20Groups.pdf},
 	author = {Kostoulas, Dionysios and Psaltoulis, Dimitrios and Indranil Gupta and Kenneth P. Birman and Alan Demers}
 }
@@ -7857,7 +7880,7 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
 	keywords = {storage},
 	isbn = {0-7695-2285-8},
 	doi = {10.1109/ICDE.2005.47},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.6928},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.6928},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.76.5241.pdf},
 	author = {Lawrence L. You and Kristal T. Pollack and Darrell D. E. Long}
 }
@@ -7891,7 +7914,7 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
 
 This paper describes the design and implementation of rcc, the router configuration checker, a tool that finds faults in BGP configurations using static analysis. rcc detects faults by checking constraints that are based on a high-level correctness specification. rcc detects two broad classes of faults: route validity faults, where routers may learn routes that do not correspond to usable paths, and path visibility faults, where routers may fail to learn routes for paths that exist in the network. rcc enables network operators to test and debug configurations before deploying them in an operational network, improving on the status quo where most faults are detected only during operation. rcc has been downloaded by more than sixty-five network operators to date, some of whom have shared their configurations with us. We analyze network-wide configurations from 17 different ASes to detect a wide variety of faults and use these findings to motivate improvements to the Internet routing infrastructure},
 	keywords = {autonomous systems, border gateway protocol},
-	url = {http://portal.acm.org/citation.cfm?id=1251207$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1251207$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.113.5668.pdf},
 	author = {Nick Feamster and Hari Balakrishnan}
 }
@@ -7908,11 +7931,11 @@ This paper describes the design and implementation of rcc, the router configurat
 	keywords = {contracts, P2P, peer resource contribution, peer-to-peer networking},
 	isbn = {0-7695-2417-6},
 	doi = {10.1109/HOT-P2P.2005.9},
-	url = {http://dl.acm.org/citation.cfm?id=1090948.1091369},
+	www_section = {http://dl.acm.org/citation.cfm?id=1090948.1091369},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/HOT-P2P\%2705\%20-\%20Khorshadi\%2C\%20Liu\%20\%26\%20Ghosal.pdf},
 	author = {Khorshadi, Behrooz and Liu, Xin and Dipak Ghosal}
 }
-@book {2005,
+@book {2005_3,
 	title = {Distributed Hash Tables},
 	booktitle = {Peer-to-Peer Systems and Applications},
 	series = {Lecture Notes in Computer Science},
@@ -7927,7 +7950,7 @@ This paper describes the design and implementation of rcc, the router configurat
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/LNCS\%20-\%20Distributed\%20Hash\%20Tables.pdf},
 	author = {Klaus Wehrle and G{\"o}tz, Stefan and Rieche, Simon}
 }
-@conference {2005,
+@conference {2005_4,
 	title = {An empirical study of free-riding behavior in the maze p2p file-sharing system},
 	booktitle = {Proceedings of the 4th international conference on Peer-to-Peer Systems},
 	year = {2005},
@@ -7937,7 +7960,7 @@ This paper describes the design and implementation of rcc, the router configurat
 	keywords = {free-riding, incentives, Sybil attack},
 	isbn = {3-540-29068-0, 978-3-540-29068-1},
 	doi = {10.1007/11558989_17},
-	url = {http://dx.doi.org/10.1007/11558989_17},
+	www_section = {http://dx.doi.org/10.1007/11558989_17},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/maze_freeride.pdf},
 	author = {Yang, Mao and Zhang, Zheng and Li, Xiaoming and Dai, Yafei}
 }
@@ -7950,7 +7973,7 @@ This paper describes the design and implementation of rcc, the router configurat
 	type = {Tech report},
 	address = {Jerusalem, Israel},
 	abstract = {this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitle "GNU Free Documentation License"},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.7750},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.7750},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.60.7750_0.pdf},
 	author = {Yoram Kulbak and Danny Bickson}
 }
@@ -7963,11 +7986,11 @@ This paper describes the design and implementation of rcc, the router configurat
 	abstract = {mobility is a challenging problem because disconnections are prevalent and lack of knowledge about network dynamics hinders good decision making. Current approaches are primarily based on redundant transmissions. They have either high overhead due to excessive transmissions or long delays due to the possibility of making wrong choices when forwarding a few redundant copies. In this paper, we propose a novel forwarding algorithm based on the idea of erasure codes. Erasure coding allows use of a large number of relays while maintaining a constant overhead, which results in fewer cases of long delays. We use simulation to compare the routing performance of using erasure codes in DTN with four other categories of forwarding algorithms proposed in the literature. Our simulations are based on a real-world mobility trace collected in a large outdoor wild-life environment. The results show that the erasure-coding based algorithm provides the best worst-case delay performance with a fixed amount of overhead. We also present a simple analytical model to capture the delay characteristics of erasure-coding based forwarding, which provides insights on the potential of our approach},
 	keywords = {delay tolerant network, routing},
 	doi = {10.1145/1080139.1080140},
-	url = {http://doi.acm.org/10.1145/1080139.1080140},
+	www_section = {http://doi.acm.org/10.1145/1080139.1080140},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.79.364.pdf},
 	author = {Wang, Yong and Sushant Jain and Martonosi, Margaret and Fall, Kevin}
 }
-@conference {2005,
+@conference {2005_5,
 	title = {Exchange-based incentive mechanisms for peer-to-peer file sharing},
 	booktitle = {Proceedings of International Conference on Distributed Computing Systems 2004},
 	year = {2005},
@@ -7996,7 +8019,7 @@ This paper describes the design and implementation of rcc, the router configurat
 	keywords = {bandwidth allocation, dblp, nash equilibrium, routing allocation},
 	isbn = {0-7803-8968-9 },
 	doi = {10.1109/INFCOM.2005.1498490  },
-	url = {http://dblp.uni-trier.de/db/conf/infocom/infocom2005.html$\#$GollapudiSZ05},
+	www_section = {http://dblp.uni-trier.de/db/conf/infocom/infocom2005.html$\#$GollapudiSZ05},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/INFOCOM\%2705\%20-\%20Exploiting\%20anarchy\%20in\%20networks.pdf},
 	author = {Gollapudi, Sreenivas and Sivakumar, D. and Zhang, Aidong}
 }
@@ -8010,7 +8033,7 @@ This paper describes the design and implementation of rcc, the router configurat
 	abstract = {As the ubiquitous computing vision materializes, the number and diversity of digital elements in our environment increases. Computing capability comes in various forms and is embedded in different physical objects, ranging from miniature devices such as human implants and tiny sensor particles, to large constructions such as vehicles and entire buildings. The number of possible interactions among such elements, some of which may be invisible or offer similar functionality, is growing fast so that it becomes increasingly hard to combine or select between them. Mechanisms are thus required for intelligent matchmaking that will achieve controlled system behavior, yet without requiring the user to continuously input desirable options in an explicit manner. In this paper we argue that information about the colocation relationship of computing elements is quite valuable in this respect and can be exploited to guide automated service selection with minimal or no user involvement. We also discuss the implementation of such mechanism that is part of our runtime system for smart objects},
 	isbn = {0-7695-2375-7},
 	doi = {10.1109/MOBIQUITOUS.2005.29},
-	url = {http://www.computer.org/portal/web/csdl/doi/10.1109/MOBIQUITOUS.2005.29},
+	www_section = {http://www.computer.org/portal/web/csdl/doi/10.1109/MOBIQUITOUS.2005.29},
 	author = {Alexandros Karypidis and Spyros Lalis}
 }
 @article {10.1109/MASCOT.2005.73,
@@ -8036,7 +8059,7 @@ This paper describes the design and implementation of rcc, the router configurat
 	keywords = {cryptography},
 	isbn = {978-3-540-28114-6},
 	doi = {10.1007/11535218},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.4261},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.4261},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SHA1AttackProceedingVersion.pdf},
 	author = {Xiaoyun Wang and Yiqun Lisa Yin and Hongbo Yu}
 }
@@ -8072,7 +8095,7 @@ This paper describes the design and implementation of rcc, the router configurat
 	abstract = {This paper studies the degradation of anonymity in a flow-based wireless mix network under flow marking attacks, in which an adversary embeds a recognizable pattern of marks into wireless traffic flows by electromagnetic interference. We find that traditional mix technologies are not effective in defeating flow marking attacks, and it may take an adversary only a few seconds to recognize the communication relationship between hosts by tracking suchartificial marks. Flow marking attacks utilize frequency domain analytical techniques and convert time domain marks into invariant feature frequencies. To counter flow marking attacks, we propose a new countermeasure based on digital filtering technology, and show that this filter-based counter-measure can effectively defend a wireless mix network from flow marking attacks},
 	keywords = {802.11, anonymity, Bluetooth, flow marking attack},
 	isbn = {0-7695-2331-5},
-	url = {http://portal.acm.org/citation.cfm?id=1069397},
+	www_section = {http://portal.acm.org/citation.cfm?id=1069397},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Fu--FlowMarking--2005.pdf},
 	author = {Xinwen Fu and Ye Zhu and Bryan Graham and Riccardo Bettati and Wei Zhao}
 }
@@ -8089,7 +8112,7 @@ We provide a formal definition of onion-routing in the universally composable fr
 	keywords = {onion routing, privacy},
 	isbn = {978-3-540-28114-6},
 	doi = {10.1007/11535218},
-	url = {http://www.springerlink.com/content/0jmg1krt9ph147ql/},
+	www_section = {http://www.springerlink.com/content/0jmg1krt9ph147ql/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/camlys05.pdf},
 	author = {Jan Camenisch and Anna Lysyanskaya},
 	editor = {Victor Shoup}
@@ -8110,7 +8133,7 @@ We provide a formal definition of onion-routing in the universally composable fr
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IEEE\%20DSO\%20-\%20Free\%20riding\%20on\%20Gnutella\%20revisited.pdf},
 	author = {Daniel Hughes and Geoff Coulson and James Walkerdine}
 }
-@conference {2005,
+@conference {2005_6,
 	title = {Fuzzy Identity-Based Encryption},
 	booktitle = {EUROCRYPT{\textquoteright}05 Workshop on the Theory and Application of of Cryptographic Techniques},
 	series = {Lecture Notes in Computer Science},
@@ -8140,7 +8163,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
 	keywords = {Gossip-based protocols, proactive aggregation},
 	issn = {0734-2071},
 	doi = {http://doi.acm.org/10.1145/1082469.1082470},
-	url = {http://doi.acm.org/10.1145/1082469.1082470},
+	www_section = {http://doi.acm.org/10.1145/1082469.1082470},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Jelasity\%2C\%20Montresor\%20\%26\%20Babaoglu\%20-\%20Gossip-based\%20aggregation.pdf},
 	author = {M{\'a}rk Jelasity and Alberto Montresor and Babaoglu, Ozalp}
 }
@@ -8150,7 +8173,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
 	year = {2005},
 	abstract = {Existing solutions to balance load in DHTs incur a high overhead either in terms of routing state or in terms of load movement generated by nodes arriving or departing the system. In this paper, we propose a set of general techniques and use them to develop a protocol based on Chord, called Y0 , that achieves load balancing with minimal overhead under the typical assumption that the load is uniformly distributed in the identifier space. In particular, we prove that Y0 can achieve near-optimal load balancing, while moving little load to maintain the balance and increasing the size of the routing tables by at most a constant factor},
 	keywords = {Chord, distributed hash table, load balancing},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.6740},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.6740},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/paper.pdf},
 	author = {Godfrey, Brighten and Ion Stoica}
 }
@@ -8168,7 +8191,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
 	keywords = {contracts, hidden-action, incentives, mechanism design, moral-hazard, multi-hop, principal-agent model, routing},
 	isbn = {1-59593-049-3},
 	doi = {http://doi.acm.org/10.1145/1064009.1064022},
-	url = {http://doi.acm.org/10.1145/1064009.1064022},
+	www_section = {http://doi.acm.org/10.1145/1064009.1064022},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EC\%2705\%20-\%20Hidden-action\%20in\%20multi-hop\%20routing.pdf},
 	author = {Michal Feldman and John Chuang and Ion Stoica and S Shenker}
 }
@@ -8210,7 +8233,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
 	isbn = {978-3-540-25338-9},
 	issn = {0302-9743},
 	doi = {10.1007/b107118},
-	url = {http://www.springerlink.com/content/pdn9ttp0bvk0f3e9/},
+	www_section = {http://www.springerlink.com/content/pdn9ttp0bvk0f3e9/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.68.7579.pdf},
 	author = {Stefan Z{\"o}ls and R{\"u}diger Schollmeier and Wolfgang Kellerer and Anthony Tarlano}
 }
@@ -8226,7 +8249,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
 	keywords = {storage},
 	isbn = {1-59593-233-X},
 	doi = {10.1145/1103780.1103797},
-	url = {http://portal.acm.org/citation.cfm?id=1103797$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1103797$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/w8paper13.pdf},
 	author = {Lihao Xu}
 }
@@ -8242,7 +8265,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
 	keywords = {forward error correction, LDPC, loss pattern, multicast, packet scheduling, Reed-Solomon},
 	isbn = {1-59593-197-X},
 	doi = {10.1145/1095921.1095944},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.8807},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.8807},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/RR-5578.pdf},
 	author = {Christoph Neumann and Aur{\'e}lien Francillon and David Furodet}
 }
@@ -8259,7 +8282,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
 	keywords = {mobile Ad-hoc networks, multicast, reliability},
 	issn = {0140-3664},
 	doi = {10.1016/j.comcom.2005.02.008},
-	url = {http://portal.acm.org/citation.cfm?id=1646697$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1646697$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.68.5832.pdf},
 	author = {Baumung, Peter and Martina Zitterbart and Kendy Kutzner}
 }
@@ -8277,7 +8300,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
 	keywords = {BitTorrent, data dissemination, prisoner{\textquoteright}s dilemma, strategy},
 	isbn = {1-59593-026-4},
 	doi = {http://doi.acm.org/10.1145/1080192.1080199},
-	url = {http://doi.acm.org/10.1145/1080192.1080199},
+	www_section = {http://doi.acm.org/10.1145/1080192.1080199},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/P2PECON\%2705\%20-\%20Incentives\%20in\%20BitTorrent\%20induce\%20free\%20riding.pdf},
 	author = {Jun, Seung and Ahamad, Mustaque}
 }
@@ -8295,11 +8318,11 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
 	keywords = {BitTorrent, cooperation, P2P},
 	isbn = {1-59593-026-4},
 	doi = {http://doi.acm.org/10.1145/1080192.1080198},
-	url = {http://doi.acm.org/10.1145/1080192.1080198},
+	www_section = {http://doi.acm.org/10.1145/1080192.1080198},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/coopbittorrentcom_0.pdf},
 	author = {Nazareno Andrade and Miranda Mowbray and Lima, Aliandro and Wagner, Gustavo and Ripeanu, Matei}
 }
-@proceedings {2005,
+@proceedings {2005_7,
 	title = {On the Interaction Between Overlay Routing and Underlay Routing },
 	journal = {IEEE INFOCOM {\textquoteright}05},
 	year = {2005},
@@ -8315,7 +8338,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
 	address = {Phoenix, AZ},
 	abstract = {Most research activities in the field of peer-to-peer (P2P) computing are concerned with routing in virtualized overlay networks. These overlays generally assume node connectivity to be provided by an underlying network-layer routing protocol. This duplication of functionality can give rise to severe inefficiencies. In contrast, we suggest a cross-layer approach where the P2P overlay network also provides the required network-layer routing functionality by itself. Especially in sensor networks, where special attention has to be paid to the nodes{\textquoteright} limited capabilities, this can greatly help in reducing the message overhead. In this paper, we present a key building block for such a protocol, the iterative successor pointer rewiring protocol (ISPRP), which efficiently initializes a P2P routing network among a freshly deployed set of nodes having but link-layer connectivity. ISPRP works in a fully self-organizing way and issues only a small per-node amount of messages by keeping interactions between nodes as local as possible},
 	keywords = {P2P},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cramer05isprp.pdf},
 	author = {Cramer, Curt and Thomas Fuhrmann}
 }
@@ -8332,7 +8355,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
 	keywords = {P2P, pareto, stochastic lifetime resilience},
 	issn = {0163-5999},
 	doi = {10.1145/1071690.1064217},
-	url = {http://portal.acm.org/citation.cfm?id=1071690.1064217$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1071690.1064217$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.83.5920.pdf},
 	author = {Leonard, Derek and Rai, Vivek and Loguinov, Dmitri}
 }
@@ -8349,7 +8372,7 @@ Our results contradict some beliefs that the protocols mentioned guarantee anony
 	keywords = {anonymity measurement, onion routing},
 	isbn = {978-3-540-28963-0},
 	doi = {10.1007/11555827},
-	url = {http://www.springerlink.com/content/ewblt5k80xrgqe4j/},
+	www_section = {http://www.springerlink.com/content/ewblt5k80xrgqe4j/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/esorics05-Klonowski.pdf},
 	author = {Marcin Gogolewski and Marek Klonowski and Miroslaw Kutylowski}
 }
@@ -8366,7 +8389,7 @@ Our results contradict some beliefs that the protocols mentioned guarantee anony
 	keywords = {flooding attacks, location-aware topology, P2P, search efficiency, topology matching},
 	issn = {1045-9219},
 	doi = {10.1109/TPDS.2005.21},
-	url = {http://portal.acm.org/citation.cfm?id=1042380$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1042380$\#$},
 	author = {Yunhao Liu and Xiao, Li and Liu, Xiaomei and Ni, Lionel M. and Zhang, Xiaodong}
 }
 @conference {torta05,
@@ -8379,7 +8402,7 @@ Our results contradict some beliefs that the protocols mentioned guarantee anony
 	abstract = {Tor is the second generation Onion Router, supporting the anonymous transport of TCP streams over the Internet. Its low latency makes it very suitable for common tasks, such as web browsing, but insecure against traffic-analysis attacks by a global passive adversary. We present new traffic-analysis techniques that allow adversaries with only a partial view of the network to infer which nodes are being used to relay the anonymous streams and therefore greatly reduce the anonymity provided by Tor. Furthermore, we show that otherwise unrelated streams can be linked back to the same initiator. Our attack is feasible for the adversary anticipated by the Tor designers. Our theoretical attacks are backed up by experiments performed on the deployed, albeit experimental, Tor network. Our techniques should also be applicable to any low latency anonymous network. These attacks highlight the relationship between the field of traffic-analysis and more traditional computer security issues, such as covert channel analysis. Our research also highlights that the inability to directly observe network links does not prevent an attacker from performing traffic-analysis: the adversary can use the anonymising network as an oracle to infer the traffic load on remote nodes in order to perform traffic-analysis},
 	keywords = {anonymity, onion routing, traffic analysis},
 	isbn = {0-7695-2339-0},
-	url = {http://portal.acm.org/citation.cfm?id=1059390},
+	www_section = {http://portal.acm.org/citation.cfm?id=1059390},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/torta05.pdf},
 	author = {Steven J. Murdoch and George Danezis}
 }
@@ -8393,7 +8416,7 @@ Our results contradict some beliefs that the protocols mentioned guarantee anony
 	abstract = {Chord is a distributed hash table (DHT) that requires only O(log n) links per node and performs searches with latency and message cost O(log n), where n is the number of peers in the network. Chord assumes all nodes behave according to protocol. We give a variant of Chord which is robust with high probability for any time period during which: 1) there are always at least z total peers in the network for some integer z; 2) there are never more than (1/4{\textendash}ε)z Byzantine peers in the network for a fixed ε > 0; and 3) the number of peer insertion and deletion events is no more than zk for some tunable parameter k. We assume there is an adversary controlling the Byzantine peers and that the IP-addresses of all the Byzantine peers and the locations where they join the network are carefully selected by this adversary. Our notion of robustness is rather strong in that we not only guarantee that searches can be performed but also that we can enforce any set of {\textquotedblleft}proper behavior{\textquotedblright} such as contributing new material, etc. In comparison to Chord, the resources required by this new variant are only a polylogarithmic factor greater in communication, messaging, and linking costs},
 	keywords = {Chord, distributed hash table, robustness},
 	doi = {10.1007/11561071},
-	url = {http://www.springerlink.com/content/422llxn7khwej72n/},
+	www_section = {http://www.springerlink.com/content/422llxn7khwej72n/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/swarm.pdf},
 	author = {Amos Fiat and Jared Saia and Maxwell Young}
 }
@@ -8425,7 +8448,7 @@ Our results contradict some beliefs that the protocols mentioned guarantee anony
 	address = {Berkeley, CA, USA},
 	abstract = {Existing studies on BitTorrent systems are single-torrent based, while more than 85\% of all peers participate in multiple torrents according to our trace analysis. In addition, these studies are not sufficiently insightful and accurate even for single-torrent models, due to some unrealistic assumptions. Our analysis of representative Bit-Torrent traffic provides several new findings regarding the limitations of BitTorrent systems: (1) Due to the exponentially decreasing peer arrival rate in reality, service availability in such systems becomes poor quickly, after which it is difficult for the file to be located and downloaded. (2) Client performance in the BitTorrent-like systems is unstable, and fluctuates widely with the peer population. (3) Existing systems could provide unfair services to peers, where peers with high downloading speed tend to download more and upload less. In this paper, we study these limitations on torrent evolution in realistic environments. Motivated by the analysis and modeling results, we further build a graph based multi-torrent model to study inter-torrent collaboration. Our model quantitatively provides strong motivation for inter-torrent collaboration instead of directly stimulating seeds to stay longer. We also discuss a system design to show the feasibility of multi-torrent collaboration},
 	keywords = {bittorrent system, intertorrent collaboration, multi-torrent collaboration, multiple torrents},
-	url = {http://www.usenix.org/events/imc05/tech/full_papers/guo/guo_html/},
+	www_section = {http://www.usenix.org/events/imc05/tech/full_papers/guo/guo_html/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IMC\%2705\%20-\%20Measurement\%2C\%20analysis\%20and\%20modeling\%20of\%20BitTorrent-like\%20systems.pdf},
 	author = {Guo, Lei and Chen, Songqing and Xiao, Zhen and Tan, Enhua and Ding, Xiaoning and Zhang, Xiaodong}
 }
@@ -8440,7 +8463,7 @@ This paper reports the results from a two week measurement of the entire Overnet
 	keywords = {distributed hash table, overlay networks, P2P},
 	isbn = {978-3-540-24473-8},
 	doi = {10.1007/b138861},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kutzner05overnet.pdf},
 	author = {Kendy Kutzner and Thomas Fuhrmann}
 }
@@ -8456,7 +8479,7 @@ This paper reports the results from a two week measurement of the entire Overnet
 	keywords = {anonymity, traffic analysis},
 	isbn = {978-3-540-34745-3},
 	doi = {10.1007/11767831},
-	url = {http://www.springerlink.com/content/375x2pv385388h86/},
+	www_section = {http://www.springerlink.com/content/375x2pv385388h86/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pet05-serjantov.pdf},
 	author = {Andrei Serjantov and Steven J. Murdoch}
 }
@@ -8472,7 +8495,7 @@ This paper reports the results from a two week measurement of the entire Overnet
 	keywords = {anonymity, electronic voting},
 	isbn = {978-3-540-34745-3},
 	doi = {10.1007/11767831},
-	url = {http://www.springerlink.com/content/v32m5122127m78v0/},
+	www_section = {http://www.springerlink.com/content/v32m5122127m78v0/},
 	author = {Jan Camenisch and Anton Mityagin}
 }
 @conference { gkantsidis:network,
@@ -8505,7 +8528,7 @@ This paper reports the results from a two week measurement of the entire Overnet
 	keywords = {free-rider, problem},
 	isbn = {1-59593-026-4},
 	doi = {http://doi.acm.org/10.1145/1080192.1080200},
-	url = {http://doi.acm.org/10.1145/1080192.1080200},
+	www_section = {http://doi.acm.org/10.1145/1080192.1080200},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/P2PEcon\%2705\%20-\%20A\%20new\%20mechanism\%20for\%20the\%20free-rider\%20problem.pdf},
 	author = {Sanghavi, Sujay and Hajek, Bruce}
 }
@@ -8519,7 +8542,7 @@ This paper reports the results from a two week measurement of the entire Overnet
 	address = {Berkeley, CA, USA},
 	abstract = {The most basic functionality of a distributed hash table, or DHT, is to partition a key space across the set of nodes in a distributed system such that all nodes agree on the partitioning. For example, the Chord DHT assigns each node},
 	keywords = {Chord, distributed hash table},
-	url = {http://portal.acm.org/citation.cfm?id=1251532$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1251532$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ntr-worlds05.pdf},
 	author = {Michael J. Freedman and Lakshminarayanan, Karthik and Rhea, Sean C. and Ion Stoica}
 }
@@ -8531,7 +8554,7 @@ This paper reports the results from a two week measurement of the entire Overnet
 
 We introduce and implement Obfuscated Ciphertext Mixing, the obfuscation of a mixnet program. Using this technique, all proofs can be performed before the mixing process, even before the inputs are available. In addition, the mixing program does not need to be secret: anyone can publicly compute the shuffle (though not the decryption). We frame this functionality in the strongest obfuscation setting proposed by Barak et. al. [4], tweaked for the public-key setting. For applications where the secrecy of the shuffle permutation is particularly important (e.g. voting), we also consider the Distributed Obfuscation of a Mixer, where multiple trustees cooperate to generate an obfuscated mixer program such that no single trustee knows the composed shuffle permutation},
 	keywords = {obfuscated ciphertext mixing},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.6592},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.6592},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cryptoeprint-2005-394.pdf},
 	author = {Ben Adida and Douglas Wikstr{\"o}m}
 }
@@ -8552,7 +8575,7 @@ We introduce and implement Obfuscated Ciphertext Mixing, the obfuscation of a mi
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ACNS\%2705\%20-\%20Garcia\%20\%26\%20Hoepman\%20-\%20Off-line\%20Karma.pdf},
 	author = {Flavio D. Garcia and Jaap-Henk Hoepman}
 }
-@conference {2005,
+@conference {2005_8,
 	title = {OpenDHT: a public DHT service and its uses},
 	booktitle = {Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications},
 	series = {SIGCOMM {\textquoteright}05},
@@ -8564,7 +8587,7 @@ We introduce and implement Obfuscated Ciphertext Mixing, the obfuscation of a mi
 	keywords = {distributed hash table, openDHT, peer-to-peer, resource allocation},
 	isbn = {1-59593-009-4},
 	doi = {10.1145/1080091.1080102},
-	url = {http://doi.acm.org/10.1145/1080091.1080102},
+	www_section = {http://doi.acm.org/10.1145/1080091.1080102},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/openDHT.pdf}
 }
 @article {Feldman:2005:OFB:1120717.1120723,
@@ -8580,11 +8603,11 @@ We introduce and implement Obfuscated Ciphertext Mixing, the obfuscation of a mi
 	keywords = {algorithms, cooperation, design, economics, game-theory, hidden-action, hidden-information, incentives, peer-to-peer networking, performance, reliability},
 	issn = {1551-9031},
 	doi = {http://doi.acm.org/10.1145/1120717.1120723},
-	url = {http://doi.acm.org/10.1145/1120717.1120723},
+	www_section = {http://doi.acm.org/10.1145/1120717.1120723},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGecom\%20Exch.\%20\%285\%29\%20-\%20Overcoming\%20free-riding\%20behavior.pdf},
 	author = {Michal Feldman and John Chuang}
 }
-@article {2005,
+@article {2005_9,
 	title = {P2P Contracts: a Framework for Resource and Service Exchange},
 	journal = {FGCS. Future Generations Computer Systems  },
 	volume = {21},
@@ -8626,7 +8649,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 	address = {Anaheim, CA},
 	abstract = {Network Address Translation (NAT) causes well-known difficulties for peer-to-peer (P2P) communication, since the peers involved may not be reachable at any globally valid IP address. Several NAT traversal techniques are known, but their documentation is slim, and data about their robustness or relative merits is slimmer. This paper documents and analyzes one of the simplest but most robust and practical NAT traversal techniques, commonly known as hole punching. Hole punching is moderately well-understood for UDP communication, but we show how it can be reliably used to set up peer-to-peer TCP streams as well. After gathering data on the reliability of this technique on a wide variety of deployed NATs, we nd that about 82\% of the NATs tested support hole punching for UDP, and about 64\% support hole punching for TCP streams. As NAT vendors become increasingly conscious of the needs of important P2P applications such as Voice over IP and online gaming protocols, support for hole punching is likely to increase in the future},
 	keywords = {communication network, ip address, NAT, nat traversal techniques, network address translation, P2P, peer-to-peer networking},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.59.6799\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.59.6799\&rep=rep1\&type=pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.59.6799.pdf},
 	author = {Pyda Srisuresh and Bryan Ford and Dan Kegel}
 }
@@ -8635,7 +8658,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 	year = {2005},
 	abstract = {Programming of and experiences with sensor network nodes are about to enter the curricula of technical universities. Often however, practical obstacles complicate the implementation of a didactic concept. In this paper we present our approach that uses a Java virtual machine to decouple experiments with algorithm and protocol concepts from the odds of embedded system programming. This concept enables students to load Java classes via an SD-card into a sensor node. An LC display provides detailed information if the program aborts due to bugs},
 	keywords = {sensor networks},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.8036},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.8036},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.72.8036.pdf},
 	author = {Thomas Fuhrmann and Till Harbaum}
 }
@@ -8653,11 +8676,11 @@ We have developed a prototype based on the FreePastry open-source implementation
 	keywords = {ADOPT algorithm, DCOP, distributed constraint optimization},
 	isbn = {1-59593-093-0},
 	doi = {10.1145/1082473.1082631},
-	url = {http://doi.acm.org/10.1145/1082473.1082631},
+	www_section = {http://doi.acm.org/10.1145/1082473.1082631},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/AAMAS\%2705\%20-\%20Accelerating\%20the\%20DCOP\%20algorithm\%20ADOPT.pdf},
 	author = {Ali, Syed and Koenig, Sven and Tambe, Milind}
 }
-@article {2005,
+@article {2005_10,
 	title = {Privacy Practices of Internet Users: Self-reports Versus Observed Behavior},
 	journal = {Int. J. Hum.-Comput. Stud},
 	volume = {63},
@@ -8667,7 +8690,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 	keywords = {decision-making, design, e-commerce, economic models, policy, privacy, survey},
 	issn = {1071-5819},
 	doi = {10.1016/j.ijhcs.2005.04.019},
-	url = {http://dx.doi.org/10.1016/j.ijhcs.2005.04.019},
+	www_section = {http://dx.doi.org/10.1016/j.ijhcs.2005.04.019},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PrivacyPractices2005Jensen.pdf},
 	author = {Jensen, Carlos and Potts, Colin and Jensen, Christian}
 }
@@ -8683,11 +8706,11 @@ We have developed a prototype based on the FreePastry open-source implementation
 	keywords = {privacy, traffic analysis},
 	isbn = {978-3-540-34745-3},
 	doi = {10.1007/11767831},
-	url = {http://www.springerlink.com/content/1062w684754754h4/},
+	www_section = {http://www.springerlink.com/content/1062w684754754h4/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pet05-bissias.pdf},
 	author = {George Dean Bissias and Marc Liberatore and Brian Neil Levine}
 }
-@book {2005,
+@book {2005_11,
 	title = {Privacy-Preserving Set Operations},
 	booktitle = {Advances in Cryptology {\textendash} CRYPTO 2005},
 	series = {Lecture Notes in Computer Science},
@@ -8699,12 +8722,12 @@ We have developed a prototype based on the FreePastry open-source implementation
 	abstract = {In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party{\textquoteright}s input to the function is his private input multiset. In order to protect these private sets, the players perform privacy-preserving computation; that is, no party learns more information about other parties{\textquoteright} private input sets than what can be deduced from the result. In this paper, we propose efficient techniques for privacy-preserving operations on multisets. By building a framework of multiset operations, employing the mathematical properties of polynomials, we design efficient, secure, and composable methods to enable privacy-preserving computation of the union, intersection, and element reduction operations. We apply these techniques to a wide range of practical problems, achieving more efficient results than those of previous work},
 	isbn = {978-3-540-28114-6},
 	doi = {10.1007/11535218_15},
-	url = {http://dx.doi.org/10.1007/11535218_15},
+	www_section = {http://dx.doi.org/10.1007/11535218_15},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PrivacyPreservingSetOperations2005Kissner.pdf},
 	author = {Kissner, Lea and Song, Dawn},
 	editor = {Shoup, Victor}
 }
-@book {2005,
+@book {2005_12,
 	title = {On Private Scalar Product Computation for Privacy-Preserving Data Mining},
 	booktitle = {Information Security and Cryptology {\textendash} ICISC 2004},
 	series = {Lecture Notes in Computer Science},
@@ -8717,7 +8740,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 	keywords = {Privacy-preserving data mining, private scalar product protocol, vertically partitioned frequent pattern mining},
 	isbn = {978-3-540-26226-8},
 	doi = {10.1007/11496618_9},
-	url = {http://dx.doi.org/10.1007/11496618_9},
+	www_section = {http://dx.doi.org/10.1007/11496618_9},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PrivateScalarProduct2004Goethals.pdf},
 	author = {Goethals, Bart and Laur, Sven and Lipmaa, Helger and Mielik{\"a}inen, Taneli},
 	editor = {Park, Choon-sik and Chee, Seongtaek}
@@ -8732,7 +8755,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 	keywords = {cryptography, onion routing},
 	isbn = {1-59593-231-3},
 	doi = {10.1145/1103576.1103585},
-	url = {http://portal.acm.org/citation.cfm?id=1103576.1103585},
+	www_section = {http://portal.acm.org/citation.cfm?id=1103576.1103585},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/GHPvR05.pdf},
 	author = {Flavio D. Garcia and Ichiro Hasuo and Wolter Pieters and Peter van Rossum}
 }
@@ -8748,7 +8771,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 	keywords = {anonymity, coupling, Markov chain, rapid mixing},
 	isbn = {978-3-540-29039-1},
 	doi = {10.1007/11558859},
-	url = {http://www.springerlink.com/content/777769630v335773/},
+	www_section = {http://www.springerlink.com/content/777769630v335773/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ih05-Klonowski.pdf},
 	author = {Marek Klonowski and Miroslaw Kutylowski}
 }
@@ -8765,7 +8788,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 	keywords = {distributed hash table, multi-hop networks, proximity neighbor selection},
 	isbn = {0-7695-2376-5},
 	doi = {10.1109/P2P.2005.28},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cramer05pns.pdf},
 	author = {Cramer, Curt and Thomas Fuhrmann}
 }
@@ -8781,7 +8804,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 	keywords = {private information retrieval, pseudonym},
 	isbn = {1-59593-228-3},
 	doi = {10.1145/1102199.1102201},
-	url = {http://portal.acm.org/citation.cfm?id=1102199.1102201},
+	www_section = {http://portal.acm.org/citation.cfm?id=1102199.1102201},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/sassaman-wpes2005.pdf},
 	author = {Len Sassaman and Bram Cohen and Nick Mathewson}
 }
@@ -8799,7 +8822,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kugler2.pdf},
 	author = {Tatara, Kohei and Hori, Y. and Sakurai, Kouichi}
 }
-@article {2005,
+@article {2005_13,
 	title = {A Quick Introduction to Bloom Filters},
 	year = {2005},
 	month = aug,
@@ -8819,7 +8842,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 	keywords = {anonymity, P2P, RWAP},
 	isbn = {978-3-540-28102-3},
 	doi = {10.1007/11534310},
-	url = {http://www.springerlink.com/content/0642hvq80b27vv1f/},
+	www_section = {http://www.springerlink.com/content/0642hvq80b27vv1f/},
 	author = {Jinsong Han and Yunhao Liu and Li Lu and Lei Hu and Abhishek Patil}
 }
 @article { le2005,
@@ -8830,7 +8853,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 	month = {June},
 	publisher = {SCC},
 	keywords = {GNUnet, keywords, libextractor, metadata, search},
-	url = {http://www.linuxjournal.com/article/7552},
+	www_section = {http://www.linuxjournal.com/article/7552},
 	author = {Christian Grothoff}
 }
 @mastersthesis {Aspelund05retrivabilityof,
@@ -8841,7 +8864,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 	type = {Master thesis},
 	abstract = {This master thesis looks at aspects with backup of data and restore in ad-hoc networks. Ad-hoc networks are networks made between arbitrary nodes without any form of infrastructure or central control. Backup in such environments would have to rely on other nodes to keep backups. The key problem is knowing whom to trust. Backup in ad-hoc network is meant to be a method to offer extra security to data that is created outside of a controlled environment. The most important aspects of backup are the ability to retrieve data after it is lost from the original device. In this project an ad-hoc network is simulated, to measure how much of the data can be retrieved as a function of the size of the network. The distance to the data and how many of the distributed copies are available is measured. The network is simulated using User-mode Linux and the centrality and connectivity of the simulated network is measured. Finding the device that keeps your data when a restoration is needed can be like looking for a needle in a haystack. A simple solution to this is to not only rely on the ad-hoc network but also make it possible for devices that keep backups to upload data to others or back to a host that is available to the source itself},
 	keywords = {ad-hoc networks},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.141},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.141},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Retrivability_of_data_in_ad-hoc_backup.pdf},
 	author = {Trond Aspelund}
 }
@@ -8852,7 +8875,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 	address = {Mountain View, CA, USA},
 	abstract = {This paper describes how a network can continue to function in the presence of Byzantine failures. A Byzantine failure is one in which a node, instead of halting (as it would in a fail-stop failure), continues to operate, but incorrectly. It might lie about routing information, perform the routing algorithm itself flawlessly, but then fail to forward some class of packets correctly, or flood the network with garbage traffic. Our goal is to design a network so that as long as one nonfaulty path connects nonfaulty nodes A and B, they will be able to communicate, with some fair share of bandwidth, even if all the other components in the network are maximally malicious. We review work from 1988 that presented a network design that had that property, but required the network to be small enough so that every router could keep state proportional to n2, where n is the total number of nodes in the network. This would work for a network of size on the order of a thousand nodes, but to build a large network, we need to introduce hierarchy. This paper presents a new design, building on the original work, that works with hierarchical networks. This design not only defends against malicious routers, but because it guarantees fair allocation of resources, can mitigate against many other types of denial of service attacks},
 	keywords = {routing},
-	url = {http://portal.acm.org/citation.cfm?id=1698181$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1698181$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/smli_tr-2005-146.pdf},
 	author = {Perlman, Radia}
 }
@@ -8867,7 +8890,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 	keywords = {anonymity, privacy, QoS},
 	isbn = {978-3-540-28102-3},
 	doi = {10.1007/11534310},
-	url = {http://www.springerlink.com/content/9b2k6u5wval6cep1/},
+	www_section = {http://www.springerlink.com/content/9b2k6u5wval6cep1/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.66.7970.pdf},
 	author = {Hongyun Xu and Xinwen Fu and Ye Zhu and Riccardo Bettati and Jianer Chen and Wei Zhao}
 }
@@ -8877,7 +8900,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 	year = {2005},
 	abstract = {The design of efficient routing protocols for ad hoc and sensor networks is challenging for several reasons: Physical network topology is random. Nodes have limited computation and memory capabilities. Energy and bisection bandwidth are scarce. Furthermore, in most settings, the lack of centralized components leaves all network control tasks to the nodes acting as decentralized peers. In this paper, we present a novel routing algorithm, scalable source routing (SSR), which is capable of memory and message efficient routing in large random networks. A guiding example is a community of {\textquoteright}digital homes {\textquoteright} where smart sensors and actuators are installed by laypersons. Such networks combine wireless ad-hoc and infrastructure networks, and lack a well-crafted network topology. Typically, the nodes do not have sufficient processing and memory resources to perform sophisticated routing algorithms. Flooding on the other hand is too bandwidthconsuming in the envisaged large-scale networks. SSR is a fully self-organizing routing protocol for such scenarios. It creates a virtual ring that links all nodes via predecessor/successor source routes. Additionally, each node possesses O(log N) short-cut source routes to nodes in exponentially increasing virtual ring distance. Like with the Chord overlay network, this ensures full connectivity within the network. Moreover, it provides a routing semantic which can efficiently support indirection schemes like i3. Memory and message efficiency are achieved by the introduction of a route cache together with a set of path manipulation rules that allow to produce near-to-optimal paths},
 	keywords = {scalable source routing, sensor networks, wireless sensor network},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.6509},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.6509},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.67.6509.pdf},
 	author = {Thomas Fuhrmann}
 }
@@ -8893,7 +8916,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 	keywords = {ad-hoc networks, mobile Ad-hoc networks},
 	isbn = {0-7695-2299-8},
 	doi = {10.1109/PERCOM.2005.36},
-	url = {http://portal.acm.org/citation.cfm?id=1049775$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1049775$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.73.7247.pdf},
 	author = {Sailhan, Francoise and Valerie Issarny}
 }
@@ -8902,7 +8925,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 	year = {2005},
 	abstract = {The small-world phenomenon, that the world{\textquoteright}s social network is tightly connected, and that any two people can be linked by a short chain of friends, has long been a subject of interest. Famously, the psychologist Stanley Milgram performed an experiment where he asked people to deliver a letter to a stranger by forwarding it to an acquaintance, who could forward it to one his acquaintances, and so on until the destination was reached. The results seemed to confirm that the small-world phenomenon is real. Recently it has been shown by Jon Kleinberg that in order to search in a network, that is to actually find the short paths in the manner of the Milgram experiment, a very special type of a graph model is needed. In this thesis, we present two ideas about searching in the small world stemming from Kleinberg{\textquoteright}s results. In the first we study the formation of networks of this type, attempting to see why the kind},
 	keywords = {small-world},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.688},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.688},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.101.688.pdf},
 	author = {Sandberg, Oskar}
 }
@@ -8920,7 +8943,7 @@ We have developed a prototype based on the FreePastry open-source implementation
 This overview focuses on the three DHT systems that have received the most attention in the research community: Chord, Pastry, and Content Addressable Networks (CAN). Furthermore, the systems Symphony, Viceroy, and Kademlia are discussed because they exhibit interesting mechanisms and properties beyond those of the first three systems},
 	keywords = {CAN, Chord, Content Addressable Networks, dblp, distributed hash table, Kademlia, Pastry, Symphony, Viceroy},
 	isbn = {3-540-29192-X},
-	url = {http://dblp.uni-trier.de/db/conf/p2p/p2p2005lncs.html$\#$GotzRW05},
+	www_section = {http://dblp.uni-trier.de/db/conf/p2p/p2p2005lncs.html$\#$GotzRW05},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Lecture\%20Notes\%20in\%20Computer\%20Science\%20-\%20Selected\%20DHT\%20Algorithms\%20.pdf},
 	author = {G{\"o}tz, Stefan and Rieche, Simon and Klaus Wehrle}
 }
@@ -8938,7 +8961,7 @@ This overview focuses on the three DHT systems that have received the most atten
 	keywords = {bayesian game, coordination ratio, incomplete information, nash equilibria, selfish routing},
 	isbn = {1-58113-986-1},
 	doi = {http://doi.acm.org/10.1145/1073970.1074000},
-	url = {http://doi.acm.org/10.1145/1073970.1074000},
+	www_section = {http://doi.acm.org/10.1145/1073970.1074000},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SPAA\%2705\%20-\%20Selfish\%20routing\%20with\%20incomplete\%20information.pdf},
 	author = {Gairing, Martin and Monien, Burkhard and Tiemann, Karsten}
 }
@@ -8950,7 +8973,7 @@ This overview focuses on the three DHT systems that have received the most atten
 	address = {Kaiserslautern, Germany},
 	abstract = {In [CKF04], we have reported on our concept of a peer-to-peer extension to the popular video disk recorder (VDR) [Sch04], the Distributed Video Disk Recording (DVDR) system. The DVDR is a collaboration system of existing video disk recorders via a peer to peer network. There, the VDRs communicate about the tasks to be done and distribute the recordings afterwards. In this paper, we report on lessons learnt during its implementation and explain the considerations leading to the design of a new job scheduling algorithm. DVDR is an application which is based on a distributed hash table (DHT) employing proximity route selection (PRS)/proximity neighbor selection (PNS). For our implementation, we chose to use Chord [SMK + 01, GGG + 03]. Using a DHT with PRS/PNS yields two important features: (1) Each hashed key is routed to exactly one destination node within the system. (2) PRS/PNS forces messages originating in one region of the network destined to the same key to be routed through exactly one node in that region (route convergence). The first property enables per-key aggregation trees with a tree being rooted at the node which is responsible for the respective key. This node serves as a rendezvous point. The second property leads to locality (i.e., low latency) in this aggregation tree},
 	keywords = {Chord, distributed hash table, proximity neighbor selection},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kutzner05dvdr.pdf},
 	author = {Kendy Kutzner and Cramer, Curt and Thomas Fuhrmann}
 }
@@ -8968,7 +8991,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
 	keywords = {ad-hoc networks, P2P, self-organization},
 	isbn = {978-3-540-25809-4},
 	doi = {10.1007/b136094},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann05networking.pdf},
 	author = {Thomas Fuhrmann}
 }
@@ -8986,7 +9009,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
 	keywords = {market, virtual currency},
 	isbn = {1-59593-026-4},
 	doi = {http://doi.acm.org/10.1145/1080192.1080194},
-	url = {http://doi.acm.org/10.1145/1080192.1080194},
+	www_section = {http://doi.acm.org/10.1145/1080192.1080194},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/P2PECON\%2705\%20-\%20Self-recharging\%20virtual\%20currency.pdf},
 	author = {Irwin, David and Chase, Jeff and Grit, Laura and Yumerefendi, Aydan}
 }
@@ -8997,7 +9020,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
 	address = {University of Karlsruhe (TH), Fakultaet fuer Informatik, Technical Report 2005-5},
 	abstract = {Large networks require scalable routing. Traditionally, protocol overhead is reduced by introducing a hierarchy. This requires aggregation of nearby nodes under a common address prefix. In fixed networks, this is achieved administratively, whereas in wireless ad-hoc networks, dynamic assignments of nodes to aggregation units are required. As a result of the nodes commonly being assigned a random network address, the majority of proposed ad-hoc routing protocols discovers routes between end nodes by flooding, thus limiting the network size. Peer-to-peer (P2P) overlay networks offer scalable routing solutions by employing virtualized address spaces, yet assume an underlying routing protocol for end-to-end connectivity. We investigate a cross-layer approach to P2P routing, where the virtual address space is implemented with a network-layer routing protocol by itself. The Iterative Successor Pointer Rewiring Protocol (ISPRP) efficiently initializes a ring-structured network among nodes having but link-layer connectivity. It is fully self-organizing and issues only a small per-node amount of messages by keeping interactions between nodes as local as possible. The main contribution of this paper is a proof that ISPRP is self-stabilizing, that is, starting from an arbitrary initial state, the protocol lets the network converge into a correct state within a bounded amount of time},
 	keywords = {ad-hoc networks, P2P},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cramer05selfstabilizing.pdf},
 	author = {Cramer, Curt and Thomas Fuhrmann}
 }
@@ -9011,7 +9034,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
 	abstract = {We propose a service discovery architecture called VSD (service discovery based on volunteers) for heterogeneous and dynamic pervasive computing environments. The proposed architecture uses a small subset of the nodes called volunteers that perform directory services. Relatively stable and capable nodes serve as volunteers, thus recognizing node heterogeneity in terms of mobility and capability. We discuss characteristics of VSD architecture and methods to improve connectivity among volunteers for higher discovery rate. By showing that VSD performs quite well compared to a broadcast based scheme in MANET scenarios, we validate that VSD is a flexible and adaptable architecture appropriate for dynamic pervasive computing environments. VSD incorporates several novel features: i) handles dynamism and supports self-reconfiguration; ii) provides physical locality and scalability; and iii) improves reliability and copes with uncertainty through redundancy by forming overlapped clusters},
 	isbn = {0-7803-9032-6},
 	doi = {10.1109/PERSER.2005.1506410},
-	url = {http://www.computer.org/portal/web/csdl/doi/10.1109/PERSER.2005.1506410},
+	www_section = {http://www.computer.org/portal/web/csdl/doi/10.1109/PERSER.2005.1506410},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/31.pdf},
 	author = {Mijeom Kim and Mohan Kumar and Behrooz Shirazi}
 }
@@ -9029,7 +9052,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
 	abstract = {If agents are to negotiate automatically with one another they must share a negotiation mechanism, specifying what possible actions each party can take at any given time, when negotiation terminates, and what is the structure of the resulting agreements. Current standardization activities such as FIPA [2] and WS-Agreement [3] represent this as a negotiation protocol specifying the flow of messages. However, they omit other aspects of the rules of negotiation (such as obliging a participant to improve on a previous offer), requiring these to be represented implicitly in an agent{\textquoteright}s design, potentially resulting incompatibility, maintenance and re-usability problems. In this chapter, we propose an alternative approach, allowing all of a mechanism to be formal and explicit. We present (i) a taxonomy of declarative rules which can be used to capture a wide variety of negotiation mechanisms in a principled and well-structured way; (ii) a simple interaction protocol, which is able to support any mechanism which can be captured using the declarative rules; (iii) a software framework for negotiation that allows agents to effectively participate in negotiations defined using our rule taxonomy and protocol and (iv) a language for expressing aspects of the negotiation based on OWL-Lite [4]. We provide examples of some of the mechanisms that the framework can support},
 	keywords = {framework, negotiation},
 	isbn = {3-540-24843-9},
-	url = {http://dl.acm.org/citation.cfm?id=2167504.2167521},
+	www_section = {http://dl.acm.org/citation.cfm?id=2167504.2167521},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SELMAS\%20-\%20Software\%20framework\%20for\%20automated\%20negotiation.pdf},
 	author = {Bartolini, Claudio and Preist, Chris and Nicholas R Jennings},
 	editor = {Choren, Ricardo and Garcia, Alessandro and Lucena, Carlos and Romanovsky, Alexander}
@@ -9048,7 +9071,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
 	keywords = {bandwidth utilization, BitTorrent, fairness},
 	isbn = {1-59593-022-1},
 	doi = {http://doi.acm.org/10.1145/1064212.1064273},
-	url = {http://doi.acm.org/10.1145/1064212.1064273},
+	www_section = {http://doi.acm.org/10.1145/1064212.1064273},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGMETRICS\%2705\%20-\%20Bharambe\%2C\%20Herley\%20\%26\%20Padmanabhan.pdf},
 	author = {Bharambe, Ashwin R. and Herley, Cormac and Venkata N. Padmanabhan}
 }
@@ -9060,7 +9083,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
 	abstract = {In 2004 Golle, Jakobsson, Juels and Syverson presented a new encryption scheme called the universal re-encryption [GJJS04] for mixnets [Cha81] which was extended by Gomulkiewicz et al. [GKK04]. We discover that this scheme and its extension both are insecure against a chosen ciphertext attack proposed by Pfitzmann in 1994 [Pfi94]. Another drawback of them is low efficiency for anonymous communications due to their long ciphertexts, i.e., four times the size of plaintext. Accordingly, we devise a novel universal and efficient anonymous tunnel, rWonGoo, for circuit-based low-latency communications in large scale peer-to-peer environments to dramatically decrease possibility to suffer from the attack [Pfi94]. The basic idea behind rWonGoo is to provide anonymity with re-encryption and random forwarding, obtaining practicality, correctness and efficiency in encryption in the way differing from the layered encryption systems [Cha81] that can be difficult to achieve correctness of tunnels},
 	isbn = {978-3-540-28102-3},
 	doi = {10.1007/11534310},
-	url = {http://www.springerlink.com/content/b3x4na87xbmcextx/},
+	www_section = {http://www.springerlink.com/content/b3x4na87xbmcextx/},
 	author = {Tianbo Lu and Bin-Xing Fang and Yuzhong Sun and Li Guo}
 }
 @article {Lua05asurvey,
@@ -9073,7 +9096,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
 	keywords = {overlay, peer-to-peer networking},
 	issn = {1553-877X },
 	doi = {10.1109/COMST.2005.1610546},
-	url = {http://www.slideshare.net/networkingcentral/a-survey-and-comparison-of-peertopeer-overlay-network-schemes},
+	www_section = {http://www.slideshare.net/networkingcentral/a-survey-and-comparison-of-peertopeer-overlay-network-schemes},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IEEE\%20CST\%20-\%20A\%20Survey\%20and\%20Comparison\%20of\%20Peer-to-Peer\%20Overlay.pdf},
 	author = {Eng Keong Lua and Jon Crowcroft and Marcelo Pias and Ravi Sharma and Steven Lim}
 }
@@ -9091,7 +9114,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
 	keywords = {peer-to-peer networking, reputation, Sybil attack},
 	isbn = {1-59593-026-4},
 	doi = {http://doi.acm.org/10.1145/1080192.1080202},
-	url = {http://doi.acm.org/10.1145/1080192.1080202},
+	www_section = {http://doi.acm.org/10.1145/1080192.1080202},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ACM\%20SIGCOMM\%2705\%20-\%20Cheng\%20\%26\%20Friedman\%20-\%20Sybilproof\%20reputation\%20mechanisms.pdf},
 	author = {Cheng, Alice and Eric Friedman}
 }
@@ -9104,7 +9127,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
 	organization = {Springer},
 	abstract = {Distributed Hash Tables (DHTs) are very efficient distributed systems for routing, but at the same time vulnerable to disruptive nodes. Designers of such systems want them used in open networks, where an adversary can perform a sybil attack by introducing a large number of corrupt nodes in the network, considerably degrading its performance. We introduce a routing strategy that alleviates some of the effects of such an attack by making sure that lookups are performed using a diverse set of nodes. This ensures that at least some of the nodes queried are good, and hence the search makes forward progress. This strategy makes use of latent social information present in the introduction graph of the network},
 	keywords = {distributed hash table, routing},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.3947},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.3947},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/sybildht.pdf},
 	author = {George Danezis and Chris Lesniewski-laas and Frans M. Kaashoek and Ross Anderson}
 }
@@ -9118,7 +9141,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
 	abstract = {For peer-to-peer services to be effective, participating nodes must cooperate, but in most scenarios a node represents a self-interested party and cooperation can neither be expected nor enforced. A reasonable assumption is that a large fraction of p2p nodes are rational and will attempt to maximize their consumption of system resources while minimizing the use of their own. If such behavior violates system policy then it constitutes an attack. In this paper we identify and create a taxonomy for rational attacks and then identify corresponding solutions if they exist. The most effective solutions directly incentivize cooperative behavior, but when this is not feasible the common alternative is to incentivize evidence of cooperation instead},
 	keywords = {attack, P2P},
 	doi = {10.1007/11558989},
-	url = {http://www.springerlink.com/content/lh21385ml723844j/},
+	www_section = {http://www.springerlink.com/content/lh21385ml723844j/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CameraReady_240.pdf},
 	author = {Seth James Nielson and Scott A. Crosby}
 }
@@ -9131,7 +9154,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
 	abstract = {This is a short talk on topology of covert conflict, comprising joint work I{\textquoteright}ve been doing with Ross Anderson. The background of this work is the following. We consider a conflict, and there are parties to the conflict. There is communication going on that can be abstracted as a network of nodes (parties) and links (social ties between the nodes). We contend that once you{\textquoteright}ve got a conflict and you{\textquoteright}ve got enough parties to it, these guys start communicating as a result of the conflict. They form connections, that influences the conflict, and the dynamics of the conflict in turn feeds the connectivity of the unfolding network.
 Modern conflicts often turn on connectivity: consider, for instance, anything from the American army{\textquoteright}s attack on the Taleban in Afghanistan, and elsewhere, or medics who are trying to battle a disease, like Aids, or anything else. All of these turn on, making strategic decisions about which nodes to go after in the network. For instance, you could consider that a good first place to give condoms out and start any Aids programme, would be with prostitutes},
 	doi = {10.1007/978-3-540-77156-2},
-	url = {http://www.springerlink.com/content/p885q38262486876/},
+	www_section = {http://www.springerlink.com/content/p885q38262486876/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/UCAM-CL-TR-637.pdf},
 	author = {Shishir Nagaraja and Ross Anderson}
 }
@@ -9149,7 +9172,7 @@ In this paper we present a novel routing approach that is capable of handling co
 	keywords = {autonomous systems, overlay networks, P2P},
 	isbn = {978-3-540-25273-3},
 	doi = {10.1007/b106632},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kutzner05autonomic.pdf},
 	author = {Kendy Kutzner and Thomas Fuhrmann}
 }
@@ -9165,7 +9188,7 @@ In this paper we present a novel routing approach that is capable of handling co
 	keywords = {anonymity, P2P},
 	isbn = {1-59593-226-7},
 	doi = {10.1145/1102120.1102133},
-	url = {http://portal.acm.org/citation.cfm?id=1102120.1102133},
+	www_section = {http://portal.acm.org/citation.cfm?id=1102120.1102133},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WangCJ05.pdf},
 	author = {Xinyuan Wang and Shiping Chen and Sushil Jajodia}
 }
@@ -9181,7 +9204,7 @@ In this paper we present a novel routing approach that is capable of handling co
 	keywords = {anonymity},
 	isbn = {978-3-540-34745-3},
 	doi = {10.1007/11767831},
-	url = {http://www.springerlink.com/content/l5110366246k5003/},
+	www_section = {http://www.springerlink.com/content/l5110366246k5003/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pet05-zhu.pdf},
 	author = {Ye Zhu and Riccardo Bettati}
 }
@@ -9197,7 +9220,7 @@ In this paper we present a novel routing approach that is capable of handling co
 	abstract = {In this paper, we briefly present a novel routing algorithm, scalable source routing (SSR), which is capable of memory and message efficient routing in networks with {\textquoteright}random topology{\textquoteright}. This algorithm enables sensor networks to use recent peer to-peer mechanisms from the field of overlay networks, like e.g. distributed hash tables and indirection infrastructures. Unlike other proposals along that direction, SSR integrates all necessary routing tasks into one simple, highly efficient routing protocol. Simulations demonstrate that in a small-world network with more than 100 000 nodes, SSR requires each node to only store routing data for 255 other nodes to establish routes between arbitrary pairs of nodes. These routes are on average only about 20-30\% longer than the globally optimal path between these nodes},
 	keywords = {scalable source routing, topology matching},
 	isbn = {0-7803-9246-9},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann05emnets.pdf},
 	author = {Thomas Fuhrmann}
 }
@@ -9213,7 +9236,7 @@ In this paper we present a novel routing approach that is capable of handling co
 	keywords = {delay tolerant network, routing},
 	isbn = {1-59593-009-4},
 	doi = {10.1145/1080091.1080106},
-	url = {http://portal.acm.org/citation.cfm?doid=1080091.1080106},
+	www_section = {http://portal.acm.org/citation.cfm?doid=1080091.1080106},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/paper-JaiDem.pdf},
 	author = {Sushant Jain and Michael J. Demmer and Rabin K. Patra and Fall, Kevin}
 }
@@ -9222,7 +9245,7 @@ In this paper we present a novel routing approach that is capable of handling co
 	year = {2004},
 	abstract = {Many personal computers are operated with no backup strategy for protecting data in the event of loss or failure. At the same time, PCs are likely to contain spare disk space and unused networking resources. We present the Apportioned Backup System (ABS), which provides a reliable collaborative backup resource by leveraging these independent, distributed resources. With ABS, procuring and maintaining specialized backup hardware is unnecessary. ABS makes efficient use of network and storage resources through use of coding techniques, convergent encryption and storage, and efficient versioning and verification processes. The system also painlessly accommodates dynamic expansion of system compute, storage, and network resources, and is tolerant of catastrophic node failures},
 	keywords = {apportioned backup system},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.6858},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.6858},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.120.6858.pdf},
 	author = {Joe Cooley and Chris Taylor and Alen Peacock}
 }
@@ -9234,7 +9257,7 @@ In this paper we present a novel routing approach that is capable of handling co
 	address = {Barcelona, Catalunya, Spain},
 	abstract = {Skype is a peer-to-peer VoIP client developed by KaZaa in 2003. Skype claims that it can work almost seamlessly across NATs and firewalls and has better voice quality than the MSN and Yahoo IM applications. It encrypts calls end-to-end, and stores user information in a decentralized fashion. Skype also supports instant messaging and conferencing. This report analyzes key Skype functions such as login, NAT and firewall traversal, call establishment, media transfer, codecs, and conferencing under three different network setups. Analysis is performed by careful study of Skype network traffic},
 	keywords = {P2P, VoIP},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.2433},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.2433},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cucs-039-04.pdf},
 	author = {Salman A. Baset and Henning G. Schulzrinne}
 }
@@ -9252,7 +9275,7 @@ In this paper we present a novel routing approach that is capable of handling co
 Initial work considered a simple model, with an observer (Eve) restricted to counting the number of messages leaving a Mix configured as a firewall guarding an enclave with one malicious sender (Alice) and some other naive senders (Cluelessi{\textquoteright}s). Here, we consider the case where Eve can distinguish between multiple destinations, and the senders can select to which destination their message (if any) is sent each clock tick},
 	isbn = {978-3-540-26203-9},
 	doi = {10.1007/b136164},
-	url = {http://www.springerlink.com/content/w256n3dfl6wf2q3m/},
+	www_section = {http://www.springerlink.com/content/w256n3dfl6wf2q3m/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/newman-pet2004.pdf},
 	author = {Richard E. Newman and Vipan R. Nalla and Ira S. Moskowitz}
 }
@@ -9265,7 +9288,7 @@ Initial work considered a simple model, with an observer (Eve) restricted to cou
 	abstract = {We Provide a framework for reasoning about information-hiding requirements in multiagent systems and for reasoning about anonymity in particular. Our framework employs the modal logic of knowledge within the context of the runs and systems framework, much in the spirit of our carlier work on secercy [13]. we give several definitions of anonymity with respect to agents, actions and observers in multiagent systems, and we relate our defenitions of anonymity to other definitions of information hiding, such as secrecy. We also give probabilistic definitions of anonymity that are able to quantify an observer{\textquoteright}s uncertainty about the state of the system. Finally, we relate our definitions of anonymity to other formalizations of anonymity and information hiding, including defenitions of anonymity in the process algebra CSP and defenitions of information hiding using function views},
 	keywords = {anonymity, epistemic logic, formal methods},
 	issn = {0926-227X},
-	url = {http://portal.acm.org/citation.cfm?id=1145953},
+	www_section = {http://portal.acm.org/citation.cfm?id=1145953},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/halpern-oneill-2003.pdf},
 	author = {Joseph Y. Halpern and Kevin R. O{\textquoteright}Neil}
 }
@@ -9300,10 +9323,10 @@ In this paper we propose an {\textquotedblleft}onion-like{\textquotedblright} en
 	abstract = {This paper describes a cooperative overlay network that provides anonymous communication services for participating users. The Anonymizing Peer-to-Peer Proxy (AP3) system provides clients with three primitives: (i) anonymous message delivery, (ii) anonymous channels, and (iii) secure pseudonyms. AP3 is designed to be lightweight, low-cost and provides "probable innocence" anonymity to participating users, even under a large-scale coordinated attack by a limited fraction of malicious overlay nodes. Additionally, we use AP3{\textquoteright}s primitives to build novel anonymous group communication facilities (multicast and anycast), which shield the identity of both publishers and subscribers},
 	keywords = {anonymity, Peer-to-Peer Proxy},
 	doi = {10.1145/1133572.1133578},
-	url = {http://portal.acm.org/citation.cfm?id=1133578},
+	www_section = {http://portal.acm.org/citation.cfm?id=1133578},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.61.6219.pdf}
 }
-@booklet {2004,
+@booklet {2004_0,
 	title = {Apres-a system for anonymous presence},
 	year = {2004},
 	abstract = {If Alice wants to know when Bob is online, and they don{\textquoteright}t want anyone else to know their interest in each other, what do they do? Once they know they are both online, they would like to be able to exchange messages, send files, make phone calls to each other, and so forth, all without anyone except them knowing they are doing this. Apres is a system that attempts to make this possible},
@@ -9319,7 +9342,7 @@ In this paper we propose an {\textquotedblleft}onion-like{\textquotedblright} en
 	address = {Harvard University},
 	abstract = {The asymptotic analysis of certain public good models for p2p systems suggests that when the aim is to maximize social welfare a fixed contribution scheme in terms of the number of files shared can be asymptotically optimal as the number of participants grows to infinity. Such a simple scheme eliminates free riding, is incentive compatible and obtains a value of social welfare that is within o(n) of that obtained by the second-best policy of the corresponding mechanism design formulation of the problem. We extend our model to account for file popularity, and discuss properties of the resulting equilibria. The fact that a simple optimization problem can be used to closely approximate the solution of the exact model (which is in most cases practically intractable both analytically and computationally), is of great importance for studying several interesting aspects of the system. We consider the evolution of the system to equilibrium in its early life, when both peers and the system planner are still learning about system parameters. We also analyse the case of group formation when peers belong to different classes (such as DSL and dial-up users), and it may be to their advantage to form distinct groups instead of a larger single group, or form such a larger group but avoid disclosing their class. We finally discuss the game that occurs when peers know that a fixed fee will be used, but the distribution of their valuations is unknown to the system designer},
 	keywords = {asymptotically optimal, P2P, sharing},
-	url = {http://www.eecs.harvard.edu/p2pecon/confman/papers },
+	www_section = {http://www.eecs.harvard.edu/p2pecon/confman/papers },
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/optimalscheme04.pdf},
 	author = {Panayotis Antoniadis and Costas Courcoubetis and Richard Weber}
 }
@@ -9327,7 +9350,7 @@ In this paper we propose an {\textquotedblleft}onion-like{\textquotedblright} en
 	title = {Attack Resistant Trust Metrics},
 	year = {2004},
 	abstract = {This dissertation characterizes the space of trust metrics, under both the scalar assumption where each assertion is evaluated independently, and the group assumption where a group of assertions are evaluated in tandem. We present a quantitative framework for evaluating the attack resistance of trust metrics, and give examples of trust metrics that are within a small factor of optimum compared to theoretical upper bounds. We discuss experiences with a realworld deployment of a group trust metric, the Advogato website. Finally, we explore possible applications of attack resistant trust metrics, including using it as to build a distributed name server, verifying metadata in peer-to-peer networks such as music sharing systems, and a proposal for highly spam resistant e-mail delivery},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.9266},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.9266},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/compact.pdf},
 	author = {Raph Levien}
 }
@@ -9343,7 +9366,7 @@ In this paper we propose an {\textquotedblleft}onion-like{\textquotedblright} en
 	keywords = {availability, DNS, federated},
 	isbn = {1-58113-821-0},
 	doi = {http://doi.acm.org/10.1145/1028788.1028790},
-	url = {http://doi.acm.org/10.1145/1028788.1028790},
+	www_section = {http://doi.acm.org/10.1145/1028788.1028790},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IMC\%2704\%20-\%20Availability\%2C\%20Usage\%2C\%20and\%20Deployment\%20Characteristics\%20of\%20the\%20DNS.pdf},
 	author = {Jeffrey Pang and James Hendricks and Aditya Akella and Bruce Maggs and Roberto De Prisco and Seshan, Srinivasan}
 }
@@ -9360,7 +9383,7 @@ In this paper we propose an {\textquotedblleft}onion-like{\textquotedblright} en
 	keywords = {attack, fault removal, fault-tolerance, index terms-dependability, trust, vulnerability},
 	issn = {1545-5971},
 	doi = {10.1109/TDSC.2004.2},
-	url = {http://portal.acm.org/citation.cfm?id=1026488.1026492$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1026488.1026492$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.88.2793.pdf},
 	author = {Avizienis, Algirdas and Laprie, Jean-Claude and Randell, Brian and Carl Landwehr}
 }
@@ -9370,7 +9393,7 @@ In this paper we propose an {\textquotedblleft}onion-like{\textquotedblright} en
 	month = {July},
 	school = {University of Cambridge},
 	type = {phd},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.3200},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.3200},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/george-thesis.pdf},
 	author = {George Danezis}
 }
@@ -9386,7 +9409,7 @@ In this paper we propose an {\textquotedblleft}onion-like{\textquotedblright} en
 	keywords = {bootstrapping, distributed hash table, P2P},
 	isbn = {0-7803-8783-X },
 	doi = {10.1109/ICON.2004.1409169},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cramer04bootstrapping.pdf},
 	author = {Cramer, Curt and Kendy Kutzner and Thomas Fuhrmann}
 }
@@ -9401,11 +9424,11 @@ In this paper we propose an {\textquotedblleft}onion-like{\textquotedblright} en
 We identify flaws in the software in Reliable that further compromise its ability to provide anonymity, and review key areas that are necessary for the security of a mix in addition to a sound algorithm. Our analysis can be used to evaluate under which circumstances the two mixing algorithms should be used to best achieve anonymity and satisfy their purpose. Our work can also be used as a framework for establishing a security review process for mix node deployments},
 	isbn = {978-3-540-22987-2},
 	doi = {10.1007/b100085},
-	url = {http://www.springerlink.com/content/7lvqwn445ty1c7ga/},
+	www_section = {http://www.springerlink.com/content/7lvqwn445ty1c7ga/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mixmaster-reliable.pdf},
 	author = {Claudia Diaz and Len Sassaman and Evelyne Dewitte}
 }
-@article {2004,
+@article {2004_1,
 	title = {A construction of locality-aware overlay network: mOverlay and its performance},
 	journal = {IEEE Journal on Selected Areas in Communications},
 	volume = {22},
@@ -9414,7 +9437,7 @@ We identify flaws in the software in Reliable that further compromise its abilit
 	pages = {18-28},
 	abstract = {There are many research interests in peer-to-peer (P2P) overlay architectures. Most widely used unstructured P2P networks rely on central directory servers or massive message flooding, clearly not scalable. Structured overlay networks based on distributed hash tables (DHT) are expected to eliminate flooding and central servers, but can require many long-haul message deliveries. An important aspect of constructing an efficient overlay network is how to exploit network locality in the underlying network. We propose a novel mechanism, mOverlay, for constructing an overlay network that takes account of the locality of network hosts. The constructed overlay network can significantly decrease the communication cost between end hosts by ensuring that a message reaches its destination with small overhead and very efficient forwarding. To construct the locality-aware overlay network, dynamic landmark technology is introduced. We present an effective locating algorithm for a new host joining the overlay network. We then present a theoretical analysis and simulation results to evaluate the network performance. Our analysis shows that the overhead of our locating algorithm is O(logN), where N is the number of overlay network hosts. Our simulation results show that the average distance between a pair of hosts in the constructed overlay network is only about 11\% of the one in a traditional, randomly connected overlay network. Network design guidelines are also provided. Many large-scale network applications, such as media streaming, application-level multicasting, and media distribution, can leverage mOverlay to enhance their performance},
 	keywords = {distributed hash table, flooding attacks, overlay networks, P2P},
-	url = {http://kmweb.twbbs.org/drupal/node/13},
+	www_section = {http://kmweb.twbbs.org/drupal/node/13},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/6-914.ppt},
 	author = {Xin Yan Zhang and Qian Zhang and Zhang, Zhensheng and Gang Song and Wenwu Zhu}
 }
@@ -9429,7 +9452,7 @@ We identify flaws in the software in Reliable that further compromise its abilit
 	abstract = {In this paper we present a quantitative study of data survival in peer to peer storage systems. We first recall two main redundancy mechanisms: replication and erasure codes, which are used by most peer to peer storage systems like OceanStore, PAST or CFS, to guarantee data durability. Second we characterize peer to peer systems according to a volatility factor (a peer is free to leave the system at anytime) and to an availability factor (a peer is not permanently connected to the system). Third we model the behavior of a system as a Markov chain and analyse the average life time of data (MTTF) according to the volatility and availability factors. We also present the cost of the repair process based on these redundancy schemes to recover failed peers. The conclusion of this study is that when there is no high availability of peers, a simple replication scheme may be more efficient than sophisticated erasure codes},
 	keywords = {P2P, redundancy, storage},
 	isbn = {0-7803-8430-X},
-	url = {http://portal.acm.org/citation.cfm?id=1111777$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1111777$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.102.9992.pdf},
 	author = {Gil Utard and Antoine Vernois}
 }
@@ -9443,10 +9466,10 @@ We identify flaws in the software in Reliable that further compromise its abilit
 	organization = {IEEE Computer Society},
 	address = {Washington, DC, USA},
 	isbn = {0-7695-2086-3},
-	url = {http://dl.acm.org/citation.cfm?id=977400.977979},
+	www_section = {http://dl.acm.org/citation.cfm?id=977400.977979},
 	author = {L Garc{\'e}s-Erice and Felber, P. A. and E W Biersack and Urvoy-Keller, G. and Ross, K. W.}
 }
-@mastersthesis {2004,
+@mastersthesis {2004_2,
 	title = {The Decentralised Coordination of Self-Adaptive Components for Autonomic Distributed Systems},
 	volume = {Doctor of Philosophy},
 	year = {2004},
@@ -9469,7 +9492,7 @@ We identify flaws in the software in Reliable that further compromise its abilit
 	abstract = {Overlay networks are widely used to deploy functionality at edge nodes without changing network routers. Each node in an overlay network maintains pointers to a set of neighbor nodes. These pointers are used both to maintain the overlay and to implement application functionality, for example, to locate content stored by overlay nodes. If an attacker controls a large fraction of the neighbors of correct nodes, it can "eclipse" correct nodes and prevent correct overlay operation. This Eclipse attack is more general than the Sybil attack. Attackers can use a Sybil attack to launch an Eclipse attack by inventing a large number of seemingly distinct overlay nodes. However, defenses against Sybil attacks do not prevent Eclipse attacks because attackers may manipulate the overlay maintenance algorithm to mount an Eclipse attack. This paper discusses the impact of the Eclipse attack on several types of overlay and it proposes a novel defense that prevents the attack by bounding the degree of overlay nodes. Our defense can be applied to any overlay and it enables secure implementations of overlay optimizations that choose neighbors according to metrics like proximity. We present preliminary results that demonstrate the importance of defending against the Eclipse attack and show that our defense is effective},
 	keywords = {attack, overlay networks},
 	doi = {10.1145/1133572.1133613},
-	url = {http://portal.acm.org/citation.cfm?id=1133572.1133613$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1133572.1133613$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.61.5727.pdf},
 	author = {Singh, Atul and Miguel Castro and Peter Druschel and Antony Rowstron}
 }
@@ -9483,7 +9506,7 @@ We identify flaws in the software in Reliable that further compromise its abilit
 	address = {Las Vegas, NV},
 	abstract = { Many clustering protocols for mobile ad hoc networks (MANETs) have been proposed in the literature. With only one exception so far [1], all these protocols are proactive, thus wasting bandwidth when their function is not currently needed. To reduce the signalling traffic load, reactive clustering may be employed. We have developed a clustering protocol named {\textquotedblleft}On-Demand Group Mobility-Based Clustering {\textquotedblright} (ODGMBC) which is reactive. Its goal is to build clusters as a basis for address autoconfiguration and hierarchical routing. The design process especially addresses the notion of group mobility in a MANET. As a result, ODGMBC maps varying physical node groups onto logical clusters. In this paper, ODGMBC is described. It was implemented for the ad hoc network simulator GloMoSim [2] and evaluated using several performance indicators. Simulation results are promising and show that ODGMBC leads to stable clusters. This stability is advantageous for autoconfiguration and routing mechansims to be employed in conjunction with the clustering algorithm. Index Terms {\textemdash} clustering, multi-hop, reactive, MANET, group mobility},
 	keywords = {mobile Ad-hoc networks, multi-hop networks},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cramer04odgmbc.pdf},
 	author = {Cramer, Curt and Oliver Stanze and Kilian Weniger and Martina Zitterbart}
 }
@@ -9497,7 +9520,7 @@ We identify flaws in the software in Reliable that further compromise its abilit
 	keywords = {sensor networks},
 	isbn = {978-3-540-20825-9},
 	doi = {10.1007/978-3-540-24606-0_19},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/scan.pdf},
 	author = {Hans-Joachim Hof and Erik-Oliver Blass and Thomas Fuhrmann and Martina Zitterbart}
 }
@@ -9516,11 +9539,11 @@ This paper explores the design of these techniques and their interaction in a co
 
 Measurements with 425 server instances running on 150 PlanetLab and RON hosts show that the latency optimizations reduce the time required to locate and fetch data by a factor of two. The throughput optimizations result in a sustainable bulk read throughput related to the number of DHT hosts times the capacity of the slowest access link; with 150 selected PlanetLab hosts, the peak aggregate throughput over multiple clients is 12.8 megabytes per second},
 	keywords = {distributed hash table, high-throughput, latency},
-	url = {http://dl.acm.org/citation.cfm?id=1251175.1251182},
+	www_section = {http://dl.acm.org/citation.cfm?id=1251175.1251182},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NSDI\%2704\%20-\%20Designing\%20a\%20DHT\%20for\%20low\%20latency\%20and\%20high\%20throughput.pdf},
 	author = {Dabek, Frank and Li, Jinyang and Emil Sit and Robertson, James and Frans M. Kaashoek and Robert Morris}
 }
-@conference {2004,
+@conference {2004_3,
 	title = {Designing Incentive mechanisms for peer-to-peer systems},
 	booktitle = {GECON 2004. 1st IEEE International Workshop on Grid Economics and Business Models},
 	year = {2004},
@@ -9541,7 +9564,7 @@ Measurements with 425 server instances running on 150 PlanetLab and RON hosts sh
 	title = {Digital Fountains: A Survey and Look Forward Abstract {\textemdash} We},
 	year = {2004},
 	abstract = {survey constructions and applications of digital fountains, an abstraction of erasure coding for network communication. Digital fountains effectively change the standard paradigm where a user receives an ordered stream of packets to one where a user must simply receive enough packets in order to obtain the desired data. Obviating the need for ordered data simplifies data delivery, especially when the data is large or is to be distributed to a large number of users. We also examine barriers to the adoption of digital fountains and discuss whether they can be overcome. I},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.2282},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.2282},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.114.2282.pdf}
 }
 @conference {golle:eurocrypt2004,
@@ -9557,7 +9580,7 @@ We present new DC-net constructions that simultaneously achieve non-interactivit
 	keywords = {anonymity, dining cryptographers, non-interactive, privacy},
 	isbn = {978-3-540-21935-4},
 	doi = {10.1007/b97182},
-	url = {http://www.springerlink.com/content/ud2tb1fyk5m2ywlu/},
+	www_section = {http://www.springerlink.com/content/ud2tb1fyk5m2ywlu/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/golle-eurocrypt2004.pdf},
 	author = {Philippe Golle and Ari Juels}
 }
@@ -9587,7 +9610,7 @@ We present new DC-net constructions that simultaneously achieve non-interactivit
 	address = {Ulm, Germany},
 	abstract = {Since the advent of Gnutella, Peer-to-Peer (P2P) protocols have matured towards a fundamental design element for large-scale, self-organising distributed systems. Many research efforts have been invested to improve various aspects of P2P systems, like their performance, scalability, and so on. However, little experience has been gathered from the actual deployment of such P2P systems apart from the typical file sharing applications. To bridge this gap and to gain more experience in making the transition from theory to practice, we started building advanced P2P applications whose explicit goal is {\textquotedblleft}to be deployed in the wild{\textquotedblright}. In this paper, we describe a fully decentralised P2P video recording system. Every node in the system is a networked computer (desktop PC or set-top box) capable of receiving and recording DVB-S, i.e. digital satellite TV. Like a normal video recorder, users can program their machines to record certain programmes. With our system, they will be able to schedule multiple recordings in parallel. It is the task of the system to assign the recordings to different machines in the network. Moreover, users can {\textquotedblleft}record broadcasts in the past{\textquotedblright}, i.e. the system serves as a short-term archival storage},
 	keywords = {DVB, P2P},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cramer04scheduling.pdf},
 	author = {Cramer, Curt and Kendy Kutzner and Thomas Fuhrmann}
 }
@@ -9603,7 +9626,7 @@ The simplest solution to this problem would be to send many onions with the same
 	keywords = {adaptive adversary, anonymity, onion routing},
 	isbn = {978-0-387-24485-3},
 	doi = {10.1007/b105674},
-	url = {http://www.springerlink.com/content/019lu6xp5b9fctn8/},
+	www_section = {http://www.springerlink.com/content/019lu6xp5b9fctn8/},
 	author = {Jan Iwanik and Marek Klonowski and Miroslaw Kutylowski}
 }
 @conference {Danezis04theeconomics,
@@ -9612,11 +9635,11 @@ The simplest solution to this problem would be to send many onions with the same
 	year = {2004},
 	abstract = {We propose the first economic model of censorship resistance. Early peer-to-peer systems, such as the Eternity Service, sought to achieve censorshop resistance by distributing content randomly over the whole Internet. An alternative approach is to encourage nodes to serve resources they are interested in. Both architectures have been implemented but so far there has been no quantitative analysis of the protection they provide. We develop a model inspired by economics and con
 ict theory to analyse these systems. Under our assumptions, resource distribution according to nodes{\textquoteright} individual preferences provides better stability and resistance to censorship. Our results may have wider application too},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.4.7003\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.4.7003\&rep=rep1\&type=pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.4.7003\%20\%281\%29.pdf},
 	author = {George Danezis and Ross Anderson}
 }
-@book {2004,
+@book {2004_4,
 	title = {Efficient Private Matching and Set Intersection},
 	booktitle = {Advances in Cryptology - EUROCRYPT 2004},
 	series = {Lecture Notes in Computer Science},
@@ -9628,7 +9651,7 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
 	abstract = {We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has many applications for online collaboration. We present protocols, based on the use of homomorphic encryption and balanced hashing, for both semi-honest and malicious environments. For lists of length k, we obtain O(k) communication overhead and O(k ln ln k) computation. The protocol for the semi-honest environment is secure in the standard model, while the protocol for the malicious environment is secure in the random oracle model. We also consider the problem of approximating the size of the intersection, show a linear lower-bound for the communication overhead of solving this problem, and provide a suitable secure protocol. Lastly, we investigate other variants of the matching problem, including extending the protocol to the multi-party setting as well as considering the problem of approximate matching},
 	isbn = {978-3-540-21935-4},
 	doi = {10.1007/978-3-540-24676-3_1},
-	url = {http://dx.doi.org/10.1007/978-3-540-24676-3_1},
+	www_section = {http://dx.doi.org/10.1007/978-3-540-24676-3_1},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EffecitvePrivateMatching2004Freedman.pdf},
 	author = {Freedman, MichaelJ. and Nissim, Kobbi and Pinkas, Benny},
 	editor = {Cachin, Christian and Camenisch, JanL.}
@@ -9640,7 +9663,7 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
 	publisher = {Kluwer Academic Publishers},
 	organization = {Kluwer Academic Publishers},
 	abstract = {The resource discovery problem poses new challenges in infrastructure-less wireless networks. Due to the highly dynamic nature of these networks and their bandwidth and energy constraints, there is a pressing need for energy-aware communicationefficient resource discovery protocols. This chapter provides an overview of several approaches to resource discovery, discussing their suitability for classes of wireless networks. The approaches discussed in this chapter include flooding-based approaches, hierarchical cluster-based and dominating set schemes, and hybrid loose hierarchy architectures. Furthermore, the chapter provides a detailed case study on the design, evaluation and analysis of an energy-efficient resource discovery protocol based on hybrid loose hierarchy and utilizing the concept of {\textquoteleft}contacts{\textquoteright}},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.9310},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.9310},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.76.9310.pdf},
 	author = {Ahmed Helmy}
 }
@@ -9653,7 +9676,7 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
 	address = {New York, NY, USA},
 	keywords = {anonymity, file-sharing, overlay networks},
 	doi = {10.1145/1133572.1133611},
-	url = {http://dx.doi.org/10.1145/1133572.1133611},
+	www_section = {http://dx.doi.org/10.1145/1133572.1133611},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/herbivore-esigops.pdf},
 	author = {Emin G{\"u}n Sirer and Goel, Sharad and Mark Robson and Engin, Dogan}
 }
@@ -9668,7 +9691,7 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
 	abstract = {The ever-increasing requirement for high-performance and huge-capacity memories of emerging embedded applications has led to the widespread adoption of SDRAM and NAND flash memory as main and secondary memories, respectively. In particular, the use of energy consuming memory, SDRAM, has become burdensome in battery-powered embedded systems. Intuitively, though demand paging can be used to mitigate the increasing requirement of main memory size, its applicability should be deliberately elaborated since NAND flash memory has asymmetric operation characteristics in terms of performance and energy consumption.In this paper, we present energy-aware demand paging technique to lower the energy consumption of embedded systems considering the characteristics of interactive embedded applications with large memory footprints. We also propose a flash memory-aware page replacement policy that can reduce the number of write and erase operations in NAND flash memory. With real-life workloads, we show the system-wide Energy{\textperiodcentered}Delay can be reduced by 15~30\% compared to the traditional shadowing architecture},
 	isbn = {1-58113-929-2},
 	doi = {10.1145/1013235.1013317},
-	url = {http://doi.acm.org/10.1145/1013235.1013317},
+	www_section = {http://doi.acm.org/10.1145/1013235.1013317},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/2004-ISLPED-Energy-aware\%20demand\%20paging\%20on\%20NAND\%20flash-based\%20embedded\%20storages.pdf},
 	author = {Chanik Park and Kang, Jeong-Uk and Park, Seon-Yeong and Kim, Jin-Soo}
 }
@@ -9682,11 +9705,11 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
 	address = {Berkeley, CA, USA},
 	abstract = {A fundamental vision driving pervasive computing research is access to personal and shared data anywhere at anytime. In many ways, this vision is close to being realized. Wireless networks such as 802.11 offer connectivity to small, mobile devices. Portable storage, such as mobile disks and USB keychains, let users carry several gigabytes of data in their pockets. Yet, at least three substantial barriers to pervasive data access remain. First, power-hungry network and storage devices tax the limited battery capacity of mobile computers. Second, the danger of viewing stale data or making inconsistent updates grows as objects are replicated across more computers and portable storage devices. Third, mobile data access performance can suffer due to variable storage access times caused by dynamic power management, mobility, and use of heterogeneous storage devices. To overcome these barriers, we have built a new distributed file system called BlueFS. Compared to the Coda file system, BlueFS reduces file system energy usage by up to 55\% and provides up to 3 times faster access to data replicated on portable storage},
 	keywords = {802.11, file systems},
-	url = {http://portal.acm.org/citation.cfm?id=1251279$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1251279$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/nightingale-bluefs2004.pdf},
 	author = {Nightingale, Edmund B. and Flinn, Jason}
 }
-@article {2004,
+@article {2004_5,
 	title = {Enhancing Web privacy and anonymity in the digital era},
 	journal = {Information Management \& Computer Security},
 	volume = {12},
@@ -9710,7 +9733,7 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
 	abstract = {Erasure coding is a technique for achieving high availability and reliability in storage and communication systems. In this paper, we revisit the analysis of erasure code replication and point out some situations when whole-file replication is preferred. The switchover point (from preferring whole-file replication to erasure code replication) is studied, and characterized using asymptotic analysis. We also discuss the additional considerations in building erasure code replication systems},
 	isbn = {0-7695-2156-8},
 	doi = {10.1109/P2P.2004.17},
-	url = {http://portal.acm.org/citation.cfm?id=1021938$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1021938$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.109.2034.pdf},
 	author = {Lin, W. K. and Chiu, Dah Ming and Lee, Y. B.}
 }
@@ -9719,7 +9742,7 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
 	year = {2004},
 	abstract = {The ever-increasing volume of archival data that need to be retained for long periods of time has motivated the design of low-cost, high-efficiency storage systems. Inter-file compression has been proposed as a technique to improve storage efficiency by exploiting the high degree of similarity among archival data. We evaluate the two main inter-file compression techniques, data chunking and delta encoding, and compare them with traditional intra-file compression. We report on experimental results from a range of representative archival data sets},
 	keywords = {compression, storage},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.1341},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.1341},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.11.1341.pdf},
 	author = {Lawrence L. You and Christos Karamanolis}
 }
@@ -9733,7 +9756,7 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
 	keywords = {algoweb_ldpc},
 	isbn = {0-7695-1822-2},
 	doi = {10.1109/ISIT.2004.1365074},
-	url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1181950},
+	www_section = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1181950},
 	author = {Richard Karp and Luby, Michael and M. Amin Shokrollahi}
 }
 @conference {flow-correlation04,
@@ -9751,7 +9774,7 @@ This work was supported in part by the National Science Foundation under Contrac
 	keywords = {flow correlation attack},
 	isbn = {978-3-540-26203-9},
 	doi = {10.1007/b136164},
-	url = {http://www.springerlink.com/content/kej7uwxee8h71p81/},
+	www_section = {http://www.springerlink.com/content/kej7uwxee8h71p81/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/flow-correlation04.pdf},
 	author = {Ye Zhu and Xinwen Fu and Bryan Graham and Riccardo Bettati and Wei Zhao}
 }
@@ -9765,7 +9788,7 @@ This work was supported in part by the National Science Foundation under Contrac
 	address = {Sophia Antipolis},
 	abstract = {The use of formal methods to verify security protocols with respect to secrecy and authentication has become standard practice. In contrast, the formalization of other security goals, such as privacy, has received less attention. Due to the increasing importance of privacy in the current society, formal methods will also become indispensable in this area. Therefore, we propose a formal definition of the notion of anonymity in presence of an observing intruder. We validate this definition by analyzing a well-known anonymity preserving protocol, viz. onion routing},
 	keywords = {anonymity, onion routing, privacy},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.75.2547},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.75.2547},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/esorics04-mauw.pdf},
 	author = {Sjouke Mauw and Jan Verschuren and Erik P. de Vink}
 }
@@ -9781,7 +9804,7 @@ This work was supported in part by the National Science Foundation under Contrac
 	keywords = {anonymity, mix, privacy, unlinkability},
 	isbn = {1-58113-961-6},
 	doi = {10.1145/1030083.1030114},
-	url = {http://portal.acm.org/citation.cfm?id=1030114},
+	www_section = {http://portal.acm.org/citation.cfm?id=1030114},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/reiter-ccs2004.pdf},
 	author = {Michael K. Reiter and XiaoFeng Wang}
 }
@@ -9799,11 +9822,11 @@ This work was supported in part by the National Science Foundation under Contrac
 	keywords = {cheap pseudonyms, cooperation, equilibrium, exclusion, free-riding, identity cost, incentives, peer-to-peer networking, whitewashing},
 	isbn = {1-58113-942-X},
 	doi = {http://doi.acm.org/10.1145/1016527.1016539},
-	url = {http://doi.acm.org/10.1145/1016527.1016539},
+	www_section = {http://doi.acm.org/10.1145/1016527.1016539},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PINS\%2704\%20-\%20\%20Free-riding\%20and\%20whitewashing\%20in\%20P2P\%20systems.pdf},
 	author = {Michal Feldman and Papadimitriou, Christos and John Chuang and Ion Stoica}
 }
-@book {2004,
+@book {2004_6,
 	title = {Group Spreading: A Protocol for Provably Secure Distributed Name Service},
 	booktitle = {Automata, Languages and Programming},
 	series = {Lecture Notes in Computer Science},
@@ -9814,7 +9837,7 @@ This work was supported in part by the National Science Foundation under Contrac
 	organization = {Springer Berlin Heidelberg},
 	isbn = {978-3-540-22849-3},
 	doi = {10.1007/978-3-540-27836-8_18},
-	url = {http://dx.doi.org/10.1007/978-3-540-27836-8_18},
+	www_section = {http://dx.doi.org/10.1007/978-3-540-27836-8_18},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p_icalp04_0.pdf},
 	author = {Awerbuch, Baruch and Scheideler, Christian},
 	editor = {D{\'\i}az, Josep and Karhum{\"a}ki, Juhani and Lepist{\"o}, Arto and Sannella, Donald}
@@ -9831,7 +9854,7 @@ In general, solving the minimal hitting set problem is NP-hard. Therefore, we us
 However, the statistical hitting set attack is prone to wrong solutions with a given small probability. We use here duality checking algorithms to resolve this problem. We call this final exact attack the HS*-attack},
 	keywords = {anonymity, hitting set attack, traffic analysis},
 	doi = {10.1007/b104759},
-	url = {http://www.springerlink.com/content/t6bkk4tyjvr71m55/},
+	www_section = {http://www.springerlink.com/content/t6bkk4tyjvr71m55/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/hitting-set04.pdf},
 	author = {Dogan Kesdogan and Lexi Pimenidis}
 }
@@ -9847,7 +9870,7 @@ However, the statistical hitting set attack is prone to wrong solutions with a g
 	keywords = {blocking resistance, JAP, mix},
 	isbn = {1-58113-968-3},
 	doi = {10.1145/1029179.1029197},
-	url = {http://portal.acm.org/citation.cfm?id=1029179.1029197},
+	www_section = {http://portal.acm.org/citation.cfm?id=1029179.1029197},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/koepsell-wpes2004_0.pdf},
 	author = {Stefan K{\"o}psell and Ulf Hilling}
 }
@@ -9866,7 +9889,7 @@ Golle et al{\textquoteright}s techniques for universal re-encryption are reviewe
 	keywords = {information hiding, re-encryption},
 	isbn = {978-3-540-26203-9},
 	doi = {10.1007/b136164},
-	url = {http://www.springerlink.com/content/q07439n27u1egx0w/},
+	www_section = {http://www.springerlink.com/content/q07439n27u1egx0w/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fairbrother-pet2004.pdf},
 	author = {Peter Fairbrother}
 }
@@ -9882,7 +9905,7 @@ Golle et al{\textquoteright}s techniques for universal re-encryption are reviewe
 The key feature of our approach is its modularity. It yields precise, formal specifications of information hiding properties for any protocol formalism and any choice of the attacker model as long as the latter induce an observational equivalence relation on protocol instances. In particular, specifications based on function views are suitable for any cryptographic process calculus that defines some form of indistinguishability between processes. Our definitions of information hiding properties take into account any feature of the security model, including probabilities, random number generation, timing, etc., to the extent that it is accounted for by the formalism in which the system is specified},
 	keywords = {anonymity, information hiding, privacy},
 	issn = {0926-227X},
-	url = {http://portal.acm.org/citation.cfm?id=1297694},
+	www_section = {http://portal.acm.org/citation.cfm?id=1297694},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/shmat_anon.pdf},
 	author = {Dominic Hughes and Vitaly Shmatikov}
 }
@@ -9896,7 +9919,7 @@ The key feature of our approach is its modularity. It yields precise, formal spe
 	address = {Berkeley, CA, USA},
 	abstract = {We describe a technique called lookaside caching that combines the strengths of distributed file systems and portable storage devices, while negating their weaknesses. In spite of its simplicity, this technique proves to be powerful and versatile. By unifying distributed storage and portable storage into a single abstraction, lookaside caching allows users to treat devices they carry as merely performance and availability assists for distant file servers. Careless use of portable storage has no catastrophic consequences. Experimental results show that significant performance improvements are possible even in the presence of stale data on the portable device},
 	keywords = {caching proxies, distributed database},
-	url = {http://portal.acm.org/citation.cfm?id=1096703$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1096703$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/integratingpds-fast04.pdf},
 	author = {Niraj Tolia and Harkes, Jan and Michael Kozuch and Satyanarayanan, Mahadev}
 }
@@ -9913,11 +9936,11 @@ The key feature of our approach is its modularity. It yields precise, formal spe
 	keywords = {indirection, mobility, multicast, network infrastructure, service composition},
 	issn = {1063-6692},
 	doi = {10.1109/TNET.2004.826279},
-	url = {http://portal.acm.org/citation.cfm?id=987233$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=987233$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/i3.pdf},
 	author = {Ion Stoica and Adkins, Daniel and Shelley Zhuang and S Shenker and Surana, Sonesh}
 }
-@book {2004,
+@book {2004_7,
 	title = {An Introduction to Auction Theory},
 	year = {2004},
 	pages = {199},
@@ -9928,7 +9951,7 @@ The key feature of our approach is its modularity. It yields precise, formal spe
 	keywords = {affiliated values model, auction theory, Bayesian Nash equilibrium, common values model, multiple objects, private values model, Revenue Equivalence Theorem},
 	isbn = {9780199275984},
 	doi = {10.1093/019927598X.001.0001},
-	url = {http://www.oxfordscholarship.com/view/10.1093/019927598X.001.0001/acprof-9780199275984},
+	www_section = {http://www.oxfordscholarship.com/view/10.1093/019927598X.001.0001/acprof-9780199275984},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Menezes\%20\%26\%20Monteiro\%20-\%20An\%20Introduction\%20to\%20Auction\%20Theory.pdf},
 	author = {Flavio M. Menezes and Paulo K. Monteiro}
 }
@@ -9949,7 +9972,7 @@ The main goals for the design of Keso has been that it should make use of spare 
 
 By basing Keso on peer-to-peer techniques it becomes highly scalable, fault tolerant and self-organizing. Keso is intended to run on ordinary workstations and can make use of the previously unused storage space. Keso also provides means for access control and data privacy despite being built on top of untrusted components. The file system utilizes the fact that a lot of data stored in traditional file systems is redundant by letting all files that contains a datablock with the same contents reference the same datablock in the file system. This is achieved while still maintaining access control and data privacy},
 	keywords = {decentralized file system, DKS, Keso},
-	url = {http://mattias.amnefe.lt/keso/},
+	www_section = {http://mattias.amnefe.lt/keso/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Amnefelt\%20\%26\%20Svenningsson\%20-\%20Keso.pdf},
 	author = {Mattias Amnefelt and Johanna Svenningsson}
 }
@@ -9959,7 +9982,7 @@ By basing Keso on peer-to-peer techniques it becomes highly scalable, fault tole
 	publisher = {In: the 4th IFIP Networking Conference (Networking{\textquoteright}05)},
 	abstract = {A fundamental challenge in Peer-To-Peer (P2P) systems is how to locate objects of interest, namely, the look-up service problem. A key break-through towards a scalable and distributed solution of this problem is the distributed hash},
 	keywords = {distributed hash table, P2P},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.3912},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.3912},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/INFOCOM05_Poster.pdf},
 	author = {Yinzhe Yu and Sanghwan Lee and Zhi-li Zhang}
 }
@@ -9974,7 +9997,7 @@ By basing Keso on peer-to-peer techniques it becomes highly scalable, fault tole
 Specifically, we implement a variant of a recently proposed technique that passively estimates the set of administrative domains (also known as autonomous systems, or ASes) between two arbitrary end-hosts without having access to either end of the path. Using this technique, we analyze the AS-level paths that are likely to be used in these anonymity networks. We find several cases in each network where multiple nodes are in the same administrative domain. Further, many paths between nodes, and between nodes and popular endpoints, traverse the same domain},
 	keywords = {anonymity, autonomous systems},
 	doi = {10.1145/1029179.1029199},
-	url = {http://portal.acm.org/citation.cfm?id=1029199},
+	www_section = {http://portal.acm.org/citation.cfm?id=1029199},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.10.6119.pdf},
 	author = {Nick Feamster and Roger Dingledine}
 }
@@ -9987,7 +10010,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
 	organization = {USENIX Association},
 	address = {Berkeley, CA, USA},
 	abstract = {Currently, researchers designing and implementing large-scale overlay services employ disparate techniques at each stage in the production cycle: design, implementation, experimentation, and evaluation. As a result, complex and tedious tasks are often duplicated leading to ineffective resource use and difficulty in fairly comparing competing algorithms. In this paper, we present MACEDON, an infrastructure that provides facilities to: i) specify distributed algorithms in a concise domain-specific language; ii) generate code that executes in popular evaluation infrastructures and in live networks; iii) leverage an overlay-generic API to simplify the interoperability of algorithm implementations and applications; and iv) enable consistent experimental evaluation. We have used MACEDON to implement and evaluate a number of algorithms, including AMMO, Bullet, Chord, NICE, Overcast, Pastry, Scribe, and SplitStream, typically with only a few hundred lines of MACEDON code. Using our infrastructure, we are able to accurately reproduce or exceed published results and behavior demonstrated by current publicly available implementations},
-	url = {http://portal.acm.org/citation.cfm?id=1251175.1251195$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1251175.1251195$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.2.8796.pdf},
 	author = {Rodriguez, Adolfo and Killian, Charles and Bhat, Sooraj and Kosti{\'c}, Dejan and Vahdat, Amin}
 }
@@ -10000,7 +10023,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
 	pages = {226{\textendash}241},
 	abstract = {Anonymous message transmission should be a key feature in network architectures ensuring that delivered messages are impossible-or at least infeasible-to be traced back to their senders. For this purpose the formal model of the non-adaptive, real-time PROB-channel will be introduced. In this model attackers try to circumvent applied protection measures and to link senders to delivered messages. In order to formally measure the level of anonymity provided by the system, the probability will be given, with which observers can determine the senders of delivered messages (source-hiding property) or the recipients of sent messages (destination-hiding property). In order to reduce the certainty of an observer, possible counter-measures will be defined that will ensure specified upper limit for the probability with which an observer can mark someone as the sender or recipient of a message. Finally results of simulations will be shown to demonstrate the strength of the techniques},
 	isbn = {3-540-26203-2},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.851},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.851},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/TH04.pdf},
 	author = {Gergely T{\'o}th and Zolt{\'a}n Horn{\'a}k}
 }
@@ -10013,7 +10036,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
 	address = {Espoo, Finland},
 	abstract = {Anonymous message transmission systems are the building blocks of several high-level anonymity services (e.g. epayment, e-voting). Therefore, it is essential to give a theoretically based but also practically usable objective numerical measure for the provided level of anonymity. In this paper two entropybased anonymity measures will be analyzed and some shortcomings of these methods will be highlighted. Finally, source- and destination-hiding properties will be introduced for so called local anonymity, an aspect reflecting the point of view of the users},
 	keywords = {anonymity, anonymity measurement},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.7843},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.7843},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/THV04.pdf},
 	author = {Gergely T{\'o}th and Zolt{\'a}n Horn{\'a}k and Ferenc Vajda},
 	editor = {Sanna Liimatainen and Teemupekka Virtanen}
@@ -10031,7 +10054,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
 	keywords = {distributed hash table, load balancing, mercury, P2P, random sampling, range queries},
 	issn = {0146-4833},
 	doi = {10.1145/1030194.1015507},
-	url = {http://portal.acm.org/citation.cfm?id=1030194.1015507$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1030194.1015507$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p625-bharambe1.pdf},
 	author = {Bharambe, Ashwin R. and Agrawal, Mukesh and Seshan, Srinivasan}
 }
@@ -10047,7 +10070,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
 	keywords = {anonymity, tagging attack},
 	isbn = {1-58113-968-3},
 	doi = {10.1145/1029179.1029198},
-	url = {http://portal.acm.org/citation.cfm?id=1029179.1029198},
+	www_section = {http://portal.acm.org/citation.cfm?id=1029179.1029198},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/danezis-wpes2004.pdf},
 	author = {George Danezis and Ben Laurie}
 }
@@ -10065,7 +10088,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
 	keywords = {fluid model, game theory, peer-to-peer networking},
 	isbn = {1-58113-862-8},
 	doi = {http://doi.acm.org/10.1145/1015467.1015508},
-	url = {http://doi.acm.org/10.1145/1015467.1015508},
+	www_section = {http://doi.acm.org/10.1145/1015467.1015508},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%2704\%20-\%20Qui\%20\%26\%20Srikant\%20-\%20Modeling\%20and\%20performance\%20analysis.pdf},
 	author = {Qiu, Dongyu and Rayadurgam Srikant}
 }
@@ -10077,7 +10100,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
 	organization = {Springer},
 	abstract = {In this paper we present and evaluate uncoordinated on-line algorithms for simultaneous storage and replication load-balancing in DHT-based peer-to-peer systems. We compare our approach with the classical balls into bins model, and point out the similarities but also the differences which call for new loadbalancing mechanisms specifically targeted at P2P systems. Some of the peculiarities of P2P systems, which make our problem even more challenging are that both the network membership and the data indexed in the network is dynamic, there is neither global coordination nor global information to rely on, and the load-balancing mechanism ideally should not compromise the structural properties and thus the search efficiency of the DHT, while preserving the semantic information of the data (e.g., lexicographic ordering to enable range searches)},
 	keywords = {distributed hash table, P2P, storage},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.3746},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.3746},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/self-star-load-balance.pdf},
 	author = {Karl Aberer and Anwitaman Datta and Manfred Hauswirth}
 }
@@ -10086,7 +10109,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
 	booktitle = {INFOCOM},
 	year = {2004},
 	abstract = {There are a number of scenarios where it is desirable to have a wireless device connect to multiple networks simultaneously. Currently, this is possible only by using multiple wireless network cards in the device. Unfortunately, using multiple wireless cards causes excessive energy drain and consequent reduction of lifetime in battery operated devices. In this paper, we propose a software based approach, called MultiNet, that facilitates simultaneous connections to multiple networks by virtualizing a single wireless card. The wireless card is virtualized by introducing an intermediate layer below IP, which continuously switches the card across multiple networks. The goal of the switching algorithm is to be transparent to the user who sees her machine as being connected to multiple networks. We present the design, implementation, and performance of the MultiNet system.We analyze and evaluate buffering and switching algorithms in terms of delay and energy consumption. Our system has been operational for over twelve months, it is agnostic of the upper layer protocols, and works well over popular IEEE 802.11 wireless LAN cards},
-	url = {http://www.pubzone.org/dblp/conf/infocom/ChandraBB04},
+	www_section = {http://www.pubzone.org/dblp/conf/infocom/ChandraBB04},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/18_3.PDF},
 	author = {Ranveer Chandra and Victor Bahl and Pradeep Bahl}
 }
@@ -10103,7 +10126,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
 	abstract = {We consider a model for monitoring the connectivity of a network subject to node or edge failures. In particular, we are concerned with detecting (ε, k)-failures: events in which an adversary deletes up to network elements (nodes or edges), after which there are two sets of nodes A and B, each at least an ε fraction of the network, that are disconnected from one another. We say that a set D of nodes is an (ε k)-detection set if, for any (ε k)-failure of the network, some two nodes in D are no longer able to communicate; in this way, D "witnesses" any such failure. Recent results show that for any graph G, there is an is (ε k)-detection set of size bounded by a polynomial in k and ε, independent of the size of G.In this paper, we expose some relationships between bounds on detection sets and the edge-connectivity λ and node-connectivity κ of the underlying graph. Specifically, we show that detection set bounds can be made considerably stronger when parameterized by these connectivity values. We show that for an adversary that can delete κλ edges, there is always a detection set of size O((κ/ε) log (1/ε)) which can be found by random sampling. Moreover, an (ε, \&lambda)-detection set of minimum size (which is at most 1/ε) can be computed in polynomial time. A crucial point is that these bounds are independent not just of the size of G but also of the value of λ.Extending these bounds to node failures is much more challenging. The most technically difficult result of this paper is that a random sample of O((κ/ε) log (1/ε)) nodes is a detection set for adversaries that can delete a number of nodes up to κ, the node-connectivity.For the case of edge-failures we use VC-dimension techniques and the cactus representation of all minimum edge-cuts of a graph; for node failures, we develop a novel approach for working with the much more complex set of all minimum node-cuts of a graph},
 	keywords = {failure detection, graph connectivity, network},
 	isbn = {0-89871-558-X},
-	url = {http://dl.acm.org/citation.cfm?id=982792.982803},
+	www_section = {http://dl.acm.org/citation.cfm?id=982792.982803},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SODA\%2704\%20-\%20Network\%20failure\%20detection\%20and\%20graph\%20connectivity\%250A.pdf},
 	author = {Kleinberg, Jon and Sandler, Mark and Slivkins, Aleksandrs}
 }
@@ -10119,7 +10142,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
 	address = {Boston, Massachusetts, USA},
 	abstract = {Network positioning has recently been demonstrated to be a viable concept to represent the network distance relationships among Internet end hosts. Several subsequent studies have examined the potential benefits of using network position in applications, and proposed alternative network positioning algorithms. In this paper, we study the problem of designing and building a network positioning system (NPS). We identify several key system-building issues such as the consistency, adaptivity and stability of host network positions over time. We propose a hierarchical network positioning architecture that maintains consistency while enabling decentralization, a set of adaptive decentralized algorithms to compute and maintain accurate, stable network positions, and finally present a prototype system deployed on PlanetLab nodes that can be used by a variety of applications. We believe our system is a viable first step to provide a network positioning capability in the Internet},
 	keywords = {Internet, network positioning algorithms, network positioning system, nps},
-	url = {http://dl.acm.org/citation.cfm?id=1247415.1247426},
+	www_section = {http://dl.acm.org/citation.cfm?id=1247415.1247426},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ATEC\%2704\%20-\%20A\%20network\%20positioning\%20system.pdf},
 	author = {Ng, T. S. Eugene and Zhang, Hui}
 }
@@ -10133,7 +10156,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
 	address = {Berkeley, CA, USA},
 	abstract = {PlanetLab is a geographically distributed overlay network designed to support the deployment and evaluation of planetary-scale network services. Two high-level goals shape its design. First, to enable a large research community to share the infrastructure, PlanetLab provides distributed virtualization, whereby each service runs in an isolated slice of PlanetLab{\textquoteright}s global resources. Second, to support competition among multiple network services, PlanetLab decouples the operating system running on each node from the network-wide services that define PlanetLab, a principle referred to as unbundled management. This paper describes how Planet-Lab realizes the goals of distributed virtualization and unbundled management, with a focus on the OS running on each node},
 	keywords = {overlay networks},
-	url = {http://portal.acm.org/citation.cfm?id=1251175.1251194$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1251175.1251194$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/plos_nsdi_04.pdf},
 	author = {Bavier, Andy and Bowman, Mic and Chun, Brent and Culler, David and Karlin, Scott and Muir, Steve and Peterson, Larry and Roscoe, Timothy and Spalink, Tammo and Wawrzoniak, Mike}
 }
@@ -10151,7 +10174,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of 
 	keywords = {anonymity, privacy},
 	isbn = {1-58113-961-6},
 	doi = {10.1145/1030083.1030113},
-	url = {http://portal.acm.org/citation.cfm?id=1030113},
+	www_section = {http://portal.acm.org/citation.cfm?id=1030113},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/golle-ccs2004.pdf},
 	author = {Philippe Golle and Ari Juels}
 }
@@ -10160,11 +10183,11 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of 
 	year = {2004},
 	abstract = {Backup is cumbersome. To be effective, backups have to be made at regular intervals, forcing users to organize and store a growing collection of backup media. In this paper we propose a novel Peer-to-Peer backup system, PeerStore, that allows the user to store his backups on other people{\textquoteright}s computers instead. PeerStore is an adaptive, cost-effective system suitable for all types of networks ranging from LAN, WAN to large unstable networks like the Internet. The system consists of two layers: metadata layer and symmetric trading layer. Locating blocks and duplicate checking is accomplished by the metadata layer while the actual data distribution is done between pairs of peers after they have established a symmetric data trade. By decoupling the metadata management from data storage, the system offers a significant reduction of the maintenance cost and preserves fairness among peers. Results show that PeerStore has a reduced maintenance cost comparing to pStore. PeerStore also realizes fairness because of the symmetric nature of the trades},
 	keywords = {backup, P2P},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.8067},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.8067},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/peerstore-better-performance-by.pdf},
 	author = {Martin Landers and Han Zhang and Kian-Lee Tan}
 }
-@conference {2004,
+@conference {2004_8,
 	title = {A Peer-to-Peer File Sharing System for Wireless Ad-Hoc Networks},
 	year = {2004},
 	abstract = {File sharing in wireless ad-hoc networks in a peer to peer manner imposes many challenges that make conventional peer-to-peer systems operating on wire-line networks inapplicable for this case. Information and workload distribution as well as routing are major problems for members of a wireless ad-hoc network, which are only aware of their neighborhood. In this paper we propose a system that solves peer-to-peer filesharing problem for wireless ad-hoc networks. Our system works according to peer-to-peer principles, without requiring a central server, and distributes information regarding the location of shared files among members of the network. By means of a {\textquotedblleft}hashline{\textquotedblright} and forming a tree-structure based on the topology of the network, the system is able to answer location queries, and also discover and maintain routing information that is used to transfer files from a source-peer to another peer},
@@ -10172,7 +10195,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of 
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.124.9928.pdf},
 	editor = {Hasan S{\"o}zer and Metin Kekkalmaz and Ibrahim K{\"o}rpeoglu}
 }
-@article {2004,
+@article {2004_9,
 	title = {Peer-to-Peer Networking \& -Computing},
 	journal = {Informatik Spektrum},
 	volume = {27},
@@ -10194,11 +10217,11 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of 
 	address = {Cagliari, Italy},
 	abstract = {Databases and Grid computing are a good match. With the service orientation of Grid computing, the complexity of maintaining and integrating databases can be kept away from the actual users. Data access and integration is performed via services, which also allow to employ an access control. While it is our perception that many proposed Grid applications rely on a centralized and static infrastructure, Peer-to-Peer (P2P) technologies might help to dynamically scale and enhance Grid applications. The focus does not lie on publicly available P2P networks here, but on the self-organizing capabilities of P2P networks in general. A P2P overlay could, e.g., be used to improve the distribution of queries in a data Grid. For studying the combination of these three technologies, Grid computing, databases, and P2P, in this paper, we use an existing application from the life sciences, drug target validation, as an example. In its current form, this system has several drawbacks. We believe that they can be alleviated by using a combination of the service-based architecture of Grid computing and P2P technologies for implementing the services. The work presented in this paper is in progress. We mainly focus on the description of the current system state, its problems and the proposed new architecture. For a better understanding, we also outline the main topics related to the work presented here},
 	keywords = {GRID, overlay networks, P2P},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cramer04lifescience.pdf},
 	author = {Cramer, Curt and Andrea Schafferhans and Thomas Fuhrmann}
 }
-@article {2004,
+@article {2004_10,
 	title = {Personalized Web search for improving retrieval effectiveness},
 	journal = {Knowledge and Data Engineering, IEEE Transactions on},
 	volume = {16},
@@ -10212,13 +10235,13 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of 
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PersonalizedWebSearch2004Liu.pdf},
 	author = {Fang Liu and Yu, C. and Weiyi Meng}
 }
-@booklet {2004,
+@booklet {2004_11,
 	title = {POSIX - Portable Operating System Interface},
 	journal = {The Open Group Technical Standard Base Specifications, Issue 6},
 	number = {IEEE Std 1003.n },
 	year = {2004},
 	keywords = {API, asynchronous, built-in utility, CPU, file access control mechanism, input/output (I/O), job control, network, portable operating system interface (POSIX{\textregistered}), shell, stream, synchronous},
-	url = {http://pubs.opengroup.org/onlinepubs/009695399/},
+	www_section = {http://pubs.opengroup.org/onlinepubs/009695399/},
 	author = {The Open Group and IEEE}
 }
 @conference {morphmix-fc2004,
@@ -10233,7 +10256,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of 
 	keywords = {anonymity, P2P},
 	isbn = {978-3-540-22420-4},
 	doi = {10.1007/b98935},
-	url = {http://www.springerlink.com/content/dc1qn54t9ta4u3g1/},
+	www_section = {http://www.springerlink.com/content/dc1qn54t9ta4u3g1/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/morphmix-fc2004.pdf},
 	author = {Marc Rennhard and Bernhard Plattner},
 	editor = {Ari Juels}
@@ -10251,7 +10274,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of 
 	keywords = {network coordinates, proximity routing, replica selection, retransmission timer estimation, Vivaldi},
 	issn = {0146-4833},
 	doi = {http://doi.acm.org/10.1145/972374.972394},
-	url = {http://doi.acm.org/10.1145/972374.972394},
+	www_section = {http://doi.acm.org/10.1145/972374.972394},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%20Comput.\%20Commun.\%20Rev.\%20-\%20Practical\%2C\%20distributed\%20network\%20coordinates.pdf},
 	author = {Russ Cox and Dabek, Frank and Frans M. Kaashoek and Li, Jinyang and Robert Morris}
 }
@@ -10269,7 +10292,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of 
 	keywords = {traffic analysis},
 	isbn = {978-3-540-26203-9},
 	doi = {10.1007/b136164},
-	url = {http://www.springerlink.com/content/v6m6cat1lxvbd4yd/},
+	www_section = {http://www.springerlink.com/content/v6m6cat1lxvbd4yd/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/e2e-traffic.pdf},
 	author = {Nick Mathewson and Roger Dingledine}
 }
@@ -10285,7 +10308,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of 
 	keywords = {anonymity, predecessor attack, privacy},
 	issn = {1094-9224},
 	doi = {10.1145/1042031.1042032},
-	url = {http://portal.acm.org/citation.cfm?id=1042031.1042032\&coll=GUIDE\&dl=GUIDE\&CFID=76057600\&CFTOKEN=15386893},
+	www_section = {http://portal.acm.org/citation.cfm?id=1042031.1042032\&coll=GUIDE\&dl=GUIDE\&CFID=76057600\&CFTOKEN=15386893},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Wright-2004.pdf},
 	author = {Matthew Wright and Micah Adler and Brian Neil Levine and Clay Shields}
 }
@@ -10293,7 +10316,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of 
 	title = {Privacy in Electronic Commerce and the Economics of Immediate Gratification},
 	year = {2004},
 	abstract = {Dichotomies between privacy attitudes and behavior have been noted in the literature but not yet fully explained. We apply lessons from the research on behavioral economics to understand the individual decision making process with respect to privacy in electronic commerce. We show that it is unrealistic to expect individual rationality in this context. Models of self-control problems and immediate gratification offer more realistic descriptions of the decision process and are more consistent with currently available data. In particular, we show why individuals who may genuinely want to protect their privacy might not do so because of psychological distortions well documented in the behavioral literature; we show that these distortions may affect not only {\textquoteleft}na{\"\i}ve{\textquoteright} individuals but also {\textquoteleft}sophisticated{\textquoteright} ones; and we prove that this may occur also when individuals perceive the risks from not protecting their privacy as significant},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.58.3760\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.58.3760\&rep=rep1\&type=pdf},
 	author = {Alessandro Acquisti}
 }
 @conference {Atallah:2004:PCF:1029179.1029204,
@@ -10310,7 +10333,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of 
 	keywords = {benchmarking, e-commerce, forecasting, privacy, secure multi-party computation, secure protocol, SMC},
 	isbn = {1-58113-968-3},
 	doi = {10.1145/1029179.1029204},
-	url = {http://doi.acm.org/10.1145/1029179.1029204},
+	www_section = {http://doi.acm.org/10.1145/1029179.1029204},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WPES\%2704\%20-\%20Forecasting\%20and\%20benchamking.pdf},
 	author = {Atallah, Mikhail and Bykova, Marina and Li, Jiangtao and Frikken, Keith and Topkara, Mercan}
 }
@@ -10322,11 +10345,11 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of 
 	keywords = {distributed database, private information retrieval, private key, public key cryptography},
 	isbn = {3-540-22217-0},
 	issn = {0302-9743 },
-	url = {http://cat.inist.fr/?aModele=afficheN\&cpsidt=15852065},
+	www_section = {http://cat.inist.fr/?aModele=afficheN\&cpsidt=15852065},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kissner04private.pdf},
 	author = {Lea Kissner and Alina Oprea and Michael K. Reiter and Dawn Xiaodong Song and Ke Yang}
 }
-@conference {2004,
+@conference {2004_12,
 	title = {A Probabilistic Approach to Predict Peers{\textquoteright} Performance in P2P Networks},
 	booktitle = {CIA 2004. Cooperative Information Agents VIII, 8th International Workshop},
 	series = {Lecture Notes in Computer Science},
@@ -10352,7 +10375,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of 
 	pages = {355{\textendash}377},
 	abstract = {We use the probabilistic model checker PRISM to analyze the Crowds system for anonymous Web browsing. This case study demonstrates how probabilistic model checking techniques can be used to formally analyze security properties of a peer-to-peer group communication system based on random message routing among members. The behavior of group members and the adversary is modeled as a discrete-time Markov chain, and the desired security properties are expressed as PCTL formulas. The PRISM model checker is used to perform automated analysis of the system and verify anonymity guarantees it provides. Our main result is a demonstration of how certain forms of probabilistic anonymity degrade when group size increases or random routing paths are rebuilt, assuming that the corrupt group members are able to identify and/or correlate multiple routing paths originating from the same sender},
 	keywords = {anonymity, P2P, routing},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.6570},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.6570},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/shmat_crowds.pdf},
 	author = {Vitaly Shmatikov}
 }
@@ -10370,7 +10393,7 @@ In this paper we improve these results: we show that the same level of unlinkabi
 	keywords = {anonymity, Markov chain, path coupling, rapid mixing, unlinkability},
 	isbn = {978-3-540-23208-7},
 	doi = {10.1007/b100936},
-	url = {http://www.springerlink.com/content/cknab9y9bpete2ha/},
+	www_section = {http://www.springerlink.com/content/cknab9y9bpete2ha/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/berman-fc2004.pdf},
 	author = {Ron Berman and Amos Fiat and Amnon Ta-Shma},
 	editor = {Ari Juels}
@@ -10381,7 +10404,7 @@ In this paper we improve these results: we show that the same level of unlinkabi
 	year = {2004},
 	pages = {74{\textendash}79},
 	abstract = {Information dissemination in wide area networks has recently garnered much attention. Two differing models, publish/subscribe and rendezvous-based multicast atop overlay networks, have emerged as the two leading approaches for this goal. Event-based publish/subscribe supports contentbased services with powerful filtering capabilities, while peer-to-peer rendezvous-based services allow for efficient communication in a dynamic network infrastructure. We describe Reach, a system that integrates these two approaches to provide efficient and scalable content-based services in a dynamic network setting},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.92.4393\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.92.4393\&rep=rep1\&type=pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/debs04perng.pdf},
 	author = {Ginger Perng and Chenxi Wang and Michael K. Reiter}
 }
@@ -10393,7 +10416,7 @@ In this paper we improve these results: we show that the same level of unlinkabi
 	publisher = {Springer-Verlag},
 	organization = {Springer-Verlag},
 	abstract = {We study the problem of searching on data that is encrypted using a public key system. Consider user Bob who sends email to user Alice encrypted under Alice{\textquoteright}s public key. An email gateway wants to test whether the email contains the keyword "urgent" so that it could route the email accordingly. Alice, on the other hand does not wish to give the gateway the ability to decrypt all her messages. We define and construct a mechanism that enables Alice to provide a key to the gateway that},
-	url = {citeseer.ist.psu.edu/boneh04public.html},
+	www_section = {citeseer.ist.psu.edu/boneh04public.html},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/encsearch.pdf},
 	author = {Dan Boneh and Giovanni Di Crescenzo and Rafail Ostrovsky and Gieseppe Persiano}
 }
@@ -10418,7 +10441,7 @@ In this paper we improve these results: we show that the same level of unlinkabi
 	organization = {USENIX Association},
 	address = {Berkeley, CA, USA},
 	abstract = {Ongoing advancements in technology lead to ever-increasing storage capacities. In spite of this, optimizing storage usage can still provide rich dividends. Several techniques based on delta-encoding and duplicate block suppression have been shown to reduce storage overheads, with varying requirements for resources such as computation and memory. We propose a new scheme for storage reduction that reduces data sizes with an effectiveness comparable to the more expensive techniques, but at a cost comparable to the faster but less effective ones. The scheme, called Redundancy Elimination at the Block Level (REBL), leverages the benefits of compression, duplicate block suppression, and delta-encoding to eliminate a broad spectrum of redundant data in a scalable and efficient manner. REBL generally encodes more compactly than compression (up to a factor of 14) and a combination of compression and duplicate suppression (up to a factor of 6.7). REBL also encodes similarly to a technique based on delta-encoding, reducing overall space significantly in one case. Furthermore, REBL uses super-fingerprints, a technique that reduces the data needed to identify similar blocks while dramatically reducing the computational requirements of matching the blocks: it turns O(n2) comparisons into hash table lookups. As a result, using super-fingerprints to avoid enumerating matching data objects decreases computation in the resemblance detection phase of REBL by up to a couple orders of magnitude},
-	url = {http://portal.acm.org/citation.cfm?id=1247420$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1247420$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.91.8331.pdf},
 	author = {Kulkarni, Purushottam and Douglis, Fred and Jason Lavoie and Tracey, John M.}
 }
@@ -10428,7 +10451,7 @@ In this paper we improve these results: we show that the same level of unlinkabi
 	year = {2004},
 	abstract = {The emergence of more powerful and resourceful mobile devices, as well as new wireless communication technologies, is turning the concept of ad-hoc networking into a viable and promising possibility for ubiquitous information sharing. However, the inherent characteristics of ad-hoc networks bring up new challenges for which most conventional systems don{\textquoteright}t provide an appropriate response. Namely, the lack of a pre-existing infrastructure, the high topological dynamism of these networks, the relatively low bandwidth of wireless links, as well as the limited storage and energy resources of mobile devices are issues that strongly affect the efficiency of any distributed system intended to provide ubiquitous information sharing. In this paper we describe Haddock-FS, a transparent replicated file system designed to support collaboration in the novel usage scenarios enabled by mobile environments. Haddock-FS is based on a highly available optimistic consistency protocol. In order to effectively cope with the network bandwidth and device memory constraints of these environments, Haddock-FS employs a limited size log truncation scheme and a cross-file, cross-version content similarity exploitation mechanism},
 	keywords = {ad-hoc networks, ubiquitous computing},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.9141},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.9141},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.144.9141.pdf},
 	author = {Jo{\~a}o Barreto and Paulo Ferreira}
 }
@@ -10445,7 +10468,7 @@ We propose three very efficient protocols for reputable mixnets, all synchronous
 	keywords = {anonymity, privacy},
 	isbn = {978-3-540-26203-9},
 	doi = {10.1007/b136164},
-	url = {http://www.springerlink.com/content/mqpu4nyljy82ca90/},
+	www_section = {http://www.springerlink.com/content/mqpu4nyljy82ca90/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/golle-pet2004.pdf},
 	author = {Philippe Golle}
 }
@@ -10463,7 +10486,7 @@ We propose three very efficient protocols for reputable mixnets, all synchronous
 	keywords = {framework, P2P, peer-to-peer networking, reputation management},
 	isbn = {0-7695-2156-8},
 	doi = {http://dx.doi.org/10.1109/P2P.2004.44},
-	url = {http://dx.doi.org/10.1109/P2P.2004.44},
+	www_section = {http://dx.doi.org/10.1109/P2P.2004.44},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/P2P\%2704\%20-\%20Reputation\%20management\%20framework.pdf},
 	author = {Gupta, Rohit and Somani, Arun K.}
 }
@@ -10472,7 +10495,7 @@ We propose three very efficient protocols for reputable mixnets, all synchronous
 	booktitle = {In Proc. of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS)},
 	year = {2004},
 	pages = {1{\textendash}8},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.4900},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.4900},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/awerbuch-robust.pdf},
 	author = {Awerbuch, Baruch}
 }
@@ -10490,11 +10513,11 @@ We propose three very efficient protocols for reputable mixnets, all synchronous
 	keywords = {cheap pseudonyms, collusion, free-riding, incentives, peer-to-peer networking, prisoners dilemma, reputation, whitewash},
 	isbn = {1-58113-771-0},
 	doi = {http://doi.acm.org/10.1145/988772.988788},
-	url = {http://doi.acm.org/10.1145/988772.988788},
+	www_section = {http://doi.acm.org/10.1145/988772.988788},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EC\%2704\%20-\%20Robust\%20incentive\%20techniques\%20for\%20P2P\%20networks.pdf},
 	author = {Michal Feldman and Kevin Lai and Ion Stoica and John Chuang}
 }
-@article {2004,
+@article {2004_13,
 	title = {Scalable byzantine agreement},
 	year = {2004},
 	abstract = {This paper gives a scalable protocol for solving the Byzantine agreement problem. The protocol is scalable in the sense that for Byzantine agreement over n processors, each processor sends and receives only O(log n) messages in expectation. To the best of our knowledge this is the first result for the Byzantine agreement problem where each processor sends and receives o(n) messages. The protocol uses randomness and is correct with high probability. 1 It can tolerate any fraction of faulty processors which is strictly less than 1/6. Our result partially answers the following question posed by Kenneth Birman: {\textquotedblleft}How scalable are the traditional solutions to problems such as Consensus or Byzantine Agreement?{\textquotedblright} [5]},
@@ -10506,7 +10529,7 @@ We propose three very efficient protocols for reputable mixnets, all synchronous
 	title = {Secure Indexes},
 	booktitle = {In submission},
 	year = {2004},
-	url = {http://gnunet.org/papers/secureindex.pdf  },
+	www_section = {http://gnunet.org/papers/secureindex.pdf  },
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/secureindex.pdf},
 	author = {Eu-jin Goh}
 }
@@ -10523,11 +10546,11 @@ This paper describes the design and implementation of a secure, reliable, and sc
 	keywords = {programmable networks, secrecy},
 	isbn = {978-3-540-71499-6},
 	doi = {10.1007/978-3-540-71500-9},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/iwan2004.pdf},
 	author = {Michael Conrad and Thomas Fuhrmann and Marcus Schoeller and Martina Zitterbart}
 }
-@mastersthesis {2004,
+@mastersthesis {2004_14,
 	title = {Signaling and Networking in Unstructured Peer-to-Peer Networks},
 	year = {2004},
 	month = sep,
@@ -10552,7 +10575,7 @@ This paper describes the design and implementation of a secure, reliable, and sc
 	keywords = {load balancing, P2P},
 	isbn = {1-58113-840-7},
 	doi = {10.1145/1007912.1007919},
-	url = {http://portal.acm.org/citation.cfm?id=1007919$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1007919$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.88.2405.pdf},
 	author = {David Karger and Ruhl, Matthias}
 }
@@ -10568,7 +10591,7 @@ This paper describes the design and implementation of a secure, reliable, and sc
 In this paper, we present, a scalable simulation environment for wireless sensor networks that provides an accurate, per-node estimate of power consumption. PowerTOSSIM is an extension to TOSSIM, an event-driven simulation environment for TinyOS applications. In PowerTOSSIM, TinyOS components corresponding to specific hardware peripherals (such as the radio, EEPROM, LEDs, and so forth) are instrumented to obtain a trace of each device{\textquoteright}s activity during the simulation runPowerTOSSIM employs a novel code-transformation technique to estimate the number of CPU cycles executed by each node, eliminating the need for expensive instruction-level simulation of sensor nodes. PowerTOSSIM includes a detailed model of hardware energy consumption based on the Mica2 sensor node platform. Through instrumentation of actual sensor nodes, we demonstrate that PowerTOSSIM provides accurate estimation of power consumption for a range of applications and scales to support very large simulations},
 	keywords = {sensor networks, TinyOS},
 	doi = {10.1145/1031495.1031518},
-	url = {http://portal.acm.org/citation.cfm?id=1031495.1031518},
+	www_section = {http://portal.acm.org/citation.cfm?id=1031495.1031518},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.65.9976.pdf},
 	author = {Victor Shnayder and Mark Hempstead and Bor-rong Chen and Geoff Werner Allen and Matt Welsh}
 }
@@ -10585,7 +10608,7 @@ In this paper, we present, a scalable simulation environment for wireless sensor
 	keywords = {anonymity, statistical analysis},
 	isbn = {978-3-540-24207-9},
 	doi = {10.1007/b104759},
-	url = {http://www.springerlink.com/content/tqljb3hybk4rubla/},
+	www_section = {http://www.springerlink.com/content/tqljb3hybk4rubla/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.6.2954.pdf},
 	author = {George Danezis and Andrei Serjantov}
 }
@@ -10602,7 +10625,7 @@ In this paper, we present, a scalable simulation environment for wireless sensor
 	keywords = {content distribution, distributed hash table, DOLR, grid computing, P2P, peer-to-peer networking},
 	issn = {0360-0300},
 	doi = {http://doi.acm.org/10.1145/1041680.1041681},
-	url = {http://doi.acm.org/10.1145/1041680.1041681},
+	www_section = {http://doi.acm.org/10.1145/1041680.1041681},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ACM\%20Computing\%20Surveys\%20-\%20A\%20survey\%20of\%20p2p\%20content\%20distribution\%20technologies.pdf},
 	author = {Androutsellis-Theotokis, Stephanos and Spinellis, Diomidis}
 }
@@ -10628,7 +10651,7 @@ In this paper, we present, a scalable simulation environment for wireless sensor
 	abstract = {The variety of possible anonymity network topologies has spurred much debate in recent years. In a synchronous batching design, each batch of messages enters the mix network together, and the messages proceed in lockstep through the network. We show that a synchronous batching strategy can be used in various topologies, including a free-route network, in which senders choose paths freely, and a cascade network, in which senders choose from a set of fixed paths. We show that free-route topologies can provide better anonymity as well as better message reliability in the event of partial network failure},
 	keywords = {anonymity, network topology},
 	doi = {10.1007/b136164},
-	url = {http://www.springerlink.com/content/uqvfwe97ehlldm8d/},
+	www_section = {http://www.springerlink.com/content/uqvfwe97ehlldm8d/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/sync-batching.pdf},
 	author = {Roger Dingledine and Vitaly Shmatikov and Paul Syverson}
 }
@@ -10640,7 +10663,7 @@ In this paper, we present, a scalable simulation environment for wireless sensor
 	address = {Toulouse, France},
 	abstract = {This paper presents an analysis of mixes and dummy traffic policies, which are building blocks of anonymous services. The goal of the paper is to bring together all the issues related to the analysis and design of mix networks. We discuss continuous and pool mixes, topologies for mix networks and dummy traffic policies. We point out the advantages and disadvantages of design decisions for mixes and dummy policies. Finally, we provide a list of research problems that need further work},
 	keywords = {anonymity, dummy traffic, mix},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.9855},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.9855},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.5.9855.pdf},
 	author = {Claudia Diaz and Bart Preneel}
 }
@@ -10655,7 +10678,7 @@ In this paper, we present, a scalable simulation environment for wireless sensor
 	abstract = {A mix is a communication proxy that attempts to hide the correspondence between its incoming and outgoing messages. Timing attacks are a significant challenge for mix-based systems that wish to support interactive, low-latency applications. However, the potency of these attacks has not been studied carefully. In this paper, we investigate timing analysis attacks on low-latency mix systems and clarify the threat they pose. We propose a novel technique, defensive dropping, to thwart timing attacks. Through simulations and analysis, we show that defensive dropping can be effective against attackers who employ timing analysis},
 	isbn = {978-3-540-22420-4},
 	doi = {10.1007/b98935},
-	url = {http://www.springerlink.com/content/n4khdtwk7dqvj0u0/},
+	www_section = {http://www.springerlink.com/content/n4khdtwk7dqvj0u0/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/timing-fc2004.pdf},
 	author = {Brian Neil Levine and Michael K. Reiter and Chenxi Wang and Matthew Wright},
 	editor = {Ari Juels}
@@ -10669,7 +10692,7 @@ In this paper, we present, a scalable simulation environment for wireless sensor
 	organization = {USENIX Association  Berkeley, CA, USA},
 	abstract = {We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies, and a practical design for location-hidden services via rendezvous points. Tor works on the real-world Internet, requires no special privileges or kernel modifications, requires little synchronization or coordination between nodes, and provides a reasonable tradeoff between anonymity, usability, and efficiency. We briefly describe our experiences with an international network of more than 30 nodes. We close with a list of open problems in anonymous communication},
 	keywords = {onion routing},
-	url = {http://portal.acm.org/citation.cfm?id=1251396},
+	www_section = {http://portal.acm.org/citation.cfm?id=1251396},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tor-design.pdf},
 	author = {Roger Dingledine and Nick Mathewson and Paul Syverson}
 }
@@ -10681,7 +10704,7 @@ In this paper, we present, a scalable simulation environment for wireless sensor
 	abstract = {Availability is a storage system property that is both highly desired and yet minimally engineered. While many systems provide mechanisms to improve availability - such as redundancy and failure recovery - how to best configure these mechanisms is typically left to the system manager. Unfortunately, few individuals have the skills to properly manage the trade-offs involved, let alone the time to adapt these decisions to changing conditions. Instead, most systems are configured statically and with only a cursory understanding of how the configuration will impact overall performance or availability. While this issue can be problematic even for individual storage arrays, it becomes increasingly important as systems are distributed - and absolutely critical for the wide-area peer-to-peer storage infrastructures being explored.
 This paper describes the motivation, architecture and implementation for a new peer-to-peer storage system, called TotalRecall, that automates the task of availability management. In particular, the TotalRecall system automatically measures and estimates the availability of its constituent host components, predicts their future availability based on past behavior, calculates the appropriate redundancy mechanisms and repair policies, and delivers user-specified availability while maximizing efficiency},
 	keywords = {P2P},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.9775},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.9775},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/recall.pdf},
 	author = {Ranjita Bhagwan Kiran and Kiran Tati and Yu-chung Cheng and Stefan Savage and Geoffrey M. Voelker}
 }
@@ -10699,7 +10722,7 @@ This paper describes the motivation, architecture and implementation for a new p
 	keywords = {anonymity, traffic analysis},
 	isbn = {978-3-540-26203-9},
 	doi = {10.1007/b136164},
-	url = {http://www.springerlink.com/content/kgenxdaxkyey4ed2/},
+	www_section = {http://www.springerlink.com/content/kgenxdaxkyey4ed2/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/danezis-pet2004.pdf},
 	author = {George Danezis}
 }
@@ -10729,7 +10752,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	keywords = {anonymity, private channels, universal re-encryption},
 	isbn = {978-3-540-20996-6},
 	doi = {10.1007/b95630},
-	url = {http://www.springerlink.com/content/1fu5qrb1a2kfe7f9/},
+	www_section = {http://www.springerlink.com/content/1fu5qrb1a2kfe7f9/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/GolleJakobssonJuelsSyverson-universal04.pdf},
 	author = {Philippe Golle and Jakobsson, Markus and Ari Juels and Paul Syverson}
 }
@@ -10740,7 +10763,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	month = {July},
 	abstract = {Anonymous communication protocols, very essential for preserving privacy of the parties communicating, may lead to severe problems. A malicious server may use anonymous communication protocols for injecting unwelcome messages into the system so that their source can be hardly traced. So anonymity and privacy protection on one side and protection against such phenomena as spam are so far contradictory goals. We propose a mechanism that may be used to limit the mentioned side effects of privacy protection. During the protocol proposed each encrypted message admitted into the system is signed by a respective authority. Then, on its route through the network the encrypted message and the signature are re-encrypted universally. The purpose of universal re-encryption is to hide the routes of the messages from an observer monitoring the traffic. Despite re-encryption, signature of the authority remains valid. Depending on a particular application, verification of the signature is possible either off-line by anybody with the access to the ciphertext and the signature or requires contact with the authority that has issued the signature},
 	keywords = {anonymity, information hiding, privacy, re-encryption},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.4976},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.4976},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.108.4976.pdf},
 	author = {Marek Klonowski and Miroslaw Kutylowski and Anna Lauks and Filip Zagorski}
 }
@@ -10757,7 +10780,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	keywords = {internet topology, network coordinates, Vivaldi},
 	issn = {0146-4833},
 	doi = {http://doi.acm.org/10.1145/1030194.1015471},
-	url = {http://doi.acm.org/10.1145/1030194.1015471},
+	www_section = {http://doi.acm.org/10.1145/1030194.1015471},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%20Compt.\%20Commun.\%20Rev.\%20-\%20Vivaldi.pdf},
 	author = {Dabek, Frank and Russ Cox and Frans M. Kaashoek and Robert Morris}
 }
@@ -10773,7 +10796,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	keywords = {distributed hash table, overlay networks, P2P},
 	isbn = {0-7695-2252-1},
 	doi = {10.1109/CSAC.2004.50},
-	url = {http://portal.acm.org/citation.cfm?id=1038254.1038318$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1038254.1038318$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.3.1198.pdf},
 	author = {Srivatsa, Mudhakar and Liu, Ling}
 }
@@ -10783,7 +10806,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	year = {2004},
 	abstract = {In a typical file system, only the current version of a file (or directory) is available. In Wayback, a user can also access any previous version, all the way back to the file{\textquoteright}s creation time. Versioning is done automatically at the write level: each write to the file creates a new version. Wayback implements versioning using an undo log structure, exploiting the massive space available on modern disks to provide its very useful functionality. Wayback is a user-level file system built on the FUSE framework that relies on an underlying file system for access to the disk. In addition to simplifying Wayback, this also allows it to extend any existing file system with versioning: after being mounted, the file system can be mounted a second time with versioning. We describe the implementation of Wayback, and evaluate its performance using several benchmarks},
 	keywords = {file systems, version control},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.2672},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.2672},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.11.2672.pdf},
 	author = {Fabian Bustamante and Brian Cornell and Brian Cornell and Peter Dinda and Peter Dinda and Fabian Bustamante}
 }
@@ -10793,7 +10816,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	year = {2004},
 	pages = {440{\textendash}448},
 	abstract = {We investigate the circumstances under which it is possible to discourage free-riding in a peer-to-peer system for resource-sharing by prioritizing resource allocation to peers with higher reputation. We use a model to predict conditions necessary for any reputation scheme to succeed in discouraging free-riding by this method. We show with simulations that for representative cases, a very simple autonomous reputation scheme works nearly as well at discouraging free-riding as an ideal reputation scheme. Finally, we investigate the expected dynamic behavior of the system},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.4.9659\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.4.9659\&rep=rep1\&type=pdf},
 	author = {Nazareno Andrade and Miranda Mowbray and Walfredo Cirne and Francisco Brasileiro}
 }
 @conference {fu-active,
@@ -10807,7 +10830,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	abstract = {To explore mission-critical information, an adversary using active traffic analysis attacks injects probing traffic into the victim network and analyzes the status of underlying payload traffic. Active traffic analysis attacks are easy to deploy and hence become a serious threat to mission critical applications. This paper suggests statistical pattern recognition as a fundamental technology to evaluate effectiveness of active traffic analysis attacks and corresponding countermeasures. Our evaluation shows that sample entropy of ping packets {\textquoteright} round trip time is an effective feature statistic to discover the payload traffic rate. We propose simple countermeasures that can significantly reduce the effectiveness of ping-based active traffic analysis attacks. Our experiments validate the effectiveness of this scheme, which can also be used in other scenarios},
 	keywords = {traffic analysis},
 	isbn = {0-7695-2033-2},
-	url = {http://portal.acm.org/citation.cfm?id=950964},
+	www_section = {http://portal.acm.org/citation.cfm?id=950964},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fu-active.pdf},
 	author = {Xinwen Fu and Bryan Graham and Riccardo Bettati and Wei Zhao}
 }
@@ -10823,7 +10846,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	keywords = {ad-hoc networks, energy efficiency, game theory, mechanism design, routing, selfish agents, VCG mechanism},
 	isbn = {1-58113-753-2},
 	doi = {10.1145/938985.939011},
-	url = {http://portal.acm.org/citation.cfm?id=939011$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=939011$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.103.7483.pdf},
 	author = {Anderegg, Luzi and Eidenbenz, Stephan}
 }
@@ -10836,7 +10859,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	organization = {USENIX Association},
 	address = {Berkeley, CA, USA},
 	abstract = {Recent research has produced a new and perhaps dangerous technique for uniquely identifying blocks that I will call compare-by-hash. Using this technique, we decide whether two blocks are identical to each other by comparing their hash values, using a collision-resistant hash such as SHA-1[5]. If the hash values match, we assume the blocks are identical without further ado. Users of compare-by-hash argue that this assumption is warranted because the chance of a hash collision between any two randomly generated blocks is estimated to be many orders of magnitude smaller than the chance of many kinds of hardware errors. Further analysis shows that this approach is not as risk-free as it seems at first glance},
-	url = {http://portal.acm.org/citation.cfm?id=1251057$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1251057$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.100.8338.pdf},
 	author = {Henson, Val}
 }
@@ -10861,7 +10884,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	keywords = {traffic analysis},
 	isbn = {0-7695-2017-0},
 	doi = {10.1109/ICPP.2003.1240613},
-	url = {http://www.computer.org/portal/web/csdl/doi?doc=doi/10.1109/ICPP.2003.1240613},
+	www_section = {http://www.computer.org/portal/web/csdl/doi?doc=doi/10.1109/ICPP.2003.1240613},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fu-analytical.pdf},
 	author = {Xinwen Fu and Bryan Graham and Riccardo Bettati and Wei Zhao}
 }
@@ -10876,7 +10899,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	address = {Athens, Greece},
 	abstract = {This paper presents a method for calculating the anonymity of a timed pool mix. Thus we are able to compare it to a threshold pool mix, and any future mixes that might be developed. Although we are only able to compute the anonymity of a timed pool mix after some specic number of rounds, this is a practical approximation to the real anonymity},
 	keywords = {anonymity, mix},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.5699},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.5699},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.9.5699.pdf},
 	author = {Andrei Serjantov and Richard E. Newman}
 }
@@ -10889,7 +10912,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	keywords = {fault-tolerance, P2P},
 	isbn = {978-3-540-20184-7},
 	doi = {10.1007/b13831},
-	url = {http://www.springerlink.com/content/7emt7u01cvbb6bu6/},
+	www_section = {http://www.springerlink.com/content/7emt7u01cvbb6bu6/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.4.334.pdf},
 	author = {Hildrum, Kirsten and John Kubiatowicz}
 }
@@ -10897,11 +10920,11 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	title = {Automatic Context Integration for Group Aware Environments},
 	year = {2003},
 	abstract = {Tele-collaboration is a valuable tool that can connect learners at different sites and help them benefit from their respective competences. Albeit many e-learning applications provide a high level of technical sophistication, such tools typically fall short of reflecting the learners {\textquoteright} full context, e.g., their presence and awareness. Hence, these applications cause many disturbances in the social interaction of the learners. This paper describes mechanisms to improve the group awareness in elearning environments with the help of automatic integration of such context information from the physical world. This information is gathered by different embedded sensors in various objects, e.g., a coffee mug or an office chair. This paper also describes first results of the integration of these sensors into an existing CSCW/CSCL framework},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.1450},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.1450},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/hurler03context.pdf},
 	author = {Bernhard Hurler and Leo Petrak and Thomas Fuhrmann and Oliver Brand and Martina Zitterbart}
 }
-@conference {2003,
+@conference {2003_0,
 	title = {Bootstrapping a Distributed Computational Economy with Peer-to-Peer Bartering},
 	booktitle = {Proceedings of the 1st Worshop on Economics of Peer-to-Peer Systems},
 	year = {2003},
@@ -10923,7 +10946,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	keywords = {attack, security analysis},
 	isbn = {978-3-540-20610-1},
 	doi = {10.1007/b94512},
-	url = {http://www.springerlink.com/content/0e0mwvgyt008wxkf/},
+	www_section = {http://www.springerlink.com/content/0e0mwvgyt008wxkf/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/nguyen-pet2003.pdf},
 	author = {Lan Nguyen and Rei Safavi-Naini},
 	editor = {Roger Dingledine}
@@ -10936,7 +10959,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	month = aug,
 	pages = {995-1002},
 	abstract = {Scheme to build dynamic, distributed P2P networks of constant degree and logarithmic diameter},
-	url = {http://www.cs.brown.edu/people/eli/papers/focs01.pdf},
+	www_section = {http://www.cs.brown.edu/people/eli/papers/focs01.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/focs01.pdf},
 	author = {Gopal Pandurangan and Prabhakar Raghavan and Eli Upfal}
 }
@@ -10954,7 +10977,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	keywords = {BANDWIDTH, bullet, overlays, peer-to-peer networking},
 	isbn = {1-58113-757-5},
 	doi = {http://doi.acm.org/10.1145/945445.945473},
-	url = {http://doi.acm.org/10.1145/945445.945473},
+	www_section = {http://doi.acm.org/10.1145/945445.945473},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SOSP\%2703\%20-\%20Bullet.pdf},
 	author = {Kosti{\'c}, Dejan and Rodriguez, Adolfo and Albrecht, Jeannie and Vahdat, Amin}
 }
@@ -10969,7 +10992,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	keywords = {privacy, traffic analysis},
 	issn = {0933-2790},
 	doi = {10.1007/s00145-002-0128-6},
-	url = {http://www.springerlink.com/content/eljjgl3ec01c00xa/},
+	www_section = {http://www.springerlink.com/content/eljjgl3ec01c00xa/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.80.1566.pdf},
 	author = {Amos Beimel and Shlomi Dolev}
 }
@@ -10985,7 +11008,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	keywords = {ad-hoc networks, charging, cooperation, hybrid cellular networks, multi-hop networks, packet forwarding},
 	isbn = {1-58113-684-6},
 	doi = {10.1145/778415.778418},
-	url = {http://portal.acm.org/citation.cfm?id=778418$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=778418$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BenSalemBHJ03mobihoc.pdf},
 	author = {Salem, Naouel Ben and Levente Butty{\'a}n and Jean-Pierre Hubaux and Jakobsson, Markus}
 }
@@ -10996,7 +11019,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 	type = {publication},
 	address = {University of Dortmund, Germany},
 	abstract = {This paper presents an approach for interconnecting isolated clouds of an ad hoc network that form a scatternet topology using Internet gateways as intermediate nodes. The architecture developed is intended to augment FleetNet, a highly dynamic ad hoc network for inter-vehicle communications. This is achieved by upgrading FleetNet capabilities to establish a communication path between moving vehicles and the Internet via Internet gateways to facilitate direct gateway to gateway communications via the Internet, thus bridging gaps in the network topology and relaying packets closer towards their geographical destination at the same time. After outlining the overall FleetNet approach and its underlying geographical multi-hop routing, we focus on the FleetNet gateway architecture. We describe required modifications to the gateway architecture and to the FleetNet network layer in order to use these gateways as intermediate nodes for FleetNet routing. Finally, we conclude the paper by a short discussion on the prototype gateway implementation and by summarizing first results and ongoing work on inter scatternet communication},
-	url = {http://i30www.ira.uka.de/research/publications/p2p/},
+	www_section = {http://i30www.ira.uka.de/research/publications/p2p/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kutzner03connecting.pdf},
 	author = {Kendy Kutzner and Jean-Jacques Tchouto and Marc Bechler and Lars Wolf and Bernd Bochow and Thomas Luckenbach}
 }
@@ -11012,7 +11035,7 @@ While technically and conceptually simple, universal re-encryption leads to new 
 
 Because our scheme requires cooperation, it is potentially vulnerable to several novel attacks involving free riding (e.g., holding a partner{\textquoteright}s data is costly, which tempts cheating) or disruption. We defend against these attacks using a number of new methods, including the use of periodic random challenges to ensure partners continue to hold data and the use of disk-space wasting to make cheating unprofitable. Results from an initial prototype show that our technique is feasible and very inexpensive: it appears to be one to two orders of magnitude cheaper than existing Internet backup services},
 	keywords = {backup, P2P, redundancy},
-	url = {http://portal.acm.org/citation.cfm?id=1247343$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1247343$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/lillibridge.pdf},
 	author = {Mark Lillibridge and Sameh Elnikety and Andrew D. Birrell and Mike Burrows and Isard, Michael}
 }
@@ -11029,7 +11052,7 @@ Because our scheme requires cooperation, it is potentially vulnerable to several
 	abstract = {Internet traffic is experiencing a shift from webtraffic to file swapping traffic. Today a significant partof Internet traffic is generated by peer-to-peer applications, mostly by the popular Kazaa application.Yet, to date, few studies analyze Kazaa traffic, thusleaving the bulk of Internet traffic in dark. We presenta large-scale investigation of Kazaa traffic based onlogs collected at a large Israeli ISP, which captureroughly a quarter of all traffic between Israel and US},
 	keywords = {file swapping traffic, kazaa, traffic},
 	isbn = {0-7695-1972-5},
-	url = {http://dl.acm.org/citation.cfm?id=832311.837393},
+	www_section = {http://dl.acm.org/citation.cfm?id=832311.837393},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WIAPP\%2703\%20-\%20Deconstructing\%20the\%20Kazaa\%20network.pdf},
 	author = {Leibowitz, Nathaniel and Ripeanu, Matei and Wierzbicki, Adam}
 }
@@ -11044,7 +11067,7 @@ Because our scheme requires cooperation, it is potentially vulnerable to several
 	abstract = {We study the threat that passive logging attacks poseto anonymous communications. Previous work analyzedthese attacks under limiting assumptions. We first describea possible defense that comes from breaking the assumptionof uniformly random path selection. Our analysisshows that the defense improves anonymity in the staticmodel, where nodes stay in the system, but fails in a dynamicmodel, in which nodes leave and join. Additionally,we use the dynamic model to show that the intersectionattack creates a vulnerability in certain peer-to-peer systemsfor anonymous communciations. We present simulationresults that show that attack times are significantlylower in practice than the upper bounds given by previouswork. To determine whether users{\textquoteright} web traffic has communicationpatterns required by the attacks, we collectedand analyzed the web requests of users. We found that,for our study, frequent and repeated communication to thesame web site is common},
 	keywords = {attack, P2P},
 	isbn = {0-7695-1940-7},
-	url = {http://portal.acm.org/citation.cfm?id=830556},
+	www_section = {http://portal.acm.org/citation.cfm?id=830556},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/wright-passive.pdf , https://gnunet.org/git/bibliography.git/tree/docs/wright-passive2.pdf},
 	author = {Matthew Wright and Micah Adler and Brian Neil Levine and Clay Shields}
 }
@@ -11059,7 +11082,7 @@ Because our scheme requires cooperation, it is potentially vulnerable to several
 	abstract = {The highly successful architecture and protocols of today{\textquoteright}s Internet may operate poorly in environments characterized by very long delay paths and frequent network partitions. These problems are exacerbated by end nodes with limited power or memory resources. Often deployed in mobile and extreme environments lacking continuous connectivity, many such networks have their own specialized protocols, and do not utilize IP. To achieve interoperability between them, we propose a network architecture and application interface structured around optionally-reliable asynchronous message forwarding, with limited expectations of end-to-end connectivity and node resources. The architecture operates as an overlay above the transport layers of the networks it interconnects, and provides key services such as in-network data storage and retransmission, interoperable naming, authenticated forwarding and a coarse-grained class of service},
 	isbn = {1-58113-735-4},
 	doi = {10.1145/863955.863960},
-	url = {http://portal.acm.org/citation.cfm?id=863960$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=863960$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IRB-TR-03-003.pdf},
 	author = {Fall, Kevin}
 }
@@ -11070,7 +11093,7 @@ Because our scheme requires cooperation, it is potentially vulnerable to several
 	keywords = {ALC, FEC, large block FEC codes, LDGM, LDPC, reliable multicast},
 	isbn = {978-3-540-20051-2},
 	doi = {10.1007/b13249},
-	url = {http://www.springerlink.com/content/tdemq6m8b20320hb/},
+	www_section = {http://www.springerlink.com/content/tdemq6m8b20320hb/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ngc03_ldpc_slides_03sep18_4s.pdf},
 	author = {Vincent Roca and Zainab Khallouf and Julien Laboure}
 }
@@ -11081,7 +11104,7 @@ Because our scheme requires cooperation, it is potentially vulnerable to several
 
 This paper presents the design and implementation of a cooperative off-site backup system, Venti-DHash. Venti-DHash is based on a DHT infrastructure and is designed to support recovery of data after a disaster by keeping regular snapshots of filesystems distributed off-site, on peers on the Internet. Where as conventional backup systems incur significant equipment costs, manual effort and high administrative overhead, we hope that a distributed backup system can alleviate these problems, making backups easy and feasible. By building this system on top of a DHT, the backup application inherits the properties of the DHT, and serves to evaluate the feasibility of using a DHT to build larg escale applications},
 	keywords = {backup, distributed hash table},
-	url = {http://doc.cat-v.org/plan_9/misc/venti-dhash/},
+	www_section = {http://doc.cat-v.org/plan_9/misc/venti-dhash/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.104.8086.pdf},
 	author = {Emil Sit and Josh Cates and Russ Cox}
 }
@@ -11091,7 +11114,7 @@ This paper presents the design and implementation of a cooperative off-site back
 	year = {2003},
 	pages = {84{\textendash}102},
 	abstract = {Decentralized anonymity infrastructures are still not in wide use today. While there are technical barriers to a secure robust design, our lack of understanding of the incentives to participate in such systems remains a major roadblock. Here we explore some reasons why anonymity systems are particularly hard to deploy, enumerate the incentives to participate either as senders or also as nodes, and build a general model to describe the effects of these incentives. We then describe and justify some simplifying assumptions to make the model manageable, and compare optimal strategies for participants based on a variety of scenarios},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.13.5636\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.13.5636\&rep=rep1\&type=pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.13.5636.pdf},
 	author = {Alessandro Acquisti and Roger Dingledine and Paul Syverson}
 }
@@ -11101,11 +11124,11 @@ This paper presents the design and implementation of a cooperative off-site back
 	year = {2003},
 	abstract = {Mobile ad-hoc networks rely on the cooperation of nodes for routing and forwarding. For individual nodes there are however several advantages resulting from noncooperation, the most obvious being power saving. Nodes that act selfishly or even maliciously pose a threat to availability in mobile ad-hoc networks. Several approaches have been proposed to detect noncooperative nodes. In this paper, we investigate the effect of using rumors with respect to the detection time of misbehaved nodes as well as the robustness of the reputation system against wrong accusations. We propose a Bayesian approach for reputation representation, updates, and view integration. We also present a mechanism to detect and exclude potential lies. The simulation results indicate that by using this Bayesian approach, the reputation system is robust against slander while still benefitting from the speed-up in detection time provided by the use of rumors},
 	keywords = {ad-hoc networks, reputation, robustness},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.9006},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.9006},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.13.9006_0.pdf},
 	author = {Sonja Buchegger and Jean-Yves Le Boudec}
 }
-@conference {2003,
+@conference {2003_1,
 	title = {The effect of rumor spreading in reputation systems for mobile ad-hoc networks},
 	booktitle = {Proceedings of WiOpt {\textquoteleft}03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks},
 	year = {2003},
@@ -11130,7 +11153,7 @@ This paper presents the design and implementation of a cooperative off-site back
 	keywords = {asymmetry, hierarchy, P2P, pass, peer-to-peer asymmetric file sharing system, peer-to-peer networking},
 	isbn = {0-7695-1872-9},
 	doi = {http://doi.ieeecomputersociety.org/10.1109/SAINT.2003.1183054},
-	url = {http://dl.acm.org/citation.cfm?id=827273.829221},
+	www_section = {http://dl.acm.org/citation.cfm?id=827273.829221},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SAINT\%2703\%20-\%20Kwon\%20\%26\%20Ryu.pdf},
 	author = {Kwon, Gisik and Ryu, Kyung D.}
 }
@@ -11148,7 +11171,7 @@ This paper presents the design and implementation of a cooperative off-site back
 	keywords = {distributed eigenvector computation, peer-to-peer networking, reputation},
 	isbn = {1-58113-680-3},
 	doi = {http://doi.acm.org/10.1145/775152.775242},
-	url = {http://doi.acm.org/10.1145/775152.775242},
+	www_section = {http://doi.acm.org/10.1145/775152.775242},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WWW\%2703\%20-\%20The\%20EigenTrust\%20algorithm.pdf},
 	author = {Kamvar, Sepandar D. and Schlosser, Mario T. and Hector Garcia-Molina}
 }
@@ -11164,11 +11187,11 @@ This paper presents the design and implementation of a cooperative off-site back
 	keywords = {key management, probabilistic key sharing, sensor networks},
 	isbn = {1-58113-738-9},
 	doi = {10.1145/948109.948119},
-	url = {http://portal.acm.org/citation.cfm?id=948119$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=948119$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ccs03-SNKeyMan.pdf},
 	author = {Liu, Donggang and Peng Ning}
 }
-@article {2003,
+@article {2003_2,
 	title = {The evolution of altruistic punishment},
 	journal = {Proceedings of the National Academy of Sciences of the USA},
 	volume = {100},
@@ -11195,7 +11218,7 @@ GNUnet aims to provide anonymity for its users.  Its design
 makes it hard to link a transaction to the node where it originated from.  While anonymity requirements make a global view of the end-points of a transaction infeasible, the local link-to-link messages can be fully authenticated.  Our economic model is based entirely on this local view of the network and takes only local
 decisions},
 	keywords = {anonymity, file-sharing, GNUnet},
-	url = {http://grothoff.org/christian/ebe.pdf},
+	www_section = {http://grothoff.org/christian/ebe.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ebe.pdf},
 	author = {Christian Grothoff}
 }
@@ -11204,11 +11227,11 @@ decisions},
 	year = {2003},
 	abstract = {The ext3cow file system, built on Linux{\textquoteright}s popular ext3 file system, brings snapshot functionality and file versioning to the open-source community. Our implementation of ext3cow has several desirable properties: ext3cow is implemented entirely in the file system and, therefore, does not modify kernel interfaces or change the operation of other file systems; ext3cow provides a time-shifting interface that permits access to data in the past without polluting the file system namespace; and, ext3cow creates versions of files on disk without copying data in memory. Experimental results show that the time-shifting functions of ext3cow do not degrade file system performance. Ext3cow performs comparably to ext3 on many file system benchmarks and trace driven experiments},
 	keywords = {file systems},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.2545},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.2545},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.10.2545.pdf},
 	author = {Zachary N. J. Peterson and Randal C. Burns}
 }
-@article {2003,
+@article {2003_3,
 	title = {Extremum Feedback with Partial Knowledge},
 	volume = {Volume 2816/2003},
 	year = {2003},
@@ -11217,11 +11240,11 @@ In this paper we analyze several extensions to the exponential feedback algorith
 	isbn = {978-3-540-20051-2},
 	issn = {0302-9743 },
 	doi = {10.1007/b13249},
-	url = {http://www.springerlink.com/content/bvelyaew4ukl4aau/},
+	www_section = {http://www.springerlink.com/content/bvelyaew4ukl4aau/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann03feedback.pdf},
 	author = {Thomas Fuhrmann and J{\"o}rg Widmer}
 }
-@conference {2003,
+@conference {2003_4,
 	title = {A game theoretic framework for incentives in P2P systems},
 	booktitle = {Proceedings of the 3rd International Conference on Peer-to-Peer Computing},
 	year = {2003},
@@ -11234,7 +11257,7 @@ In this paper we analyze several extensions to the exponential feedback algorith
 	keywords = {network, P2P, peer-to-peer networking, system performance},
 	isbn = {0-7695-2023-5 },
 	doi = { 10.1109/PTP.2003.1231503  },
-	url = { 10.1109/PTP.2003.1231503  },
+	www_section = { 10.1109/PTP.2003.1231503  },
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/P2P\%2703\%20-\%20Buragohain\%2C\%20Agrawal\%20\%26\%20Suri\%20-\%20Incentives\%20in\%20P2P\%20systems.pdf},
 	author = {Chiranjeeb Buragohain and Dvyakant Agrawal and Subhash Suri}
 }
@@ -11250,7 +11273,7 @@ In this paper we analyze several extensions to the exponential feedback algorith
 The main focus of this work is gap, a simple protocol for anonymous transfer of data which can achieve better anonymity guarantees than many traditional indirection schemes and is additionally more efficient.  gap is based on a new perspective on how to achieve anonymity.  Based on this new perspective it is possible to relax the requirements stated in traditional indirection
 schemes, allowing individual nodes to balance anonymity with efficiency according to their specific needs},
 	keywords = {anonymity, GNUnet, installation},
-	url = {http://grothoff.org/christian/aff.pdf},
+	www_section = {http://grothoff.org/christian/aff.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/aff.pdf},
 	author = {Krista Bennett and Christian Grothoff}
 }
@@ -11267,7 +11290,7 @@ We then show how to express existing mixes in the framework, and then suggest ot
 	keywords = {mix},
 	isbn = {978-3-540-20610-1},
 	doi = {10.1007/b94512},
-	url = {http://www.springerlink.com/content/jvuk0exyqxvcyhvy/},
+	www_section = {http://www.springerlink.com/content/jvuk0exyqxvcyhvy/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.3.9155.pdf},
 	author = {Claudia Diaz and Andrei Serjantov},
 	editor = {Roger Dingledine}
@@ -11284,7 +11307,7 @@ We then show how to express existing mixes in the framework, and then suggest ot
 	keywords = {anonymity, flooding attacks},
 	isbn = {1-58113-776-1},
 	doi = {10.1145/1005140.1005154},
-	url = {http://portal.acm.org/citation.cfm?id=1005154},
+	www_section = {http://portal.acm.org/citation.cfm?id=1005154},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/danezis-wpes2003.pdf},
 	author = {George Danezis and Len Sassaman}
 }
@@ -11297,7 +11320,7 @@ We then show how to express existing mixes in the framework, and then suggest ot
 	address = {Ithaca, NY},
 	abstract = {Anonymity is increasingly important for networked applications amidst concerns over censorship and privacy. In this paper, we describe Herbivore, a peer-to-peer, scalable, tamper-resilient communication system that provides provable anonymity and privacy. Building on dining cryptographer networks, Herbivore scales by partitioning the network into anonymizing cliques. Adversaries able to monitor all network traffic cannot deduce the identity of a sender or receiver beyond an anonymizing clique. In addition to strong anonymity, Herbivore simultaneously provides high efficiency and scalability, distinguishing it from other anonymous communication protocols. Performance measurements from a prototype implementation show that the system can achieve high bandwidths and low latencies when deployed over the Internet},
 	keywords = {anonymity, P2P, privacy},
-	url = {http://ecommons.cornell.edu/handle/1813/5606},
+	www_section = {http://ecommons.cornell.edu/handle/1813/5606},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/herbivore-tr.pdf},
 	author = {Goel, Sharad and Mark Robson and Milo Polte and Emin G{\"u}n Sirer}
 }
@@ -11313,7 +11336,7 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
 	keywords = {distributed hash table, P2P},
 	issn = {0190-3918},
 	doi = {10.1109/ICPP.2003.1240580},
-	url = {http://www.computer.org/portal/web/csdl/doi/10.1109/ICPP.2003.1240580},
+	www_section = {http://www.computer.org/portal/web/csdl/doi/10.1109/ICPP.2003.1240580},
 	author = {Zhiyong Xu and Rui Min and Yiming Hu}
 }
 @conference {Blake:2003:HAS:1251054.1251055,
@@ -11327,7 +11350,7 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
 	address = {Lihue, Hawaii, USA},
 	abstract = {Peer-to-peer storage aims to build large-scale, reliable and available storage from many small-scale unreliable, low-availability distributed hosts. Data redundancy is the key to any data guarantees. However, preserving redundancy in the face of highly dynamic membership is costly. We use a simple resource usage model to measured behavior from the Gnutella file-sharing network to argue that large-scale cooperative storage is limited by likely dynamics and cross-system bandwidth -- not by local disk space. We examine some bandwidth optimization strategies like delayed response to failures, admission control, and load-shifting and find that they do not alter the basic problem. We conclude that when redundancy, data scale, and dynamics are all high, the needed cross-system bandwidth is unreasonable},
 	keywords = {distributed hosts, dynamic peer network, peer-to-peer storage, redundancy},
-	url = {http://dl.acm.org/citation.cfm?id=1251054.1251055},
+	www_section = {http://dl.acm.org/citation.cfm?id=1251054.1251055},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/HotOS\%20IX\%20-\%20High\%20available\%2C\%20scalable\%20storage\%2C\%20dynamic\%20peer\%20networks.pdf},
 	author = {Blake, Charles and Rodrigues, Rodrigo}
 }
@@ -11361,7 +11384,7 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
 	keywords = {distributed hash table, flexibility, routing geometry},
 	isbn = {1-58113-735-4},
 	doi = {http://doi.acm.org/10.1145/863955.863998},
-	url = {http://doi.acm.org/10.1145/863955.863998},
+	www_section = {http://doi.acm.org/10.1145/863955.863998},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%2703\%20-\%20The\%20impact\%20of\%20DHT\%20routing\%20geometry\%20on\%20resilience\%20and\%20proximity.pdf},
 	author = {Krishna Phani Gummadi and Gummadi, Ramakrishna and Steven D. Gribble and Sylvia Paul Ratnasamy and S Shenker and Ion Stoica}
 }
@@ -11375,12 +11398,12 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
 	organization = {Springer-Verlag, LNCS 2760},
 	abstract = {Several di$\#$erent notations are used in the literature of MIX networks to describe the nested encrypted structures now widely known as "onions". The shortcomings of these notations are described and a new notation is proposed, that as well as having some advantages from a typographical point of view, is also far clearer to read and to reason about. The proposed notation generated a lively debate at the PET2003 workshop and the various views, and alternative proposals, are reported upon. The workshop participants did not reach any consensus on improving onion notation, but there is now a heightened awareness of the problems that can arise with existing representations},
 	keywords = {onion routing},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.5965},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.5965},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/clayton-pet2003.pdf},
 	author = {Richard Clayton},
 	editor = {Roger Dingledine}
 }
-@conference {2003,
+@conference {2003_5,
 	title = {Incentives build robustness in BitTorrent},
 	booktitle = {NetEcon{\textquoteright}03 - Proceedings of the Workshop on Economics of Peer-to-Peer Systems },
 	year = {2003},
@@ -11399,7 +11422,7 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
 	address = {Berkeley, California, USA},
 	abstract = {this paper, our contributions are to generalize from the traditional symmetric EPD to the asymmetric transactions of P2P applications, map out the design space of EPD-based incentive techniques, and simulate a subset of these techniques. Our findings are as follows: Incentive techniques relying on private history (where entites only use their private histories of entities{\textquoteright} actions) fail as the population size increases},
 	keywords = {P2P, privacy},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.1949},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.1949},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/incentives-for-cooperation-in_0.pdf},
 	author = {Kevin Lai and Michal Feldman and Ion Stoica and John Chuang}
 }
@@ -11413,11 +11436,11 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
 	address = {Washington D.C., USA},
 	abstract = {Informally, a communication protocol is sender k - anonymous if it can guarantee that an adversary, trying to determine the sender of a particular message, can only narrow down its search to a set of k suspects. Receiver k-anonymity places a similar guarantee on the receiver: an adversary, at best, can only narrow down the possible receivers to a set of size k. In this paper we introduce the notions of sender and receiver k-anonymity and consider their applications. We show that there exist simple and e$\#$cient protocols which are k-anonymous for both the sender and the receiver in a model where a polynomial time adversary can see all tra$\#$c in the network and can control up to a constant fraction of the participants. Our protocol is provably secure, practical, and does not require the existence of trusted third parties. This paper also provides a conceptually simple augmentation to Chaum{\textquoteright}s DC-Nets that adds robustness against adversaries who attempt to disrupt the protocol through perpetual transmission or selective non-participation},
 	isbn = {1-58113-738-9},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.9.9348\&rep=rep1\&type=url\&i=2},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.9.9348\&rep=rep1\&type=url\&i=2},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/k-anonymous_ccs2003.pdf},
 	author = {Luis von Ahn and Andrew Bortz and Nicholas J. Hopper}
 }
-@conference {2003,
+@conference {2003_6,
 	title = {KARMA: a Secure Economic Framework for P2P Resource Sharing},
 	booktitle = {P2PECON{\textquoteright}05. Proceedings of the 3rd Workshop on Economics of Peer-to-Peer Systems},
 	year = {2003},
@@ -11434,11 +11457,11 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
 	year = {2003},
 	abstract = {A peer-to-peer (p2p) distributed hash table (DHT) system allows hosts to join and fail silently (or leave), as well as to insert and retrieve files (objects). This paper explores a new point in design space in which increased memory usage and constant background communication overheads are tolerated to reduce file lookup times and increase stability to failures and churn. Our system, called Kelips, uses peer-to-peer gossip to partially replicate file index information. In Kelips, (a) under normal conditions, file lookups are resolved with O(1) time and complexity (i.e., independent of system size), and (b) membership changes (e.g., even when a large number of nodes fail) are detected and disseminated to the system quickly. Per-node memory requirements are small in medium-sized systems. When there are failures, lookup success is ensured through query rerouting. Kelips achieves load balancing comparable to existing systems. Locality is supported by using topologically aware gossip mechanisms. Initial results of an ongoing experimental study are also discussed},
 	keywords = {distributed hash table, P2P},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.3464},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.3464},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.13.3464.pdf},
 	author = {Indranil Gupta and Kenneth P. Birman and Prakash Linga and Alan Demers and Robbert Van Renesse}
 }
-@book {2003,
+@book {2003_7,
 	title = {Koorde: A Simple degree-optimal distributed hash table},
 	booktitle = {Peer-to-Peer Systems II},
 	series = {Lecture Notes in Computer Science},
@@ -11459,7 +11482,7 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
 	year = {2003},
 	abstract = {A P2P resource market is a market in which peers trade resources (including storage, bandwidth and CPU cycles) and services with each other. We propose a specific paradigm for a P2P resource market. This paradigm has five key components: (i) pairwise trading market, with peers setting their own prices for offered resources; (ii) multiple currency economy, in which any peer can issue its own currency; (iii) no legal recourse, thereby limiting the transaction costs in trades; (iv) a simple, secure application-layer protocol; and (v) entity identification based on the entity{\textquoteright}s unique public key. We argue that the paradigm can lead to a flourishing P2P resource market, allowing applications to tap into the huge pool of surplus peer resources. We illustrate the paradigm and its corresponding Lightweight Currency Protocol (LCP) with several application examples},
 	keywords = {P2P},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.1309},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.1309},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/LightweightParadigm.pdf},
 	author = {David A. Turner and Keith W. Ross}
 }
@@ -11489,7 +11512,7 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
 	keywords = {distributed hash table, Gnutella, P2P},
 	isbn = {1-58113-735-4},
 	doi = {10.1145/863955.864000},
-	url = {http://portal.acm.org/citation.cfm?id=864000$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=864000$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.10.5444.pdf},
 	author = {Chawathe, Yatin and Breslau, Lee and Lanham, Nick and S Shenker}
 }
@@ -11503,7 +11526,7 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
 	address = {Berkeley, CA, USA},
 	abstract = {Versioning file systems retain earlier versions of modified files, allowing recovery from user mistakes or system corruption. Unfortunately, conventional versioning systems do not efficiently record large numbers of versions. In particular, versioned metadata can consume as much space as versioned data. This paper examines two space-efficient metadata structures for versioning file systems and describes their integration into the Comprehensive Versioning File System (CVFS), which keeps all versions of all files. Journal-based metadata encodes each metadata version into a single journal entry; CVFS uses this structure for inodes and indirect blocks, reducing the associated space requirements by 80\%. Multiversion b-trees extend each entrys key with a timestamp and keep current and historical entries in a single tree; CVFS uses this structure for directories, reducing the associated space requirements by 99\%. Similar space reductions are predicted via trace analysis for other versioning strategies (e.g., on-close versioning). Experiments with CVFS verify that its current-version performance is sim-ilar to that of non-versioning file systems while reducing overall space needed for history data by a factor of two. Although access to historical versions is slower than con-ventional versioning systems, checkpointing is shown to mitigate and bound this effect},
 	keywords = {file systems},
-	url = {http://portal.acm.org/citation.cfm?id=1090694.1090700$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1090694.1090700$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fast03.pdf},
 	author = {Soules, Craig A. N. and Goodson, Garth R. and Strunk, John D. and Ganger, Gregory R.}
 }
@@ -11540,7 +11563,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
 	year = {2003},
 	pages = {2{\textendash}15},
 	abstract = {We present Mixminion, a message-based anonymous remailer protocol with secure single-use reply blocks. Mix nodes cannot distinguish Mixminion forward messages from reply messages, so forward and reply messages share the same anonymity set. We add directory servers that allow users to learn public keys and performance statistics of participating remailers, and we describe nymservers that provide long-term pseudonyms using single-use reply blocks as a primitive. Our design integrates link encryption between remailers to provide forward anonymity. Mixminion works in a real-world Internet environment, requires little synchronization or coordination between nodes, and protects against known anonymity-breaking attacks as well as or better than other systems with similar design parameters. 1. Overview Chaum first introduced anonymous remailers over 20 years ago [7]},
-	url = { http://mixminion.net/minion-design.pdf},
+	www_section = { http://mixminion.net/minion-design.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/minion-design.pdf},
 	author = {George Danezis and Roger Dingledine and Nick Mathewson}
 }
@@ -11554,7 +11577,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
 	organization = {Springer-Verlag, LNCS 2760},
 	abstract = {We present a mix network topology that is based on sparse expander graphs, with each mix only communicating with a few neighbouring others. We analyse the anonymity such networks provide, and compare it with fully connected mix networks and mix cascades. We prove that such a topology is e$\#$cient since it only requires the route length of messages to be relatively small in comparison with the number of mixes to achieve maximal anonymity. Additionally mixes can resist intersection attacks while their batch size, that is directly linked to the latency of the network, remains constant. A worked example of a network is also presented to illustrate how these results can be applied to create secure mix networks in practise},
 	keywords = {anonymity, mix cascades, traffic analysis},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.1188},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.1188},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/danezis-pet2003.pdf},
 	author = {George Danezis},
 	editor = {Roger Dingledine}
@@ -11571,7 +11594,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
 	keywords = {anonymity, unlinkability},
 	isbn = {978-3-540-20610-1},
 	doi = {10.1007/b94512},
-	url = {http://www.springerlink.com/content/dxteg659uf2jtdd7/},
+	www_section = {http://www.springerlink.com/content/dxteg659uf2jtdd7/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/steinbrecher-pet2003.pdf},
 	author = {Sandra Steinbrecher and Stefan K{\"o}psell},
 	editor = {Roger Dingledine}
@@ -11588,7 +11611,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
 	keywords = {distributed hash table, multi-dimensional range queries, range queries},
 	isbn = {1-58113-707-9},
 	doi = {10.1145/958491.958500},
-	url = {http://doi.acm.org/10.1145/958491.958500},
+	www_section = {http://doi.acm.org/10.1145/958491.958500},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/eScholarship\%20UC\%20item\%204x6723n2.pdf},
 	author = {Li, Xin and Kim, Young Jin and Govindan, Ramesh and Hong, Wei}
 }
@@ -11600,7 +11623,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
 	keywords = {flexible service platforms, programmable networks},
 	isbn = {978-3-540-21250-8},
 	doi = {10.1007/b96396},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.3301},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.3301},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/scholler03language.pdf},
 	author = {Michael Conrad and Marcus Schoeller and Thomas Fuhrmann and Gerhard Bocksch and Martina Zitterbart}
 }
@@ -11612,7 +11635,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
 	abstract = {We present nesC, a programming language for networked embedded systems that represent a new design space for application developers. An example of a networked embedded system is a sensor network, which consists of (potentially) thousands of tiny, low-power "motes," each of which execute concurrent, reactive programs that must operate with severe memory and power constraints.nesC{\textquoteright}s contribution is to support the special needs of this domain by exposing a programming model that incorporates event-driven execution, a flexible concurrency model, and component-oriented application design. Restrictions on the programming model allow the nesC compiler to perform whole-program analyses, including data-race detection (which improves reliability) and aggressive function inlining (which reduces resource consumption).nesC has been used to implement TinyOS, a small operating system for sensor networks, as well as several significant sensor applications. nesC and TinyOS have been adopted by a large number of sensor network research groups, and our experience and evaluation of the language shows that it is effective at supporting the complex, concurrent programming style demanded by this new class of deeply networked systems},
 	keywords = {data races, nesC, TinyOS},
 	doi = {10.1145/781131.781133},
-	url = {http://portal.acm.org/citation.cfm?id=781133},
+	www_section = {http://portal.acm.org/citation.cfm?id=781133},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.127.9488.pdf},
 	author = {David Gay and Matt Welsh and Philip Levis and Eric Brewer and Robert Von Behren and Culler, David}
 }
@@ -11620,7 +11643,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
 	title = {Network Services for the Support of Very-Low-Resource Devices},
 	year = {2003},
 	abstract = {Visions of future computing scenarios envisage a multitude of very-low-resource devices linked by power-efficient wireless communication means. This paper presents our vision of such a scenario. From this vision requirements are derived for an infrastructure that is able to satisfy the largely differing needs of these devices. The paper also shows how innovative, collaborating applications between distributed sensors and actuators can arise from such an infrastructure. The realization of such innovative applications is illustrated with two examples of straightforward services that have been implemented with the AMnet infrastructure that is currently being developed in the FlexiNet project. Additionally, first performance measurements for one of these services are given. Index terms {\textemdash} Bluetooth, Programmable networks, Sensoractuator networks},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.186},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.186},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ASWN2003.pdf},
 	author = {Thomas Fuhrmann and Till Harbaum and Martina Zitterbart}
 }
@@ -11632,7 +11655,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
 	publisher = {ACM Press},
 	organization = {ACM Press},
 	abstract = {This paper presents new methods enabling anonymous communication on the Internet. We describe a new protocol that allows us to create an anonymous overlay network by exploiting the web browsing activities of regular users. We show that the overlay network provides an anonymity set greater than the set of senders and receivers in a realistic threat model. In particular, the protocol provides unobservability in our threat model},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.4.6246\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.4.6246\&rep=rep1\&type=pdf},
 	author = {Matthias Bauer}
 }
 @conference {bauer:wpes2003,
@@ -11647,21 +11670,21 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
 	keywords = {anonymity, convert channel, HTTP},
 	isbn = {1-58113-776-1},
 	doi = {10.1145/1005140.1005152},
-	url = {http://portal.acm.org/citation.cfm?id=1005152},
+	www_section = {http://portal.acm.org/citation.cfm?id=1005152},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.4.6246.pdf},
 	author = {Matthias Bauer}
 }
 @booklet {Klinedinst_anew,
 	title = {A New Generation of File Sharing Tools},
 	year = {2003},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.4.1694\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.4.1694\&rep=rep1\&type=pdf},
 	author = {Dan Klinedinst}
 }
 @booklet {Fuhrmann_anode,
 	title = {A Node Evaluation Mechanism for Service Setup in},
 	year = {2003},
 	abstract = {AMnet is a programmable network that aims at the flexible and rapid creation of services within an IP network. Examples for typical services include network layer enhancements e.g. for multicast and mobility, transport layer enhancements e.g. to integrate wireless LANs, and various application layer services e.g. for media transcoding and content distribution. AMnet is based on regular Linux boxes that run an execution environment (EE), a resource monitor, and a basic signaling-engine. These so-called active nodes run the services and provide support for resource-management and module-relocation. Services are created by service modules, small pieces of code, that are executed within the EE. Based on the standard netfilter mechanism of Linux, service modules have full access to the network traffic passing through the active node. This paper describes the evaluation mechanism for service setup in AMnet. In order to determine where a service module can be started, service modules are accompanied by evaluation modules. This allows service module authors to implement various customized strategies for node-selection and service setup. Examples that are supported by the AMnet evaluation mechanism are a) service setup at a fixed position, e.g. as gateway, b) along a fixed path (with variable position along that path), c) at variable positions inside the network with preferences for certain constellations, or d) at an unspecified position, e.g. for modification of multicasted traffic. The required path information is gathered by the AMnodes present in the network. By interaction with the resource monitors of the AMnodes and the service module repository of the respective administrative domain, the AMnet evaluation also ensures overall system security and stability},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.8749},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.8749},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann03evaluation.pdf},
 	author = {Thomas Fuhrmann and Marcus Schoeller and Christina Schmidt and Martina Zitterbart}
 }
@@ -11672,7 +11695,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
 	pages = {127{\textendash}140},
 	abstract = {Motivated by the prospect of readily available Content Addressable Storage (CAS), we introduce the concept of file recipes. A file{\textquoteright}s recipe is a first-class file system object listing content hashes that describe the data blocks composing the file. File recipes provide applications with instructions for reconstructing the original file from available CAS data blocks. We describe one such application of recipes, the CASPER distributed file system. A CASPER client opportunistically fetches blocks from nearby CAS providers to improve its performance when the connection to a file server traverses a low-bandwidth path. We use measurements of our prototype to evaluate its performance under varying network conditions. Our results demonstrate significant improvements in execution times of applications that use a network file system. We conclude by describing fuzzy block matching, a promising technique for using approximately matching blocks on CAS providers to reconstitute the exact desired contents of a file at a client},
 	keywords = {file systems, storage},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.740},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.740},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/casper-usenix2003.pdf},
 	author = {Niraj Tolia and Michael Kozuch and Satyanarayanan, Mahadev and Brad Karp and Thomas Bressoud and Adrian Perrig}
 }
@@ -11687,7 +11710,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
 	abstract = {SRS is a widely used system for integrating biologicaldatabases. Currently, SRS relies only on locally providedcopies of these databases. In this paper we propose a mechanism that also allows the seamless integration of remotedatabases. To this end, our proposed mechanism splits theexisting SRS functionality into two components and addsa third component that enables us to employ peer-to-peercomputing techniques to create optimized overlay-networkswithin which database queries can efficiently be routed. Asan additional benefit, this mechanism also reduces the administration effort that would be needed with a conventionalapproach using replicated databases},
 	keywords = {overlay networks, P2P, SRS},
 	isbn = {0-7695-1919-9},
-	url = {http://portal.acm.org/citation.cfm?id=792493$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=792493$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann03overlaySRS.pdf},
 	author = {Thomas Fuhrmann and Andrea Schafferhans and Etzold, Thure}
 }
@@ -11703,7 +11726,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
 	keywords = {anonymity},
 	isbn = {978-3-540-20300-1},
 	doi = {10.1007/b13237},
-	url = {http://www.springerlink.com/content/8jva7vy8tkert9ur/},
+	www_section = {http://www.springerlink.com/content/8jva7vy8tkert9ur/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.5.2005.pdf},
 	author = {Andrei Serjantov and Peter Sewell}
 }
@@ -11712,7 +11735,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
 	year = {2003},
 	abstract = {FlashBack is a peer-to-peer backup algorithm designed for powerconstrained devices running in a personal area network (PAN). Backups are performed transparently as local updates initiate the spread of backup data among a subset of the currently available peers. Flashback limits power usage by avoiding flooding and keeping small neighbor sets. Flashback has also been designed to utilize powered infrastructure when possible to further extend device lifetime. We propose our architecture and algorithms, and present initial experimental results that illustrate FlashBack{\textquoteright}s performance characteristics},
 	keywords = {backup, P2P, personal area network},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.7820},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.7820},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/052820031647_102.pdf},
 	author = {Boon Thau Loo and Anthony LaMarca and Gaetano Borriello and Boon Thau Loo}
 }
@@ -11721,7 +11744,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
 	year = {2003},
 	abstract = {this paper was supported in part by the National Competence Center in Research on Mobile Information and Communication Systems (NCCR-MICS), a center supported by the Swiss National Science Foundation under grant number 5005-67322 and by SNSF grant 2100064994, "Peer-to-Peer Information Systems." messages. From the responses it (randomly) selects certain peers to which direct network links are established},
 	keywords = {P2P},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.5649},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.5649},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.3.5649.pdf},
 	author = {Karl Aberer and Philippe Cudre-Mauroux and Anwitaman Datta and Zoran Despotovic and Manfred Hauswirth and Magdalena Punceva and Roman Schmidt}
 }
@@ -11733,7 +11756,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
 	organization = {IEEE Press},
 	address = {Seattle, Washington},
 	abstract = {PlanetP is a peer-to-peer system in which searching content is done mostly locally. Every peer knows which content is available at which other peers. The index information is represented compactly using bloom filters and distributed throughout the network using push and pull mechanisms },
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.14.6056\&rep=rep1\&type=url\&i=0},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.14.6056\&rep=rep1\&type=url\&i=0},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/paper.dvi_.pdf},
 	author = {Francisco Matias Cuenca-Acuna and Christopher Peery and Richard P. Martin and Thu D. Nguyen}
 }
@@ -11763,7 +11786,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
 	abstract = {Designing mix-networks for low-latency applicationsthat offer acceptable performance and provide good resistanceagainst attacks without introducing too much over-headis very difficult. Good performance and small over-headsare vital to attract users and to be able to supportmany of them, because with only a few users, there is noanonymity at all. In this paper, we analyze how well differentkinds of mix-networks are suited to provide practicalanonymity for a very large number of users},
 	keywords = {performance},
 	isbn = {0-7695-1963-6},
-	url = {http://portal.acm.org/citation.cfm?id=938984.939808},
+	www_section = {http://portal.acm.org/citation.cfm?id=938984.939808},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/RP03-1.pdf},
 	author = {Marc Rennhard and Bernhard Plattner}
 }
@@ -11775,7 +11798,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
 	publisher = {University of Tennessee},
 	abstract = {This paper has been submitted for publication. Please see the above URL for current publication status. As peer-to-peer and widely distributed storage systems proliferate, the need to perform efficient erasure coding, instead of replication, is crucial to performance and efficiency. Low-Density Parity-Check (LDPC) codes have arisen as alternatives to standard erasure codes, such as Reed-Solomon codes, trading off vastly improved decoding performance for inefficiencies in the amount of data that must be acquired to perform decoding. The scores of papers written on LDPC codes typically analyze their collective and asymptotic behavior. Unfortunately, their practical application requires the generation and analysis of individual codes for finite systems. This paper attempts to illuminate the practical considerations of LDPC codes for peer-to-peer and distributed storage systems. The three main types of LDPC codes are detailed, and a huge variety of codes are generated, then analyzed using simulation. This analysis focuses on the performance of individual codes for finite systems, and addresses several important heretofore unanswered questions about employing LDPC codes in real-world systems. This material is based upon work supported by the National},
 	keywords = {distributed hash table, distributed storage, LDPC, P2P},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.5709},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.5709},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ut-cs-03-510.pdf},
 	author = {James S. Plank and Michael G. Thomason}
 }
@@ -11790,7 +11813,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
 	keywords = {public key cryptography},
 	isbn = {978-3-540-40674-7},
 	doi = {10.1007/b11817},
-	url = {http://www.springerlink.com/content/wjbh5579hdfd66ed/},
+	www_section = {http://www.springerlink.com/content/wjbh5579hdfd66ed/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/camenisch2003pve.pdf},
 	author = {Jan Camenisch and Victor Shoup}
 }
@@ -11805,7 +11828,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
 	abstract = {The goal of anonymity providing techniques is to preserve the privacy of users, who has communicated with whom, for how long, and from which location, by hiding traffic information. This is accomplished by organizing additional traffic to conceal particular communication relationships and by embedding the sender and receiver of a message in their respective anonymity sets. If the number of overall participants is greater than the size of the anonymity set and if the anonymity set changes with time due to unsynchronized participants, then the anonymity technique becomes prone to traffic analysis attacks. In this paper, we are interested in the statistical properties of the disclosure attack, a newly suggested traffic analysis attack on the MIXes. Our goal is to provide analytical estimates of the number of observations required by the disclosure attack and to identify fundamental (but avoidable) {\textquoteleft}weak operational modes{\textquoteright} of the MIXes and thus to protect users against a traffic analysis by the disclosure attack},
 	keywords = {anonymity measurement, mix, traffic analysis},
 	isbn = {0-7695-1940-7},
-	url = {http://portal.acm.org/citation.cfm?id=829515.830557},
+	www_section = {http://portal.acm.org/citation.cfm?id=829515.830557},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/agrawal03.pdf},
 	author = {Dakshi Agrawal and Dogan Kesdogan and Stefan Penz}
 }
@@ -11819,7 +11842,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
 	abstract = {Mix chains as proposed by Chaum allow sending untraceable electronic e-mail without requiring trust in a single authority: messages are recursively public-key encrypted to multiple intermediates (mixes), each of which forwards the message after removing one layer of encryption. To conceal as much information as possible when using variable (source routed) chains, all messages passed to mixes should be of the same length; thus, message length should not decrease when a mix transforms an input message into the corresponding output message directed at the next mix in the chain. Chaum described an implementation
 for such length-preserving mixes, but it is not secure against active attacks. We show how to build practical cryptographically secure lengthpreserving mixes. The conventional denition of security against chosen ciphertext attacks is not applicable to length-preserving mixes; we give an appropriate denition and show that our construction achieves provable security},
 	keywords = {mix chain, public key cryptography},
-	url = {http://eprints.kfupm.edu.sa/59837/},
+	www_section = {http://eprints.kfupm.edu.sa/59837/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BM-mixencrypt.pdf},
 	author = {Bodo M{\"o}ller}
 }
@@ -11857,7 +11880,7 @@ for such length-preserving mixes, but it is not secure against active attacks. W
 	organization = {VLDB Endowment},
 	keywords = {distributed hash table, PIER, range queries},
 	isbn = {0-12-722442-4},
-	url = {http://dl.acm.org/citation.cfm?id=1315451.1315480},
+	www_section = {http://dl.acm.org/citation.cfm?id=1315451.1315480},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/vldb03-pier.pdf},
 	author = {Huebsch, Ryan and Hellerstein, Joseph M. and Lanham, Nick and Boon Thau Loo and S Shenker and Ion Stoica}
 }
@@ -11866,7 +11889,7 @@ for such length-preserving mixes, but it is not secure against active attacks. W
 	year = {2003},
 	abstract = {Distributed Hash Tables (DHTs) are scalable peer-to-peer systems that support exact match lookups. This paper describes the construction and use of a Prefix Hash Tree (PHT) {\textendash} a distributed data structure that supports range queries over DHTs. PHTs use the hash-table interface of DHTs to construct a search tree that is efficient (insertions/lookups take \#\#\#\#\# \#\#\# \#\#\#\# DHT lookups, where D is the data domain being indexed) and robust (the failure of any given node in the search tree does not affect the availability of data stored at other nodes in the PHT)},
 	keywords = {distributed hash table, P2P, queries, range},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.243},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.243},
 	author = {Ratnasamy, Sylvia and Hellerstein, Joseph M. and S Shenker}
 }
 @conference {GKK03,
@@ -11882,7 +11905,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	keywords = {electronic voting, Markov chain, path coupling, randomized partial checking, rapid mixing},
 	isbn = {978-3-540-20300-1},
 	doi = {10.1007/b13237},
-	url = {http://www.springerlink.com/content/5gmj68nn4x1xc4j1/},
+	www_section = {http://www.springerlink.com/content/5gmj68nn4x1xc4j1/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/GKK03.pdf},
 	author = {Marcin Gomulkiewicz and Marek Klonowski and Miroslaw Kutylowski}
 }
@@ -11915,7 +11938,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	keywords = {anonymity, PGP, privacy, public key cryptography},
 	isbn = {1-58113-738-9},
 	doi = {10.1145/948109.948127},
-	url = {http://portal.acm.org/citation.cfm?id=948127},
+	www_section = {http://portal.acm.org/citation.cfm?id=948127},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/incomparable-pkeys.pdf},
 	author = {Waters, Brent and Edward W. Felten and Amit Sahai},
 	editor = {Vijay Atluri and Peng Liu}
@@ -11927,7 +11950,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	month = {June},
 	abstract = {Decentralized anonymity systems tend to be unreliable, because users must choose nodes in the network without knowing the entire state of the network. Reputation systems promise to improve reliability by predicting network state. In this paper we focus on anonymous remailers and anonymous publishing, explain why the systems can benefit from reputation, and describe our experiences designing reputation systems for them while still ensuring anonymity. We find that in each example we first must redesign the underlying anonymity system to support verifiable transactions},
 	keywords = {anonymity, anonymous publishing, remailer, reputation},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.4740},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.4740},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/rep-anon.pdf},
 	author = {Roger Dingledine and Nick Mathewson and Paul Syverson}
 }
@@ -11937,7 +11960,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	year = {2003},
 	abstract = {Decentralized anonymity systems tend to be unreliable, because users must choose nodes in the network without knowing the entire state of the network. Reputation systems promise to improve reliability by predicting network state. In this paper we focus on anonymous remailers and anonymous publishing, explain why the systems can benefit from reputation, and describe our experiences designing reputation systems for them while still ensuring anonymity. We find that in each example we first must redesign the underlying anonymity system to support verifiable transactions},
 	keywords = {anonymity, P2P, redundancy, remailer},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.4740},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.4740},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.14.4740.pdf},
 	author = {Roger Dingledine and Nick Mathewson and Paul Syverson}
 }
@@ -11954,7 +11977,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	abstract = {We consider the problem of distributing "live" streaming media content to a potentially large and highly dynamic population of hosts. Peer-to-peer content distribution is attractive in this setting because the bandwidth available to serve content scales with demand. A key challenge, however, is making content distribution robust to peer transience. Our approach to providing robustness is to introduce redundancy, both in network paths and in data. We use multiple, diverse distribution trees to provide redundancy in network paths and multiple description coding (MDC) to provide redundancy in data.We present a simple tree management algorithm that provides the necessary path diversity and describe an adaptation framework for MDC based on scalable receiver feedback. We evaluate these using MDC applied to real video data coupled with real usage traces from a major news site that experienced a large flash crowd for live streaming content. Our results show very significant benefits in using multiple distribution trees and MDC, with a 22 dB improvement in PSNR in some cases},
 	keywords = {distribution trees, mdc, media content, multiple description coding, peer-to-peer streaming},
 	isbn = {0-7695-2024-3},
-	url = {http://dl.acm.org/citation.cfm?id=951950.952204},
+	www_section = {http://dl.acm.org/citation.cfm?id=951950.952204},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ICNP\%2703\%20-\%20Resilient\%20peer-to-peer\%20streaming.pdf},
 	author = {Venkata N. Padmanabhan and Wang, Helen J. and Chou, Philip A.}
 }
@@ -11964,7 +11987,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	year = {2003},
 	abstract = {Active and programmable networks have been subject to intensive and successful research activities during the last couple of years. Many ideas and concepts have been pursued. However, only a few prototype implementations that have been developed so far, can deal with different applications in a larger scale setting. Moreover, detailed performance analyses of such prototypes are greatly missing today. Therefore, this paper does not present yet another architecture for active and programmable networks. In contrast, it rather focuses on the performance evaluation of the so-called AMnet approach that has already been presented previously [1]. As such, the paper demonstrates that an operational high-performance programmable network system with AAA (authentication, authorization, and accounting) security functionality will in fact be feasible in the near future},
 	keywords = {programmable networks},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.3074},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.3074},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann03performance.pdf},
 	author = {Thomas Fuhrmann and Till Harbaum and Panos Kassianidis and Marcus Schoeller and Martina Zitterbart}
 }
@@ -11980,11 +12003,11 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	keywords = {anonymity, privacy, return address},
 	isbn = {1-58113-776-1},
 	doi = {10.1145/1005140.1005155},
-	url = {http://portal.acm.org/citation.cfm?id=1005155},
+	www_section = {http://portal.acm.org/citation.cfm?id=1005155},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/reusable-channels-wpes2003.pdf},
 	author = {Philippe Golle and Jakobsson, Markus}
 }
-@conference {2003,
+@conference {2003_8,
 	title = {Revealing Information While Preserving Privacy},
 	booktitle = {Proceedings of the Twenty-second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems},
 	year = {2003},
@@ -11995,7 +12018,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	keywords = {data reconstruction, integrity and security, subset-sums with noise},
 	isbn = {1-58113-670-6},
 	doi = {10.1145/773153.773173},
-	url = {http://doi.acm.org/10.1145/773153.773173},
+	www_section = {http://doi.acm.org/10.1145/773153.773173},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/RevelaingInformation2003Dinur.pdf},
 	author = {Dinur, Irit and Nissim, Kobbi}
 }
@@ -12010,11 +12033,11 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	address = {Bolton Landing, NY, USA},
 	abstract = {Peer-to-peer storage systems assume that their users consume resources in proportion to their contribution. Unfortunately, users are unlikely to do this without some enforcement mechanism. Prior solutions to this problem require centralized infrastructure, constraints on data placement, or ongoing administrative costs. All of these run counter to the design philosophy of peer-to-peer systems. requiring trusted third parties, symmetric storage relationships, monetary payment, or certified identities. Each peer that requests storage of another must agree to hold a claim in return---a placeholder that accounts for available space. After an exchange, each partner checks the other to ensure faithfulness. Samsara punishes unresponsive nodes probabilistically. Because objects are replicated, nodes with transient failures are unlikely to suffer data loss, unlike those that are dishonest or chronically unavailable. Claim storage overhead can be reduced when necessary by forwarding among chains of nodes, and eliminated when cycles are created. Forwarding chains increase the risk of exposure to failure, but such risk is modest under reasonable assumptions of utilization and simultaneous, persistent failure},
 	keywords = {P2P, reputation},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.6734},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.6734},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p135-cox.pdf},
 	author = {Landon P. Cox and Brian D. Noble}
 }
-@conference {2003,
+@conference {2003_9,
 	title = {Scalable Application-level Anycast for Highly Dynamic Groups},
 	booktitle = {NGC{\textquoteright}03 Networked Group Communication, Fifth International COST264 Workshop},
 	series = {Lecture Notes in Computer Science, 2003},
@@ -12044,7 +12067,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	keywords = {security policy, trade-off},
 	issn = {1089-7801},
 	doi = {10.1109/MIC.2003.1200305},
-	url = {http://portal.acm.org/citation.cfm?id=776703$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=776703$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IEEE-IC-SecurityPerformance-May-2003.pdf},
 	author = {Menasc{\'e}, Daniel}
 }
@@ -12062,7 +12085,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	keywords = {game theory, optimization, overlay, relaxation, selfish routing, traffic engineering, traffic equilibrium},
 	isbn = {1-58113-735-4},
 	doi = {http://doi.acm.org/10.1145/863955.863974},
-	url = {http://doi.acm.org/10.1145/863955.863974},
+	www_section = {http://doi.acm.org/10.1145/863955.863974},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%2703\%20-\%20On\%20selfish\%20routing\%20in\%20internet-like\%20environments.pdf},
 	author = {Lili Qiu and Yang, Yang Richard and Zhang, Yin and S Shenker}
 }
@@ -12080,7 +12103,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	keywords = {ad-hoc networks, key authentication, PGP, public key cryptography, self-organization},
 	issn = {1536-1233},
 	doi = {10.1109/TMC.2003.1195151},
-	url = {http://portal.acm.org/citation.cfm?id=766655.766661$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=766655.766661$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.6.1545.pdf}
 }
 @conference {Naor03asimple,
@@ -12091,7 +12114,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	abstract = {We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of   and is robust under random deletion of nodes. The second has parallel time of   and message complexity of   . It is robust under spam induced by a random subset of the nodes. We then show a construction which is fault tolerant against random deletions and has an optimal degree-dilation tradeoff. The construction has improved parameters when compared to other DHTs. Its main merits are its simplicity, its flexibility and the fresh ideas introduced in its design. It is very easy to modify and to add more sophisticated protocols, such as dynamic caching and erasure correcting codes},
 	keywords = {distributed hash table, fault-tolerance},
 	doi = {10.1007/b11823},
-	url = {http://www.springerlink.com/content/4e756fgyq4ff4kay/},
+	www_section = {http://www.springerlink.com/content/4e756fgyq4ff4kay/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.12.3388.pdf},
 	author = {Moni Naor and Udi Wieder}
 }
@@ -12105,7 +12128,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	organization = {USENIX Association},
 	address = {Berkeley, CA, USA},
 	keywords = {distributed hash table, range queries, SkipNet},
-	url = {http://dl.acm.org/citation.cfm?id=1251460.1251469},
+	www_section = {http://dl.acm.org/citation.cfm?id=1251460.1251469},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/harvey.pdf},
 	author = {Harvey, Nicholas J. A. and Michael B. Jones and Stefan Saroiu and Marvin Theimer and Wolman, Alec}
 }
@@ -12118,7 +12141,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	publisher = {Springer Berlin / Heidelberg},
 	abstract = {We are building Coral, a peer-to-peer content distribution system. Coral creates self-organizing clusters of nodes that fetch information from each other to avoid communicating with more distant or heavily-loaded servers. Coral indexes data, but does not store it. The actual content resides where it is used, such as in nodes{\textquoteright} local web caches. Thus, replication happens exactly in proportion to demand},
 	isbn = {978-3-540-40724-9},
-	url = {www.coralcdn.org/docs/coral-iptps03.ps},
+	www_section = {www.coralcdn.org/docs/coral-iptps03.ps},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/coral-iptps03.pdf},
 	author = {Michael J. Freedman and David Mazi{\`e}res}
 }
@@ -12127,7 +12150,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	year = {2003},
 	abstract = {Establishing peer-to-peer (P2P) file sharing for mobile ad hoc networks ANET) requires the construction of a search algorithm for transmitting queries and search results as well as the development of a transfer protocol for downloading files matching a query. In this paper, we present a special-purpose system for searching and file transfer tailored to both the characteristics of MANET and the requirements of peer-to-peer file sharing. Our approach is based on an application layer overlay networlc As innovative feature, overlay routes are set up on demand by the search algorithm, closely matching network topology and transparently aggregating redundant transfer paths on a per-file basis. The transfer protocol guarantees high data rates and low transmission overhead by utilizing overlay routes. In a detailed ns2 simulation study, we show that both the search algorithm and the transfer protocol outperform offthe -shelf approaches based on a P2P file sharing system for the wireline Internet, TCP and a MANET routing protocol},
 	keywords = {ad-hoc networks, file-sharing, P2P},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.9634},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.9634},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/VTC03.pdf},
 	author = {Alexander Klemm and Er Klemm and Christoph Lindemann and Oliver Waldhorst}
 }
@@ -12144,7 +12167,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	keywords = {application-level multicast, content distribution, end-system multicast, peer-to-peer networking, video streaming},
 	issn = {0163-5980},
 	doi = {http://doi.acm.org/10.1145/1165389.945474},
-	url = {http://doi.acm.org/10.1145/1165389.945474},
+	www_section = {http://doi.acm.org/10.1145/1165389.945474},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGOSP\%2703\%20-\%20Spitstream\%3A\%20High-bandwidth\%20multicast.pdf},
 	author = {Miguel Castro and Peter Druschel and Anne-Marie Kermarrec and Nandi, Animesh and Antony Rowstron and Singh, Atul}
 }
@@ -12159,7 +12182,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	address = {Athens},
 	abstract = {An improvement over the previously known disclosure attack is presented that allows, using statistical methods, to effectively deanonymize users of a mix system. Furthermore the statistical disclosure attack is computationally efficient, and the conditions for it to be possible and accurate are much better understood. The new attack can be generalized easily to a variety of anonymity systems beyond mix networks},
 	keywords = {anonymity, statistical analysis, traffic analysis},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.4512},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.4512},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/statistical-disclosure.pdf},
 	author = {George Danezis}
 }
@@ -12176,7 +12199,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	keywords = {ad-hoc networks, cooperation, self-organization},
 	issn = {1383-469X},
 	doi = {10.1023/A:1025146013151 },
-	url = {http://portal.acm.org/citation.cfm?id=942421$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=942421$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ButtyanH03monet.pdf},
 	author = {Levente Butty{\'a}n and Jean-Pierre Hubaux}
 }
@@ -12185,7 +12208,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	year = {2003},
 	abstract = {Network protocols suffer from a lock dictated by the need for standardization and Metcalf{\textquoteright}s law. Programmable middleboxes can help to relieve the effects of that lock. This paper gives game theoretic arguments that show how the option of having middleboxes can raise the quality of communication protocols. Based on this analysis, design considerations for active and programmable networks are discussed},
 	keywords = {programmable networks},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.7171},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.7171},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann03strategy.pdf},
 	author = {Thomas Fuhrmann}
 }
@@ -12200,7 +12223,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	abstract = {Formation of suitable overlay-network topologiesthat are able to reflect the structure of the underlying network-infrastructure, has rarely been addressedby peer-to-peer applications so far. Often, peer-to-peerprotocols restrain to purely random formation of theiroverlay-network. This leads to a far from optimal performance of such peer-to-peer networks and ruthlesslywastes network resources.In this paper, we describe a simple mechanism thatuses programmable network technologies to improvethe topology formation process of unstructured peer-to-peer networks. Being a network service, our mechanismdoes not require any modification of existing applications or computing systems. By that, it assists networkoperators with improving the performance of their network and relieves programmers from the burden of designing and implementing topology-aware peer-to-peerprotocols.Although we use the well-know Gnutella protocol todescribe the mechanism of our proposed service, it applies to all kinds of unstructured global peer-to-peercomputing applications},
 	keywords = {overlay networks, programmable networks, topology matching},
 	isbn = {0-7695-1919-9},
-	url = {http://portal.acm.org/citation.cfm?id=791231.792432$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=791231.792432$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann03supportingP2P.pdf},
 	author = {Thomas Fuhrmann}
 }
@@ -12214,7 +12237,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	address = {Berkeley, CA, USA},
 	abstract = {We present Symphony, a novel protocol for maintaining distributed hash tables in a wide area network. The key idea is to arrange all participants along a ring and equip them with long distance contacts drawn from a family of harmonic distributions. Through simulation, we demonstrate that our construction is scalable, flexible, stable in the presence of frequent updates and offers small average latency with only a handful of long distance links per node. The cost of updates when hosts join and leave is small},
 	keywords = {small-world},
-	url = {http://portal.acm.org/citation.cfm?id=1251460.1251470$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1251460.1251470$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/manku03symphony.pdf},
 	author = {Manku, Gurmeet Singh and Bawa, Mayank and Prabhakar Raghavan}
 }
@@ -12230,7 +12253,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
 	keywords = {link estimation, multi-hop networks, neighborhood management, reliability, sensor networks},
 	isbn = {1-58113-707-9},
 	doi = {10.1145/958491.958494},
-	url = {http://portal.acm.org/citation.cfm?id=958494$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=958494$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p14-woo.pdf},
 	author = {Woo, Alec and Tong, Terence and Culler, David}
 }
@@ -12248,7 +12271,7 @@ this, we propose separating the proxy into two distinct components|the messenger
 	author = {Nick Feamster and Magdalena Balazinska and Winston Wang and Hari Balakrishnan and David Karger},
 	editor = {Roger Dingledine}
 }
-@article {2003,
+@article {2003_10,
 	title = {On the Topology of Overlay-Networks},
 	year = {2003},
 	abstract = {Random-graph models are about to become an important tool in the study of wireless ad-hoc and sensor-networks, peer-to-peer networks, and, generally, overlay-networks. Such models provide a theoretical basis to assess the capabilities of certain networks, and guide the design of new protocols. Especially the recently proposed models for so-called small-world networks receive much attention from the networking community. This paper proposes the use of two more mathematical concepts for the analysis of network topologies, dimension and curvature. These concepts can intuitively be applied to, e.g., sensor-networks. But they can also be sensibly dened for certain other random-graph models. The latter is non-trivial since such models may describe purely virtual networks that do not inherit properties from an underlying physical world. Analysis of a random-graph model for Gnutella-like overlay-networks yields strong indications that such networks might be characterized as a sphere with fractal dimension},
@@ -12282,7 +12305,7 @@ this, we propose separating the proxy into two distinct components|the messenger
 	organization = {IEEE Computer Society},
 	abstract = {The initially unrestricted host-to-host communication model provided by the Internet Protocol has deteriorated due to political and technical changes caused by Internet growth. While this is not a problem for most client-server applications, peer-to-peer networks frequently struggle with peers that are only partially reachable. We describe how a peer-to-peer framework can hide diversity and obstacles in the underlying Internet and provide peer-to-peer applications with abstractions that hide transport specific details. We present the details of an implementation of a transport service based on SMTP. Small-scale benchmarks are used to compare transport services over UDP, TCP, and SMTP},
 	keywords = {GNUnet, P2P},
-	url = {http://grothoff.org/christian/transport.pdf},
+	www_section = {http://grothoff.org/christian/transport.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/transport.pdf},
 	author = {Ronaldo A. Ferreira and Christian Grothoff and Paul Ruth}
 }
@@ -12298,7 +12321,7 @@ this, we propose separating the proxy into two distinct components|the messenger
 	keywords = {file-sharing, P2P},
 	isbn = {1-58113-630-7},
 	doi = {10.1145/642611.642636},
-	url = {http://portal.acm.org/citation.cfm?id=642611.642636$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=642611.642636$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/HPL-2002-163.pdf},
 	author = {Good, Nathaniel S. and Krekelberg, Aaron}
 }
@@ -12307,7 +12330,7 @@ this, we propose separating the proxy into two distinct components|the messenger
 	year = {2003},
 	abstract = {The continued miniaturization in computing and wireless communication is about to make informationally enhanced environments become a reality. Already today, devices like a notebook computer or a personal digital assistent (PDA) can easily connect to the Internet via IEEE 802.11 networks (WaveLAN) or similar technologies provided at so-called hot-spots. In the near future, even smaller devices can join a wireless network to exchange status information or send and receive commands. In this paper, we present sample uses of a generic Bluetooth component that we have developed and that has been successfully integrated into various mininature devices to transmit sensor data or exchange control commands. The use of standard protocols like TCP/IP, Obex, and HTTP simplifies the use of those devices with conventional devices (notebook, PDA, cell-phone) without even requiring special drivers or applications for these devices. While such scenarios have already often been dreamt of, we are able to present a working solution based on small and cost-effective standard elements. We describe two applications that illustrate the power this approach in the broad area of e-commerce, e-learning, and e-government: the BlueWand, a small, pen-like device that can control Bluetooth devices in its vincinity by simple gestures, and a door plate that can display messages that are posted to it e.g. by a Bluetooth PDA. Keywords: Human-Computer Interaction, Ubiquitous Computing, Wireless Communications (Bluetooth)},
 	keywords = {Bluetooth, ubiquitous computing},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.2131},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.2131},
 	author = {Thomas Fuhrmann and Till Harbaum}
 }
 @article {shsm03,
@@ -12321,7 +12344,7 @@ this, we propose separating the proxy into two distinct components|the messenger
 	abstract = {Privacy-providing tools, including tools that provide anonymity, are gaining popularity in the modern world. Among the goals of their users is avoiding tracking and profiling. While some businesses are unhappy with the growth of privacy-enhancing technologies, others can use lack of information about their users to avoid unnecessary liability and even possible harassment by parties with contrary business interests, and to gain a competitive market edge.Currently, users interested in anonymous browsing have the choice only between single-hop proxies and the few more complex systems that are available. These still leave the user vulnerable to long-term intersection attacks.In this paper, we propose a caching proxy system for allowing users to retrieve data from the World-Wide Web in a way that would provide recipient unobservability by a third party and sender unobservability by the recipient and thus dispose with intersection attacks, and report on the prototype we built using Google},
 	keywords = {anonymity, caching proxies, privacy},
 	doi = {10.1145/1120709.1120713},
-	url = {http://portal.acm.org/citation.cfm?id=1120713},
+	www_section = {http://portal.acm.org/citation.cfm?id=1120713},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/shsm03.pdf},
 	author = {Anna Shubina and Sean Smith}
 }
@@ -12336,7 +12359,7 @@ this, we propose separating the proxy into two distinct components|the messenger
 	address = {Los Alamitos, CA, USA},
 	issn = {0018-9162},
 	doi = {10.1109/MC.2003.1220588},
-	url = {http://portal.acm.org/citation.cfm?id=939824.939859$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=939824.939859$\#$},
 	author = {Jain, Saurabh and Agrawal, Dharma P.}
 }
 @booklet {Boulkenafed02adhocfs:sharing,
@@ -12345,7 +12368,7 @@ this, we propose separating the proxy into two distinct components|the messenger
 	abstract = {This paper presents the ADHOCFS file system for mobileusers, which realizes transparent, adaptive file accessaccording to the users{\textquoteright} specific situations (e.g., device inuse, network connectivity, etc).The paper concentratesmore specifically on the support of ADHOCFS for collaborativefile sharing within ad hoc groups of trusted nodesthat are in the local communication of each other using theunderlying ad hoc network, which has not been addressedin the past},
 	keywords = {ad-hoc networks},
 	isbn = {0-7695-1938-5},
-	url = {http://portal.acm.org/citation.cfm?id=825345},
+	www_section = {http://portal.acm.org/citation.cfm?id=825345},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.13.9956.pdf},
 	author = {Malika Boulkenafed and Valerie Issarny}
 }
@@ -12362,7 +12385,7 @@ this, we propose separating the proxy into two distinct components|the messenger
 	keywords = {electronic voting},
 	isbn = {1-58113-612-9},
 	doi = {10.1145/586110.586121},
-	url = {http://portal.acm.org/citation.cfm?id=586121},
+	www_section = {http://portal.acm.org/citation.cfm?id=586121},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BonehGolle-psp2002.pdf},
 	author = {Dan Boneh and Philippe Golle},
 	editor = {Vijay Atluri}
@@ -12379,7 +12402,7 @@ this, we propose separating the proxy into two distinct components|the messenger
 	keywords = {programmable networks},
 	isbn = {3-540-00223-5},
 	doi = {10.1007/3-540-36199-5},
-	url = {http://portal.acm.org/citation.cfm?id=664025$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=664025$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann02architecture_0.pdf},
 	author = {Thomas Fuhrmann and Till Harbaum and Marcus Schoeller and Martina Zitterbart}
 }
@@ -12395,7 +12418,7 @@ this, we propose separating the proxy into two distinct components|the messenger
 	abstract = {Various systems offering anonymity for near real-time Internet traffic have been operational. However, they did not deliver many quantitative results about performance, bandwidth overhead, or other issues that arise when implementing or operating such a system. Consequently, the problem of designing and operating these systems in a way that they provide a good balance between usability, protection from attacks, and overhead is not well understood. In this paper, we present the analysis of an anonymity network for web browsing that offers a high level of anonymity against a sophisticated attacker and good end-to-end performance at a reasonable bandwidth overhead. We describe a novel way of operating the system that maximizes the protection from traffic analysis attacks while minimizing the bandwidth overhead. We deliver quantitative results about the performance of our system, which should help to give a better understanding of anonymity networks},
 	keywords = {anonymity, anonymous web browsing},
 	isbn = {0-7695-1748-X},
-	url = {http://portal.acm.org/citation.cfm?id=759973},
+	www_section = {http://portal.acm.org/citation.cfm?id=759973},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/RRMPH02-1.pdf},
 	author = {Marc Rennhard and Sandro Rafaeli and Laurent Mathy and Bernhard Plattner and David Hutchison}
 }
@@ -12408,7 +12431,7 @@ this, we propose separating the proxy into two distinct components|the messenger
 	organization = {IEEE},
 	abstract = {There have been a number of protocols proposed for anonymous network communication. In this paper we investigate attacks by corrupt group members that degrade the anonymity of each protocol over time. We prove that when a particular initiator continues communication with a particular responder across path reformations, existing protocols are subject to the attack. We use this result to place an upper bound on how long existing protocols, including Crowds, Onion Routing, Hordes, Web Mixes, and DC-Net, can maintain anonymity in the face of the attacks described. Our results show that fully-connected DC-Net is the most resilient to these attacks, but it su$\#$ers from scalability issues that keep anonymity group sizes small. Additionally, we show how violating an assumption of the attack allows malicious users to setup other participants to falsely appear to be the initiator of a connection},
 	keywords = {anonymity, Crowds, dining cryptographers, Hordes, onion routing},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.9435},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.9435},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/wright-degrade.pdf},
 	author = {Matthew Wright and Micah Adler and Brian Neil Levine and Clay Shields}
 }
@@ -12420,7 +12443,7 @@ this, we propose separating the proxy into two distinct components|the messenger
 	publisher = {Springer-Verlag  London, UK},
 	abstract = {In this paper we propose a new Peer-to-Peer architecture for a censorship resistant system with user, server and active-server document anonymity as well as efficient document retrieval. The retrieval service is layered on top of an existing Peer-to-Peer infrastructure, which should facilitate its implementation},
 	isbn = {3-540-44179-4},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.13.5048\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.13.5048\&rep=rep1\&type=pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.13.5048.pdf},
 	author = {Andrei Serjantov}
 }
@@ -12436,7 +12459,7 @@ Indeed, if one server has been pressured into removal, the other server administ
 	keywords = {anonymity, censorship resistance, P2P},
 	isbn = {978-3-540-44179-3},
 	doi = {10.1007/3-540-45748-8},
-	url = {http://portal.acm.org/citation.cfm?id=687808},
+	www_section = {http://portal.acm.org/citation.cfm?id=687808},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Serj02-iptps.pdf},
 	author = {Andrei Serjantov}
 }
@@ -12453,7 +12476,7 @@ Placing application-dedicated functionality within the network requires a flexib
 	keywords = {multicast, programmable networks},
 	isbn = {3-540-43709-6},
 	doi = {10.1007/3-540-47906-6},
-	url = {http://www.springerlink.com/content/4j371710765jg14q/},
+	www_section = {http://www.springerlink.com/content/4j371710765jg14q/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/speer02networking.pdf},
 	author = {Speer, Anke and Marcus Schoeller and Thomas Fuhrmann and Martina Zitterbart}
 }
@@ -12464,7 +12487,7 @@ Placing application-dedicated functionality within the network requires a flexib
 	abstract = {Private Information Retrieval (PIR) protocols allow a user to retrieve a data item from a database while hiding the identity of the item being retrieved. Specifically, in information-theoretic, k-server PIR protocols the database is replicated among k servers, and each server learns nothing about the item the user retrieves. The cost of such protocols is measured by the communication complexity of retrieving one out of n bits of data. For any fixed k, the complexity of the best protocols prior to our work was 0(n^{\frac{1}{{2k - 1}}}) (Ambainis, 1997). Since then several methods were developed in an attempt to beat this bound, but all these methods yielded the same asymptotic bound.In this work, this barrier is finally broken and the complexity of information-theoretic k-server PIR is improved to n^{0(\frac{{\log \log k}}{{k\log k}})}. The new PIR protocols can also be used to construct k-query binary locally decodable codes of length exp (n^{0(\frac{{\log \log k}}{{k\log k}})}), compared to exp(n^{\frac{1}{{k - 1}}}) in previous constructions. The improvements presented in this paper apply even for small values of k: the PIR protocols are more efficient than previous ones for every k \geqslant 3, and the locally decodable codes are shorter for every k \geqslant 4},
 	keywords = {private information retrieval},
 	isbn = {0-7695-1822-2},
-	url = {http://portal.acm.org/citation.cfm?id=652187},
+	www_section = {http://portal.acm.org/citation.cfm?id=652187},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/beimel-barrier.pdf},
 	author = {Amos Beimel and Yuval Ishai and Eyal Kushilevitz and Jean-Fran{\c c}ois Raymond}
 }
@@ -12482,7 +12505,7 @@ Placing application-dedicated functionality within the network requires a flexib
 	keywords = {Byzantine storage, detection, secure file system, stale data, tampering attack, trusted network, untrusted server},
 	isbn = {1-58113-485-1},
 	doi = {http://doi.acm.org/10.1145/571825.571840},
-	url = {http://doi.acm.org/10.1145/571825.571840},
+	www_section = {http://doi.acm.org/10.1145/571825.571840},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PODC\%2702\%20-\%20Building\%20secure\%20file\%20systems\%20out\%20of\%20Byzantine\%20storage.pdf},
 	author = {David Mazi{\`e}res and Shasha, Dennis}
 }
@@ -12497,7 +12520,7 @@ Placing application-dedicated functionality within the network requires a flexib
 	keywords = {coding theory, low-density parity-check},
 	issn = { 0018-9448 },
 	doi = {10.1109/TIT.2002.805067  },
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.6722},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.6722},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.92.7281.pdf},
 	author = {Peter Oswald and M. Amin Shokrollahi}
 }
@@ -12508,7 +12531,7 @@ Placing application-dedicated functionality within the network requires a flexib
 	month = {June},
 	abstract = {Cebolla is an intersection of cryptographic mix networks and the environment of the public Internet. Most of the history of cryptographic mix networks lies in academic attempts to provide anonymity of various sorts to the users of the network. While based on strong cryptographic principles, most attempts have failed to address properties of the public network and the reasonable expectations of most of its users. Cebolla attempts to address this gulf between the interesting research aspects of IP level anonymity and the operational expectations of most uses of the IP network},
 	keywords = {anonymity, cryptography},
-	url = {http://www.linuxinsight.com/ols2002_cebolla_pragmatic_ip_anonymity.html},
+	www_section = {http://www.linuxinsight.com/ols2002_cebolla_pragmatic_ip_anonymity.html},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cebolla.pdf},
 	author = {Zach Brown}
 }
@@ -12516,7 +12539,7 @@ Placing application-dedicated functionality within the network requires a flexib
 	title = {Censorship Resistant Peer-to-Peer Content Addressable Networks},
 	year = {2002},
 	abstract = {We present a censorship resistant peer-to-peer network for accessing n data items in a network of n nodes. Each search for a data item in the network takes O(log n) time and requires at most O(log2n) messages. Our network is censorship resistant in the sense that even after adversarial removal of an arbitrarily large constant fraction of the nodes in the network, all but an arbitrarily small fraction of the remaining nodes can obtain all but an arbitrarily small fraction of the original data items. The network can be created in a fully distributed fashion. It requires only O(log n) memory in each node. We also give a variant of our scheme that has the property that it is highly spam resistant: an adversary can take over complete control of a constant fraction of the nodes in the network and yet will still be unable to generate spam},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.16.4761\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.16.4761\&rep=rep1\&type=pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.16.4761.pdf},
 	author = {Amos Fiat and Jared Saia}
 }
@@ -12530,7 +12553,7 @@ Placing application-dedicated functionality within the network requires a flexib
 	abstract = {We present the design and rationale of a practical system for passing confidential messages. The mechanism is an adaptation of Rivest{\textquoteright}s {\textquotedblleft}chaffing and winnowing{\textquotedblright}, which has the legal advantage of using authentication keys to provide privacy.We identify a weakness in Rivest{\textquoteright}s particular choice of his {\textquotedblleft}package transform{\textquotedblright} as an {\textquotedblleft}all-or-nothing{\textquotedblright} element within his scheme. We extend the basic system to allow the passing of several messages concurrently. Only some of these messages need be divulged under legal duress, the other messages will be plausibly deniable. We show how this system may have some resilience to the type of legal attack inherent in the UK{\textquoteright}s Regulation of Investigatory Powers (RIP) Act},
 	keywords = {legal attack, RIP},
 	doi = {10.1007/3-540-36415-3},
-	url = {http://portal.acm.org/citation.cfm?id=647598.732024},
+	www_section = {http://portal.acm.org/citation.cfm?id=647598.732024},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Chaffinch.pdf},
 	author = {Richard Clayton and George Danezis},
 	editor = {Fabien Petitcolas}
@@ -12546,7 +12569,7 @@ Placing application-dedicated functionality within the network requires a flexib
 	keywords = {credibility, polling protocol, reputation},
 	isbn = {1-58113-449-5},
 	doi = {10.1145/511446.511496},
-	url = {http://portal.acm.org/citation.cfm?id=511496$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=511496$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/samarati.pdf},
 	author = {Cornelli, Fabrizio and Ernesto Damiani and Sabrina De Capitani di Vimercati and Stefano Paraboschi and Pierangela Samarati}
 }
@@ -12563,7 +12586,7 @@ Placing application-dedicated functionality within the network requires a flexib
 	keywords = {byzantine fault tolerance, certification authority, denial-of-service, proactive secret-sharing, public key cryptography, threshold cryptography},
 	issn = {0734-2071},
 	doi = {10.1145/571637.571638},
-	url = {http://portal.acm.org/citation.cfm?id=571638$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=571638$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cocaTOCS.pdf},
 	author = {Zhou, Lidong and Schneider, Fred B. and Robbert Van Renesse}
 }
@@ -12581,7 +12604,7 @@ Placing application-dedicated functionality within the network requires a flexib
 	abstract = {Recently a new generation of P2P systems, offering distributed hash table (DHT) functionality, have been proposed. These systems greatly improve the scalability and exact-match accuracy of P2P systems, but offer only the exact-match query facility. This paper outlines a research agenda for building complex query facilities on top of these DHT-based P2P systems. We describe the issues involved and outline our research plan and current status},
 	keywords = {distributed hash table},
 	isbn = {3-540-44179-4},
-	url = {http://dl.acm.org/citation.cfm?id=646334.687945},
+	www_section = {http://dl.acm.org/citation.cfm?id=646334.687945},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IPTPS\%2701\%20-\%20Complex\%20queries\%20in\%20DHT-based\%20p2p\%20networks.pdf},
 	author = {Harren, Matthew and Hellerstein, Joseph M. and Huebsch, Ryan and Boon Thau Loo and S Shenker and Ion Stoica}
 }
@@ -12599,11 +12622,11 @@ Placing application-dedicated functionality within the network requires a flexib
 	keywords = {e-business, moral hazard, reciprocity, reputation, trust},
 	isbn = {0-7695-1435-9},
 	doi = {http://dx.doi.org/10.1109/HICSS.2002.994181},
-	url = {http://dl.acm.org/citation.cfm?id=820745.821158},
+	www_section = {http://dl.acm.org/citation.cfm?id=820745.821158},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/HICSS\%2702\%20-\%20A\%20computational\%20model\%20of\%20trust\%20and\%20reputation.pdf},
 	author = {Lik Mui and Mojdeh Mohtashemi and Ari Halberstadt}
 }
-@conference {2002,
+@conference {2002_0,
 	title = {Cooperative Backup System},
 	booktitle = {In The USENIX Conf. on File and Storage Technologies},
 	year = {2002},
@@ -12621,7 +12644,7 @@ Placing application-dedicated functionality within the network requires a flexib
 	address = {Berkeley, CA, USA},
 	abstract = {CPCMS, the Cryptographically Protected Configuration Management System is a new configuration management system that provides scalability, disconnected commits, and fine-grain access controls. It addresses the novel problems raised by modern open-source development practices, in which projects routinely span traditional organizational boundaries and can involve thousands of participants. CPCMS provides for simultaneous public and private lines of development, with post hoc "publication" of private branches},
 	isbn = {1-880446-01-4},
-	url = {http://portal.acm.org/citation.cfm?id=715916$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=715916$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.61.3184.pdf},
 	author = {Shapiro, Jonathan S. and Vanderburgh, John}
 }
@@ -12637,7 +12660,7 @@ Placing application-dedicated functionality within the network requires a flexib
 	keywords = {anonymity, anonymous credential system},
 	isbn = {1-58113-612-9},
 	doi = {http://doi.acm.org/10.1145/586110.586114},
-	url = {http://portal.acm.org/citation.cfm?id=586114},
+	www_section = {http://portal.acm.org/citation.cfm?id=586114},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/idemix.pdf},
 	author = {Jan Camenisch and Els Van Herreweghen}
 }
@@ -12652,7 +12675,7 @@ Placing application-dedicated functionality within the network requires a flexib
 	abstract = {File systems have (at least) two undesirable characteristics: both the addressing model and the consistency semantics differ from those of memory, leading to a change in programming model at the storage boundary. Main memory is a single flat space of pages with a simple durability (persistence) model: all or nothing. File content durability is a complex function of implementation, caching, and timing. Memory is globally consistent. File systems offer no global consistency model. Following a crash recovery, individual files may be lost or damaged, or may be collectively inconsistent even though they are individually sound},
 	keywords = {file systems},
 	isbn = {1-880446-00-6},
-	url = {http://portal.acm.org/citation.cfm?id=713855$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=713855$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/storedesign2002.pdf},
 	author = {Shapiro, Jonathan S. and Adams, Jonathan}
 }
@@ -12669,7 +12692,7 @@ Placing application-dedicated functionality within the network requires a flexib
 	keywords = {end-to-end measurement, flow, internet congestion protocols, per-flow, shared congestion},
 	issn = {1063-6692 },
 	doi = {http://dx.doi.org/10.1109/TNET.2002.1012369},
-	url = {http://dx.doi.org/10.1109/TNET.2002.1012369},
+	www_section = {http://dx.doi.org/10.1109/TNET.2002.1012369},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IEEE\%E2\%81\%84ACM\%20Transactions\%20on\%20Networking\%20-\%20Detecting\%20shared\%20congestion\%20of\%20flows.pdf},
 	author = {Rubenstein, Dan and Kurose, Jim and Don Towsley}
 }
@@ -12687,7 +12710,7 @@ Placing application-dedicated functionality within the network requires a flexib
 	keywords = {algorithmic mechanism design, algorithms, distributed computation, multicast, routing},
 	isbn = {1-58113-587-4},
 	doi = {http://doi.acm.org/10.1145/570810.570812},
-	url = {http://jmvidal.cse.sc.edu/library/feigenbaum02a.pdf},
+	www_section = {http://jmvidal.cse.sc.edu/library/feigenbaum02a.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DIALM\%2702\%20-\%20Feigenbaum\%20\%26\%20Shenker\%20-\%20Distributed\%20algorithmic\%20mechanism\%20design.pdf},
 	author = {Feigenbaum, Joan and S Shenker}
 }
@@ -12698,7 +12721,7 @@ Placing application-dedicated functionality within the network requires a flexib
 	month = apr,
 	publisher = {EECS Department, University of California, Berkeley},
 	abstract = {Modern networking applications replicate data and services widely, leading to a need for location-independent routing {\textendash} the ability to route queries directly to objects using names that are independent of the objects{\textquoteright} physical locations. Two important properties of a routing infrastructure are routing locality and rapid adaptation to arriving and departing nodes. We show how these two properties can be achieved with an efficient solution to the nearest-neighbor problem. We present a new distributed algorithm that can solve the nearest-neighbor problem for a restricted metric space. We describe our solution in the context of Tapestry, an overlay network infrastructure that employs techniques proposed by Plaxton, Rajaraman, and Richa},
-	url = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2002/5214.html},
+	www_section = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2002/5214.html},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CSD-02-1178.pdf},
 	author = {Hildrum, Kirsten and John Kubiatowicz and Rao, Satish and Ben Y. Zhao}
 }
@@ -12711,7 +12734,7 @@ Placing application-dedicated functionality within the network requires a flexib
 	pages = {99{\textendash}142},
 	abstract = {I will close the remailer for the time being because the legal issues concerning the Internet in Finland are yet undefined. The legal protection of the users needs to be clarified. At the moment the privacy of Internet messages is judicially unclearI have also personally been a target because of the remailer. Unjustified accusations affect both my job and my private life},
 	keywords = {privacy},
-	url = {https://litigation-essentials.lexisnexis.com/webcd/app?action=DocumentDisplay\&crawlid=1\&doctype=cite\&docid=32+N.M.L.+Rev.+99\&srctype=smi\&srcid=3B15\&key=008c465fa13eb62c9370e4baa5eea0e5},
+	www_section = {https://litigation-essentials.lexisnexis.com/webcd/app?action=DocumentDisplay\&crawlid=1\&doctype=cite\&docid=32+N.M.L.+Rev.+99\&srctype=smi\&srcid=3B15\&key=008c465fa13eb62c9370e4baa5eea0e5},
 	author = {Robyn Wagner}
 }
 @conference {langos02,
@@ -12727,7 +12750,7 @@ For a detailed description of our method we assume a cascade of Chaumian MIXes a
 	keywords = {anonymity service, intersection attacks},
 	isbn = {978-3-540-00565-0},
 	doi = {10.1007/3-540-36467-6},
-	url = {http://www.springerlink.com/content/66ybualwu5hmh563/},
+	www_section = {http://www.springerlink.com/content/66ybualwu5hmh563/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/langos02.pdf},
 	author = {Oliver Berthold and Heinrich Langos},
 	editor = {Roger Dingledine and Paul Syverson}
@@ -12743,7 +12766,7 @@ For a detailed description of our method we assume a cascade of Chaumian MIXes a
 	keywords = {anonymity, certificate revocation, credentials, dynamic accumulators, group signatures, identity escrow},
 	isbn = {978-3-540-44050-5},
 	doi = {10.1007/3-540-45708-9},
-	url = {http://portal.acm.org/citation.cfm?id=704437},
+	www_section = {http://portal.acm.org/citation.cfm?id=704437},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/camenisch2002da.pdf},
 	author = {Jan Camenisch and Anna Lysyanskaya}
 }
@@ -12753,7 +12776,7 @@ For a detailed description of our method we assume a cascade of Chaumian MIXes a
 	abstract = {We describe a content addressable network which is robust in the face of massive adversarial attacks and in a highly dynamic environment. Our network is robust in the sense that at any time, an arbitrarily large fraction of the peers can reach an arbitrarily large fraction of the data items. The network can be created and maintained in a completely distributed fashion},
 	keywords = {fault-tolerance, robustness},
 	doi = {10.1007/3-540-45748-8},
-	url = {http://www.springerlink.com/content/r7fumjuwmgnd4md1/},
+	www_section = {http://www.springerlink.com/content/r7fumjuwmgnd4md1/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/180.pdf},
 	author = {Jared Saia and Amos Fiat and Steven D. Gribble and Anna R. Karlin and Stefan Saroiu}
 }
@@ -12766,7 +12789,7 @@ For a detailed description of our method we assume a cascade of Chaumian MIXes a
 	organization = {Springer-Verlag},
 	address = {Melbourne, Australia},
 	keywords = {censorship resistance, ECRS, encoding, file-sharing, GNUnet},
-	url = {http://grothoff.org/christian/esed.pdf},
+	www_section = {http://grothoff.org/christian/esed.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/esed.pdf},
 	author = {Krista Bennett and Christian Grothoff and Tzvetan Horozov and Ioana Patrascu}
 }
@@ -12782,7 +12805,7 @@ For a detailed description of our method we assume a cascade of Chaumian MIXes a
 	abstract = {Over the past decade, mobile computing and wireless communication have become increasingly important drivers of many new computing applications. The field of wireless sensor networks particularly focuses on applications involving autonomous use of compute, sensing, and wireless communication devices for both scientific and commercial purposes. This paper examines the research decisions and design tradeoffs that arise when applying wireless peer-to-peer networking techniques in a mobile sensor network designed to support wildlife tracking for biology research.The ZebraNet system includes custom tracking collars (nodes) carried by animals under study across a large, wild area; the collars operate as a peer-to-peer network to deliver logged data back to researchers. The collars include global positioning system (GPS), Flash memory, wireless transceivers, and a small CPU; essentially each node is a small, wireless computing device. Since there is no cellular service or broadcast communication covering the region where animals are studied, ad hoc, peer-to-peer routing is needed. Although numerous ad hoc protocols exist, additional challenges arise because the researchers themselves are mobile and thus there is no fixed base station towards which to aim data. Overall, our goal is to use the least energy, storage, and other resources necessary to maintain a reliable system with a very high {\textquoteleft}data homing{\textquoteright} success rate. We plan to deploy a 30-node ZebraNet system at the Mpala Research Centre in central Kenya. More broadly, we believe that the domain-centric protocols and energy tradeoffs presented here for ZebraNet will have general applicability in other wireless and sensor applications},
 	issn = {0163-5964},
 	doi = {10.1145/635506.605408},
-	url = {http://portal.acm.org/citation.cfm?id=635506.605408$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=635506.605408$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/asplos-x_annot.pdf},
 	author = {Juang, Philo and Oki, Hidekazu and Wang, Yong and Martonosi, Margaret and Peh, Li Shiuan and Rubenstein, Daniel}
 }
@@ -12798,7 +12821,7 @@ For a detailed description of our method we assume a cascade of Chaumian MIXes a
 	keywords = {distributed storage, erasure coding, P2P},
 	isbn = {3-540-44179-4},
 	doi = {10.1007/3-540-45748-8},
-	url = {http://www.springerlink.com/content/e1kmcf729e6updgm/},
+	www_section = {http://www.springerlink.com/content/e1kmcf729e6updgm/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IPTPS\%2701\%20-\%20Erasure\%20coding\%20vs.\%20replication.pdf},
 	author = {Weatherspoon, Hakim and John Kubiatowicz}
 }
@@ -12807,11 +12830,11 @@ For a detailed description of our method we assume a cascade of Chaumian MIXes a
 	year = {2002},
 	abstract = {Mojo Nation\&quot;w as a netw ork for robust, decentralized file storage and transfer},
 	isbn = {3-540-44179-4},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.9607},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.9607},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Experiences_Deploying_a_Large-Scale_Emergent_Network.pdf},
 	author = {O{\textquoteright}Hearn, Bryce W.}
 }
-@conference {Castro02exploitingnetwork,
+@conference {Castro02exploitingnetwork_0,
 	title = {Exploiting network proximity in distributed hash tables},
 	booktitle = {in International Workshop on Future Directions in Distributed Computing (FuDiCo)},
 	year = {2002},
@@ -12819,7 +12842,7 @@ For a detailed description of our method we assume a cascade of Chaumian MIXes a
 	abstract = {Self-organizing peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry (also called distributed hash tables or DHTs) offer a novel platform for a variety of scalable and decentralized distributed applications. These systems provide efficient and fault-tolerant routing, object location, and load balancing within a self-organizing overlay network. One important aspect of these systems is how they exploit network proximity in the underlying Internet. Three basic approaches have been proposed to exploit network proximity in DHTs, geographic layout, proximity routing and proximity neighbour selection. In this position paper, we briefly discuss the three approaches, contrast their strengths and shortcomings, and consider their applicability
 in the different DHT routing protocols. We conclude that proximity neighbor selection, when used in DHTs with prefixbased routing like Pastry and Tapestry, is highly effective and appears to dominate the other approaches},
 	keywords = {CAN, distributed hash table, P2P},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.3062},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.3062},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fudico.pdf},
 	author = {Miguel Castro and Peter Druschel and Y. Charlie Hu}
 }
@@ -12827,7 +12850,7 @@ in the different DHT routing protocols. We conclude that proximity neighbor sele
 	title = {Exploiting network proximity in peer-to-peer overlay networks},
 	year = {2002},
 	abstract = {The authors give an overview over various ways to use proximity information to optimize routing in peer-to-peer networks. Their study focuses on Pastry and describe in detail the protocols that are used in Pastry to build routing tables with neighbours that are close in terms of the underlying network. They give some analytical and extensive experimental evidence that the protocols are effective in reducing the length of the routing-path in terms of the link-to-link latency that their implementation uses to measure distance},
-	url = {http://www.research.microsoft.com/~antr/PAST/location.ps  },
+	www_section = {http://www.research.microsoft.com/~antr/PAST/location.ps  },
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/location.pdf},
 	author = {Miguel Castro and Peter Druschel and Y. Charlie Hu and Antony Rowstron}
 }
@@ -12844,7 +12867,7 @@ in the different DHT routing protocols. We conclude that proximity neighbor sele
 	keywords = {centralized file server, farsite, file system, randomized replicaed storage},
 	issn = {0163-5980},
 	doi = {http://doi.acm.org/10.1145/844128.844130},
-	url = {http://doi.acm.org/10.1145/844128.844130},
+	www_section = {http://doi.acm.org/10.1145/844128.844130},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGOPS\%20-\%20FARSITE.pdf},
 	author = {Adya, Atul and Bolosky, William J. and Miguel Castro and Cermak, Gerald and Chaiken, Ronnie and John R. Douceur and Howell, Jon and Lorch, Jacob R. and Marvin Theimer and Roger Wattenhofer}
 }
@@ -12864,7 +12887,7 @@ The read-only file system makes the security of published content independent fr
 	keywords = {file systems, read-only, security},
 	issn = {0734-2071},
 	doi = {http://doi.acm.org/10.1145/505452.505453},
-	url = {http://doi.acm.org/10.1145/505452.505453},
+	www_section = {http://doi.acm.org/10.1145/505452.505453},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/OSDI\%2700\%20-\%20Fast\%20and\%20Secure\%20Distributed\%20Read-Only\%20File\%20System.pdf},
 	author = {Kevin Fu and Frans M. Kaashoek and David Mazi{\`e}res}
 }
@@ -12879,19 +12902,19 @@ The read-only file system makes the security of published content independent fr
 	keywords = {traffic analysis, vulnerability},
 	isbn = {978-3-540-00565-0},
 	doi = {10.1007/3-540-36467-6},
-	url = {http://www.springerlink.com/content/c4qwe6d608p2cjyv/},
+	www_section = {http://www.springerlink.com/content/c4qwe6d608p2cjyv/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/hintz02.pdf},
 	author = {Andrew Hintz},
 	editor = {Roger Dingledine and Paul Syverson}
 }
-@conference {2002,
+@conference {2002_1,
 	title = {Finite-length analysis of low-density parity-check codes on the binary erasure channel},
 	year = {2002},
 	month = {01/2002 },
 	abstract = {In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The main result is an expression for the exact average bit and block erasure probability for a given regular ensemble of LDPC codes when decoded iteratively. We also give expressions for upper bounds on the average bit and block erasure probability for regular LDPC ensembles and the standard random ensemble under maximum-likelihood (ML) decoding. Finally, we present what we consider to be the most important open problems in this area},
 	keywords = {BEC, coding theory, low-density parity-check, maximum-likelihood},
 	doi = {10.1109/TIT.2002.1003839  },
-	url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1003839},
+	www_section = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1003839},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Finite-length\%20analysis\%20of\%20low-density\%20parity-check\%20codes\%20on.pdf},
 	author = {Changyan Di and David Proietti and I. Emre Telatar and Thomas J. Richardson and R{\"u}diger L. Urbanke}
 }
@@ -12904,7 +12927,7 @@ The read-only file system makes the security of published content independent fr
 	address = {Karlstad, Sweden},
 	abstract = {New threats such as compulsion to reveal logs, secret and private keys as well as to decrypt material are studied in the context of the security of mix networks. After a comparison of this new threat model with the traditional one, a new construction is introduced, the fs-mix, that minimizes the impact that such powers have on the security of the network, by using forward secure communication channels and key updating operation inside the mixes. A discussion about the forward security of these new proposals and some extensions is included},
 	keywords = {anonymity, forward security, mix, traffic analysis},
-	url = {http://citeseer.ist.psu.edu/533725.html},
+	www_section = {http://citeseer.ist.psu.edu/533725.html},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Dan-SFMix03.pdf},
 	author = {George Danezis},
 	editor = {Fisher-Hubner, Jonsson}
@@ -12920,12 +12943,12 @@ The read-only file system makes the security of published content independent fr
 	keywords = {anonymity, attack},
 	isbn = {978-3-540-00421-9},
 	doi = {10.1007/3-540-36415-3},
-	url = {http://www.springerlink.com/content/um0kf3dp88b0eg5v/},
+	www_section = {http://www.springerlink.com/content/um0kf3dp88b0eg5v/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/trickle02.pdf},
 	author = {Andrei Serjantov and Roger Dingledine and Paul Syverson},
 	editor = {Fabien Petitcolas}
 }
-@article {2002,
+@article {2002_2,
 	title = {The GNet Whitepaper},
 	year = {2002},
 	month = jun,
@@ -12945,7 +12968,7 @@ The read-only file system makes the security of published content independent fr
 	abstract = {With widespread acceptance of the Internet as a public medium for communication and information retrieval, there has been rising concern that the personal privacy of users can be eroded by cooperating network entities. A technical solution to maintaining privacy is to provide anonymity. We present a protocol for initiator anonymity called Hordes, which uses forwarding mechanisms similar to those used in previous protocols for sending data, but is the first protocol to make use of multicast routing to anonymously receive data. We show this results in shorter transmission latencies and requires less work of the protocol participants, in terms of the messages processed. We also present a comparison of the security and anonymity of Hordes with previous protocols, using the first quantitative definition of anonymity and unlinkability},
 	keywords = {anonymity, Hordes, multicast, routing},
 	issn = {0926-227X},
-	url = {http://portal.acm.org/citation.cfm?id=603406},
+	www_section = {http://portal.acm.org/citation.cfm?id=603406},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Levine-2002.pdf},
 	author = {Brian Neil Levine and Clay Shields}
 }
@@ -12966,7 +12989,7 @@ The read-only file system makes the security of published content independent fr
 	abstract = {Efficient data sharing in global peer-to-peer systems is complicated by erratic node failure, unreliable networkconnectivity and limited bandwidth.Replicating data onmultiple nodes can improve availability and response time.Yet determining when and where to replicate data in orderto meet performance goals in large-scale systems withmany users and files, dynamic network characteristics, and changing user behavior is difficult.We propose anapproach in which peers create replicas automatically in a decentralized fashion, as required to meet availabilitygoals.The aim of our framework is to maintain a thresholdlevel of availability at all times.We identify a set of factors that hinder data availabilityand propose a model that decides when more replication isnecessary.We evaluate the accuracy and performance ofthe proposed model using simulations.Our preliminaryresults show that the model is effective in predicting therequired number of replicas in the system},
 	keywords = {data sharing, model-driven, P2P},
 	isbn = {0-7695-1582-7},
-	url = {http://portal.acm.org/citation.cfm?id=873217$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=873217$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.16.909.pdf},
 	author = {Ranganathan, Kavitha and Iamnitchi, Adriana and Foster, Ian}
 }
@@ -12978,7 +13001,7 @@ The read-only file system makes the security of published content independent fr
 	publisher = {Association},
 	organization = {Association},
 	abstract = {An increasing number of countries and companies routinely block or monitor access to parts of the Internet. To counteract these measures, we propose Infranet, a system that enables clients to surreptitiously retrieve sensitive content via cooperating Web servers distributed across the global Internet. These Infranet servers provide clients access to censored sites while continuing to host normal uncensored content. Infranet uses a tunnel protocol that provides a covert communication channel between its clients and servers, modulated over standard HTTP transactions that resemble innocuous Web browsing. In the upstream direction, Infranet clients send covert messages to Infranet servers by associating meaning to the sequence of HTTP requests being made. In the downstream direction, Infranet servers return content by hiding censored data in uncensored images using steganographic techniques. We describe the design, a prototype implementation, security properties, and performance of Infranet. Our security analysis shows that Infranet can successfully circumvent several sophisticated censoring techniques},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.18.5049\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.18.5049\&rep=rep1\&type=pdf},
 	author = {Nick Feamster and Magdalena Balazinska and Greg Harfst and Hari Balakrishnan and David Karger}
 }
 @conference {infranet,
@@ -12991,7 +13014,7 @@ The read-only file system makes the security of published content independent fr
 	abstract = {An increasing number of countries and companies routinely block or monitor access to parts of the Internet. To counteract these measures, we propose Infranet, a system that enables clients to surreptitiously retrieve sensitive content via cooperating Web servers distributed across the global Internet. These Infranet servers provide clients access to censored sites while continuing to host normal uncensored content. Infranet uses a tunnel protocol that provides a covert communication channel between its clients and servers, modulated over standard HTTP transactions that resemble innocuous Web browsing. In the upstream direction, Infranet clients send covert messages to Infranet servers by associating meaning to the sequence of HTTP requests being made. In the downstream direction, Infranet servers return content by hiding censored data in uncensored images using steganographic techniques. We describe the design, a prototype implementation, security properties, and performance of Infranet. Our security analysis shows that Infranet can successfully circumvent several sophisticated censoring techniques},
 	keywords = {censorship resistance, infranet},
 	isbn = {1-931971-00-5},
-	url = {http://portal.acm.org/citation.cfm?id=720281},
+	www_section = {http://portal.acm.org/citation.cfm?id=720281},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/infranet.pdf},
 	author = {Nick Feamster and Magdalena Balazinska and Greg Harfst and Hari Balakrishnan and David Karger}
 }
@@ -13007,7 +13030,7 @@ The read-only file system makes the security of published content independent fr
 	abstract = {The basic concepts of three branches of game theory, leader-follower, cooperative, and two-person nonzero sum games, are reviewed and applied to the study of the Internet pricing issue. In particular, we emphasize that the cooperative game (also called the bargaining problem) provides an overall picture for the issue. With a simple model for Internet quality of service (QoS), we demonstrate that the leader-follower game may lead to a solution that is not Pareto optimal and in some cases may be "unfair," and that the cooperative game may provide a better solution for both the Internet service provider (ISP) and the user. The practical implication of the results is that government regulation or arbitration may be helpful. The QoS model is also applied to study the competition between two ISPs, and we find a Nash equilibrium point from which the two ISPs would not move out without cooperation. The proposed approaches can be applied to other Internet pricing problems such as the Paris Metro pricing scheme},
 	keywords = {bargaining problems, cooperative games, leader-follower games, Paris metro pricing, quality of services, two-person nonzero sum games},
 	issn = {1063-6692},
-	url = {http://dl.acm.org/citation.cfm?id=508325.508330},
+	www_section = {http://dl.acm.org/citation.cfm?id=508325.508330},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IEEE\%E2\%81\%84ACM\%20Trans.\%20Netw.\%2702\%20\%2810\%29-\%20Internet\%20pricing.pdf},
 	author = {Cao, Xi-Ren and Shen, Hong-Xia and Milito, Rodolfo and Wirth, Patrica}
 }
@@ -13023,7 +13046,7 @@ The read-only file system makes the security of published content independent fr
 	keywords = {inter-packet delay, tracing},
 	isbn = {978-3-540-44345-2},
 	doi = {10.1007/3-540-45853-0},
-	url = {http://portal.acm.org/citation.cfm?id=699363},
+	www_section = {http://portal.acm.org/citation.cfm?id=699363},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/2002-08-esorics02-ipd-correlation.pdf},
 	author = {Xinyuan Wang and Douglas S. Reeves and S. Felix Wu}
 }
@@ -13039,7 +13062,7 @@ The read-only file system makes the security of published content independent fr
 	keywords = {collusion detection, legal attack, P2P, traffic analysis},
 	isbn = {1-58113-633-1},
 	doi = {10.1145/644527.644537},
-	url = {http://portal.acm.org/citation.cfm?id=644537},
+	www_section = {http://portal.acm.org/citation.cfm?id=644537},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/morphmix-wpes2002.pdf},
 	author = {Marc Rennhard and Bernhard Plattner}
 }
@@ -13051,7 +13074,7 @@ The read-only file system makes the security of published content independent fr
 	pages = {121 - 129 },
 	abstract = {We introduce Tarzan, a peer-to-peer anonymous network layer that provides generic IP forwarding. Unlike prior anonymizing layers, Tarzan is flexible, transparent, decentralized, and highly scalable. Tarzan achieves these properties by building anonymous IP tunnels between an open-ended set of peers. Tarzan can provide anonymity to existing applications, such as web browsing and file sharing, without change to those applications. Performance tests show that Tarzan imposes minimal overhead over a corresponding non-anonymous overlay route},
 	isbn = {3-540-44179-4},
-	url = {http://www.cs.rice.edu/Conferences/IPTPS02/182.pdf},
+	www_section = {http://www.cs.rice.edu/Conferences/IPTPS02/182.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tarzan.pdf},
 	author = {Michael J. Freedman and Emil Sit and Josh Cates and Robert Morris}
 }
@@ -13062,7 +13085,7 @@ The read-only file system makes the security of published content independent fr
 	publisher = {Springer-Verlag},
 	address = {London, UK},
 	isbn = {3-540-44179-4},
-	url = {http://portal.acm.org/citation.cfm?id=646334$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=646334$\#$},
 	editor = {Peter Druschel and Frans M. Kaashoek and Antony Rowstron}
 }
 @conference {Muthitacharoen02ivy:a,
@@ -13071,7 +13094,7 @@ The read-only file system makes the security of published content independent fr
 	pages = {31{\textendash}44},
 	abstract = {Ivy is a multi-user read/write peer-to-peer file system. Ivy has no centralized or dedicated components, and it provides useful integrity properties without requiring users to fully trust either the underlying peer-to-peer storage system or the other users of the file system},
 	keywords = {distributed storage, P2P},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.2147},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.2147},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.20.2147.pdf},
 	author = {Muthitacharoen, Athicha and Robert Morris and Thomer M. Gil and Bengie Chen}
 }
@@ -13090,7 +13113,7 @@ The read-only file system makes the security of published content independent fr
 	keywords = {distributed hash table, fault-tolerance, Kademlia, P2P},
 	isbn = {3-540-44179-4},
 	doi = {10.1007/3-540-45748-8_5},
-	url = {http://www.springerlink.com/content/2ekx2a76ptwd24qt/},
+	www_section = {http://www.springerlink.com/content/2ekx2a76ptwd24qt/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kpos_0.pdf},
 	author = {Petar Maymounkov and David Mazi{\`e}res}
 }
@@ -13112,7 +13135,7 @@ The read-only file system makes the security of published content independent fr
 	organization = {ACM Press},
 	abstract = {Distributed Sensor Networks (DSNs) are ad-hoc mobile networks that include sensor nodes with limited computation and communication capabilities. DSNs are dynamic in the sense that they allow addition and deletion of sensor nodes after deployment to grow the network or replace failing and unreliable nodes. DSNs may be deployed in hostile areas where communication is monitored and nodes are subject to capture and surreptitious use by an adversary. Hence DSNs require cryptographic protection of communications, sensorcapture detection, key revocation and sensor disabling. In this paper, we present a key-management scheme designed to satisfy both operational and security requirements of DSNs},
 	keywords = {DNS, mobile Ad-hoc networks},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.9193},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.9193},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.19.9193.pdf},
 	author = {Laurent Eschenauer and Virgil D. Gligor}
 }
@@ -13125,7 +13148,7 @@ The read-only file system makes the security of published content independent fr
 	organization = {Springer-Verlag, LNCS 2578},
 	abstract = {A user is only anonymous within a set of other users. Hence, the core functionality of an anonymity providing technique is to establish an anonymity set. In open environments, such as the Internet, the established anonymity sets in the whole are observable and change with every anonymous communication. We use this fact of changing anonymity sets and present a model where we can determine the protection limit of an anonymity technique, i.e. the number of observations required for an attacker to break uniquely a given anonymity technique. In this paper, we use the popular MIX method to demonstrate our attack. The MIX method forms the basis of most of the today{\textquoteright}s deployments of anonymity services (e.g. Freedom, Onion Routing, Webmix). We note that our approach is general and can be applied equally well to other anonymity providing techniques},
 	keywords = {anonymity measurement, attack, mix},
-	url = {http://portal.acm.org/citation.cfm?id=731881},
+	www_section = {http://portal.acm.org/citation.cfm?id=731881},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/limits-open.pdf},
 	author = {Dogan Kesdogan and Dakshi Agrawal and Stefan Penz},
 	editor = {Fabien Petitcolas}
@@ -13143,7 +13166,7 @@ The read-only file system makes the security of published content independent fr
 	abstract = {Broadcast Encryption schemes enable a center to broadcast encrypted programs so that only designated subsets of users can decrypt each program. The stateless variant of this problem provides each user with a fixed set of keys which is never updated. The best scheme published so far for this problem is the "subset difference" (SD) technique of Naor Naor and Lotspiech, in which each one of the n users is initially given O(log2(n)) symmetric encryption keys. This allows the broadcaster to define at a later stage any subset of up to r users as "revoked", and to make the program accessible only to their complement by sending O(r) short messages before the encrypted program, and asking each user to perform an O(log(n)) computation. In this paper we describe the "Layered Subset Difference" (LSD) technique, which achieves the same goal with O(log1+{\textquestiondown}(n)) keys, O(r) messages, and O(log(n)) computation. This reduces the number of keys given to each user by almost a square root factor without affecting the other parameters. In addition, we show how to use the same LSD keys in order to address any subset defined by a nested combination of inclusion and exclusion conditions with a number of messages which is proportional to the complexity of the description rather than to the size of the subset. The LSD scheme is truly practical, and makes it possible to broadcast an unlimited number of programs to 256,000,000 possible customers by giving each new customer a smart card with one kilobyte of tamper-resistant memory. It is then possible to address any subset defined by t nested inclusion and exclusion conditions by sending less than 4t short messages, and the scheme remains secure even if all the other users form an adversarial coalition},
 	keywords = {broadcast encryption scheme, encryption, LSD},
 	isbn = {3-540-44050-X},
-	url = {http://dl.acm.org/citation.cfm?id=646767.704291},
+	www_section = {http://dl.acm.org/citation.cfm?id=646767.704291},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CRYPTO\%2702\%20-\%20The\%20LSD\%20broadcast\%20encryption\%20scheme.pdf},
 	author = {Halevy, Dani and Shamir, Adi}
 }
@@ -13159,7 +13182,7 @@ The read-only file system makes the security of published content independent fr
 	isbn = {0-7695-1822-2},
 	issn = {0272-5428},
 	doi = {10.1109/SFCS.2002.1181950},
-	url = {http://www.computer.org/portal/web/csdl/abs/proceedings/focs/2002/1822/00/18220271abs.htm},
+	www_section = {http://www.computer.org/portal/web/csdl/abs/proceedings/focs/2002/1822/00/18220271abs.htm},
 	author = {Luby, Michael}
 }
 @conference {randomized-checking,
@@ -13174,7 +13197,7 @@ Randomized partial checking is exceptionally efficient compared to previous prop
 Randomized partial checking is particularly well suited for voting systems, as it ensures voter privacy and provides assurance of correct operation. Voter privacy is ensured (either probabilistically or cryptographically) with appropriate design and parameter selection. Unlike previous work, our work provides voter privacy as a global property of the mix net rather than as a property ensured by a single honest server. RPC-based mix nets also provide high assurance of a correct election result, since a corrupt server is very likely to be caught if it attempts to tamper with even a couple of ballots},
 	keywords = {electronic voting, public verifiability, randomized partial checking, shuffle network},
 	isbn = {1-931971-00-5},
-	url = {http://portal.acm.org/citation.cfm?id=647253.720294},
+	www_section = {http://portal.acm.org/citation.cfm?id=647253.720294},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/randomized-checking.pdf},
 	author = {Jakobsson, Markus and Ari Juels and Ron Rivest}
 }
@@ -13192,7 +13215,7 @@ Randomized partial checking is particularly well suited for voting systems, as i
 	keywords = {algorithms, economics, integrated-services networks, network, nonlinear, pricing schemes, programming, resource allocation},
 	issn = {0030-364X},
 	doi = {10.1287/opre.50.4.603.2862},
-	url = {http://dx.doi.org/10.1287/opre.50.4.603.2862},
+	www_section = {http://dx.doi.org/10.1287/opre.50.4.603.2862},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Oper.\%20Res.\%20-\%20Optimal\%20Resource\%20Allocation.pdf},
 	author = {Thomas, Panagiotis and Teneketzis, Demosthenis and MacKie-Mason, Jeffrey K.}
 }
@@ -13202,7 +13225,7 @@ Randomized partial checking is particularly well suited for voting systems, as i
 	year = {2002},
 	month = jan,
 	address = {San Jose},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.61.4223\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.61.4223\&rep=rep1\&type=pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mmcn.pdf},
 	author = {Stefan Saroiu and P. Krishna Gummadi and Steven D. Gribble}
 }
@@ -13217,11 +13240,11 @@ We further investigate this intriguing proposal. Specifically, we
 4) Describe techniques to permit the receiver to verify the computation with no memory accesses;
 5) Give experimental results showing that our concrete memory-bound function is only about four times slower on a 233 MHz settop box than on a 3.06 GHz workstation, and that speedup of the function is limited even if an adversary knows the access sequence and uses optimal off-line cache replacement},
 	doi = {10.1007/b11817},
-	url = {citeseer.ist.psu.edu/dwork02memorybound.html},
+	www_section = {citeseer.ist.psu.edu/dwork02memorybound.html},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/memory-bound-crypto.pdf},
 	author = {Cynthia Dwork and Andrew Goldberg and Moni Naor}
 }
-@book {2002,
+@book {2002_3,
 	title = {Mnemosyne: Peer-to-Peer Steganographic Storage},
 	booktitle = {Peer-to-Peer Systems},
 	series = {Lecture Notes in Computer Science},
@@ -13232,7 +13255,7 @@ We further investigate this intriguing proposal. Specifically, we
 	organization = {Springer Berlin Heidelberg},
 	isbn = {978-3-540-44179-3},
 	doi = {10.1007/3-540-45748-8_13},
-	url = {http://dx.doi.org/10.1007/3-540-45748-8_13},
+	www_section = {http://dx.doi.org/10.1007/3-540-45748-8_13},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/107.pdf},
 	author = {Hand, Steven and Roscoe, Timothy},
 	editor = {Druschel, Peter and Kaashoek, Frans and Rowstron, Antony}
@@ -13242,7 +13265,7 @@ We further investigate this intriguing proposal. Specifically, we
 	year = {2002},
 	abstract = {We introduce online codes {\textendash} a class of near-optimal codes for a very general loss channel which we call the free channel. Online codes are linear encoding/decoding time codes, based on sparse bipartite graphs, similar to Tornado codes, with a couple of novel properties: local encodability and rateless-ness. Local encodability is the property that each block of the encoding of a message can be computed independently from the others in constant time. This also implies that each encoding block is only dependent on a constant-sized part of the message and a few preprocessed bits. Rateless-ness is the property that each message has an encoding of practically infinite size. We argue that rateless codes are more appropriate than fixed-rate codes for most situations where erasure codes were considered a solution. Furthermore, rateless codes meet new areas of application, where they are not replaceable by fixed-rate codes. One such area is information dispersal over peer-to-peer networks},
 	keywords = {coding theory, local encodability, rateless-ness, sparse bipartite graphs},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.1333},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.1333},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.112.1333.pdf},
 	author = {Petar Maymounkov}
 }
@@ -13255,7 +13278,7 @@ We further investigate this intriguing proposal. Specifically, we
 	pages = {839 - 876},
 	publisher = {IOS Press  Amsterdam, The Netherlands},
 	abstract = {We present a protocol for anonymous communication over the Internet. Our protocol, called P (Peer-to-Peer Personal Privacy Protocol) provides sender-, receiver-, and sender-receiver anonymity. P is designed to be implemented over the current Internet protocols, and does not require any special infrastructure support. A novel feature of P is that it allows individual participants to trade-off degree of anonymity for communication efficiency, and hence can be used to scalably implement large anonymous groups. We present a description of P , an analysis of its anonymity and communication efficiency, and evaluate its performance using detailed packet-level simulations},
-	url = { http://www.cs.umd.edu/projects/p5/p5.pdf},
+	www_section = { http://www.cs.umd.edu/projects/p5/p5.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p5.pdf},
 	author = {Rob Sherwood and Bobby Bhattacharjee and Aravind Srinivasan}
 }
@@ -13264,7 +13287,7 @@ We further investigate this intriguing proposal. Specifically, we
 	year = {2002},
 	abstract = {Backup is cumbersome and expensive. Individual users almost never back up their data, and backup is a significant cost in large organizations. This paper presents Pastiche, a simple and inexpensive backup system. Pastiche exploits excess disk capacity to perform peer-to-peer backup with no administrative costs. Each node minimizes storage overhead by selecting peers that share a significant amount of data. It is easy for common installations to find suitable peers, and peers with high overlap can be identified with only hundreds of bytes. Pastiche provides mechanisms for confidentiality, integrity, and detection of failed or malicious peers. A Pastiche prototype suffers only 7.4\% overhead for a modified Andrew Benchmark, and restore performance is comparable to cross-machine copy},
 	keywords = {backup, P2P},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.3254},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.3254},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.15.3254.pdf},
 	author = {Landon P. Cox and Christopher D. Murray and Brian D. Noble}
 }
@@ -13280,7 +13303,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {cooperation, fairness, mobile Ad-hoc networks, reputation, robustness, routing, trust},
 	isbn = {1-58113-501-7},
 	doi = {10.1145/513800.513828},
-	url = {http://portal.acm.org/citation.cfm?id=513828$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=513828$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BucheggerL02.pdf},
 	author = {Sonja Buchegger and Jean-Yves Le Boudec}
 }
@@ -13302,12 +13325,12 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {privacy},
 	isbn = {978-3-540-00565-0},
 	doi = {10.1007/3-540-36467-6},
-	url = {http://www.springerlink.com/content/740p21gl5a9f640m/},
+	www_section = {http://www.springerlink.com/content/740p21gl5a9f640m/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/petfive.pdf},
 	author = {Ian Goldberg},
 	editor = {Roger Dingledine and Paul Syverson}
 }
-@conference { c. rhea:probabilistic,
+@conference {c.rhea:probabilistic,
 	title = {Probabilistic Location and Routing},
 	booktitle = {INFOCOM{\textquoteright}02. Proceedings of the 21th Annual Joint Conference of the IEEE Computer and Communications Societies},
 	year = {2002},
@@ -13335,7 +13358,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {denial-of-service, P2P},
 	isbn = {1-58113-612-9},
 	doi = {10.1145/586110.586136},
-	url = {http://portal.acm.org/citation.cfm?id=586110.586136$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=586110.586136$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p115-daswani_0.pdf},
 	author = {Daswani, Neil and Hector Garcia-Molina}
 }
@@ -13353,7 +13376,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {convergent encryption, distributed file system, duplicate files, farsite, SALAD, serverless},
 	isbn = {0-7695-1585-1},
 	doi = {http://dx.doi.org/10.1109/ICDCS.2002.1022312},
-	url = {http://dl.acm.org/citation.cfm?id=850928.851884},
+	www_section = {http://dl.acm.org/citation.cfm?id=850928.851884},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ICDCS\%2702\%20-\%20Reclaiming\%20space\%20for\%20duplicate\%20files.pdf},
 	author = {John R. Douceur and Adya, Atul and Bolosky, William J. and Simon, Dan and Marvin Theimer}
 }
@@ -13364,7 +13387,7 @@ We further investigate this intriguing proposal. Specifically, we
 	publisher = {Springer Verlag},
 	organization = {Springer Verlag},
 	abstract = {We describe a MIX cascade protocol and a reputation system that together increase the reliability of a network of MIX cascades. In our protocol, MIX nodes periodically generate a communally random seed that, along with their reputations, determines cascade configuration},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.19.9316\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.19.9316\&rep=rep1\&type=pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.19.9316.pdf},
 	author = {Roger Dingledine and Paul Syverson}
 }
@@ -13379,7 +13402,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {anonymity, communal randomness, P2P, reputation},
 	isbn = {978-3-540-00646-6},
 	doi = {10.1007/3-540-36504-4},
-	url = {http://www.springerlink.com/content/g67u25lm80234qj4/},
+	www_section = {http://www.springerlink.com/content/g67u25lm80234qj4/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/casc-rep.pdf},
 	author = {Roger Dingledine and Paul Syverson},
 	editor = {Matt Blaze}
@@ -13395,11 +13418,11 @@ We further investigate this intriguing proposal. Specifically, we
 	organization = {ACM  New York, NY, USA},
 	address = {Pittsburgh},
 	abstract = {The Peer-to-Peer (P2P) architectures that are most prevalent in today{\textquoteright}s Internet are decentralized and unstructured. Search is blind in that it is independent of the query and is thus not more effective than probing randomly chosen peers. One technique to improve the effectiveness of blind search is to proactively replicate data},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.19.9873\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.19.9873\&rep=rep1\&type=pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/replication.pdf},
 	author = {Edith Cohen and S Shenker}
 }
-@conference {Damiani02areputation-based,
+@conference {Damiani02areputation-based_0,
 	title = {A Reputation-Based Approach for Choosing Reliable Resources in Peer-to-Peer Networks},
 	booktitle = {In Proceedings of the 9th ACM Conference on Computer and Communications Security},
 	year = {2002},
@@ -13407,7 +13430,7 @@ We further investigate this intriguing proposal. Specifically, we
 	publisher = {ACM Press},
 	organization = {ACM Press},
 	abstract = {Peer-to-peer (P2P) applications have seen an enormous success, and recently introduced P2P services have reached tens of millions of users. A feature that significantly contributes to the success of many P2P applications is user anonymity. However, anonymity opens the door to possible misuses and abuses, exploiting the P2P network as a way to spread tampered with resources, including Trojan Horses, viruses, and spam. To address this problem we propose a self-regulating system where the P2P network is used to implement a robust reputation mechanism. Reputation sharing is realized through a distributed polling algorithm by which resource requestors can assess the reliability of a resource offered by a participant before initiating the download. This way, spreading of malicious contents will be reduced and eventually blocked. Our approach can be straightforwardly piggybacked on existing P2P protocols and requires modest modifications to current implementations},
-	url = {http://seclab.dti.unimi.it/Papers/ccs02.ps  },
+	www_section = {http://seclab.dti.unimi.it/Papers/ccs02.ps  },
 	author = {Ernesto Damiani and Sabrina De Capitani di Vimercati and Stefano Paraboschi and Pierangela Samarati and Fabio Violante}
 }
 @conference {Damiani02areputation-based,
@@ -13418,7 +13441,7 @@ We further investigate this intriguing proposal. Specifically, we
 	publisher = {ACM Press},
 	organization = {ACM Press},
 	abstract = {Peer-to-peer (P2P) applications have seen an enormous success, and recently introduced P2P services have reached tens of millions of users. A feature that significantly contributes to the success of many P2P applications is user anonymity. However, anonymity opens the door to possible misuses and abuses, exploiting the P2P network as a way to spread tampered with resources, including Trojan Horses, viruses, and spam. To address this problem we propose a self-regulating system where the P2P network is used to implement a robust reputation mechanism. Reputation sharing is realized through a distributed polling algorithm by which resource requestors can assess the reliability of a resource offered by a participant before initiating the download. This way, spreading of malicious contents will be reduced and eventually blocked. Our approach can be straightforwardly piggybacked on existing P2P protocols and requires modest modifications to current implementations},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.7.1784\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.7.1784\&rep=rep1\&type=pdf},
 	author = {Ernesto Damiani and Sabrina De Capitani di Vimercati and Stefano Paraboschi and Pierangela Samarati and Fabio Violante}
 }
 @conference {beimel-robust,
@@ -13434,7 +13457,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {obsolete database, private information retrieval, robustness},
 	isbn = {978-3-540-00420-2},
 	doi = {10.1007/3-540-36413-7},
-	url = {http://www.springerlink.com/content/9bnlbf2e2lp9u9p4/},
+	www_section = {http://www.springerlink.com/content/9bnlbf2e2lp9u9p4/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BS.pdf},
 	author = {Amos Beimel and Yoav Stahl}
 }
@@ -13450,7 +13473,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {application layer multicast, hierarchy, overlay networks, P2P, scalability},
 	isbn = {1-58113-570-X},
 	doi = {10.1145/633025.633045},
-	url = {http://portal.acm.org/citation.cfm?id=633045$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=633045$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/sigcomm02.pdf},
 	author = {Banerjee, Suman and Bobby Bhattacharjee and Kommareddy, Christopher}
 }
@@ -13461,7 +13484,7 @@ We further investigate this intriguing proposal. Specifically, we
 	school = {University of California, Berkeley},
 	type = {phd},
 	keywords = {CAN, distributed hash table},
-	url = {www.icir.org/sylvia/thesis.ps},
+	www_section = {www.icir.org/sylvia/thesis.ps},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/can.pdf},
 	author = {Sylvia Paul Ratnasamy}
 }
@@ -13473,7 +13496,7 @@ We further investigate this intriguing proposal. Specifically, we
 	pages = {2002},
 	abstract = {This paper presents Scribe, a scalable application-level multicast infrastructure. Scribe supports large numbers of groups, with a potentially large number of members per group. Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet, and leverages Pastry{\textquoteright}s reliability, self-organization, and locality properties. Pastry is used to create and manage groups and to build efficient multicast trees for the dissemination of messages to each group. Scribe provides best-effort reliability guarantees, but we outline how an application can extend Scribe to provide stronger reliability. Simulation results, based on a realistic network topology model, show that Scribe scales across a wide range of groups and group sizes. Also, it balances the load on the nodes while achieving acceptable delay and link stress when compared to IP multicast},
 	keywords = {distributed hash table, multicast, Scribe},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.20.299\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.20.299\&rep=rep1\&type=pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/jsac.pdf},
 	author = {Miguel Castro and Peter Druschel and Anne-Marie Kermarrec and Antony Rowstron}
 }
@@ -13491,7 +13514,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {directory service, encryption, exclusive encryption, Windows},
 	isbn = {0-7695-1828-1},
 	doi = {http://dx.doi.org/10.1109/CSAC.2002.1176289},
-	url = {http://dl.acm.org/citation.cfm?id=784592.784803},
+	www_section = {http://dl.acm.org/citation.cfm?id=784592.784803},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ACSAC\%2702\%20-\%20A\%20secure\%20directory\%20service\%20based\%20on\%20exclusive\%20encryption.pdf},
 	author = {John R. Douceur and Adya, Atul and Benaloh, Josh and Bolosky, William J. and Yuval, Gideon}
 }
@@ -13508,7 +13531,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {P2P, resilient overlay network},
 	issn = {0163-5980},
 	doi = {10.1145/844128.844156},
-	url = {http://portal.acm.org/citation.cfm?id=844156$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=844156$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/osdi2002.pdf},
 	author = {Miguel Castro and Peter Druschel and Ganesh, Ayalvadi and Antony Rowstron and Dan S. Wallach}
 }
@@ -13519,7 +13542,7 @@ We further investigate this intriguing proposal. Specifically, we
 	pages = {113{\textendash}127},
 	abstract = {We consider routing security in wireless sensor networks. Many sensor network routing protocols have been proposed, but none of them have been designed with security as a goal. We propose security goals for routing in sensor networks, show how attacks against ad-hoc and peer-to-peer networks can be adapted into powerful attacks against sensor networks, introduce two classes of novel attacks against sensor networks --- sinkholes and HELLO floods, and analyze the security of all the major sensor network routing protocols. We describe crippling attacks against all of them and suggest countermeasures and design considerations. This is the first such analysis of secure routing in sensor networks},
 	keywords = {ad-hoc networks, P2P, sensor networks},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.4672},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.4672},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/sensor-route-security_0.pdf},
 	author = {Chris Karlof and David Wagner}
 }
@@ -13534,7 +13557,7 @@ We further investigate this intriguing proposal. Specifically, we
 	abstract = {Recent peer-to-peer research has focused on providing efficient hash lookup systems that can be used to build more complex systems. These systems have good properties when their algorithms are executed correctly but have not generally considered how to handle misbehaving nodes. This paper looks at what sorts of security problems are inherent in large peer-to-peer systems based on distributed hash lookup systems. We examine the types of problems that such systems might face, drawing examples from existing systems, and propose some design principles for detecting and preventing these problems},
 	keywords = {distributed hash table, P2P},
 	isbn = {3-540-44179-4},
-	url = {http://portal.acm.org/citation.cfm?id=687810$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=687810$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/173.pdf},
 	author = {Emil Sit and Robert Morris}
 }
@@ -13549,7 +13572,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {anonymity, anonymous credential system, digital signature},
 	isbn = {978-3-540-00420-2},
 	doi = {10.1007/3-540-36413-7},
-	url = {http://www.springerlink.com/content/r66ywt172y06g5qr/},
+	www_section = {http://www.springerlink.com/content/r66ywt172y06g5qr/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/camenisch2002ssep.pdf},
 	author = {Jan Camenisch and Anna Lysyanskaya}
 }
@@ -13560,7 +13583,7 @@ We further investigate this intriguing proposal. Specifically, we
 	abstract = {Distributed hash tables have recently become a useful building block for a variety of distributed applications. However, current schemes based upon consistent hashing require both considerable implementation complexity and substantial storage overhead to achieve desired load balancing goals. We argue in this paper that these goals can be achieved more simply and more cost-effectively. First, we suggest the direct application of the power of two choices paradigm, whereby an item is stored at the less loaded of two (or more) random alternatives. We then consider how associating a small constant number of hash values with a key can naturally be extended to support other load balancing strategies, including load-stealing or load-shedding, as well as providing natural fault-tolerance mechanisms},
 	keywords = {distributed hash table, load balancing},
 	doi = {10.1007/b11823},
-	url = {http://www.springerlink.com/content/r9r4qcqxc2bmfqmr/},
+	www_section = {http://www.springerlink.com/content/r9r4qcqxc2bmfqmr/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.12.277.pdf},
 	author = {Byers, John W. and Jeffrey Considine and Michael Mitzenmacher}
 }
@@ -13575,7 +13598,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {PGP, public key management, self-organization, small-world},
 	isbn = {1-58113-598-X},
 	doi = {10.1145/844102.844108},
-	url = {http://portal.acm.org/citation.cfm?id=844102.844108},
+	www_section = {http://portal.acm.org/citation.cfm?id=844102.844108},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.12.5408.pdf},
 	author = {Srdan Capkun and Levente Butty{\'a}n and Jean-Pierre Hubaux}
 }
@@ -13592,7 +13615,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {conflict detection, large-scale software development, merge conflicts, software merging},
 	issn = {0098-5589},
 	doi = {10.1109/TSE.2002.1000449},
-	url = {http://portal.acm.org/citation.cfm?id=567178$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=567178$\#$},
 	author = {Mens, Tom}
 }
 @conference {TrafHTTP,
@@ -13606,7 +13629,7 @@ We further investigate this intriguing proposal. Specifically, we
 	abstract = {Encryption is often proposed as a tool for protecting the privacy of World Wide Web browsing.However, encryption--particularly astypically implemented in, or in concert with popular Webbrowsers--does not hide all information about the encryptedplaintext.Specifically, HTTP object count and sizes are oftenrevealed (or at least incompletely concealed). We investigate theidentifiability of World Wide Web traffic based on this unconcealedinformation in a large sample of Web pages, and show that it sufficesto identify a significant fraction of them quite reliably.We also suggest some possible countermeasures against the exposure of this kind of information and experimentally evaluate their effectiveness},
 	keywords = {encryption, privacy},
 	isbn = {0-7695-1543-6},
-	url = {http://portal.acm.org/citation.cfm?id=830535},
+	www_section = {http://portal.acm.org/citation.cfm?id=830535},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tr-2002-23.pdf},
 	author = {Qixiang Sun and Daniel R. Simon and Yi-Min Wang and Wilf Russell and Venkata N. Padmanabhan and Lili Qiu}
 }
@@ -13614,7 +13637,7 @@ We further investigate this intriguing proposal. Specifically, we
 	title = {Statistically Unique and Cryptographically Verifiable (SUCV) Identifiers and Addresses},
 	year = {2002},
 	abstract = {This paper addresses the identifier ownership problem. It does so by using characteristics of Statistic Uniqueness and Cryptographic Verifiability (SUCV) of certain entities which this document calls SUCV Identifiers and Addresses. Their characteristics allow them to severely limit certain classes of denial of service attacks and hijacking attacks. SUCV addresses are particularly applicable to solve the address ownership problem that hinders mechanisms like Binding Updates in Mobile IPv6},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.1456},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.1456},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.16.1456.pdf},
 	author = {Gabriel Montenegro}
 }
@@ -13625,7 +13648,7 @@ We further investigate this intriguing proposal. Specifically, we
 	pages = {42{\textendash}57},
 	abstract = { Peer-to-peer (p2p) networking technologies have gained popularity as a mechanism for users to share files without the need for centralized servers. A p2p network provides a scalable and fault-tolerant mechanism to locate nodes anywhere on a network without maintaining a large amount of routing state. This allows for a variety of applications beyond simple file sharing. Examples include multicast systems, anonymous communications systems, and web caches. We survey security issues that occur in the underlying p2p routing protocols, as well as fairness and trust issues that occur in file sharing and other p2p applications. We discuss how techniques, ranging from cryptography, to random network probing, to economic incentives, can be used to address these problems},
 	keywords = {cryptography, P2P, routing, security policy},
-	url = {http://springerlink.metapress.com/openurl.asp?genre=article\&issn=0302-9743\&volume=2609\&spage=42},
+	www_section = {http://springerlink.metapress.com/openurl.asp?genre=article\&issn=0302-9743\&volume=2609\&spage=42},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.84.9197.pdf},
 	author = {Dan S. Wallach}
 }
@@ -13642,7 +13665,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {message logging, rollback-recovery},
 	issn = {0360-0300},
 	doi = {10.1145/568522.568525},
-	url = {http://portal.acm.org/citation.cfm?id=568522.568525$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=568522.568525$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CMU-CS-99-148.pdf},
 	author = {Mootaz Elnozahy and Lorenzo Alvisi and Yi-Min Wang and Johnson, David B.}
 }
@@ -13659,7 +13682,7 @@ We further investigate this intriguing proposal. Specifically, we
 	abstract = {Large-scale peer-to-peer systems face security threats from faulty or hostile remote computing elements. To resist these threats, many such systems employ redundancy. However, if a single faulty entity can present multiple identities, it can control a substantial fraction of the system, thereby undermining this redundancy. One approach to preventing these "Sybil attacks" is to have a trusted agency certify identities. This paper shows that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities},
 	keywords = {attack, peer-to-peer networking, security threat, Sybil attack},
 	isbn = {3-540-44179-4},
-	url = {http://dl.acm.org/citation.cfm?id=646334.687813},
+	www_section = {http://dl.acm.org/citation.cfm?id=646334.687813},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IPTPS\%2702\%20-\%20Douceur\%20-\%20The\%20Sybil\%20Attack.pdf},
 	author = {John R. Douceur}
 }
@@ -13675,7 +13698,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {fault-tolerance, overhead, P2P},
 	isbn = {1-58113-612-9},
 	doi = {10.1145/586110.586137},
-	url = {http://portal.acm.org/citation.cfm?id=586137},
+	www_section = {http://portal.acm.org/citation.cfm?id=586137},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tarzan-ccs02.pdf},
 	author = {Michael J. Freedman and Robert Morris}
 }
@@ -13693,7 +13716,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {PIR, privacy, security},
 	issn = {1931-0145},
 	doi = {10.1145/772862.772867},
-	url = {http://doi.acm.org/10.1145/772862.772867},
+	www_section = {http://doi.acm.org/10.1145/772862.772867},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGKDD\%20Explor.\%20Newsl.\%20-\%20Distributed\%20data\%20mining.pdf},
 	author = {Clifton, Chris and Kantarcioglu, Murat and Vaidya, Jaideep and Lin, Xiaodong and Zhu, Michael Y.}
 }
@@ -13706,7 +13729,7 @@ We further investigate this intriguing proposal. Specifically, we
 	publisher = {Springer-Verlag},
 	abstract = {In this paper we look closely at the popular metric of anonymity, the anonymity set, and point out a number of problems associated with it. We then propose an alternative information theoretic measure of anonymity which takes into account the probabilities of users sending and receiving the messages and show how to calculate it for a message in a standard mix-based anonymity system. We also use our metric to compare a pool mix to a traditional threshold mix, which was impossible using anonymity sets. We also show how the maximum route length restriction which exists in some fielded anonymity systems can lead to the attacker performing more powerful traffic analysis. Finally, we discuss open problems and future work on anonymity measurements},
 	isbn = {978-3-540-00565-0 },
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.12.5992\&rep=rep1\&type=url\&i=0},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.12.5992\&rep=rep1\&type=url\&i=0},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/set.dvi_.pdf},
 	author = {Andrei Serjantov and George Danezis}
 }
@@ -13721,7 +13744,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {anonymity measurement, traffic analysis},
 	isbn = {978-3-540-00565-0},
 	doi = {10.1007/3-540-36467-6},
-	url = {http://www.springerlink.com/content/wwe2c7g3hmwn0klf/},
+	www_section = {http://www.springerlink.com/content/wwe2c7g3hmwn0klf/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.12.5992.pdf},
 	author = {Andrei Serjantov and George Danezis},
 	editor = {Roger Dingledine and Paul Syverson}
@@ -13731,7 +13754,7 @@ We further investigate this intriguing proposal. Specifically, we
 	year = {2002},
 	publisher = {Springer-Verlag},
 	abstract = {This paper introduces an information theoretic model that allows to quantify the degree of anonymity provided by schemes for anonymous connections. It considers attackers that obtain probabilistic information about users. The degree is based on the probabilities an attacker, after observing the system, assigns to the dierent users of the system as being the originators of a message. As a proof of concept, the model is applied to some existing systems. The model is shown to be very useful for evaluating the level of privacy a system provides under various attack scenarios, for measuring the amount of information an attacker gets with a particular attack and for comparing dierent systems amongst each other},
-	url = {http://www.cosic.esat.kuleuven.be/publications/article-89.pdf},
+	www_section = {http://www.cosic.esat.kuleuven.be/publications/article-89.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/anonimity.pdf},
 	author = {Claudia Diaz and Stefaan Seys and Joris Claessens and Bart Preneel}
 }
@@ -13746,7 +13769,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {anonymity, attack, privacy},
 	isbn = {978-3-540-00565-0},
 	doi = {10.1007/3-540-36467-6},
-	url = {http://www.springerlink.com/content/3qb837jkpgukc6b5/},
+	www_section = {http://www.springerlink.com/content/3qb837jkpgukc6b5/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/article-89.pdf},
 	author = {Claudia Diaz and Stefaan Seys and Joris Claessens and Bart Preneel},
 	editor = {Roger Dingledine and Paul Syverson}
@@ -13763,7 +13786,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {border gateway protocol},
 	isbn = {1-58113-570-X},
 	doi = {10.1145/633025.633027},
-	url = {http://portal.acm.org/citation.cfm?id=633027$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=633027$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/bgpmisconfig.pdf},
 	author = {Mahajan, Ratul and Wetherall, David and Anderson, Thomas}
 }
@@ -13776,7 +13799,7 @@ We further investigate this intriguing proposal. Specifically, we
 	organization = {Springer-Verlag, LNCS 2482},
 	abstract = {The technique Private Information Retrieval (PIR) perfectly protects a user{\textquoteright}s access pattern to a database. An attacker cannot observe (or determine) which data element is requested by a user and so cannot deduce the interest of the user. We discuss the application of PIR on the World Wide Web and compare it to the MIX approach. We demonstrate particularly that in this context the method does not provide perfect security, and we give a mathematical model for the amount of information an attacker could obtain. We provide an extension of the method under which perfect security can still be achieved},
 	keywords = {private information retrieval},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.7678},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.7678},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PIR_Kesdogan.pdf},
 	author = {Dogan Kesdogan and Mark Borning and Michael Schmeink},
 	editor = {Roger Dingledine and Paul Syverson}
@@ -13792,7 +13815,7 @@ We further investigate this intriguing proposal. Specifically, we
 	abstract = {This paper describes a network storage system, called Venti, intended for archival data. In this system, a unique hash of a block{\textquoteright}s contents acts as the block identifier for read and write operations. This approach enforces a write-once policy, preventing accidental or malicious destruction of data. In addition, duplicate copies of a block can be coalesced, reducing the consumption of storage and simplifying the implementation of clients. Venti is a building block for constructing a variety of storage applications such as logical backup, physical backup, and snapshot file systems},
 	keywords = {backup, file systems, network storage},
 	isbn = {1-880446-03-0},
-	url = {http://portal.acm.org/citation.cfm?id=651321$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=651321$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/venti-fast.pdf},
 	author = {Quinlan, Sean and Dorward, Sean}
 }
@@ -13808,7 +13831,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {P2P},
 	isbn = {1-58113-485-1},
 	doi = {10.1145/571825.571857},
-	url = {http://portal.acm.org/citation.cfm?id=571857$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=571857$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/viceroy.pdf},
 	author = {Malkhi, Dahlia and Moni Naor and Ratajczak, David}
 }
@@ -13816,7 +13839,7 @@ We further investigate this intriguing proposal. Specifically, we
 	title = {On Algorithms for Efficient Data Migration},
 	year = {2001},
 	abstract = {The data migration problem is the problem of computing an efficient plan for moving data stored on devices in a network from one configuration to another. Load balancing or changing usage patterns could necessitate such a rearrangement of data. In this paper, we consider the case where the objects are fixed-size and the network is complete. The direct migration problem is closely related to edge-coloring. However, because there are space constraints on the devices, the problem is more complex. Our main results are polynomial time algorithms for finding a near-optimal migration plan in the presence of space constraints when a certain number of additional nodes is available as temporary storage, and a 3/2-approximation for the case where data must be migrated directly to its destination},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.1365\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.1365\&rep=rep1\&type=pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.26.1365.pdf},
 	author = {Joseph Hall and Jason D. Hartline and Anna R. Karlin and Jared Saia and John Wilkes}
 }
@@ -13826,7 +13849,7 @@ We further investigate this intriguing proposal. Specifically, we
 	year = {2001},
 	address = {San Diego, California},
 	abstract = {There have been a number of protocols proposed for anonymous network communication. In this paper we prove that when a particular initiator continues communication with a particular responder across path reformations, existing protocols are subject to attacks by corrupt group members that degrade the anonymity of each protocol over time. We use this result to place an upper bound on how long existing protocols including Crowds, Onion Routing, Hordes, and DC-Net, can maintain anonymity in the face of the attacks described. Our results show that fully-connected DC-Net is the most resilient to these attacks, but is subject to simple denial-of-service attacks. Additionally, we show how a variant of the attack allows attackers to setup other participants to falsely appear to be the initiator of a connection},
-	url = {http://freehaven.net/anonbib/cache/wright02.pdf},
+	www_section = {http://freehaven.net/anonbib/cache/wright02.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/wright02.pdf},
 	author = {Matthew Wright and Micah Adler and Brian Neil Levine and Clay Shields}
 }
@@ -13842,7 +13865,7 @@ We further investigate this intriguing proposal. Specifically, we
 	keywords = {CAN, mesh networks},
 	isbn = {3-540-42824-0},
 	doi = {10.1007/3-540-45546-9},
-	url = {http://www.springerlink.com/content/ahdgfj8yj9exqe03/},
+	www_section = {http://www.springerlink.com/content/ahdgfj8yj9exqe03/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/can-mcast.pdf},
 	author = {Sylvia Paul Ratnasamy and Handley, Mark and Richard Karp and S Shenker}
 }
@@ -13858,12 +13881,12 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
 	keywords = {privacy, pseudonym},
 	isbn = {978-3-540-42700-1},
 	doi = {10.1007/3-540-45472-1},
-	url = {http://portal.acm.org/citation.cfm?id=728483},
+	www_section = {http://portal.acm.org/citation.cfm?id=728483},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/gup.pdf},
 	author = {Stuart Stubblebine and Paul Syverson},
 	editor = {Yair Frankel}
 }
-@article {2001,
+@article {2001_0,
 	title = {Automated Negotiation: Prospects, Methods and Challenges},
 	journal = {Group Decision and Negociation},
 	volume = {10},
@@ -13888,7 +13911,7 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
 	keywords = {fault-tolerance, load balancing},
 	isbn = {1-58113-370-7},
 	doi = {10.1145/378344.378347},
-	url = {http://portal.acm.org/citation.cfm?id=378347$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=378347$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/bayeux.pdf},
 	author = {Shelley Zhuang and Ben Y. Zhao and Anthony D. Joseph and Katz, Randy H. and John Kubiatowicz}
 }
@@ -13899,7 +13922,7 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
 	year = {2001},
 	pages = {2003},
 	abstract = {Applies graph theory to anonymity. The paper suffers from the fundamental problem that it does not discuss attacks on the scheme, and there are a couple of pretty basic ways to break anonymity. Also, the scheme uses lots of traffic; some variants end up looking much like a pipenet },
-	url = {http://gecko.cs.purdue.edu/gnet/papers/BD.pdf  },
+	www_section = {http://gecko.cs.purdue.edu/gnet/papers/BD.pdf  },
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BD.pdf},
 	author = {Amos Beimel and Shlomi Dolev}
 }
@@ -13926,7 +13949,7 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
 	abstract = {Anonymity is critical for many networked applications. Yet current Internet protocols provide no support for masking the identity of communication endpoints. This paper outlines a design for a peer-to-peer, scalable, tamper-resilient communication protocol that provides strong anonymity and privacy. Called CliqueNet, our protocol provides an information-theoretic guarantee: an omnipotent adversary that can wiretap at any location in the network cannot determine the sender of a packet beyond a clique, that is, a set of k hosts, where k is an anonymizing factor chosen by the participants. CliqueNet is resilient to jamming by malicious hosts and can scale with the number of participants. This paper motivates the need for an anonymous communication layer and describes the self-organizing, novel divide-and-conquer approach that enables CliqueNet to scale while offering a strong anonymity guarantee. CliqueNet is widely applicable as a communication substrate for peer-to-peer applications that require anonymity, privacy and anti-censorship guarantees},
 	keywords = {anonymity, CliqueNet, DC-network},
 	issn = {TR2001},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.22.4785\&rep=rep1\&type=url\&i=0},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.22.4785\&rep=rep1\&type=url\&i=0},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cliquenet-iptp.pdf},
 	author = {Emin G{\"u}n Sirer and Milo Polte and Mark Robson}
 }
@@ -13936,7 +13959,7 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
 	year = {2001},
 	pages = {48{\textendash}62},
 	abstract = {The Farsite distributed file system stores multiple replicas of files on multiple machines, to provide file access even when some machines are unavailable. Farsite assigns file replicas to machines so as to maximally exploit the different degrees of availability of different machines, given an allowable replication factor R. We use competitive analysis and simulation to study the performance of three candidate hillclimbing replica placement strategies, MinMax, MinRand, and RandRand, each of which successively exchanges the locations of two file replicas. We show that the MinRand and RandRand strategies are perfectly competitive for R = 2 and 2/3-competitive for R = 3. For general R, MinRand is at least 1/2-competitive and RandRand is at least 10/17-competitive. The MinMax strategy is not competitive. Simulation results show better performance than the theoretic worst-case bounds},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.22.6802\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.22.6802\&rep=rep1\&type=pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/hill\%20climbing.pdf},
 	author = {John R. Douceur and Roger Wattenhofer}
 }
@@ -13946,7 +13969,7 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
 	pages = {107{\textendash}121},
 	abstract = {Countermeasures for node misbehavior and selfishness are mandatory requirements in MANET. Selfishness that causes lack of node activity cannot be solved by classical security means that aim at verifying the correctness and integrity of an operation. We suggest a generic mechanism based on reputation to enforce cooperation among the nodes of a MANET to prevent selfish behavior. Each network entity keeps track of other entities{\textquoteright} collaboration using a technique called reputation. The reputation is calculated based on various types of information on each entity{\textquoteright}s rate of collaboration. Since there is no incentive for a node to maliciously spread negative information about other nodes, simple denial of service attacks using the collaboration technique itself are prevented. The generic mechanism can be smoothly extended to basic network functions with little impact on existing protocols},
 	keywords = {ad-hoc networks},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.4100},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.4100},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/michpi-020801.pdf},
 	author = {Pietro Michiardi and Refik Molva}
 }
@@ -13965,11 +13988,11 @@ Given the above, a user seeking a certain level of security should take some mea
 In this paper, we propose a new cryptographic le system, which we call TCFS , as a suitable solution to the problem of privacy for distributed le system (see section 2.1). Our work improves on CFS by providing a deeper integration between the encryption service and the le system which results in a complete transparency of use to the user applications},
 	keywords = {crytographic file system, UNIX},
 	isbn = {1-880446-10-3},
-	url = {http://dl.acm.org/citation.cfm?id=647054.715628},
+	www_section = {http://dl.acm.org/citation.cfm?id=647054.715628},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FREENIX\%2701\%20-\%20A\%20transparent\%20cryptographic\%20file\%20system\%20for\%20UNIX.pdf},
 	author = {Cattaneo, Giuseppe and Catuogno, Luigi and Sorbo, Aniello Del and Persiano, Pino}
 }
-@article {2001,
+@article {2001_1,
 	title = {DVD COPY CONTROL ASSOCIATION vs. ANDREW BUNNER},
 	year = {2001}
 }
@@ -13993,7 +14016,7 @@ In this paper, we propose a new cryptographic le system, which we call TCFS , as
 	abstract = {In this paper, we propose a novel and efficient protocol for proving the correctness of a shuffle, without leaking how the shuffle was performed. Using this protocol, we can prove the correctness of a shuffle of n data with roughly 18n exponentiations, where as the protocol of Sako-Kilian[SK95] required 642n and that of Abe[Ab99] required 22n log n. The length of proof will be only 211 n bits in our protocol, opposed to 218 n bits and 214 n log n bits required by Sako-Kilian and Abe, respectively. The proposed protocol will be a building block of an efficient, universally verifiable mix-net, whose application to voting system is prominent},
 	isbn = {978-3-540-42456-7},
 	doi = {10.1007/3-540-44647-8},
-	url = {http://portal.acm.org/citation.cfm?id=704279},
+	www_section = {http://portal.acm.org/citation.cfm?id=704279},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PShuffle.pdf},
 	author = {Jun Furukawa and Kazue Sako},
 	editor = {Joe Kilian}
@@ -14008,7 +14031,7 @@ In this paper, we propose a new cryptographic le system, which we call TCFS , as
 	address = {London, UK},
 	abstract = {A credential system is a system in which users can obtain credentials from organizations and demonstrate possession of these credentials. Such a system is anonymous when transactions carried out by the same user cannot be linked. An anonymous credential system is of significant practical relevance because it is the best means of providing privacy for users. In this paper we propose a practical anonymous credential system that is based on the strong RSA assumption and the decisional Diffie-Hellman assumption modulo a safe prime product and is considerably superior to existing ones: 1 We give the first practical solution that allows a user to unlinkably demonstrate possession of a credential as many times as necessary without involving the issuing organization. 2 To prevent misuse of anonymity, our scheme is the first to offer optional anonymity revocation for particular transactions. 3 Our scheme offers separability: all organizations can choose their cryptographic keys independently of each other. Moreover, we suggest more effective means of preventing users from sharing their credentials, by introducing all-or-nothing sharing: a user who allows a friend to use one of her credentials once, gives him the ability to use all of her credentials, i.e., taking over her identity. This is implemented by a new primitive, called circular encryption, which is of independent interest, and can be realized from any semantically secure cryptosystem in the random oracle model},
 	isbn = {3-540-42070-3},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.9429},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.9429},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cl01a.pdf},
 	author = {Jan Camenisch and Anna Lysyanskaya}
 }
@@ -14023,7 +14046,7 @@ In this paper, we propose a new cryptographic le system, which we call TCFS , as
 	abstract = {In multicast communication, it is often required that feedback is received from a potentially very large group of responders while at the same time a feedback implosion needs to be pre- vented. To this end, a number of feedback control mechanisms have been proposed, which rely either on tree-based feedback aggregation or timer-based feedback suppression. Usually, these mechanisms assume that it is not necessary to discriminate be- tween feedback from different receivers. However, for many applications this is not the case and feedback from receivers with certain response values is preferred (e.g., highest loss or largest delay)},
 	keywords = {multicast},
 	isbn = {3-540-42824-0},
-	url = {http://portal.acm.org/citation.cfm?id=648089.747489$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=648089.747489$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Widmer2001g.pdf},
 	author = {J{\"o}rg Widmer and Thomas Fuhrmann}
 }
@@ -14038,7 +14061,7 @@ In this paper, we propose a new cryptographic le system, which we call TCFS , as
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Freedom_Security2-1.pdf},
 	author = {Adam Back and Ian Goldberg and Adam Shostack}
 }
-@conference {2001,
+@conference {2001_2,
 	title = {A Generalisation, a Simplification and Some Applications of Paillier{\textquoteright}s Probabilistic Public-Key System},
 	booktitle = {Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography},
 	year = {2001},
@@ -14051,7 +14074,7 @@ We construct a threshold variant of the generalised scheme as well as zero-knowl
 
 We then show how these building blocks can be used for applying the scheme to efficient electronic voting.This reduces dramatically the work needed to compute the final result of an election, compared to the previously best known schemes.W e show how the basic scheme for a yes/no vote can be easily adapted to casting a vote for up to t out of L candidates. The same basic building blocks can also be adapted to provide receipt-free elections, under appropriate physical assumptions. The scheme for 1 out of L elections can be optimised such that for a certain range of parameter values, a ballot has size only O(log L) bits},
 	isbn = {3-540-41658-7},
-	url = {http://dl.acm.org/citation.cfm?id=648118.746742},
+	www_section = {http://dl.acm.org/citation.cfm?id=648118.746742},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Generalisation2001Damgard.pdf},
 	author = {Damg\aard, Ivan and Jurik, Mats}
 }
@@ -14060,7 +14083,7 @@ We then show how these building blocks can be used for applying the scheme to ef
   author = {TODO},
 	year = {2001},
 	abstract = {A brief description of the gnutella protocol },
-	url = {http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf}
+	www_section = {http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf}
 }
 @conference {Cabrera01herald:achieving,
 	title = {Herald: Achieving a Global Event Notification Service},
@@ -14069,7 +14092,7 @@ We then show how these building blocks can be used for applying the scheme to ef
 	publisher = {IEEE Computer Society},
 	organization = {IEEE Computer Society},
 	abstract = {This paper presents the design philosophy and initial design decisions of Herald: a highly scalable global event notification system that is being designed and built at Microsoft Research. Herald is a distributed system designed to transparently scale in all respects, including numbers of subscribers and publishers, numbers of event subscription points, and event delivery rates. Event delivery can occur within a single machine, within a local network or Intranet, and throughout the Internet},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.20.672\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.20.672\&rep=rep1\&type=pdf},
 	author = {Luis Felipe Cabrera and Michael B. Jones and Marvin Theimer}
 }
 @article {Luby01improvedlow-density,
@@ -14082,7 +14105,7 @@ We then show how these building blocks can be used for applying the scheme to ef
 	keywords = {coding theory, low-density parity-check},
 	issn = {0018-9448 },
 	doi = {10.1109/18.910576 },
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.6057},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.6057},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/errorsIT.pdf},
 	author = {Luby, Michael and Michael Mitzenmacher and M. Amin Shokrollahi and Daniel A. Spielman}
 }
@@ -14113,7 +14136,7 @@ Our construction strictly improves upon previous constructions and resolves some
 	isbn = {978-3-540-42287-7},
 	issn = {0302-9743},
 	doi = {10.1007/3-540-48224-5},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.2796},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.2796},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/beimel01informationtheoretic.pdf},
 	author = {Amos Beimel and Yuval Ishai}
 }
@@ -14124,11 +14147,11 @@ Our construction strictly improves upon previous constructions and resolves some
 	pages = {2033{\textendash}2036},
 	abstract = {Pervasive micro-sensing and actuation may revolutionize the way in which we understand and manage complex physical systems: from airplane wings to complex ecosystems. The capabilities for detailed physical monitoring and manipulation offer enormous opportunities for almost every scientific discipline, and it will alter the feasible granularity of engineering},
 	keywords = {wireless sensor network},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.3027},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.3027},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.3.3027.pdf},
 	author = {Deborah Estrin and Gregory J. Pottie and L. Girod and Mani Srivastava}
 }
-@conference {2001,
+@conference {2001_3,
 	title = {Investigating the energy consumption of a wireless network interface in an ad hoc networking environment},
 	booktitle = { INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE },
 	year = {2001},
@@ -14138,7 +14161,7 @@ Our construction strictly improves upon previous constructions and resolves some
 	keywords = {ad-hoc networks, energy consumption, IEEE 802.11},
 	isbn = {0-7803-7016-3 },
 	doi = {10.1109/INFCOM.2001.916651  },
-	url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=916651},
+	www_section = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=916651},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/infocom01investigating.pdf},
 	author = {Feeney, Laura Marie and Nilsson, Martin}
 }
@@ -14154,11 +14177,11 @@ Our construction strictly improves upon previous constructions and resolves some
 	keywords = {file systems, workload characterization},
 	isbn = {1-58113-389-8},
 	doi = {10.1145/502034.502052},
-	url = {http://portal.acm.org/citation.cfm?id=502052$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=502052$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/lbfs.pdf},
 	author = {Muthitacharoen, Athicha and Chen, Benjie and David Mazi{\`e}res}
 }
-@book {2001,
+@book {2001_4,
 	title = {Multiparty Computation from Threshold Homomorphic Encryption},
 	booktitle = {Advances in Cryptology {\textemdash} EUROCRYPT 2001},
 	series = {Lecture Notes in Computer Science},
@@ -14170,7 +14193,7 @@ Our construction strictly improves upon previous constructions and resolves some
 	abstract = {We introduce a new approach to multiparty computation (MPC) basing it on homomorphic threshold crypto-systems. We show that given keys for any sufficiently efficient system of this type,general MPC protocols for n parties can be devised which are secure against an active adversary that corrupts any minority of the parties. The total number of bits broadcast is O(nk|C|),where k is the security parameter and |C| is the size of a (Boolean) circuit computing the function to be securely evaluated. An earlier proposal by Franklin and Haber with the same complexity was only secure for passive adversaries,while all earlier protocols with active security had complexity at least quadratic in n. We give two examples of threshold cryptosystems that can support our construction and lead to the claimed complexities},
 	isbn = {978-3-540-42070-5},
 	doi = {10.1007/3-540-44987-6_18},
-	url = {http://dx.doi.org/10.1007/3-540-44987-6_18},
+	www_section = {http://dx.doi.org/10.1007/3-540-44987-6_18},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/MultiPartyComputation2001Cramer.pdf},
 	author = {Cramer, Ronald and Damg{\'a}rd, Ivan and Nielsen, JesperB},
 	editor = {Pfitzmann, Birgit}
@@ -14184,7 +14207,7 @@ Our construction strictly improves upon previous constructions and resolves some
 	abstract = {We present a mix network that achieves efficient integration of public-key and symmetric-key operations. This hybrid mix network is capable of natural processing of arbitrarily long input elements, and is fast in both practical and asymptotic senses. While the overhead in the size of input elements is linear in the number of mix servers, it is quite small in practice. In contrast to previous hybrid constructions, ours has optimal robustness, that is, robustness against any minority coalition of malicious servers},
 	keywords = {mix, public key cryptography, robustness},
 	isbn = {1-58113-383-9},
-	url = {http://portal.acm.org/citation.cfm?id=383962.384046},
+	www_section = {http://portal.acm.org/citation.cfm?id=383962.384046},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.24.8205.pdf},
 	author = {Jakobsson, Markus and Ari Juels}
 }
@@ -14195,7 +14218,7 @@ Our construction strictly improves upon previous constructions and resolves some
 	pages = {75{\textendash}80},
 	abstract = {This paper sketches the design of PAST, a large-scale, Internet-based, global storage utility that provides scalability, high availability, persistence and security. PAST is a peer-to-peer Internet application and is entirely selforganizing. PAST nodes serve as access points for clients, participate in the routing of client requests, and contribute storage to the system. Nodes are not trusted, they may join the system at any time and may silently leave the system without warning. Yet, the system is able to provide strong assurances, efficient storage access, load balancing and scalability},
 	keywords = {peer-to-peer storage},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.1674},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.1674},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.1.1674.pdf},
 	author = {Peter Druschel and Antony Rowstron}
 }
@@ -14212,7 +14235,7 @@ storage, data sharing, group communication and naming. Each node in the Pastry n
 Pastry is completely decentralized, scalable, and self-organizing; it automatically adapts to the arrival, departure and failure of nodes. Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry{\textquoteright}s scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties},
 	keywords = {overlay networks, P2P},
 	isbn = {3-540-42800-3},
-	url = {http://portal.acm.org/citation.cfm?id=697650$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=697650$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pastry.pdf},
 	author = {Antony Rowstron and Peter Druschel}
 }
@@ -14234,7 +14257,7 @@ Work done in part while visiting Microsoft Research, Cambridge, UK},
 	keywords = {distributed hash table, Pastry},
 	isbn = {3-540-42800-3},
 	doi = {10.1007/3-540-45518-3_18},
-	url = {http://www.cs.rice.edu/~druschel/publications/Pastry.pdf},
+	www_section = {http://www.cs.rice.edu/~druschel/publications/Pastry.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Pastry.pdf},
 	author = {Antony Rowstron and Peter Druschel}
 }
@@ -14252,10 +14275,10 @@ Until now, Internet communities have been limited by the flat interactive qualit
 
 This compilation represents the collected wisdom of today{\textquoteright}s peer-to-peer luminaries. It includes contributions from Gnutella{\textquoteright}s Gene Kan, Freenet{\textquoteright}s Brandon Wiley, Jabber{\textquoteright}s Jeremie Miller, and many others -- plus serious discussions of topics ranging from accountability and trust to security and performance. Fraught with questions and promise, peer-to-peer is sure to remain on the computer industry{\textquoteright}s center stage for years to come},
 	isbn = {059600110X},
-	url = {http://portal.acm.org/citation.cfm?id=558412$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=558412$\#$},
 	editor = {Andy oram}
 }
-@book {2001,
+@book {2001_5,
 	title = {Peer-To-Peer: Harnessing the Power of Disruptive Technologies -- Chapter 12: Free Haven},
 	year = {2001},
 	publisher = {O{\textquoteright}Reilly Media},
@@ -14267,7 +14290,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
 @booklet {Chen01poblano:a,
 	title = {Poblano: A distributed trust model for peer-to-peer networks},
 	year = {2001},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.106.7489\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.106.7489\&rep=rep1\&type=pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.106.7489.pdf},
 	author = {Rita Chen and William Yeager}
 }
@@ -14276,14 +14299,14 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
 	year = {2001},
 	abstract = {In an effort to combine research in peer-to-peer systems with techniques for incremental backup systems, we propose pStore: a secure distributed backup system based on an adaptive peer-to-peer network. pStore exploits unused personal hard drive space attached to the Internet to provide the distributed redundancy needed for reliable and effective data backup. Experiments on a 30 node network show that 95\% of the files in a 13 MB dataset can be retrieved even when 7 of the nodes have failed. On top of this reliability, pStore includes support for file encryption, versioning, and secure sharing. Its custom versioning system permits arbitrary version retrieval similar to CVS. pStore provides this functionality at less than 10\% of the network bandwidth and requires 85\% less storage capacity than simpler local tape backup schemes for a representative workload},
 	keywords = {P2P, robustness},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.3444},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.3444},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.12.3444.pdf},
 	author = {Christopher Batten and Kenneth Barr and Arvind Saraf and Stanley Trepetin}
 }
 @booklet {Hubaux01thequest,
 	title = {The Quest for Security in Mobile Ad Hoc Networks},
 	year = {2001},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.130.6088\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.130.6088\&rep=rep1\&type=pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.130.6088.pdf},
 	author = {Jean-Pierre Hubaux and Levente Butty{\'a}n and Srdan Capkun}
 }
@@ -14299,7 +14322,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
 	keywords = {ad-hoc networks, routing},
 	isbn = {1-58113-428-2},
 	doi = {10.1145/501436.501437},
-	url = {http://portal.acm.org/citation.cfm?id=501437$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=501437$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Quest01.pdf},
 	author = {Jean-Pierre Hubaux and Levente Butty{\'a}n and Srdan Capkun}
 }
@@ -14314,7 +14337,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
 	abstract = {We present attacks on the anonymity and pseudonymity provided by a "lonely hearts" dating service and by the HushMail encrypted email system. We move on to discuss some generic attacks upon anonymous systems based on the engineering reality of these systems rather than the theoretical foundations on which they are based. However, for less sophisticated users it is social engineering attacks, owing nothing to computer science, that pose the biggest day-to-day danger. This practical experience then permits a start to be made on developing a security policy model for pseudonymous communications},
 	keywords = {pseudonym, security policy},
 	isbn = {3-540-42733-3},
-	url = {http://portal.acm.org/citation.cfm?id=731864},
+	www_section = {http://portal.acm.org/citation.cfm?id=731864},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Patterns_of_Failure.pdf},
 	author = {Richard Clayton and George Danezis and Markus G. Kuhn},
 	editor = {Ira S. Moskowitz}
@@ -14323,7 +14346,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
 	title = {A Reputation System to Increase MIX-net Reliability},
 	year = {2001},
 	abstract = {We describe a design for a reputation system that increases the reliability and thus efficiency of remailer services. Our reputation system uses a MIX-net in which MIXes give receipts for intermediate messages. Together with a set of witnesses, these receipts allow senders to verify the correctness of each MIX and prove misbehavior to the witnesses},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.19.7912\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.19.7912\&rep=rep1\&type=pdf},
 	author = {Roger Dingledine and Michael J. Freedman and David Hopwood and David Molnar}
 }
 @conference {mix-acc,
@@ -14338,7 +14361,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
 	keywords = {remailer},
 	isbn = {978-3-540-42733-9},
 	doi = {10.1007/3-540-45496-9},
-	url = {http://www.springerlink.com/content/ej8qv86wdkeukjc5/},
+	www_section = {http://www.springerlink.com/content/ej8qv86wdkeukjc5/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mix-acc.pdf},
 	author = {Roger Dingledine and Michael J. Freedman and David Hopwood and David Molnar},
 	editor = {Ira S. Moskowitz}
@@ -14356,7 +14379,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
 	keywords = {resilient overlay network},
 	issn = {0163-5980},
 	doi = {10.1145/502059.502048},
-	url = {http://portal.acm.org/citation.cfm?id=502059.502048$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=502059.502048$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ron-sosp2001.pdf},
 	author = {Andersen, David and Hari Balakrishnan and Frans M. Kaashoek and Robert Morris}
 }
@@ -14368,7 +14391,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
 	abstract = {Data transfer over TCP/IP provides no privacy for network users. Previous research in anonymity has focused on the provision of initiator anonymity. We explore methods of adapting existing initiator-anonymous protocols to provide responder anonymity and mutual anonymity. We present Anonymous Peer-to-peer File Sharing (APFS) protocols, which provide mutual anonymity for peer-topeer le sharing. APFS addresses the problem of longlived Internet services that may outlive the degradation present in current anonymous protocols. One variant of APFS makes use of unicast communication, but requires a central coordinator to bootstrap the protocol. A second variant takes advantage of multicast routing to remove the need for any central coordination point. We compare the TCP performance of APFS protocol to existing overt le sharing systems such as Napster. In providing anonymity, APFS can double transfer times and requires that additional trac be carried by peers, but this overhead is constant with the size of the session. 1},
 	keywords = {anonymity, APFS, multicast},
 	isbn = {0-7695-1429-4 },
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.20.7821\&rep=rep1\&type=url\&i=0},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.20.7821\&rep=rep1\&type=url\&i=0},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/APFS.pdf},
 	author = {Vincent Scarlata and Brian Neil Levine and Clay Shields}
 }
@@ -14384,7 +14407,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
 	keywords = {CAN, fault-tolerance, robustness},
 	isbn = {1-58113-411-8},
 	doi = {10.1145/383059.383072},
-	url = {http://portal.acm.org/citation.cfm?id=383072$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=383072$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.19.8434.pdf},
 	author = {Sylvia Paul Ratnasamy and Paul Francis and Handley, Mark and Richard Karp and S Shenker}
 }
@@ -14409,7 +14432,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
 	abstract = {We consider the problems of societal norms for cooperation and reputation when it is possible to obtain cheap pseudonyms, something that is becoming quite common in a wide variety of interactions on the Internet. This introduces opportunities to misbehave without paying reputational consequences. A large degree of cooperation can still emerge, through a convention in which newcomers "pay their dues" by accepting poor treatment from players who have established positive reputations. One might hope for an open society where newcomers are treated well, but there is an inherent social cost in making the spread of reputations optional. We prove that no equilibrium can sustain significantly more cooperation than the dues-paying equilibrium in a repeated random matching game with a large number of players in which players have finite lives and the ability to change their identities, and there is a small but nonvanishing probability of mistakes. Although one could remove the inefficiency of mistreating newcomers by disallowing anonymity, this is not practical or desirable in a wide variety of transactions. We discuss the use of entry fees, which permits newcomers to be trusted but excludes some players with low payoffs, thus introducing a different inefficiency. We also discuss the use of free but unreplaceable pseudonyms, and describe a mechanism that implements them using standard encryption techniques, which could be practically implemented in electronic transactions},
 	keywords = {pseudonym},
 	doi = {10.1111/j.1430-9134.2001.00173.x},
-	url = {http://www3.interscience.wiley.com/journal/119023370/abstract?CRETRY=1\&SRETRY=0},
+	www_section = {http://www3.interscience.wiley.com/journal/119023370/abstract?CRETRY=1\&SRETRY=0},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/081199.pdf},
 	author = {Eric Friedman and Paul Resnick}
 }
@@ -14424,7 +14447,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
 	keywords = {anonymity service, distributed name-space, pseudonym},
 	isbn = {978-3-540-42733-9},
 	doi = {10.1007/3-540-45496-9},
-	url = {http://portal.acm.org/citation.cfm?id=731726},
+	www_section = {http://portal.acm.org/citation.cfm?id=731726},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/strong-eternity.pdf},
 	author = {Tonda Benes},
 	editor = {Ira S. Moskowitz}
@@ -14435,7 +14458,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
 	year = {2001},
 	pages = {126{\textendash}135},
 	abstract = {The basic idea is to protect documents by making it impossible to remove one document from the system without loosing others. The underlying assumption that the adversary cares about collateral damage of this kind is a bit far fetched. Also, the entanglement doubles the amount of data that needs to be moved to retrieve a document},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.24.3781\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.24.3781\&rep=rep1\&type=pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tangler.pdf},
 	author = {Marc Waldman and David Mazi{\`e}res}
 }
@@ -14449,7 +14472,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
 	keywords = {censorship resistance, host-independent, self-policing network},
 	isbn = {1-58113-385-5},
 	doi = {10.1145/501983.502002},
-	url = {http://portal.acm.org/citation.cfm?id=501983.502002\&coll=GUIDE\&dl=GUIDE\&type=series\&idx=SERIES320\&part=series\&WantType=Proceedings\&title=CCS\&CFID=75729899\&CFTOKEN=36385677},
+	www_section = {http://portal.acm.org/citation.cfm?id=501983.502002\&coll=GUIDE\&dl=GUIDE\&type=series\&idx=SERIES320\&part=series\&WantType=Proceedings\&title=CCS\&CFID=75729899\&CFTOKEN=36385677},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.24.3781.pdf},
 	author = {Marc Waldman and David Mazi{\`e}res}
 }
@@ -14457,11 +14480,11 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
 	title = {Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing},
 	year = {2001},
 	abstract = {In today{\textquoteright}s chaotic network, data and services are mobile and replicated widely for availability, durability, and locality. Components{\textquoteright} within this infrastructure interact in rich and complex ways, greatly stressing traditional approaches to name service and routing. This paper explores an alternative to traditional approaches called Tapestry. Tapestry is an overlay location and routing infrastructure that provides location-independent routing of messages directly to the closest copy of an object or service using only point-to-point links and without centralized resources. The routing and directory information within this{\textquoteright} infrastructure is purely soft state and easily repaired. Tapestry is self-administering, fault-tolerant, and resilient under load. This paper presents{\textquoteright} the architecture and algorithms of Tapestry and explores their advantages through a number of experiments},
-	url = {http://portal.acm.org/citation.cfm?id=894116$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=894116$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CSD-01-1141.pdf},
 	author = {Ben Y. Zhao and Ben Y. Zhao and John Kubiatowicz and John Kubiatowicz and Anthony D. Joseph and Anthony D. Joseph}
 }
-@book {2001,
+@book {2001_6,
 	title = {The Theory of Incentives: The Principal-Agent Model},
 	year = {2001},
 	pages = {360},
@@ -14473,7 +14496,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
 This book focuses on the principal-agent model, the "simple" situation where a principal, or company, delegates a task to a single agent through a contract--the essence of management and contract theory. How does the owner or manager of a firm align the objectives of its various members to maximize profits? Following a brief historical overview showing how the problem of incentives has come to the fore in the past two centuries, the authors devote the bulk of their work to exploring principal-agent models and various extensions thereof in light of three types of information problems: adverse selection, moral hazard, and non-verifiability. Offering an unprecedented look at a subject vital to industrial organization, labor economics, and behavioral economics, this book is set to become the definitive resource for students, researchers, and others who might find themselves pondering what contracts, and the incentives they embody, are really all about},
 	keywords = {economics, principal-agent model},
 	isbn = {9780691091846},
-	url = {http://press.princeton.edu/chapters/i7311.html},
+	www_section = {http://press.princeton.edu/chapters/i7311.html},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Laffont\%20\%26\%20Martimort\%20-\%20The\%20Theory\%20of\%20Incentives.pdf},
 	author = {Jean-Jacques Laffont and David Martimort}
 }
@@ -14489,7 +14512,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	keywords = {anonymity, Freedom, latency, Pipenet},
 	isbn = {978-3-540-42733-9},
 	doi = {10.1007/3-540-45496-9},
-	url = {http://www.springerlink.com/content/4gpwtejkkvadcdcm/},
+	www_section = {http://www.springerlink.com/content/4gpwtejkkvadcdcm/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/traffic_0.pdf},
 	author = {Adam Back and Ulf M{\"o}ller and Anton Stiglic},
 	editor = {Ira S. Moskowitz}
@@ -14506,7 +14529,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	keywords = {discrete logarithm, multi-authority},
 	isbn = {1-58113-385-5},
 	doi = {10.1145/501983.502000},
-	url = {http://portal.acm.org/citation.cfm?id=502000},
+	www_section = {http://portal.acm.org/citation.cfm?id=502000},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/shuffle-ccs01.pdf},
 	author = {Andrew C. Neff},
 	editor = {Pierangela Samarati}
@@ -14515,7 +14538,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	title = {The Vesta Approach to Software Configuration Management},
 	year = {2001},
 	abstract = {Vesta is a system for software configuration management. It stores collections of source files, keeps track of which versions of which files go together, and automates the process of building a complete software artifact from its component pieces. Vesta{\textquoteright}s novel approach gives it three important properties. First, every build is repeatable, because its component sources and build tools are stored immutably and immortally, and its configuration description completely specifies what components and tools are used and how they are put together. Second, every build is incremental, because results of previous builds are cached and reused. Third, every build is consistent, because all build dependencies are automatically captured and recorded, so that a cached result from a previous build is reused only when doing so is certain to be correct. In addition, Vesta{\textquoteright}s flexible language for writing configuration descriptions makes it easy to describe large software configurations in a modular fashion and to create variant configurations by customizing build parameters. This paper gives a brief overview of Vesta, outlining Vesta{\textquoteright}s advantages over traditional tools, how those benefits are achieved, and the system{\textquoteright}s overall performance},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.7370},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.7370},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SRC-RR-168.pdf},
 	author = {Allan Heydon and Roy Levin and Timothy Mann and Yuan Yu}
 }
@@ -14531,7 +14554,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	keywords = {P2P},
 	isbn = {1-58113-389-8},
 	doi = {10.1145/502034.502054},
-	url = {http://portal.acm.org/citation.cfm?id=502054$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=502054$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cfs_sosp.pdf},
 	author = {Dabek, Frank and Frans M. Kaashoek and David Karger and Robert Morris and Ion Stoica}
 }
@@ -14541,7 +14564,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	year = {2000},
 	pages = {176{\textendash}181},
 	abstract = {Gnutella represents a new wave of peer-to-peer applications providing distributed discovery and sharing of resources across the Internet. Gnutella is distinguished by its support for anonymity and by its decentralized architecture. The current Gnutella architecture and protocol have numerous flaws with respect to efficiency, anonymity, and vulnerability to malicious actions. An alternative design is described that provides Gnutella-like functionality but removes or mitigates many of Gnutella{\textquoteright}s flaws. This design, referred to as Query/Advertise (Q/A) is based upon a scalable publish/subscribe middleware system called Sienab. A prototype implementation of Q/A is described. The relative benefits of this approach are discussed, and a number of open research problems are identified with respect to Q/A systems},
-	url = {http://serl.cs.colorado.edu/~serl/papers/CU-CS-909-00.pdf},
+	www_section = {http://serl.cs.colorado.edu/~serl/papers/CU-CS-909-00.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CU-CS-909-00.pdf},
 	author = {Dennis Heimbigner}
 }
@@ -14550,7 +14573,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	year = {2000},
 	month = {July},
 	abstract = {Based on the nomenclature of the early papers in the field, we propose a terminology which is both expressive and precise. More particularly, we define anonymity, unlinkability, unobservability, pseudonymity (pseudonyms and digital pseudonyms, and their attributes), and identity management. In addition, we describe the relationships between these terms, give a rational why we define them as we do, and sketch the main mechanisms to provide for the properties defined},
-	url = {http://dud.inf.tu-dresden.de/Anon_Terminology.shtml},
+	www_section = {http://dud.inf.tu-dresden.de/Anon_Terminology.shtml},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/terminology.pdf},
 	author = {Andreas Pfitzmann and Marit Hansen}
 }
@@ -14570,7 +14593,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	abstract = {AMIX net takes a list of ciphertexts (c 1,... , c N) and outputs a permuted list of the plaintexts (m 1,... ,m N) without revealing the relationship between (c 1,... , c N) and (m 1,... ,m N). This paper shows that the Jakobsson{\textquoteright}s flash MIX of PODC{\textquoteright}99, which was believed to be the most efficient robust MIX net, is broken. The first MIX server can prevent computing the correct output with probability 1 in our attack. We also present a countermeasure for our attack},
 	isbn = {3-540-41404-5},
 	doi = {10.1007/3-540-44448-3_15},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.6972},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.6972},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.20.6972.pdf},
 	author = {Masashi Mitomo and Kaoru Kurosawa}
 }
@@ -14584,7 +14607,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	organization = {USENIX},
 	abstract = {One of the core challenges facing the Internet today is the problem of ensuring privacy for its users. It is believed that mechanisms such as anonymity and pseudonymity are essential building blocks in formulating solutions to address these challenges and considerable effort has been devoted towards realizing these primitives in practice. The focus of this effort, however, has mostly been on hiding explicit identify information (such as source addresses) by employing a combination of anonymizing proxies, cryptographic techniques to distribute trust among them and traffic shaping techniques to defeat traffic analysis. We claim that such approaches ignore a significant amount of identifying information about the source that leaks from the contents of web traffic itself. In this paper, we demonstrate the significance and value of such information by showing how techniques from linguistics and stylometry can use this information to compromise pseudonymity in several important settings. We discuss the severity of this problem and suggest possible countermeasures},
 	keywords = {anonymity, pseudonym},
-	url = {http://portal.acm.org/citation.cfm?id=1251313},
+	www_section = {http://portal.acm.org/citation.cfm?id=1251313},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/rao.pdf},
 	author = {Josyula R. Rao and Pankaj Rohatgi}
 }
@@ -14601,7 +14624,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	keywords = {multicast},
 	isbn = {1-58113-194-1},
 	doi = {10.1145/339331.339337},
-	url = {http://portal.acm.org/citation.cfm?id=339337$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=339337$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/jsac-2001.pdf},
 	author = {Chu, Yang-hua and Rao, Sanjay G. and Zhang, Hui}
 }
@@ -14616,7 +14639,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	abstract = {There are different methods to build an anonymity service using MIXes. A substantial decision for doing so is the method of choosing the MIX route. In this paper we compare two special configurations: a fixed MIX route used by all participants and a network of freely usable MIXes where each participant chooses his own route. The advantages and disadvantages in respect to the freedom of choice are presented and examined. We{\textquoteright}ll show that some additional attacks are possible in networks with freely chosen MIX routes. After describing these attacks, we estimate their impact on the achievable degree of anonymity. Finally, we evaluate the relevance of the described attacks with respect to existing systems like e.g. Mixmaster, Crowds, and Freedom},
 	keywords = {anonymity, attack},
 	isbn = {3-540-41724-9},
-	url = {http://portal.acm.org/citation.cfm?id=371975},
+	www_section = {http://portal.acm.org/citation.cfm?id=371975},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/disad-free-routes.pdf},
 	author = {Oliver Berthold and Andreas Pfitzmann and Ronny Standtke}
 }
@@ -14631,7 +14654,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	abstract = {Wireless distributed micro-sensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks.Based on our findings that the conventional protocols of direct transmission, minimum-transmission-energy, multihop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster base stations (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic net-works, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show that LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional routing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated},
 	keywords = {Low-Energy Adaptive Clustering Hierarchy, mobile Ad-hoc networks, routing, wireless sensor network},
 	isbn = {0-7695-0493-0},
-	url = {http://portal.acm.org/citation.cfm?id=820485$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=820485$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.90.8499.pdf},
 	author = {Heinzelman, Wendi Rabiner and Chandrakasan, Anantha and Hari Balakrishnan}
 }
@@ -14646,7 +14669,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	abstract = {In this paper, we address the problem of service availability in mobile ad-hoc WANs. We present a secure mechanism to stimulate end users to keep their devices turned on, to refrain from overloading the network, and to thwart tampering aimed at converting the device into a "selfish" one. Our solution is based on the application of a tamper resistant security module in each device and cryptographic protection of messages},
 	keywords = {ad-hoc networks, cryptography},
 	isbn = {0-7803-6534-8},
-	url = {http://portal.acm.org/citation.cfm?id=514164},
+	www_section = {http://portal.acm.org/citation.cfm?id=514164},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.84.5715.pdf},
 	author = {Levente Butty{\'a}n and Jean-Pierre Hubaux}
 }
@@ -14663,7 +14686,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	keywords = {analytical modeling, availability, feasibility analysis, personal computer usage data, reliability, serverless distributed file system architecture, trust, workload characterization},
 	issn = {0163-5999},
 	doi = {10.1145/345063.339345},
-	url = {http://portal.acm.org/citation.cfm?id=345063.339345$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=345063.339345$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.65.4280_0.pdf},
 	author = {Bolosky, William J. and John R. Douceur and Ely, David and Marvin Theimer}
 }
@@ -14674,7 +14697,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	pages = {71{\textendash}78},
 	abstract = {In this paper, we present a novel routing protocol for wireless ad hoc networks -- Fisheye State Routing (FSR). FSR introduces the notion of multi-level fisheye scope to reduce routing update overhead in large networks. Nodes exchange link state entries with their neighbors with a frequency which depends on distance to destination. From link state entries, nodes construct the topology map of the entire network and compute optimal routes. Simulation experiments show that FSR is simple, efficient and scalable routing solution in a mobile, ad hoc environment. 1 Introduction As the wireless and embedded computing technologies continue to advance, increasing numbers of small size and high performance computing and communication devices will be capable of tetherless communications and ad hoc wireless networking. An ad hoc wireless network is a selforganizing and self-configuring network with the capability of rapid deployment in response to application needs},
 	keywords = {mobile Ad-hoc networks},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.6730},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.6730},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/05_75_fisheye-state-routing-in_0.pdf},
 	author = {Guangyu Pei and Mario Gerla and Tsu-Wei Chen}
 }
@@ -14689,7 +14712,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	keywords = {accountability, anonymity, anonymous publishing},
 	isbn = {978-3-540-41724-8},
 	doi = {10.1007/3-540-44702-4},
-	url = {http://www.springerlink.com/content/uh3mbw5m6u6xt24v/},
+	www_section = {http://www.springerlink.com/content/uh3mbw5m6u6xt24v/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/freehaven_pres.pdf},
 	author = {Roger Dingledine and Michael J. Freedman and David Molnar}
 }
@@ -14703,7 +14726,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/freedom2-arch.pdf},
 	author = {Philippe Boucher and Adam Shostack and Ian Goldberg}
 }
-@conference {Clarke00freenet:a,
+@conference {Clarke00freenet:a_0,
 	title = {Freenet: A Distributed Anonymous Information Storage and Retrieval System},
 	booktitle = {Designing Privacy Enhancing Technologies, International Workshop on Design Issues in Anonymity and Unobservability, ,, Proceedings 2001},
 	year = {2000},
@@ -14711,7 +14734,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	pages = {46{\textendash}66},
 	address = {Berkeley, CA, USA},
 	abstract = {We describe Freenet, an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity of both authors and readers. Freenet operates as a network of identical nodes that collectively pool their storage space to store data files and cooperate to route requests to the most likely physical location of data. No broadcast search or centralized location index is employed. Files are referred to in a location-independent manner, and are dynamically replicated in locations near requestors and deleted from locations where there is no interest. It is infeasible to discover the true origin or destination of a file passing through the network, and di$\#$cult for a node operator to determine or be held responsible for the actual physical contents of her own node},
-	url = {http://www.ecse.rpi.edu/Homepages/shivkuma/teaching/sp2001/readings/freenet.pdf},
+	www_section = {http://www.ecse.rpi.edu/Homepages/shivkuma/teaching/sp2001/readings/freenet.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/freenet.pdf},
 	author = {Ian Clarke and Sandberg, Oskar and Brandon Wiley and Theodore W. Hong}
 }
@@ -14723,7 +14746,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	pages = {46{\textendash}66},
 	abstract = {We describe Freenet, an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity of both authors and readers. Freenet operates as a network of identical nodes that collectively pool their storage space to store data files and cooperate to route requests to the most likely physical location of data. No broadcast search or centralized location index is employed. Files are referred to in a location-independent manner, and are dynamically replicated in locations near requestors and deleted from locations where there is no interest. It is infeasible to discover the true origin or destination of a file passing through the network, and di$\#$cult for a node operator to determine or be held responsible for the actual physical contents of her own node},
 	keywords = {anonymity, Freenet, P2P},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.4919},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.4919},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.10.4919_0.pdf},
 	author = {Ian Clarke and Sandberg, Oskar and Brandon Wiley and Theodore W. Hong}
 }
@@ -14733,7 +14756,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
 	pages = {46{\textendash}66},
 	abstract = {We describe Freenet, an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity of both authors and readers. Freenet operates as a network of identical nodes that collectively pool their storage space to store data files and cooperate to route requests to the most likely physical location of data. No broadcast search or centralized location index is employed. Files are referred to in a location-independent manner, and are dynamically replicated in locations near requestors and deleted from locations where there is no interest. It is infeasible to discover the true origin or destination of a file passing through the network, and di$\#$cult for a node operator to determine or be held responsible for the actual physical contents of her own node},
 	keywords = {Freenet, P2P},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.4919},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.4919},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.10.4919.pdf},
 	author = {Ian Clarke and Sandberg, Oskar and Brandon Wiley and Theodore W. Hong}
 }
@@ -14748,7 +14771,7 @@ A part of this research was done while the author visited the Tokyo Institute of
 	keywords = {existential-honesty, limited-open-verification, mix},
 	isbn = {978-3-540-67517-4},
 	doi = {10.1007/3-540-45539-6},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.1814},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.1814},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.29.1814.pdf},
 	author = {Yvo Desmedt and Kaoru Kurosawa}
 }
@@ -14762,7 +14785,7 @@ A part of this research was done while the author visited the Tokyo Institute of
 	keywords = {hybrid encryption, mix},
 	isbn = {3-540-41404-5},
 	doi = {10.1007/3-540-44448-3_14},
-	url = {http://portal.acm.org/citation.cfm?id=647096.716874},
+	www_section = {http://portal.acm.org/citation.cfm?id=647096.716874},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.87.7718.pdf},
 	author = {Miyako Ohkubo and Masayuki Abe}
 }
@@ -14777,7 +14800,7 @@ A part of this research was done while the author visited the Tokyo Institute of
 	abstract = {OceanStore is a utility infrastructure designed to span the globe and provide continuous access to persistent information. Since this infrastructure is comprised of untrusted servers, data is protected through redundancy and cryptographic techniques. To improve performance, data is allowed to be cached anywhere, anytime. Additionally, monitoring of usage patterns allows adaptation to regional outages and denial of service attacks; monitoring also enhances performance through pro-active movement of data. A prototype implementation is currently under development},
 	isbn = {1-58113-317-0},
 	doi = {10.1145/378993.379239},
-	url = {http://doi.acm.org/10.1145/378993.379239},
+	www_section = {http://doi.acm.org/10.1145/378993.379239},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p190-kubi.pdf},
 	author = {John Kubiatowicz and Bindel, David and Chen, Yan and Czerwinski, Steven and Eaton, Patrick and Geels, Dennis and Gummadi, Ramakrishna and Rhea, Sean C. and Weatherspoon, Hakim and Wells, Chris and Ben Y. Zhao}
 }
@@ -14791,7 +14814,7 @@ A part of this research was done while the author visited the Tokyo Institute of
 	organization = {IEEE CS Press},
 	abstract = {Onion Routing is an infrastructure for private communication over a public network. It provides anonymous connections that are strongly resistant to both eavesdropping and traffic analysis. Thus it hides not only the data being sent, but who is talking to whom. Onion Routing{\textquoteright}s anonymous connections are bidirectional and near real-time, and can be used anywhere a socket connection can be used. Proxy aware applications, such as web browsing and e-mail, require no modification to use Onion Routing, and do so through a series of proxies. Other applications, such as remote login, can also use the system without modification. Access to an onion routing network can be configured in a variety of ways depending on the needs, policies, and facilities of those connecting. This paper describes some of these access configurations and also provides a basic overview of Onion Routing and comparisons with related work},
 	keywords = {anonymity, privacy, traffic analysis},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4633},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4633},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/onion-discex00.pdf},
 	author = {Paul Syverson and Michael Reed and David Goldschlag}
 }
@@ -14811,7 +14834,7 @@ Overcast provides scalable and reliable single-source multicast using a simple p
 
 Results based on simulations confirm that Overcast provides its added functionality while performing competitively with IP Multicast. Simulations indicate that Overcast quickly builds bandwidth-efficient distribution trees that, compared to IP Multicast, provide 70\%-100\% of the total bandwidth possible, at a cost of somewhat less than twice the network load. In addition, Overcast adapts quickly to changes caused by the addition of new nodes or the failure of existing nodes without causing undue load on the multicast source},
 	keywords = {overcast, overlay network},
-	url = {http://dl.acm.org/citation.cfm?id=1251229.1251243},
+	www_section = {http://dl.acm.org/citation.cfm?id=1251229.1251243},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/OSDI\%2700\%20-\%20Overcast.pdf},
 	author = {Jannotti, John and Gifford, David K. and Johnson, Kirk L. and Frans M. Kaashoek and O{\textquoteright}Toole Jr., James W.}
 }
@@ -14835,7 +14858,7 @@ Results based on simulations confirm that Overcast provides its added functional
 	organization = {ACM Press},
 	abstract = {This paper presents a new protocol for initiator anonymity called Hordes, which uses forwarding mechanisms similar to those used in previous protocols for sending data, but is the first protocol to make use of the anonymity inherent in multicast routing to receive data. We show this results in shorter transmission latencies and requires less work of the protocol participants, in terms of the messages processed. We also present a comparison of the security and anonymity of Hordes with previous protocols, using the first quantitative definition of anonymity and unlinkability. Our analysis shows that Hordes provides anonymity in a degree similar to that of Crowds and Onion Routing, but also that Hordes has numerous performance advantages},
 	keywords = {Hordes, multicast},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.37.3890\&rep=rep1\&type=url\&i=0},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.37.3890\&rep=rep1\&type=url\&i=0},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/hordes-final-all.dvi_.pdf},
 	author = {Clay Shields and Brian Neil Levine}
 }
@@ -14848,7 +14871,7 @@ Results based on simulations confirm that Overcast provides its added functional
 	abstract = {A Pseudonymous Communications Infrastructure for the Internet by Ian Avrum Goldberg Doctor of Philosophy in Computer Science University of California at Berkeley Professor Eric Brewer, Chair As more and more of people{\textquoteright}s everyday activities are being conducted online, there is an ever-increasing threat to personal privacy. Every communicative or commercial transaction you perform online reveals bits of information about you that can be compiled into large dossiers, often without your permission, or even your knowledge},
 	keywords = {pseudonym},
 	isbn = {0-493-10500-X},
-	url = {http://portal.acm.org/citation.cfm?id=933285},
+	www_section = {http://portal.acm.org/citation.cfm?id=933285},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.5.3353.pdf},
 	author = {Ian Goldberg}
 }
@@ -14859,7 +14882,7 @@ Results based on simulations confirm that Overcast provides its added functional
 	month = {August},
 	pages = {59{\textendash}72},
 	abstract = {We describe a system that we have designed and implemented for publishing content on the web. Our publishing scheme has the property that it is very difficult for any adversary to censor or modify the content. In addition, the identity of the publisher is protected once the content is posted. Our system differs from others in that we provide tools for updating or deleting the published content, and users can browse the content in the normal point and click manner using a standard web browser and a client-side proxy that we provide. All of our code is freely available},
-	url = {http://portal.acm.org/citation.cfm?id=1251311},
+	www_section = {http://portal.acm.org/citation.cfm?id=1251311},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/publius.pdf},
 	author = {Marc Waldman and Aviel D. Rubin and Lorrie Cranor}
 }
@@ -14875,7 +14898,7 @@ Results based on simulations confirm that Overcast provides its added functional
 	keywords = {reputation systems},
 	issn = {0001-0782},
 	doi = {http://doi.acm.org/10.1145/355112.355122},
-	url = {http://doi.acm.org/10.1145/355112.355122},
+	www_section = {http://doi.acm.org/10.1145/355112.355122},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Communications\%20of\%20the\%20ACM\%20-\%20Reputation\%20Systems.pdf},
 	author = {Paul Resnick and Kuwabara, Ko and Zeckhauser, Richard and Eric Friedman}
 }
@@ -14884,7 +14907,7 @@ Results based on simulations confirm that Overcast provides its added functional
 	year = {2000},
 	publisher = {University of Mannheim},
 	abstract = {Feedback from multicast group members is vital for many multicast protocols. In order to avoid feedback implosion in very large groups feedback algorithms with well behaved scaling-properties must be chosen. In this paper we analyse the performance of three typical feedback algorithms described in the literature. Apart from the basic trade-off between feedback latency and response duplicates we especially focus on the algorithms{\textquoteright}{\textquoteright} sensitivity to the quality of the group size estimation. Based on this analysis we give recommendations for the choice of well behaved feedback algorithms that are suitable for very large groups},
-	url = {http://portal.acm.org/citation.cfm?id=896561$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=896561$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Fuhrmann2001a.pdf},
 	author = {Thomas Fuhrmann}
 }
@@ -14904,7 +14927,7 @@ Results based on simulations confirm that Overcast provides its added functional
 	pages = {1707{\textendash}1711},
 	abstract = {We present an architecture that enables the sharing of information among mobile, wireless, collaborating hosts that experience intermittent connectivity to the Internet. Participants in the system obtain data objects from Internet-connected servers, cache them and exchange them with others who are interested in them. The system exploits the fact that there is a high locality of information access within a geographic area. It aims to increase the data availability to participants with lost connectivity to the Internet. We discuss the main components of the system and possible applications. Finally, we present simulation results that show that the ad hoc networks can be very e$\#$ective in distributing popular information. 1 Introduction In a few years, a large percentage of the population in metropolitan areas will be equipped with PDAs, laptops or cell phones with built-in web browsers. Thus, access to information and entertainment will become as important as voice communications},
 	keywords = {802.11, file-sharing},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.5640},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.5640},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/globecom00.pdf},
 	author = {Maria Papadopouli and Henning G. Schulzrinne}
 }
@@ -14920,7 +14943,7 @@ Results based on simulations confirm that Overcast provides its added functional
 	keywords = {small-world},
 	isbn = {1-58113-184-4},
 	doi = {10.1145/335305.335325},
-	url = {http://portal.acm.org/citation.cfm?id=335325$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=335325$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/swn.pdf},
 	author = {Kleinberg, Jon}
 }
@@ -14936,7 +14959,7 @@ Results based on simulations confirm that Overcast provides its added functional
 	keywords = {anonymity, privacy, traffic analysis},
 	isbn = {978-3-540-41724-8},
 	doi = {10.1007/3-540-44702-4},
-	url = {http://portal.acm.org/citation.cfm?id=371981},
+	www_section = {http://portal.acm.org/citation.cfm?id=371981},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.34.5547.pdf},
 	author = {Paul Syverson and Gene Tsudik and Michael Reed and Carl Landwehr}
 }
@@ -14952,7 +14975,7 @@ Results based on simulations confirm that Overcast provides its added functional
 	keywords = {traffic analysis},
 	isbn = {3-540-41724-9},
 	doi = {10.1007/3-540-44702-4},
-	url = {http://portal.acm.org/citation.cfm?id=371972},
+	www_section = {http://portal.acm.org/citation.cfm?id=371972},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/raymond00.pdf},
 	author = {Jean-Fran{\c c}ois Raymond}
 }
@@ -14960,7 +14983,7 @@ Results based on simulations confirm that Overcast provides its added functional
 	title = {Trust Economies in The Free Haven Project},
 	year = {2000},
 	abstract = {The Free Haven Project aims to deploy a system for distributed data storage which is robust against attempts by powerful adversaries to find and destroy stored data. Free Haven uses a secure mixnet for communication, and it emphasizes distributed, reliable, and anonymous storage over e$\#$cient retrieval. We provide a system for building trust between pseudonymous entities, based entirely on records of observed behavior. Modelling these observed behaviors as an economy allows us to draw heavily on previous economic theory, as well as on existing data havens which base their accountability on financial loss. This trust system provides a means of enforcing accountability without sacrificing anonymity},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.27.1639\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.27.1639\&rep=rep1\&type=pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.27.1639\%20\%282\%29.pdf},
 	author = {Ron Rivest and Arthur C. Smith and Brian T. Sniffen}
 }
@@ -14973,7 +14996,7 @@ Results based on simulations confirm that Overcast provides its added functional
 	address = {Philadelphia, PA},
 	isbn = {0898714605},
 	issn = {978-0898714609 },
-	url = {http://books.google.com/books?hl=es\&lr=\&id=5kNC4fqssYQC\&oi=fnd\&pg=PR15\&dq=trust-region+methods\&ots=j1JMMQ3QJY\&sig=ncLlD3mqZ4KEQ1Z9V2qId4rNffo$\#$v=onepage\&q\&f=false},
+	www_section = {http://books.google.com/books?hl=es\&lr=\&id=5kNC4fqssYQC\&oi=fnd\&pg=PR15\&dq=trust-region+methods\&ots=j1JMMQ3QJY\&sig=ncLlD3mqZ4KEQ1Z9V2qId4rNffo$\#$v=onepage\&q\&f=false},
 	author = {Andrew R. Conn and Nicholas I. M. Gould and Philippe L. Toint}
 }
 @conference {web-mix:pet2000,
@@ -14988,7 +15011,7 @@ Results based on simulations confirm that Overcast provides its added functional
 	keywords = {anonymity, traffic analysis},
 	isbn = {978-3-540-41724-8},
 	doi = {10.1007/3-540-44702-4},
-	url = {http://portal.acm.org/citation.cfm?id=371983},
+	www_section = {http://portal.acm.org/citation.cfm?id=371983},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/web-mix-pet2000.pdf},
 	author = {Oliver Berthold and Hannes Federrath and Stefan K{\"o}psell}
 }
@@ -15005,7 +15028,7 @@ Results based on simulations confirm that Overcast provides its added functional
 	keywords = {compression},
 	issn = {0163-5808},
 	doi = {10.1145/335191.335405},
-	url = {http://portal.acm.org/citation.cfm?id=335405$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=335405$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.33.2632.pdf},
 	author = {Liefke, Hartmut and Suciu, Dan}
 }
@@ -15023,7 +15046,7 @@ Results based on simulations confirm that Overcast provides its added functional
 	isbn = {978-3-540-63384-6},
 	issn = {1094-9224},
 	doi = {10.1145/354876.354877},
-	url = {http://portal.acm.org/citation.cfm?id=354876.354877},
+	www_section = {http://portal.acm.org/citation.cfm?id=354876.354877},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.73.6464.pdf},
 	author = {Shlomi Dolev and Rafail Ostrovsky}
 }
@@ -15041,7 +15064,7 @@ Results based on simulations confirm that Overcast provides its added functional
 	keywords = {algorithms, mechanis design},
 	isbn = {1-58113-067-8},
 	doi = {http://doi.acm.org/10.1145/301250.301287},
-	url = {http://doi.acm.org/10.1145/301250.301287},
+	www_section = {http://doi.acm.org/10.1145/301250.301287},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/STOC\%2799\%20-\%20Nisan\%20\%26\%20Ronen\%20-\%20Algorithmic\%20mechanism\%20design.pdf},
 	author = {Nisan, Noam and Ronen, Amir}
 }
@@ -15060,7 +15083,7 @@ Results based on simulations confirm that Overcast provides its added functional
 This exposition presents a model to formally study such algorithms. This model, based on the field of mechanism design, is taken from the author{\textquoteright}s joint work with Amir Ronen, and is similar to approaches taken in the distributed AI community in recent years. Using this model, we demonstrate how some of the techniques of mechanism design can be applied towards distributed computation problems. We then exhibit some issues that arise in distributed computation which require going beyond the existing theory of mechanism design},
 	keywords = {algorithms, mechanism design, selfish agent},
 	isbn = {3-540-65691-X},
-	url = {http://dl.acm.org/citation.cfm?id=1764891.1764893},
+	www_section = {http://dl.acm.org/citation.cfm?id=1764891.1764893},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/STACS\%2799\%20-\%20Nisan\%20-\%20Algorithms\%20for\%20selfish\%20agents.pdf},
 	author = {Nisan, Noam}
 }
@@ -15077,7 +15100,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	keywords = {ant colony optimization, metaheuristics, natural computation, swarm intelligence},
 	issn = {1064-5462},
 	doi = {10.1162/106454699568728},
-	url = {http://portal.acm.org/citation.cfm?id=338955$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=338955$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ij_23-alife99.pdf},
 	author = {Dorigo, Marco and Di Caro, Gianni and Gambardella, Luca M.}
 }
@@ -15091,7 +15114,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	address = {Berkeley, CA, USA},
 	abstract = {Burt is a freely distributed parallel network backup system written at the University of Wisconsin, Madison. It is designed to backup large heterogeneous networks. It uses the Tcl scripting language and standard backup programs like dump(1) and GNUTar to enable backups of a wide variety of data sources, including UNIX and Windows NT workstations, AFS based storage, and others. It also uses Tcl for the creation of the user interface, giving the system administrator great flexibility in customizing the system. Burt supports parallel backups to ensure high backup speeds, and checksums to ensure data integrity. The principal contribution of Burt is that it provides a powerful I/O engine within the context of a flexible scripting language; this combination enables graceful solutions to many problems associated with backups of large installations. At our site, we use Burt to backup data from 350 workstations and from our AFS servers, a total of approximately 900 GB every two weeks},
 	keywords = {backup},
-	url = {http://portal.acm.org/citation.cfm?id=1039861$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1039861$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.112.7612.pdf},
 	author = {Melski, Eric}
 }
@@ -15108,11 +15131,11 @@ This exposition presents a model to formally study such algorithms. This model, 
 	keywords = {file systems, storage},
 	issn = {0163-5980},
 	doi = {10.1145/319344.319159},
-	url = {http://portal.acm.org/citation.cfm?id=319159$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=319159$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p110-santry.pdf},
 	author = {Santry, Douglas S. and Feeley, Michael J. and Hutchinson, Norman C. and Veitch, Alistair C. and Carton, Ross W. and Ofir, Jacob}
 }
-@mastersthesis {1999,
+@mastersthesis {1999_0,
 	title = {A Distributed Decentralized Information Storage and Retrieval System},
 	volume = {PhD},
 	year = {1999},
@@ -15144,7 +15167,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	keywords = {anonymity service},
 	isbn = {3-540-66587-0},
 	doi = {10.1007/3-540-48119-2},
-	url = {http://portal.acm.org/citation.cfm?id=730472},
+	www_section = {http://portal.acm.org/citation.cfm?id=730472},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/1999syverson-fm99.pdf},
 	author = {Paul Syverson and Stuart Stubblebine}
 }
@@ -15159,7 +15182,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	abstract = {We will introduce a new class of erasure codes built from irregular bipartite graphs that have linear time encoding and decoding algorithms and can transmit over an erasure channel at rates arbitrarily close to the channel capacity. We also show that these codes are close to optimal with respect to the trade-off between the proximity to the channel capacity and the running time of the recovery algorithm},
 	keywords = {coding theory, irregular bipartite graphs, recovery algorithm},
 	isbn = {3-540-66723-7},
-	url = {http://portal.acm.org/citation.cfm?id=758535\&dl=GUIDE\&coll=GUIDE\&CFID=102355791\&CFTOKEN=32605420$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=758535\&dl=GUIDE\&coll=GUIDE\&CFID=102355791\&CFTOKEN=32605420$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/new_sequences_of_linear_time_erasure_cod_64778.pdf},
 	author = {M. Amin Shokrollahi}
 }
@@ -15175,7 +15198,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	keywords = {sensor networks},
 	isbn = {1-58113-142-9},
 	doi = {10.1145/313451.313556},
-	url = {http://portal.acm.org/citation.cfm?id=313451.313556$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=313451.313556$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.88.2867.pdf},
 	author = {Deborah Estrin and Govindan, Ramesh and Heidemann, John and Kumar, Satish}
 }
@@ -15186,7 +15209,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	year = {1999},
 	pages = {39{\textendash}41},
 	abstract = {this article{\textquoteright}s publication, the prototype network is processing more than 1 million Web connections per month from more than six thousand IP addresses in twenty countries and in all six main top level domains. [7] Onion Routing operates by dynamically building anonymous connections within a network of real-time Chaum Mixes [3]. A Mix is a store and forward device that accepts a number of fixed-length messages from numerous sources, performs cryptographic transformations on the messages, and then forwards the messages to the next destination in a random order. A single Mix makes tracking of a particular message either by specific bit-pattern, size, or ordering with respect to other messages difficult. By routing through numerous Mixes in the network, determining who is talking to whom becomes even more difficult. Onion Routing{\textquoteright}s network of core onion-routers (Mixes) is distributed, faulttolerant, and under the control of multiple administrative domains, so no single onion-router can bring down the network or compromise a user{\textquoteright}s privacy, and cooperation between compromised onion-routers is thereby confounded},
-	url = { http://www.onion-router.net/Publications/CACM-1999 },
+	www_section = { http://www.onion-router.net/Publications/CACM-1999 },
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/onionrouting.pdf},
 	author = {David Goldschlag and Michael Reed and Paul Syverson}
 }
@@ -15199,11 +15222,11 @@ This exposition presents a model to formally study such algorithms. This model, 
 	organization = {USENIX Association},
 	address = {Berkeley, CA, USA},
 	abstract = {In this paper we describe a technique called operation-based update propagation for efficiently transmitting updates to large files that have been modified on a weakly connected client of a distributed file system. In this technique, modifications are captured above the file-system layer at the client, shipped to a surrogate client that is strongly connected to a server, re-executed at the surrogate, and the resulting files transmitted from the surrogate to the server. If re-execution fails to produce a file identical to the original, the system falls back to shipping the file from the client over the slow network. We have implemented a prototype of this mechanism in the Coda File System on Linux, and demonstrated performance improvements ranging from 40 percents to nearly three orders of magnitude in reduced network traffic and elapsed time. We also found a novel use of forward error correction in this context},
-	url = {http://portal.acm.org/citation.cfm?id=1268712$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1268712$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/lee.pdf},
 	author = {Lee, Yui-Wah and Leung, Kwong-Sak and Satyanarayanan, Mahadev}
 }
-@conference {1999,
+@conference {1999_1,
 	title = {Public-key Cryptosystems Based on Composite Degree Residuosity Classes},
 	booktitle = {Proceedings of the 17th International Conference on Theory and Application of Cryptographic Techniques},
 	year = {1999},
@@ -15212,7 +15235,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	address = {Berlin, Heidelberg},
 	abstract = {This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes : a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA. Our cryptosystems, based on usual modular arithmetics, are provably secure under appropriate assumptions in the standard model},
 	isbn = {3-540-65889-0},
-	url = {http://dl.acm.org/citation.cfm?id=1756123.1756146},
+	www_section = {http://dl.acm.org/citation.cfm?id=1756123.1756146},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PublicKeyCryptoSystems1999Paillier.pdf},
 	author = {Paillier, Pascal}
 }
@@ -15226,7 +15249,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	pages = {3-21},
 	abstract = {This article presents information on principal-agent models in which outcomes conditional on the agent{\textquoteright}s action are uncertain, and the agent{\textquoteright}s behavior therefore unobservable. For a model with bounded agent{\textquoteright}s utility, conditions are given under which the first-best equilibrium can be approximated arbitrarily closely by contracts relating payment to observable outcomes. For general models, it is shown that the solution may not always be obtained by using the agent{\textquoteright}s first-order conditions as constraint. General conditions of Lagrangean type are given for problems in which contracts are finite-dimensional},
 	keywords = {contracts, Lagrangean conditions, unobservability},
-	url = {http://econpapers.repec.org/RePEc:bla:restud:v:66:y:1999:i:1:p:3-21},
+	www_section = {http://econpapers.repec.org/RePEc:bla:restud:v:66:y:1999:i:1:p:3-21},
 	author = {Mirrlees, James A.}
 }
 @conference {314722,
@@ -15240,7 +15263,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	abstract = {We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework for carrying out the analysis of several previously studied random processes of interest, including random loss-resilient codes, solving random k-SAT formula using the pure literal rule, and the greedy algorithm for matchings in random graphs. In addition, these tools allow generalizations of these problems not previously analyzed to be analyzed in a straightforward manner. We illustrate our methodology on the three problems listed above. 1 Introduction We introduce a new set of probabilistic analysis tools related to the amplification method introduced by [12] and further developed and used in [13, 5]. These tools provide a unifying, intuitive, and powerful framework for carrying out the analysis of several previously studied random processes of interest, including the random loss-resilient codes introduced }
 	keywords = {And-Or trees, coding theory},
 	isbn = {0-89871-410-9},
-	url = {http://portal.acm.org/citation.cfm?id=314722\&dl=GUIDE\&coll=GUIDE\&CFID=102355791\&CFTOKEN=32605420$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=314722\&dl=GUIDE\&coll=GUIDE\&CFID=102355791\&CFTOKEN=32605420$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.63.2427.pdf},
 	author = {Luby, Michael and Michael Mitzenmacher and M. Amin Shokrollahi}
 }
@@ -15252,7 +15275,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	pages = {482{\textendash}494},
 	abstract = {Onion Routing is an infrastructure for private communication over a public network. It provides anonymous connections that are strongly resistant to both eavesdropping and traffic analysis. Onion routing{\textquoteright}s anonymous connections are bidirectional and near realtime, and can be used anywhere a socket connection can be used. Any identifying information must be in the data stream carried over an anonymous connection. An onion is a data structure that is treated as the destination address by onion routers; thus, it is used to establish an anonymous connection. Onions themselves appear differently to each onion router as well as to network observers. The same goes for data carried over the connections they establish. Proxy aware applications, such as web browsing and e-mail, require no modification to use onion routing, and do so through a series of proxies. A prototype onion routing network is running between our lab and other sites. This paper describes anonymous connections and their imple}
 	keywords = {anonymity, onion routing},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.2362},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.2362},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.65.8267.pdf},
 	author = {Michael Reed and Paul Syverson and David Goldschlag}
 }
@@ -15264,7 +15287,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	pages = {66{\textendash}92},
 	abstract = {Crowds is a system that allows anonymous web-surfing. For each host, a random static path through the crowd is formed that then acts as a sequence of proxies, indirecting replies and responses. Vulnerable when facing adversaries that can perform traffic analysis at the local node and without responder anonymity. But highly scalable and efficient},
 	keywords = {anonymous web browsing, Crowds},
-	url = {http://avirubin.com/crowds.pdf},
+	www_section = {http://avirubin.com/crowds.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/crowds.pdf},
 	author = {Michael K. Reiter and Aviel D. Rubin}
 }
@@ -15278,7 +15301,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	abstract = {Attacks on servers that provide anonymity generally fall into two categories: attempts to expose anonymous users and attempts to silence them. Much existing work concentrates on withstanding the former, but the threat of the latter is equally real. One particularly e$\#$ective attack against anonymous servers is to abuse them and stir up enough trouble that they must shut down. This paper describes the design, implementation, and operation of nym.alias.net, a server providing untraceable email aliases. We enumerate many kinds of abuse the system has weathered during two years of operation, and explain the measures we enacted in response. From our experiences, we distill several principles by which one can protect anonymous servers from similar attacks},
 	isbn = {1-58113-007-4},
 	doi = {10.1145/288090.288098},
-	url = {http://portal.acm.org/citation.cfm?id=288098},
+	www_section = {http://portal.acm.org/citation.cfm?id=288098},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/nym-alias-net.pdf},
 	author = {David Mazi{\`e}res and Frans M. Kaashoek}
 }
@@ -15295,7 +15318,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	keywords = {coding theory, multicast},
 	isbn = {1-58113-003-1},
 	doi = {10.1145/285237.285258},
-	url = {http://portal.acm.org/citation.cfm?id=285258\&dl=GUIDE\&coll=GUIDE\&CFID=102355791\&CFTOKEN=32605420$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=285258\&dl=GUIDE\&coll=GUIDE\&CFID=102355791\&CFTOKEN=32605420$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.72.3011.pdf},
 	author = {Byers, John W. and Luby, Michael and Michael Mitzenmacher and Rege, Ashutosh}
 }
@@ -15307,7 +15330,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	pages = {1817{\textendash}1826},
 	abstract = {We reveal an equivalence relation between the construction of a new class of low density MDS array codes, that we call B-Code, and a combinatorial problem known as perfect onefactorization of complete graphs. We use known perfect one-factors of complete graphs to create constructions and decoding algorithms for both B-Code and its dual code. B-Code and its dual are optimal in the sense that (i) they are MDS, (ii) they have an optimal encoding property, i.e., the number of the parity bits that are affected by change of a single information bit is minimal and (iii) they have optimal length. The existence of perfect one-factorizations for every complete graph with an even number of nodes is a 35 years long conjecture in graph theory. The construction of B-codes of arbitrary odd length will provide an affirmative answer to the conjecture},
 	keywords = {array codes, low density, MDS Codes, update complexity},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.8899},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.8899},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.42.8899.pdf},
 	author = {Lihao Xu and Vasken Bohossian and Jehoshua Bruck and David Wagner}
 }
@@ -15322,7 +15345,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	address = {New York, NY, USA},
 	issn = {0163-5999},
 	doi = {10.1145/288197.581193},
-	url = {http://portal.acm.org/citation.cfm?id=581193$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=581193$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.83.6433.pdf},
 	author = {Marco Ajmone Marsan and Gianfranco Balbo and Gianni Conte and Susanna Donatelli and Giuliana Franceschinis}
 }
@@ -15330,14 +15353,14 @@ This exposition presents a model to formally study such algorithms. This model, 
 	title = {PipeNet 1.0},
 	year = {1998},
 	month = jan,
-	url = {http://weidai.com/pipenet.txt},
+	www_section = {http://weidai.com/pipenet.txt},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/http___freehaven.net_anonbib_cache_pipenet10.html_.pdf},
 	author = {Dai, Wei}
 }
 @booklet {citeulike:2549551,
 	title = {PipeNet 1.1},
 	year = {1998},
-	url = {http://www.eskimo.com/~weidai/pipenet.txt},
+	www_section = {http://www.eskimo.com/~weidai/pipenet.txt},
 	author = {Dai, Wei}
 }
 @conference {tau-indy,
@@ -15351,7 +15374,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	abstract = {Private information retrieval (PIR) schemes provide a user with information from a database while keeping his query secret from the database manager. We propose a new model for PIR, utilizing auxiliary random servers providing privacy services for database access. The principal database initially engages in a preprocessing setup computation with the random servers, followed by the on-line stage with the users. Using this model we achieve the first PIR information theoretic solutions in which the database does not need to give away its data to be replicated, and with minimal on-line computation cost for the database. This solves privacy and efficiency problems inherent to all previous solutions. Specifically, in all previously existing PIR schemes the database on-line computation for one query is at least linear in the size of the data, and all previous information theoretic schemes require multiple replications of the database which are not allowed to communicate with each other.This poses a privacy problem for the database manager, who is required to hand his data to multiple foreign entities, and to the user, who is supposed to trust the multiple copies of the database not to communicate. In contrast, in our solutions no replication is needed, and the database manager only needs to perform O(1) amount of computation to answer questions of users, while all the extra computations required on line for privacy are done by the auxiliary random servers, who contain no information about the data},
 	keywords = {anonymity, privacy, private information retrieval},
 	isbn = {3-540-65142-X},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.6742},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.6742},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.18.6742.pdf},
 	author = {Yael Gertner and Shafi Goldwasser and Tal Malkin}
 }
@@ -15366,7 +15389,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	keywords = {anonymity, performance analysis},
 	issn = {0733-8716 },
 	doi = {10.1109/49.668973 },
-	url = {http://ieeexplore.ieee.org/Xplore/login.jsp?url=http\%3A\%2F\%2Fieeexplore.ieee.org\%2Fiel4\%2F49\%2F14639\%2F00668973.pdf\%3Farnumber\%3D668973\&authDecision=-203},
+	www_section = {http://ieeexplore.ieee.org/Xplore/login.jsp?url=http\%3A\%2F\%2Fieeexplore.ieee.org\%2Fiel4\%2F49\%2F14639\%2F00668973.pdf\%3Farnumber\%3D668973\&authDecision=-203},
 	author = {Anja Jerichow and Jan M{\"u}ller and Andreas Pfitzmann and Birgit Pfitzmann and Michael Waidner}
 }
 @book {Goldreich98securemulti-party,
@@ -15376,7 +15399,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	year = {1998},
 	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 = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.11.2201\&rep=rep1\&type=pdf},
 	author = {Oded Goldreich}
 }
 @conference {stop-and-go,
@@ -15389,7 +15412,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	keywords = {anonymity, identity verification, security parameter},
 	isbn = {978-3-540-65386-8},
 	doi = {10.1007/3-540-49380-8_7},
-	url = {http://www.springerlink.com/content/hmfv2mgy1xqbn852/},
+	www_section = {http://www.springerlink.com/content/hmfv2mgy1xqbn852/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/stop-and-go.pdf},
 	author = {Dogan Kesdogan and Jan Egner and Roland B{\"u}schkes}
 }
@@ -15403,7 +15426,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	keywords = {electronic voting, mix, universal verifiability},
 	isbn = {978-3-540-64518-4},
 	doi = {10.1007/BFb0054144},
-	url = {http://www.springerlink.com/content/hl8838u4l9354544/},
+	www_section = {http://www.springerlink.com/content/hl8838u4l9354544/},
 	author = {Masayuki Abe}
 }
 @conference {CPIR,
@@ -15418,7 +15441,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	keywords = {communication complexity, private information retrieval},
 	isbn = {0-89791-888-6},
 	doi = {http://doi.acm.org/10.1145/258533.258609},
-	url = {http://portal.acm.org/citation.cfm?id=258533.258609},
+	www_section = {http://portal.acm.org/citation.cfm?id=258533.258609},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/chor97computationally.pdf},
 	author = {Benny Chor and Niv Gilboa}
 }
@@ -15432,7 +15455,7 @@ This exposition presents a model to formally study such algorithms. This model, 
 	publisher = {	Springer Berlin / Heidelberg},
 	organization = {	Springer Berlin / Heidelberg},
 	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_section = {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},
 	author = {Wakaha Ogata and Kaoru Kurosawa and Kazue Sako and Kazunori Takatani}
 }
@@ -15450,11 +15473,11 @@ This exposition presents a model to formally study such algorithms. This model, 
 	keywords = {loss-resilient code},
 	isbn = {0-89791-888-6},
 	doi = {http://doi.acm.org/10.1145/258533.258573},
-	url = {http://doi.acm.org/10.1145/258533.258573},
+	www_section = {http://doi.acm.org/10.1145/258533.258573},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/STOC\%2797\%20-\%20Practical\%20Loss-Resilient\%20Codes.pdf},
 	author = {Luby, Michael and Michael Mitzenmacher and M. Amin Shokrollahi and Daniel A. Spielman and Stemann, Volker}
 }
-@conference {1997,
+@conference {1997_0,
 	title = {Privacy-enhancing Technologies for the Internet},
 	booktitle = {Compcon {\textquoteright}97. Proceedings, IEEE},
 	year = {1997},
@@ -15465,11 +15488,11 @@ This exposition presents a model to formally study such algorithms. This model, 
 	abstract = {The increased use of the Internet for everyday activities is bringing new threats to personal privacy. This paper gives an overview of existing and potential privacy-enhancing technologies for the Internet, as well as motivation and challenges for future work in this field},
 	keywords = {Internet, privacy, privacy-enhancing technology},
 	isbn = {0818678046},
-	url = {http://www.cs.berkeley.edu/~daw/papers/privacy-compcon97-www/privacy-html.html},
+	www_section = {http://www.cs.berkeley.edu/~daw/papers/privacy-compcon97-www/privacy-html.html},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Compcon\%20\%2797\%20-\%20Privacy-enhancing\%20Technologies\%20for\%20the\%20Internet.pdf},
 	author = {Ian Goldberg and David Wagner and Eric Brewer}
 }
-@article {1997,
+@article {1997_1,
 	title = {A Reliable Multicast Framework for Light-weight Sessions and Application Level Framing},
 	journal = {IEEE/ACM Trans. Netw},
 	volume = {5},
@@ -15480,7 +15503,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
 	keywords = {computer network performance, computer networks, Internetworking},
 	issn = {1063-6692},
 	doi = {10.1109/90.650139},
-	url = {http://dx.doi.org/10.1109/90.650139},
+	www_section = {http://dx.doi.org/10.1109/90.650139},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Reliable_MultiCast1997Flyod.pdf},
 	author = {Floyd, Sally and Jacobson, Van and Liu, Ching-Gung and McCanne, Steven and Zhang, Lixia}
 }
@@ -15494,11 +15517,11 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
 	abstract = {The World Wide Web has recently matured enough to provide everyday users with an extremely cheap publishing mechanism. However, the current WWW architecture makes it fundamentally difficult to provide content without identifying yourself. We examine the problem of anonymous publication on the WWW, propose a design suitable for practical deployment, and describe our implementation. Some key features of our design include universal accessibility by pre-existing clients, short persistent names, security against social, legal, and political pressure, protection against abuse, and good performance},
 	keywords = {anonymous publishing},
 	doi = {10.1.1.41.4031},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.4031},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.4031},
 	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,
+@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},
@@ -15509,7 +15532,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
 	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/},
+	www_section = {http://www.springerlink.com/content/584k258285p18x4g/},
 	author = {Hunt, James J. and Vo, Kiem-Phong and Tichy, Walter F.}
 }
 @conference {716407,
@@ -15523,7 +15546,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
 	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/},
+	www_section = {http://www.springerlink.com/content/584k258285p18x4g/},
 	author = {Hunt, James J. and Vo, Kiem-Phong and Tichy, Walter F.}
 }
 @conference {1267576,
@@ -15536,7 +15559,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
 	address = {Berkeley, CA, USA},
 	abstract = {this paper is that a traditional identity certificate is neither necessary nor sufficient for this purpose. It is especially useless if the two parties concerned did not have the foresight to obtain such certificates before desiring to open a secure channel. There are many methods for establishing identity without using certificates from trusted certification authorities. The relationship between verifier and subject guides the choice of method. Many of these relationships have easy, straight-forward methods for binding a public key to an identity, using a broadcast channel or 1:1 meetings, but one relationship makes it especially difficult. That relationship is one with an old friend with whom you had lost touch but who appears now to be available on the net. You make contact and share a few exchanges which suggest to you that this is, indeed, your old friend. Then you want to form a secure channel in order to carry on a more extensive conversation in private. This case is subject to the man-in-themiddle attack. For this case, a protocol is presented which binds a pair of identities to a pair of public keys without using any certificates issued by a trusted CA. The apparent direct conflict between conventional wisdom and the thesis of this paper lies in the definition of the word "identity" -- a word which is commonly left undefined in discussions of certification},
 	keywords = {certificate revocation, public key cryptography},
-	url = {http://portal.acm.org/citation.cfm?id=1267576$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=1267576$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.31.7263.pdf},
 	author = {Ellison, Carl M.}
 }
@@ -15548,7 +15571,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
 	pages = {242{\textendash}252},
 	address = {Prague, CZ},
 	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_section = {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},
 	author = {Ross Anderson}
 }
@@ -15564,7 +15587,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
 in the communication chain. This implies that neither the respondent nor his proxy server nor any external observer need know the identity of the initiator or his proxy server. A prototype of Onion Routing has been implemented. This prototype works with HTTP (World Wide Web) proxies. In addition, an analogous proxy for TELNET has been implemented. Proxies for FTP and SMTP are under development},
 	keywords = {communication chain, onion routing, traffic analysis},
 	isbn = {3-540-61996-8},
-	url = {http://portal.acm.org/citation.cfm?id=731526},
+	www_section = {http://portal.acm.org/citation.cfm?id=731526},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IH-1996.pdf},
 	author = {David Goldschlag and Michael Reed and Paul Syverson},
 	editor = {Ross Anderson}
@@ -15582,7 +15605,7 @@ in the communication chain. This implies that neither the respondent nor his pro
 	abstract = {Constraint satisfaction is a powerful tool for representing and solving decision problems with complete knowledge about the world. We extend the CSP framework so as to represent decision problems under incomplete knowledge. The basis of the extension consists in a distinction between controllable and uncontrollable variables -- hence the terminology "mixed CSP" -- and a "solution" gives actually a conditional decision. We study the complexity of deciding the consistency of a mixed CSP. As the problem is generally intractable, we propose an algorithm for finding an approximate solution},
 	keywords = {algorithms, constraint satisfaction, decision problem, framework, imcomplete knowledge, mixed CSP},
 	isbn = {0-262-51091-X},
-	url = {http://dl.acm.org/citation.cfm?id=1892875.1892901},
+	www_section = {http://dl.acm.org/citation.cfm?id=1892875.1892901},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/AAAI\%2796\%20-\%20Mixed\%20constraint\%20satisfaction.pdf},
 	author = {Fargier, H{\'e}l{\`e}ne and Lang, J{\'e}r{\^o}me and Schiex, Thomas}
 }
@@ -15592,7 +15615,7 @@ in the communication chain. This implies that neither the respondent nor his pro
 	year = {1996},
 	pages = {2{\textendash}16},
 	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_section = {http://eprints.kfupm.edu.sa/50994/1/50994.pdf},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/babel.pdf},
 	author = {Ceki Gulcu and Gene Tsudik}
 }
@@ -15604,7 +15627,7 @@ in the communication chain. This implies that neither the respondent nor his pro
 	year = {1996},
 	month = {August},
 	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_section = {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},
 	author = {Sameer Parekh}
 }
@@ -15626,7 +15649,7 @@ in the communication chain. This implies that neither the respondent nor his pro
 	address = {London, UK},
 	abstract = {This paper is a first step towards an understanding of the inherent limitations of distributed data structures. We propose a model of distributed search trees that is based on few natural assumptions. We prove that any class of trees within our model satisfies a lower bound of \Omega\Gamma p m) on the worst case height of distributed search trees for m keys. That is, unlike in the single site case, balance in the sense that the tree height satisfies a logarithmic upper bound cannot be achieved. This is true although each node is allowed to have arbitrary degree (note that in this case, the height of a single site search tree is trivially bounded by one). By proposing a method that generates trees of height O( p m), we show the bound to be tight. 1 Introduction Distributed data structures have attracted considerable attention in the past few years. From a practical viewpoint, this is due to the increasing availability of networks of workstations},
 	isbn = {3-540-60220-8},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4081},
+	www_section = {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},
 	author = {Kr{\"o}ll, Brigitte and Widmayer, Peter}
 }
@@ -15641,7 +15664,7 @@ in the communication chain. This implies that neither the respondent nor his pro
 	address = {New York, NY, USA},
 	issn = {0163-5980},
 	doi = {10.1145/224057.224068},
-	url = {http://portal.acm.org/citation.cfm?id=224068$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=224068$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/s15.pdf},
 	author = {Lily B. Mummert and Maria Ebling and Satyanarayanan, Mahadev}
 }
@@ -15651,7 +15674,7 @@ in the communication chain. This implies that neither the respondent nor his pro
 	publisher = {Lecture Notes in Computer Science},
 	abstract = {This paper presents the first systematic design of a robust sensing system suited for the challenges presented by soil environments. We describe three soil deployments we have undertaken: in Bangladesh, and in California at the James Reserve and in the San Joaquin River basin. We discuss our experiences and lessons learned in deploying soil sensors. We present data from each deployment and evaluate our techniques for improving the information yield from these systems. Our most notable results include the following: in-situ calibration techniques to postpone labor-intensive and soil disruptive calibration events developed at the James Reserve; achieving a 91 \% network yield from a Mica2 wireless sensing system without end-to-end reliability in Bangladesh; and the javelin, a new platform that facilitates the deployment, replacement and in-situ calibration of soil sensors, deployed in the San Joaquin River basin. Our techniques to increase information yield have already led to scientifically promising results, including previously unexpected diurnal cycles in various soil chemistry parameters across several deployments },
 	keywords = {sensor networks, wireless sensor network},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.7766},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.7766},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.120.7766.pdf},
 	author = {Nithya Ramanathan and Tom Schoellhammer and Deborah Estrin and Mark Hansen and Tom Harmon and Eddie Kohler and Mani Srivastava}
 }
@@ -15663,7 +15686,7 @@ in the communication chain. This implies that neither the respondent nor his pro
 	publisher = {IEEE Computer Society},
 	organization = {IEEE Computer Society},
 	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_section = {http://portal.acm.org/citation.cfm?id=882491.884247},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cooper.pdf},
 	author = {David A. Cooper and Kenneth P. Birman}
 }
@@ -15676,7 +15699,7 @@ in the communication chain. This implies that neither the respondent nor his pro
 	organization = {ACM  New York, NY, USA},
 	abstract = {Publicly accessible databases are an indispensable resource for retrieving up-to-date information. But they also pose a significant risk to the privacy of the user, since a curious database operator can follow the user{\textquoteright}s queries and infer what the user is after. Indeed, in cases where the users{\textquoteright} intentions are to be kept secret, users are often cautious about accessing the database. It can be shown that when accessing a single database, to completely guarantee the privacy of the user, the whole database should be down-loaded; namely n bits should be communicated (where n is the number of bits in the database).In this work, we investigate whether by replicating the database, more efficient solutions to the private retrieval problem can be obtained. We describe schemes that enable a user to access k replicated copies of a database (k>=2) and privately retrieve information stored in the database. This means that each individual server (holding a replicated copy of the database) gets no information on the identity of the item retrieved by the user. Our schemes use the replication to gain substantial saving. In particular, we present a two-server scheme with communication complexity O(n1/3)},
 	doi = {http://doi.acm.org/10.1145/293347.293350},
-	url = {http://portal.acm.org/citation.cfm?id=293347.293350},
+	www_section = {http://portal.acm.org/citation.cfm?id=293347.293350},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pir.pdf},
 	author = {Benny Chor and Oded Goldreich and Eyal Kushilevitz and Madhu Sudan}
 }
@@ -15689,7 +15712,7 @@ in the communication chain. This implies that neither the respondent nor his pro
 	abstract = {We present a receipt-free voting scheme based on a mix- type anonymous channel [Cha81, PIK93]. The receipt-freeness property [BT94] enables voters to hide how they have voted even from a powerful adversary who is trying to coerce him. The work of [BT94] gave the first solution using a voting booth, which is a hardware assumption not unlike that in current physical elections. In our proposed scheme, we reduce the physical assumptions required to obtain receipt-freeness. Our sole physical assumption is the existence of a private channel through which the center can send the voter a message without fear of eavesdropping},
 	isbn = {978-3-540-59409-3},
 	doi = {10.1007/3-540-49264-X},
-	url = {http://www.springerlink.com/content/jhf7ccxn2fj2gfum/},
+	www_section = {http://www.springerlink.com/content/jhf7ccxn2fj2gfum/},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SK.pdf},
 	author = {Joe Kilian and Kazue Sako}
 }
@@ -15699,7 +15722,7 @@ in the communication chain. This implies that neither the respondent nor his pro
 	abstract = {The Bayou System is a platform of replicated, highly-available, variable-consistency, mobile databases on which to build collaborative applications. This paper presents the preliminary system architecture along with the design goals that influenced it. We take a fresh, bottom-up and critical look at the requirements of mobile computing applications and carefully pull together both new and existing techniques into an overall architecture that meets these requirements. Our emphasis is on supporting application-specific conflict detection and resolution and on providing application controlled inconsistency},
 	keywords = {reliability, reputation},
 	doi = {10.1109/WMCSA.1994.37},
-	url = {http://portal.acm.org/citation.cfm?id=1440028},
+	www_section = {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},
 	author = {Alan Demers and Karin Petersen and Mike Spreitzer and Douglas Terry and Marvin Theimer and Brent Welch}
 }
@@ -15714,7 +15737,7 @@ in the communication chain. This implies that neither the respondent nor his pro
 	abstract = {Network Appliance Corporation recently began shipping a new kind of network server called an NFS file server appliance, which is a dedicated server whose sole function is to provide NFS file service. The file system requirements for an NFS appliance are different from those for a general-purpose UNIX system, both because an NFS appliance must be optimized for network file access and because an appliance must be easy to use.
 
 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_section = {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},
 	author = {Hitz, Dave and Lau, James and Malcolm, Michael}
 }
@@ -15724,7 +15747,7 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
 	year = {1994},
 	pages = {1{\textendash}10},
 	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_section = {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},
 	author = {Udi Manber}
 }
@@ -15735,11 +15758,11 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
 	address = {Knoxville, TN, USA},
 	abstract = {Checkpointing is a simple technique for rollback recovery: the state of an executing program is periodically saved to a disk file from which it can be recovered after a failure. While recent research has developed a collection of powerful techniques for minimizing the overhead of writing checkpoint files, checkpointing remains unavailable to most application developers. In this paper we describe libckpt, a portable checkpointing tool for Unix that implements all applicable performance optimizations which are reported in the literature. While libckpt can be used in a mode which is almost totally transparent to the programmer, it also supports the incorporation of user directives into the creation of checkpoints. This user-directed checkpointing is an innovation which is unique to our work. 1 Introduction Consider a programmer who has developed an application which will take a long time to execute, say five days. Two days into the computation, the processor on which the application is}
 	keywords = {checkpointing, performance analysis},
-	url = {http://portal.acm.org/citation.cfm?id=898770$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=898770$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.55.257.pdf},
 	author = {James S. Plank and Beck, Micah and Kingsley, Gerry and Li, Kai}
 }
-@article {1993,
+@article {1993_0,
 	title = {Allocative Efficiency of Markets with Zero-Intelligence Traders: Market as a Partial Substitute for Individual Rationality},
 	journal = {Journal of Political Economy},
 	volume = {101},
@@ -15748,7 +15771,7 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
 	pages = {119-137},
 	abstract = {We report market experiments in which human traders are replaced by "zero-intelligence" programs that submit random bids and offers. Imposing a budget constraint (i.e., not permitting traders to sell below their costs or buy above their values) is sufficient to raise the allocative efficiency of these auctions close to 100 percent. Allocative efficiency of a double auction derives largely from its structure, independent of traders{\textquoteright} motivation, intelligence, or learning. Adam Smith{\textquoteright}s invisible hand may be more powerful than some may have thought; it can generate aggregate rationality not only from individual rationality but also from individual irrationality},
 	keywords = {allocative efficiency, double auction, market, zero-intelligence trader},
-	url = {http://www.jstor.org/stable/2138676},
+	www_section = {http://www.jstor.org/stable/2138676},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/JPE\%20\%281993\%29\%20-\%20Gode\%20\%26\%20Sunder\%20-\%20Allocative\%20Efficiency.pdf},
 	author = {Dhananjay K. Gode and Shyam Sunder}
 }
@@ -15762,7 +15785,7 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
 	address = {San Diego, California, United States},
 	isbn = {0-89791-591-7},
 	doi = {http://doi.acm.org/10.1145/167088.167260},
-	url = {http://portal.acm.org/citation.cfm?id=167088.167260},
+	www_section = {http://portal.acm.org/citation.cfm?id=167088.167260},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/rackoff93cryptographic.pdf},
 	author = {Charles Rackoff and Daniel R. Simon}
 }
@@ -15776,11 +15799,11 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
 	address = {Lofthus, Norway},
 	abstract = {The contribution of this paper are twofold. First, we present an efficient computationally secure anonymous channel which has no problme of ciphertext length expansion. The length is irrelevant to the number of MIXes(control centers). It improves the efficiency of Chaums{\textquoteright}s election scheme based on the MIX net automatically. Second, we show an election scheme which satisfies fairness. That is, if some vote is disrupted, no one obtains any infromation about all the other votes. Each voter sends O(nk) bits so that the probability of the fairness is 1-2^-k, where n is the bit length of the ciphertext},
 	isbn = {3-540-57600-2},
-	url = {http://portal.acm.org/citation.cfm?id=188307.188351},
+	www_section = {http://portal.acm.org/citation.cfm?id=188307.188351},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mix.pdf},
 	author = {Choonsik Park and Kazutomo Itoh and Kaoru Kurosawa}
 }
-@book {1993,
+@book {1993_1,
 	title = {Elliptic Curve Public Key Cryptosystems},
 	series = {The Springer International Series in Engineering and Computer Science},
 	volume = {234},
@@ -15793,24 +15816,24 @@ Elliptic Curve Public Key Cryptosystems provides an up-to-date and self-containe
 Elliptic Curve Public Key Cryptosystems is a valuable reference resource for researchers in academia, government and industry who are concerned with issues of data security. Because of the comprehensive treatment, the book is also suitable for use as a text for advanced courses on the subject},
 	keywords = {algebraic geometry, elliptic curve cryptography, number theory, public key cryptosystem},
 	isbn = {978-0-7923-9368-9},
-	url = {http://books.google.com/books/about/Elliptic_curve_public_key_cryptosystems.html?id=bIb54ShKS68C},
+	www_section = {http://books.google.com/books/about/Elliptic_curve_public_key_cryptosystems.html?id=bIb54ShKS68C},
 	author = {Alfred J. Menezes}
 }
 @booklet {Liedtke93apersistent,
 	title = {A Persistent System in Real Use - Experiences of the First 13 Years},
 	year = {1993},
 	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_section = {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},
 	author = {Jochen Liedtke}
 }
-@conference {1993,
+@conference {1993_2,
 	title = {SURF-2: A program for dependability evaluation of complex hardware and software systems},
 	year = {1993},
 	abstract = {SURF-2, a software tool for evaluating system dependability, is described. It is especially designed for an evaluation-based system design approach in which multiple design solutions need to be compared from the dependability viewpoint. System behavior may be modeled either by Markov chains or by generalized stochastic Petri nets. The tool supports the evaluation of different measures of dependability, including pointwise measures, asymptotic measures, mean sojourn times and, by superposing a reward structure on the behavior model, reward measures such as expected performance or cost},
 	isbn = {0-8186-3680-7 },
 	doi = {10.1109/FTCS.1993.627372 },
-	url = {http://www.pubzone.org/dblp/conf/ftcs/BeoumesKALAMBS93}
+	www_section = {http://www.pubzone.org/dblp/conf/ftcs/BeoumesKALAMBS93}
 }
 @conference {DBLP:conf/eurocrypt/ChaumP92,
 	title = {Transferred Cash Grows in Size},
@@ -15827,7 +15850,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
 	keywords = {electronic money, forward traceability, secret shraing, transfer},
 	isbn = {3-540-56413-6},
 	doi = {10.1007/3-540-47555-9_32},
-	url = {10.1007/3-540-47555-9_32},
+	www_section = {10.1007/3-540-47555-9_32},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EUROCRYPT\%2792\%20-\%20Chaun\%20\%26\%20Pedersen\%20-\%20Transferred\%20cash\%20grows\%20in\%20size.PDF},
 	author = {David Chaum and Torben P. Pedersen}
 }
@@ -15849,7 +15872,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
 	year = {1991},
 	pages = {110{\textendash}121},
 	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_section = {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},
 	author = {Yves Deswarte and Laurent Blain and Jean-charles Fabre}
 }
@@ -15863,7 +15886,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
 	organization = {Springer-Verlag  London, UK},
 	abstract = {Untraceable communication for services like telephony is often considered infeasible in the near future because of bandwidth limitations. We present a technique, called ISDN-MIXes, which shows that this is not the case. As little changes as possible are made to the narrowband-ISDN planned by the PTTs. In particular, we assume the same subscriber lines with the same bit rate, and the same long-distance network between local exchanges, and we offer the same services. ISDN-MIXes are a combination of a new variant of CHAUM{\textquoteright}s MIXes, dummy traffic on the subscriber lines (where this needs no additional bandwidth), and broadcast of incoming-call messages in the subscriber-area},
 	isbn = {3-540-53721-X},
-	url = {http://portal.acm.org/citation.cfm?id=645662.664536},
+	www_section = {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},
 	author = {Andreas Pfitzmann and Birgit Pfitzmann and Michael Waidner}
 }
@@ -15885,7 +15908,7 @@ On the other hand, our solution is based on the idea of digital signatures whose
 We also sketch applications of these signatures to a payment system, solving disputes about shared secrets, and signatures which cannot be shown round},
 	keywords = {anonymity, arbitrary network, cryptology, DC-net},
 	isbn = {3-540-53433-4},
-	url = {http://dl.acm.org/citation.cfm?id=111563.111630},
+	www_section = {http://dl.acm.org/citation.cfm?id=111563.111630},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EUROCRYPT\%2789\%20-\%20Waidner\%26Pfitzmann\%20-\%20The\%20dining\%20cryptographers\%20in\%20the\%20disco\%20.pdf},
 	author = {Michael Waidner and Birgit Pfitzmann}
 }
@@ -15902,11 +15925,11 @@ We also sketch applications of these signatures to a payment system, solving dis
 	keywords = {data structures, search},
 	issn = {0001-0782},
 	doi = {10.1145/78973.78977},
-	url = {http://portal.acm.org/citation.cfm?id=78977$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=78977$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.85.9211.pdf},
 	author = {Pugh, William}
 }
-@conference {1988,
+@conference {1988_0,
 	title = {Completeness Theorems for Non-cryptographic Fault-tolerant Distributed Computation},
 	booktitle = {Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing},
 	year = {1988},
@@ -15916,7 +15939,7 @@ We also sketch applications of these signatures to a payment system, solving dis
 	abstract = {Every function of n inputs can be efficiently computed by a complete network of n processors in such a way that: If no faults occur, no set of size t < n/2 of players gets any additional information (other than the function value), Even if Byzantine faults are allowed, no set of size t < n/3 can either disrupt the computation or get additional information. Furthermore, the above bounds on t are tight!},
 	isbn = {0-89791-264-0},
 	doi = {10.1145/62212.62213},
-	url = {http://doi.acm.org/10.1145/62212.62213},
+	www_section = {http://doi.acm.org/10.1145/62212.62213},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CompletelenessTheorems1988Ben-Or.pdf},
 	author = {Ben-Or, Michael and Goldwasser, Shafi and Wigderson, Avi}
 }
@@ -15929,11 +15952,11 @@ We also sketch applications of these signatures to a payment system, solving dis
 	abstract = {Keeping confidential who sends which messages, in a world where any physical transmission can be traced to its origin, seems impossible. The solution presented here is unconditionally or cryptographically secure, depending on whether it is based on one-time-use keys or on public keys, respectively. It can be adapted to address efficiently a wide variety of practical considerations},
 	keywords = {pseudonym, unconditional security, untraceability},
 	issn = {0933-2790},
-	url = {http://portal.acm.org/citation.cfm?id=54239},
+	www_section = {http://portal.acm.org/citation.cfm?id=54239},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/dcnet-jcrypt88.pdf},
 	author = {David Chaum}
 }
-@conference {1988,
+@conference {1988_1,
 	title = {Founding Crytpography on Oblivious Transfer},
 	booktitle = {Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing},
 	year = {1988},
@@ -15944,7 +15967,7 @@ We also sketch applications of these signatures to a payment system, solving dis
 	keywords = {oblivious circuits},
 	isbn = {0-89791-264-0},
 	doi = {10.1145/62212.62215},
-	url = {http://doi.acm.org/10.1145/62212.62215},
+	www_section = {http://doi.acm.org/10.1145/62212.62215},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/oblivious_transfer.pdf},
 	author = {Kilian, Joe}
 }
@@ -15958,7 +15981,7 @@ We also sketch applications of these signatures to a payment system, solving dis
 	abstract = {We present a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest. Our algorithm automatically solves all the multi-party protocol problems addressed in complexity-based cryptography during the last 10 years. It actually is a completeness theorem for the class of distributed protocols with honest majority. Such completeness theorem is optimal in the sense that, if the majority of the players is not honest, some protocol problems have no efficient solution [C]},
 	isbn = {0-89791-221-7},
 	doi = {10.1145/28395.28420},
-	url = {http://doi.acm.org/10.1145/28395.28420},
+	www_section = {http://doi.acm.org/10.1145/28395.28420},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PlayMentalGame1987Goldreich.pdf},
 	author = {Goldreich, O. and Micali, S. and Wigderson, A.}
 }
@@ -15974,7 +15997,7 @@ We also sketch applications of these signatures to a payment system, solving dis
 	abstract = {This paper describes a technique for implementing the sort of small databases that frequently occur in the design of operating systems and distributed systems. We take advantage of the existence of very large virtual memories, and quite large real memories, to make the technique feasible. We maintain the database as a strongly typed data structure in virtual memory, record updates incrementally on disk in a log and occasionally make a checkpoint of the entire database. We recover from crashes by restoring the database from an old checkpoint then replaying the log. We use existing packages to convert between strongly typed data objects and their disk representations, and to communicate strongly typed data across the network (using remote procedure calls). Our memory is managed entirely by a general purpose allocator and garbage collector. This scheme has been used to implement a name server for a distributed system. The resulting implementation has the desirable property of being simultaneously simple, efficient and reliable },
 	issn = {0163-5980},
 	doi = {10.1145/37499.37517},
-	url = {http://portal.acm.org/citation.cfm?id=37499.37517$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=37499.37517$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/024-DatabasesPaper.pdf},
 	author = {Andrew D. Birrell and Michael B. Jones and Edward P. Wobber}
 }
@@ -15992,7 +16015,7 @@ We also sketch applications of these signatures to a payment system, solving dis
 	keywords = {decentralized, distributed systems, multicasting},
 	isbn = {0-89791-245-4},
 	doi = {http://doi.acm.org/10.1145/55482.55508},
-	url = {http://doi.acm.org/10.1145/55482.55508},
+	www_section = {http://doi.acm.org/10.1145/55482.55508},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%2787\%20-\%20Strategies\%20for\%20decentralized\%20resource\%20management.pdf},
 	author = {Stumm, Michael}
 }
@@ -16008,7 +16031,7 @@ We also sketch applications of these signatures to a payment system, solving dis
 	abstract = {In usual communication networks, the network operator or an intruder could easily observe when, how much and with whom the users communicate (traffic analysis), even if the users employ end-to-end encryption. When ISDNs are used for almost everything, this becomes a severe threat. Therefore, we summarize basic concepts to keep the recipient and sender or at least their relationship unobservable, consider some possible implementations and necessary hierarchical extensions, and propose some suitable performance and reliability enhancements},
 	isbn = {978-3-540-16468-5},
 	doi = {10.1007/3-540-39805-8_29},
-	url = {http://dx.doi.org/10.1007/3-540-39805-8_29},
+	www_section = {http://dx.doi.org/10.1007/3-540-39805-8_29},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NetworkWithoutUserObservabiliy1985Pfitzmann.pdf},
 	author = {Pfitzmann, Andreas and Waidner, Michael},
 	editor = {Pichler, Franz}
@@ -16025,7 +16048,7 @@ We also sketch applications of these signatures to a payment system, solving dis
 	abstract = {The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis Steele Jr. and Gerald Jay Sussman. It was designed to have an exceptionally clear and simple semantics and few different ways to form expressions. A wide variety of programming paradigms, including imperative, functional, and message passing styles, find convenient expression in Scheme. The introduction offers a brief history of the language and of the report. The first three chapters present the fundamental ideas of the language and describe the notational conventions used for describing the language and for writing programs in the language},
 	issn = {0362-1340},
 	doi = {10.1145/15042.15043},
-	url = {http://en.scientificcommons.org/42347723},
+	www_section = {http://en.scientificcommons.org/42347723},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/r5rs.pdf},
 	author = {Rees, Jonathan and Clinger, William and Richard Kelsey}
 }
@@ -16034,7 +16057,7 @@ We also sketch applications of these signatures to a payment system, solving dis
 	year = {1986},
 	pages = {558{\textendash}563},
 	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_section = {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},
 	author = {Andrew Tanenbaum and Sape J. Mullender and Robbert Van Renesse}
 }
@@ -16050,7 +16073,7 @@ We also sketch applications of these signatures to a payment system, solving dis
 	abstract = {The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the {\textquotedblleft}Byzantine Generals{\textquotedblright} problem},
 	issn = {0004-5411},
 	doi = {10.1145/3149.214121},
-	url = {http://portal.acm.org/citation.cfm?id=214121$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=214121$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pods06_paper01.pdf},
 	author = {Fischer, Michael J. and Lynch, Nancy A. and Paterson, Michael S.}
 }
@@ -16066,7 +16089,7 @@ We also sketch applications of these signatures to a payment system, solving dis
 Therefore, we summarize basic concepts to keep the recipient and sender or at least their relationship unobservable, consider some possible implementations and necessary hierarchical extensions, and propose some suitable performance and reliability enhancements},
 	keywords = {anonymity, dining cryptographers, fault-tolerance, ISDN, mix, ring network, traffic analysis, user observability},
 	isbn = {0-387-16468-5},
-	url = {http://www.semper.org/sirene/publ/PfWa_86anonyNetze.html},
+	www_section = {http://www.semper.org/sirene/publ/PfWa_86anonyNetze.html},
 	author = {Andreas Pfitzmann and Michael Waidner}
 }
 @conference {ElGamal:1985:PKC:19478.19480,
@@ -16081,7 +16104,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
 	abstract = {A new signature scheme is proposed together with an implementation of the Diffie - Hellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the difficulty of computing discrete logarithms over finite fields},
 	keywords = {cryptosystem, discrete logarithms, public key, signature scheme},
 	isbn = {0-387-15658-5},
-	url = {http://dl.acm.org/citation.cfm?id=19478.19480s},
+	www_section = {http://dl.acm.org/citation.cfm?id=19478.19480s},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CRYPTO\%2784\%20-\%20El\%20Gamal\%20-\%20Public\%20Key\%20Cryptosystem.pdf},
 	author = {El Gamal, Taher}
 }
@@ -16098,7 +16121,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
 	keywords = {version control},
 	issn = {0038-0644},
 	doi = {10.1002/spe.4380150703},
-	url = {http://portal.acm.org/citation.cfm?id=4202$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=4202$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.56.3350_0.pdf},
 	author = {Tichy, Walter F.}
 }
@@ -16113,7 +16136,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
 	abstract = {The large-scale automated transaction systems of the near future can be designed to protect the privacy and maintain the security of both individuals and organizations},
 	issn = {0001-0782},
 	doi = {http://doi.acm.org/10.1145/4372.4373},
-	url = {http://portal.acm.org/citation.cfm?id=4373},
+	www_section = {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},
 	author = {David Chaum}
 }
@@ -16124,7 +16147,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
 	organization = {Butterworth-Heinemann},
 	address = {Newton, MA, USA},
 	isbn = {0932376223},
-	url = {http://portal.acm.org/citation.cfm?id=538134$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=538134$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Preface.pdf},
 	author = {Levy, Henry M.}
 }
@@ -16139,7 +16162,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
 	address = {New York, NY, USA},
 	issn = {0164-0925},
 	doi = {10.1145/357172.357176},
-	url = {http://portal.acm.org/citation.cfm?id=357176$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=357176$\#$},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/byz.pdf},
 	author = {Lamport, Leslie and Shostak, Robert and Pease, Marshall}
 }
@@ -16151,7 +16174,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
 	organization = {IEEE Computer Society},
 	address = {Washington, DC, USA},
 	doi = {10.1109/SFCS.1982.88},
-	url = {http://dx.doi.org/10.1109/SFCS.1982.88},
+	www_section = {http://dx.doi.org/10.1109/SFCS.1982.88},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ProtocolSecurecomputations1982Yao.pdf},
 	author = {Yao, Andrew C.}
 }
@@ -16181,7 +16204,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
 	abstract = {New Cryptographic protocols which take full advantage of the unique properties of public key cryptosystems are now evolving. Several protocols for public key distribution and for digital signatures are briefly compared with each other and with the conventional alternative},
 	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 = {http://www.computer.org/portal/web/csdl/doi/10.1109/SP.1980.10006},
 	author = {Ralph C. Merkle}
 }
 @conference {1979,
@@ -16191,7 +16214,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
 	organization = {ACM  New York, NY, USA},
 	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 = {http://portal.acm.org/citation.cfm?id=357081$\#$collab},
 	author = {Daniel G. Bobrow and Douglas W. Clark}
 }
 @article {padlipky78,
@@ -16202,7 +16225,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
 	institution = {The MITRE Corporation: Bedford MA, HQ Electronic Systems Division},
 	address = {Hanscom AFB, MA},
 	keywords = {traffic analysis},
-	url = {http://stinet.dtic.mil/cgi-bin/GetTRDoc?AD=3DA059221\&Location=3DU2\&doc=3D+=GetTRDoc.pdf},
+	www_section = {http://stinet.dtic.mil/cgi-bin/GetTRDoc?AD=3DA059221\&Location=3DU2\&doc=3D+=GetTRDoc.pdf},
 	author = {Michael A. Padlipsky and David W. Snow and Paul A. Karger}
 }
 @mastersthesis {karger77,
@@ -16249,11 +16272,11 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
 	pages = {35-57},
 	abstract = {A model is presented to account for the natural selection of what is termed reciprocally altruistic behavior. The model shows how selection can operate against the cheater (non-reciprocator) in the system. Three instances of altruistic behavior are discussed, the evolution of which the model can explain: (1) behavior involved in cleaning symbioses; (2) warning cries in birds; and (3) human reciprocal altruism. Regarding human reciprocal altruism, it is shown that the details of the psychological system that regulates this altruism can be explained by the model. Specifically, friendship, dislike, moralistic aggression, gratitude, sympathy, trust, suspicion, trustworthiness, aspects of guilt, and some forms of dishonesty and hypocrisy can be explained as important adaptations to regulate the altruistic system. Each individual human is seen as possessing altruistic and cheating tendencies, the expression of which is sensitive to developmental variables that were selected to set the tendencies at a balance appropriate to the local social and ecological environment},
 	keywords = {behavior, evolution, reciprocal altruism},
-	url = {http://www.jstor.org/pss/2822435},
+	www_section = {http://www.jstor.org/pss/2822435},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Trivers\%20-\%20The\%20evolution\%20of\%20reciprocal\%20altruism.pdf},
 	author = {Robert L. Trivers}
 }
-@article {1970,
+@article {1970_0,
 	title = {An Efficient Heuristic Procedure for Partitioning Graphs},
 	journal = {The Bell System Technical Journal },
 	volume = {49},
@@ -16265,7 +16288,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
 	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},
 	author = {Brian W. Kernighan and S. Lin}
 }
-@article {1970,
+@article {1970_1,
 	title = {The market for "lemons": Quality uncertainty and the market mechanism},
 	journal = {The Quarterly Journal of Economics},
 	volume = {84},
@@ -16273,7 +16296,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
 	month = aug,
 	pages = {488-500},
 	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_section = { http://www.jstor.org/stable/1879431},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/akerlof.pdf},
 	author = {George A. Akerlof}
 }
@@ -16285,7 +16308,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
 	pages = {422{\textendash}426},
 	abstract = {this paper trade-offs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages one-by-one for membership in a given set of messages. Two new hash- coding methods are examined and compared with a particular conventional hash-coding method. The computational factors considered are the size of the hash area (space), the time required to identify a message as a nonmember of the given set (reject time), and an allowable error frequency},
 	keywords = {Bloom filter, compression},
-	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.20.2080\&rep=rep1\&type=pdf},
+	www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.20.2080\&rep=rep1\&type=pdf},
 	author = {Burton H. Bloom}
 }
 @article {1968,
@@ -16308,7 +16331,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
 	keywords = {coding theory, low-density parity-check},
 	issn = {0096-1000 },
 	doi = {10.1109/TIT.1962.1057683   },
-	url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1057683},
+	www_section = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1057683},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ldpc.pdf},
 	author = {Robert G. Gallager}
 }
@@ -16321,7 +16344,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
 	month = jun,
 	pages = {300{\textendash}304},
 	keywords = {filing-erasure-coding},
-	url = {http://www.jstor.org/pss/2098968},
+	www_section = {http://www.jstor.org/pss/2098968},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Reed\%20\%26\%20Solomon\%20-\%20Polynomial\%20Codes\%20Over\%20Certain\%20Finite\%20Fields.pdf},
 	author = {Irving Reed and Golomb Solomon}
 }
@@ -16333,6 +16356,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
 	month = jan,
 	pages = {290-297},
 	keywords = {graphs, random, random graphs},
+        www_section = {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}
 }
@@ -16347,7 +16371,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
 	address = {New York, NY, USA},
 	issn = {0001-0782},
 	doi = {10.1145/368892.368907},
-	url = {http://portal.acm.org/citation.cfm?id=368907$\#$},
+	www_section = {http://portal.acm.org/citation.cfm?id=368907$\#$},
 	author = {Andrey Petrovych Ershov}
 }
 @article {1950,
@@ -16360,6 +16384,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},
 	keywords = {n-persona game, strategy},
 	doi = {10.1073/pnas.36.1.48},
+        www_section = {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.}
 }
@@ -16373,7 +16398,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
 	address = {Princeton, New Jersey, USA},
   keywords = {economic behavior, games, theory},
 	isbn = {978-0-691-13061-3 },
-	url = {http://www.archive.org/details/theoryofgamesand030098mbp},
+	www_section = {http://www.archive.org/details/theoryofgamesand030098mbp},
 	www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Neumann\%20\%26\%20Morgenstern\%20-\%20Theory\%20of\%20Games\%20and\%20Economic\%20Behavior.pdf},
 	author = {John von Neumann and Oskar Morgenstern}
 }

	gnunetbib Bibliography (BibTeX, based on AnonBib)
	Log \| Files \| Refs \| README \| LICENSE