commit 2b51f505cd0f7fbdb0c2ba929ef144f5495662b2
parent 9028462a19d88481acba02236f6800ad614d0a7b
Author: Nils Gillmann <ng0@n0.is>
Date: Mon, 8 Oct 2018 19:45:18 +0000
gnunetbib.bib
Signed-off-by: Nils Gillmann <ng0@n0.is>
Diffstat:
| M | gnunetbib.bib | | | 3542 | ++++++++++++++++++++++++++++++++++++++++--------------------------------------- |
1 file changed, 1794 insertions(+), 1748 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -44,10 +44,10 @@
pages = {0--100},
school = {TUM},
address = {Munich},
- 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},
+ abstract = {In this thesis we translate Brandt's privacy preserving sealed-bid online auction protocol from RSA to elliptic curve arithmetic and analyze the theoretical and practical benefits. With Brandt'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},
www_section = {auctions, GNUnet, secure multi-party computation},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/thesis_0.pdf},
- www_section = unsorted,
+ www_tags = selected,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/thesis_0.pdf},
url = {https://bibliography.gnunet.org},
author = {Markus Teich},
editor = {Totakura, Sree Harsha and Grothoff, Christian and Felix Brandt}
@@ -63,9 +63,9 @@
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},
www_section = {CADET, GNUnet, measurement, performance},
- www_section = unsorted,
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/lurchi-bs-thesis.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/lurchi-bs-thesis.pdf},
author = {Christian Ulrich}
}
@conference {dold2016byzantine,
@@ -73,8 +73,9 @@
booktitle = {International Conference on Availability, Reliability and Security (ARES)},
year = {2016},
www_section = unsorted,
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/dold2016byzantine.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/dold2016byzantine.pdf},
author = {Dold, Florian and Grothoff, Christian}
}
@conference {consensus2016,
@@ -82,10 +83,10 @@
booktitle = {International Conference on Availability, Reliability and Security (ARES)},
year = {2016},
month = jun,
- 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},
+ 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's set reconciliation protocol with Ben-Or'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},
www_section = {byzantine fault tolerance, consensus, GNUnet},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/consensus2016.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/consensus2016.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Florian Dold and Christian Grothoff}
}
@@ -97,10 +98,10 @@
publisher = {Springer},
organization = {Springer},
address = {Hyderabad},
- 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},
+ 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'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},
www_section = {blind signatures, GNUnet, incentives, payments, Taler, web},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/taler2016space.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/taler2016space.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Jeffrey Burdges and Florian Dold and Christian Grothoff and Marcello Stanisci}
}
@@ -113,10 +114,10 @@
school = {Humboldt-Universitaet zu Berlin},
type = {Diplomarbeit},
address = {Berlin},
- 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},
+ 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'll try to present a scheme of how both approaches may interact to realize their goals},
www_section = {GNUnet, peer-to-peer},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/xrs2016.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/xrs2016.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Christian Ricardo K{\"u}hne}
}
@@ -130,7 +131,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},
www_section = {Decentralisation, GNUnet, Identity and Access Management, User Attributes},
- www_section = unsorted,
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Martin Schanzenbach and Christian Banse}
}
@@ -144,8 +145,8 @@
address = {Heraklion, Greece},
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},
www_section = {abuse, GNUnet, Privacy preserving, reputation, Social networking},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p4t.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/p4t.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {{\'A}lvaro Garc{\'\i}a-Recuero and Jeffrey Burdges and Christian Grothoff}
}
@@ -155,8 +156,8 @@
year = {2016},
chapter = {46},
www_section = {Architecture, GNUnet, Internet},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fk-2016-1-p46.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fk-2016-1-p46.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Christian Ricardo K{\"u}hne}
}
@@ -171,8 +172,8 @@
address = {Muenchen},
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},
www_section = {byzantine consensus, GNUnet, secure multiparty computation, set reconciliation, voting},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ma_dold_consensus_21dec2015.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ma_dold_consensus_21dec2015.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Florian Dold}
}
@@ -184,8 +185,8 @@
address = {Muenchen},
www_section = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
journal = {unknown},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-es.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/mcb-es.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum}
}
@@ -197,8 +198,8 @@
address = {Muenchen},
www_section = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
journal = {unknown},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-it.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/mcb-it.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum and Luca Saiu}
}
@@ -210,21 +211,21 @@
address = {Muenchen},
www_section = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
journal = {unknown},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-fr.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/mcb-fr.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum and Ludovic Courtes}
}
@article {mcb-en2015,
- title = {NSA{\textquoteright}s MORECOWBELL: Knell for DNS},
+ title = {NSA's MORECOWBELL: Knell for DNS},
year = {2015},
month = jan,
institution = {GNUnet e.V},
address = {Muenchen},
www_section = {DNS, DNSSEC, MORECOWBELL, NAMECOIN, TLS},
journal = {unknown},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-en.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/mcb-en.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum}
}
@@ -237,12 +238,13 @@
school = {Technische Universit{\"a}t M{\"u}nchen},
type = {PhD},
address = {M{\"u}nchen},
- abstract = {This thesis provides the design and implementation of a secure and resilient communication infrastructure for decentralized peer-to-peer networks. The proposed communication infrastructure tries to overcome limitations to unrestricted communication on today{\textquoteright}s Internet and has the goal of re-establishing unhindered communication between users. With the GNU name system, we present a fully decentralized, resilient, and privacy-preserving alternative to DNS and existing security infrastructures},
+ abstract = {This thesis provides the design and implementation of a secure and resilient communication infrastructure for decentralized peer-to-peer networks. The proposed communication infrastructure tries to overcome limitations to unrestricted communication on today's Internet and has the goal of re-establishing unhindered communication between users. With the GNU name system, we present a fully decentralized, resilient, and privacy-preserving alternative to DNS and existing security infrastructures},
www_section = {Communication, GNU Name System, GNUnet, P2P, resilience},
+ www_tags = selected,
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NET-2015-02-1.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/NET-2015-02-1.pdf},
author = {Matthias Wachs}
}
@mastersthesis {panic2014,
@@ -258,8 +260,8 @@
This thesis presents Panic!, a combination of open hardware design and free software to detect physical integrity attacks and to react by securely erasing cryptographic keys and other sensitive data from memory. To improve auditability and to allow cheap reproduction, the components of Panic! are kept simple in terms of conceptual design and lines of code.
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},
www_section = {GNUnet, home router, intrusion detection, memory erasure, Panic, physical access},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/panic.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/panic.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Nicolas Bene{\v s}}
}
@@ -269,12 +271,12 @@
year = {2014},
month = oct,
address = {London. England},
- abstract = {Making communication more resilient is a main focus for modern decentralised networks. A current development to increase connectivity between participants and to be resilient against service degradation attempts is to support different communication protocols, and to switch between these protocols in case degradation or censorship are detected. Supporting multiple protocols with different properties and having to share resources for communication with multiple partners creates new challenges with respect to protocol selection and resource allocation to optimally satisfy the applications{\textquoteright} requirements for communication.
+ abstract = {Making communication more resilient is a main focus for modern decentralised networks. A current development to increase connectivity between participants and to be resilient against service degradation attempts is to support different communication protocols, and to switch between these protocols in case degradation or censorship are detected. Supporting multiple protocols with different properties and having to share resources for communication with multiple partners creates new challenges with respect to protocol selection and resource allocation to optimally satisfy the applications' requirements for communication.
This paper presents a novel approach for automatic transport selection and resource allocation with a focus on decentralised networks. Our goal is to evaluate the communication mechanisms available for each communication partner and then allocate resources in line with the requirements of the applications.
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},
www_section = {GNUnet, resource allocation},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/paper_short.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/paper_short.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Matthias Wachs and Fabian Oehlmann and Christian Grothoff}
}
@@ -292,7 +294,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pir_0.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/pir_0.pdf},
www_section = unsorted,
author = {Devet, Casey and Goldberg, Ian},
editor = {De Cristofaro, Emiliano and Murdoch, StevenJ}
@@ -304,8 +306,8 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
month = jan,
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},
www_section = {CADET, encryption, GNUnet, routing},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cadet.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cadet.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Polot, Bartlomiej and Christian Grothoff}
}
@@ -313,8 +315,8 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
title = {Censorship-Resistant and Privacy-Preserving Distributed Web Search},
booktitle = {IEEE International Conference on Peer to Peer computing},
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},
+ 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'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/plain/docs/DistributedSearch2014Hermann.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Michael Herrmann and Ren Zhang and Kai-Chun Ning and Claudia Diaz}
@@ -327,8 +329,8 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
organization = {Springer Verlag},
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},
www_section = {DNS, GNU Name System, GNUnet, PKI},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/paper_cans2014_camera_ready.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/paper_cans2014_camera_ready.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Matthias Wachs and Martin Schanzenbach and Christian Grothoff}
}
@@ -343,8 +345,8 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
address = {Munich},
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},
www_section = {event-driven, flow control, GNUnet, static analysis},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/scheibner_thesis.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/scheibner_thesis.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Florian Scheibner}
}
@@ -358,12 +360,12 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
type = {Masters},
address = {Garching bei Muenchen},
abstract = {As a means of reducing power consumption, hardware devices are capable to enter into sleep-states that have low power consumption. Waking up from those states in order to return to work is typically a rather energy-intensive activity. Some existing applications have non-urgent tasks that currently force hardware to wake up needlessly or prevent it from going to sleep. It would be better if such non-urgent activities could be scheduled to execute when the respective devices are active to maximize the duration of sleep-states. This requires cooperation between applications and the kernel in order to determine when the execution of a task will not be expensive in terms of power consumption.
- This work presents the design and implementation of Cryogenic, a POSIX-compatible API that enables clustering tasks based on the hardware activity state. Specifically, Cryogenic{\textquoteright}s API allows applications to defer their execution until other tasks use the device they want to use. As a result, two actions that contribute to reduce the device energy consumption are achieved: reduce the number of hardware wake-ups and maximize the idle periods.
+ This work presents the design and implementation of Cryogenic, a POSIX-compatible API that enables clustering tasks based on the hardware activity state. Specifically, Cryogenic's API allows applications to defer their execution until other tasks use the device they want to use. As a result, two actions that contribute to reduce the device energy consumption are achieved: reduce the number of hardware wake-ups and maximize the idle periods.
The energy measurements enacted at the end of this thesis demonstrate that, for the specific setup and conditions present during our experimentation, Cryogenic is capable to achieve savings between 1\% and 10\% for a USB WiFi device.
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},
www_section = {cooperative, cryogenic, GNUnet, Linux, POSIX, power},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/morales2014cryogenic.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/morales2014cryogenic.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Alejandra Morales}
}
@@ -374,14 +376,14 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
month = aug,
pages = {0--49},
school = {Technische Universitaet Muenchen},
- type = {Bachelor{\textquoteright}s},
+ type = {Bachelor's},
address = {Muenchen},
abstract = {Elections are a vital tool for decision-making in democratic societies. The past decade has witnessed a handful of attempts to apply modern technology to the election process in order to make it faster and more cost-effective.
Most of the practical efforts in this area have focused on replacing traditional voting booths with electronic terminals, but did not attempt to apply cryptographic techniques able to guarantee critical properties of elections such as secrecy of ballot and verifiability. While such techniques were extensively researched in the past 30 years, practical implementation of cryptographically secure remote electronic voting schemes are not readily available. All existing implementation we are aware of either exhibit critical security flaws, are proprietary black-box systems or require additional physical assumptions such as a preparatory key ceremony executed by the election officials. The latter makes such systems unusable for purely digital communities.
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},
www_section = {GNUnet, secure multiparty computation, voting},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ba_dold_voting_24aug2014.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ba_dold_voting_24aug2014.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Florian Dold}
}
@@ -395,8 +397,8 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
abstract = {In decentralized networks, collecting and analysing information from the network is useful for developers and operators to monitor the behaviour and detect anomalies such as attacks or failures in both the overlay and underlay networks. But realizing such an infrastructure is hard to achieve due to the decentralized nature of the network especially if the anomaly occurs on systems not operated by developers or participants get separated from the collection points. In this thesis a decentralized monitoring infrastructure using a decentralized peer-to-peer network is developed to collect information and detect anomalies in a collaborative way without coordination by and in absence of a centralized infrastructure and report detected incidents to a monitoring infrastructure.
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},
www_section = {anomaly, censorship, detection, GNUnet},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/decmon_0.pdf},
- www_section = unsorted,
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/decmon_0.pdf},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
author = {Omar Tarabai}
}
@@ -410,13 +412,14 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
publisher = {Springer International Publishing},
organization = {Springer International Publishing},
abstract = {Anonymous communication systems ensure that correspondence between senders and receivers cannot be inferred with certainty.However, when patterns are persistent, observations from anonymous
-communication systems enable the reconstruction of user behavioral profiles. Protection against profiling can be enhanced by adding dummy messages, generated by users or by the anonymity provider, to the communication. In this paper we study the limits of the protection provided by this countermeasure. We propose an analysis methodology based on solving a least squares problem that permits to characterize the adversary{\textquoteright}s profiling error with respect to the user behavior, the anonymity provider behavior, and the dummy strategy. Focusing on the particular case of a timed pool mix we show how, given a privacy target, the performance analysis can be used to design optimal dummy strategies to protect this objective},
+communication systems enable the reconstruction of user behavioral profiles. Protection against profiling can be enhanced by adding dummy messages, generated by users or by the anonymity provider, to the communication. In this paper we study the limits of the protection provided by this countermeasure. We propose an analysis methodology based on solving a least squares problem that permits to characterize the adversary's profiling error with respect to the user behavior, the anonymity provider behavior, and the dummy strategy. Focusing on the particular case of a timed pool mix we show how, given a privacy target, the performance analysis can be used to design optimal dummy strategies to protect this objective},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/anonymity_and_cover_traffic.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/anonymity_and_cover_traffic.pdf},
author = {Oya, Simon and Troncoso, Carmela and P{\'e}rez-Gonz{\'a}lez, Fernando},
+ www_section = unsorted,
editor = {De Cristofaro, Emiliano and Murdoch, StevenJ}
}
@article {private_presence_service2014,
@@ -430,7 +433,7 @@ service that provides privacy-friendly indication of presence to support real-ti
list secret. Besides presence, high-integrity status updates are supported, to facilitate key update and rendezvous protocols. While infrastructure services are required for DP5 to operate, they are
designed to not require any long-term secrets and provide perfect forward secrecy in case of compromise. We provide security arguments for the indistinguishability properties of the protocol, as well
as an evaluation of its performance},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DP5\%3A\%20A\%20Private\%20Presence\%20Service.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/DP5\%3A\%20A\%20Private\%20Presence\%20Service.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Borisov, Nikita and Danezis, George and Goldberg, Ian}
@@ -448,7 +451,7 @@ as an evaluation of its performance},
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/obfuscation_osn.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/obfuscation_osn.pdf},
www_section = unsorted,
author = {Chen, Terence and Boreli, Roksana and Kaafar, Mohamed-Ali and Friedman, Arik},
editor = {De Cristofaro, Emiliano and Murdoch, StevenJ}
@@ -464,10 +467,53 @@ as an evaluation of its performance},
address = {Saarbruecken},
abstract = {Distributed Hash Tables (DHTs) are a key data structure for construction of a peer to peer systems. They provide an efficient way to distribute the storage and retrieval of key-data pairs among the participating peers. DHTs should be scalable, robust against churn and resilient to attacks. X-Vine is a DHT protocol which offers security against Sybil attacks. All communication among peers is performed over social network links, with the presumption that a friend can be trusted. This trust can be extended to a friend of a friend. It uses the tested Chord Ring topology as an overlay, which has been proven to be scalable and robust. The aim of the thesis is to experimentally compare two DHTs, R5 N and X-Vine. GNUnet is a free software secure peer to peer framework, which uses R 5N . In this thesis, we have presented the implementation of X-Vine on GNUnet, and compared the performance of R5 N and X-Vine},
www_section = {DHT, GNUnet, performance analysis, testbed, X-vine},
+ www_tags = selected,
url = {https://bibliography.gnunet.org},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SupritiSinghMasterThesis.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SupritiSinghMasterThesis.pdf},
author = {Supriti Singh}
}
+@mastersthesis {2017_0,
+ title = {The GNUnet System},
+ volume = {HDR},
+ year = {2017},
+ month = dec,
+ pages = {0--181},
+ school = {Universit{\'e} de Rennes 1},
+ type = {Habilitation {\`a} diriger des recherches},
+ address = {Rennes},
+ abstract = {GNUnet is an alternative network stack for building secure, decentralized and privacy-preserving distributed applications. Our goal is to replace the old insecure Internet protocol stack. Starting from an application for secure publication of files, it has grown to include all kinds of basic protocol components and applications towards the creation of a GNU internet. This habilitation provides an overview of the GNUnet architecture, including the development process, the network architecture and the software architecture. The goal of Part 1 is to provide an overview of how the various parts of the project work together today, and to then give ideas for future directions. The text is a first attempt to provide this kind of synthesis, and in return does not go into extensive technical depth on any particular topic. Part 2 then gives selected technical details based on eight publications covering many of the core components. This is a harsh selection; on the GNUnet website there are more than 50 published research papers and theses related to GNUnet, providing extensive and in-depth documentation. Finally, Part 3 gives an overview of current plans and future work.},
+ keywords = {decentralization, GNUnet, peer-to-peer, privacy, private information retrieval, routing, secure multiparty computation, self-organization},
+ www_section = {decentralization, GNUnet, peer-to-peer, privacy, private information retrieval, routing, secure multiparty computation, self-organization},
+ www_tags = selected,
+ doi = {https://hal.inria.fr/tel-01654244},
+ url = {https://grothoff.org/christian/habil.pdf},
+ author = {Grothoff, Christian}
+}
+@article {2018_0,
+ title = {Toward secure name resolution on the internet},
+ journal = {Computers \& Security},
+ year = {2018},
+ abstract = {The Domain Name System (DNS) provides crucial name resolution functions for most Internet services. As a result, DNS traffic provides an important attack vector for mass surveillance, as demonstrated by the QUANTUMDNS and MORECOWBELL programs of the NSA. This article reviews how DNS works and describes security considerations for next generation name resolution systems. We then describe DNS variations and analyze their impact on security and privacy. We also consider Namecoin, the GNU Name System and RAINS, which are more radical re-designs of name systems in that they both radically change the wire protocol and also eliminate the existing global consensus on TLDs provided by ICANN. Finally, we assess how the different systems stack up with respect to the goal of improving security and privacy of name resolution for the future Internet.},
+ keywords = {Future Internet, GNUnet, Name resolution, network architecture, privacy, Technology and society},
+ www_section = {Future Internet, GNUnet, Name resolution, network architecture, privacy, Technology and society},
+ issn = {0167-4048},
+ doi = {https://doi.org/10.1016/j.cose.2018.01.018},
+ url = {http://www.sciencedirect.com/science/article/pii/S0167404818300403},
+ www_tags = selected,
+ author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum}
+}
+@conference {2018_1,
+ title = {reclaimID: Secure, Self-Sovereign Identities using Name Systems and Attribute-Based Encryption},
+ booktitle = {ArXiv e-prints},
+ year = {2018},
+ abstract = {In this paper we present reclaimID: An architecture that allows users to reclaim their digital identities by securely sharing identity attributes without the need for a centralised service provider. We propose a design where user attributes are stored in and shared over a name system under user-owned namespaces. Attributes are encrypted using attribute-based encryption (ABE), allowing the user to selectively authorize and revoke access of requesting parties to subsets of his attributes. We present an implementation based on the decentralised GNU Name System (GNS) in combination with ciphertext-policy ABE using type-1 pairings. To show the practicality of our implementation, we carried out experimental evaluations of selected implementation aspects including attribute resolution performance. Finally, we show that our design can be used as a standard OpenID Connect Identity Provider allowing our implementation to be integrated into standard-compliant services.},
+ keywords = {Computer Science - Cryptography and Security},
+ www_section = {Computer Science - Cryptography and Security},
+ url = {https://arxiv.org/abs/1805.06253v1},
+ www_tags = selected,
+ author = {Schanzenbach, M. and Bramm, G. and Sch{\"u}tte, J.}
+}
+
@book {forward_secure_encryption2014,
title = {Forward-Secure Distributed Encryption},
booktitle = {Privacy Enhancing Technologies},
@@ -485,7 +531,7 @@ distributed encryption scheme that is much more efficient for small plaintext do
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/foward_secure_encryption.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/foward_secure_encryption.pdf},
www_section = unsorted,
author = {Lueks, Wouter and Hoepman, Jaap-Henk and Kursawe, Klaus},
editor = {De Cristofaro, Emiliano and Murdoch, StevenJ}
@@ -495,14 +541,14 @@ distributed encryption scheme that is much more efficient for small plaintext do
volume = {M.S},
year = {2014},
month = aug,
- type = {Master{\textquoteright}s},
+ type = {Master's},
abstract = {Port scanning is used to discover vulnerable services and launch attacks against network infrastructure. Port knocking is a well-known technique to hide TCP servers from port scanners. This thesis presents the design of TCP Stealth, a socket option to realize new port knocking variant with improved security and usability compared to previous designs.
TCP Stealth replaces the traditional random TCP SQN number with a token that authenticates the client and (optionally) the first bytes of the TCP payload. Clients and servers can enable TCP Stealth by explicitly setting a socket option or linking against a library that wraps existing network system calls.
This thesis also describes Knock, a free software implementation of TCP Stealth for the Linux kernel and {\tt libknockify}, a shared library that wraps network system calls to activate Knock on GNU/Linux systems, allowing administrators to deploy Knock without recompilation. Finally, we present experimental results demonstrating that TCP Stealth is compatible with most existing middleboxes on the Internet},
www_section = {GNUnet, Hacienda, Knock, TCP Stealth},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ma_kirsch_2014_0.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ma_kirsch_2014_0.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Julian Kirsch}
@@ -516,7 +562,7 @@ This thesis also describes Knock, a free software implementation of TCP Stealth
organization = {W3C/IAB},
address = {London, UK},
www_section = {GNU Name System, GNUnet, KBR, PKI},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/strint2014.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/strint2014.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Christian Grothoff and Polot, Bartlomiej and Carlo von Loesch}
@@ -530,7 +576,7 @@ This thesis also describes Knock, a free software implementation of TCP Stealth
school = {Technische Universitaet Muenchen},
type = {Masters},
address = {Garching bei Muenchen},
- abstract = {The successful operation of a peer-to-peer network depends on the resilience of its peer{\textquoteright}s
+ abstract = {The successful operation of a peer-to-peer network depends on the resilience of its peer's
communications. On the Internet, direct connections between peers are often limited by restrictions like NATs and traffic filtering. Addressing such problems is particularly pressing for peer-to-peer networks that do not wish to rely on any trusted infrastructure, which might otherwise help the participants establish communication channels. Modern peer-to-peer networks employ various techniques to address the problem of restricted connectivity on the Internet. One interesting development is that various overlay networks now support multiple communication protocols to improve resilience and counteract service degradation.
The support of multiple protocols causes a number of new challenges. A peer should evaluate which protocols fulfill the communication requirements best. Furthermore, limited resources, such as bandwidth, should be distributed among peers and protocols to match application requirements. Existing approaches to this problem of transport selection and resource allocation are rigid: they calculate the solution only from the current state of the
@@ -541,7 +587,7 @@ This thesis explores the feasibility of using machine learning to improve the qu
The design is evaluated with the help of simulation and a realistic implementation in the GNUnet Peer-to-Peer framework. Our experimental results highlight some of the implications of the multitude of implementation choices, key challenges, and possible directions for the use of reinforcement learning in this domain},
www_section = {bandwidth allocation, GNUnet, machine learning},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/oehlmann2014machinelearning.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/oehlmann2014machinelearning.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Fabian Oehlmann}
@@ -553,14 +599,14 @@ The design is evaluated with the help of simulation and a realistic implementati
month = feb,
pages = {0--65},
school = {Technische Universitaet Muenchen},
- type = {Bachelor{\textquoteright}s},
+ type = {Bachelor's},
address = {Garching bei Muenchen},
abstract = {Linear programming (LP) has numerous applications in different fields. In some scenarios, e.g. supply chain master planning (SCMP), the goal is solving linear programs involving multiple parties reluctant to sharing their private information. In this case, methods from the area of secure multi-party computation (SMC) can be used. Secure multi-party versions of LP solvers have been known to be impractical due to high communication complexity. To overcome this, solutions based on problem transformation have been put forward.
In this thesis, one such algorithm, proposed by Dreier and Kerschbaum, is discussed, implemented, and evaluated with respect to numerical stability and scalability. Results
obtained with different parameter sets and different test cases are presented and some problems are exposed. It was found that the algorithm has some unforeseen limitations, particularly when implemented within the bounds of normal primitive data types. Random numbers generated during the protocol have to be extremely small so as to not cause problems with overflows after a series of multiplications. The number of peers participating additionally limits the size of numbers. A positive finding was that results produced when none of the aforementioned problems occur are generally quite accurate. We discuss a few possibilities to overcome some of the problems with an implementation using arbitrary precision numbers},
www_section = {GNUnet, linear programming, secure multi-party computation},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/arias2014bs.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/arias2014bs.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Raphael Arias}
@@ -588,7 +634,7 @@ In this paper we explore the implications of differential privacy when the indis
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Brodening2013Chatzikokolakis.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Brodening2013Chatzikokolakis.pdf},
www_section = unsorted,
author = {Chatzikokolakis, Konstantinos and Andr{\'e}s, MiguelE. and Bordenabe, Nicol{\'a}sEmilio and Palamidessi, Catuscia},
editor = {De Cristofaro, Emiliano and Wright, Matthew}
@@ -599,11 +645,11 @@ In this paper we explore the implications of differential privacy when the indis
year = {2013},
pages = {0--76},
school = {University of Amsterdam},
- type = {Master{\textquoteright}s},
+ type = {Master's},
address = {Amsterdam},
abstract = {This work presents the design of a social messaging service for the GNUnet peer-to-peer framework that offers scalability, extensibility, and end-to-end encrypted communication. The scalability property is achieved through multicast message delivery, while extensibility is made possible by using PSYC (Protocol for SYnchronous Communication), which provides an extensible RPC (Remote Procedure Call) syntax that can evolve over time without having to upgrade the software on all nodes in the network. Another key feature provided by the PSYC layer are stateful multicast channels, which are used to store e.g. user profiles. End-to-end encrypted communication is provided by the mesh service of GNUnet, upon which the multicast channels are built. Pseudonymous users and social places in the system have cryptographical identities --- identified by their public key --- these are mapped to human memorable names using GNS (GNU Name System), where each pseudonym has a zone pointing to its places},
www_section = {GNS, GNUnet, PSYC, social networks},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/gnunet-psyc.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/gnunet-psyc.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Gabor X Toth}
@@ -619,8 +665,8 @@ In this paper we explore the implications of differential privacy when the indis
abstract = {A central problem on the Internet today is that key infrastructure for security is concentrated in a few places. This is particularly true in the areas of naming and public key infrastructure. Secret services and other government organizations can use this fact to block access to information or monitor communications. One of the most popular and easy to perform techniques is to make information on the Web inaccessible by censoring or manipulating the Domain Name System (DNS). With the introduction of DNSSEC, the DNS is furthermore posed to become an alternative PKI to the failing X.509 CA system, further cementing the power of those in charge of operating DNS.
This paper maps the design space and gives design requirements for censorship resistant name systems. We survey the existing range of ideas for the realization of such a system and discuss the challenges these systems have to overcome in practice. Finally, we present the results from a survey on browser usage, which supports the idea that delegation should be a key ingredient in any censorship resistant name system},
- www_section = {DNS, GNS, GNU Name System, GNUnet, PKI, SDSI, Zooko{\textquoteright}s Triangle},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fps2013wachs.pdf},
+ www_section = {DNS, GNS, GNU Name System, GNUnet, PKI, SDSI, Zooko's Triangle},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fps2013wachs.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Matthias Wachs and Martin Schanzenbach and Christian Grothoff}
@@ -643,7 +689,7 @@ This paper maps the design space and gives design requirements for censorship re
school = {Technische Universitaet Muenchen},
type = {Masters },
address = {Garching bei Muenchen},
- abstract = {Evaluations of P2P protocols during the system{\textquoteright}s design and implementation phases are commonly done through simulation and emulation respectively. While the current state-of-the-art simulation allows evaluations with many millions of peers through the use of abstractions, emulation still lags behind as it involves executing the real implementation at some parts of the system. This difference in scales can make it hard to relate the evaluations made created with simulation and emulation during the design and implementation phases and can results in a limited evaluation of the implementation, which may cause severe problems after deployment.
+ abstract = {Evaluations of P2P protocols during the system's design and implementation phases are commonly done through simulation and emulation respectively. While the current state-of-the-art simulation allows evaluations with many millions of peers through the use of abstractions, emulation still lags behind as it involves executing the real implementation at some parts of the system. This difference in scales can make it hard to relate the evaluations made created with simulation and emulation during the design and implementation phases and can results in a limited evaluation of the implementation, which may cause severe problems after deployment.
In this thesis, we build upon an existing emulator for P2P applications to push the scales offered by emulation towards the limits set by simulation. Our approach distributes and co-ordinates the emulation across many hosts. Large deployments are possible by deploying hundreds or thousands of peers on each host.
@@ -651,7 +697,7 @@ To address the varying needs of an experimenter and the range of available hardw
We specifically target HPC systems like compute clusters and supercomputers and demonstrate how such systems can be used for large scale emulations by evaluating two P2P applications with deployment sizes up to 90k peers on a supercomputer},
www_section = {emulation, GNUnet, large scale testing, protocol evaluation, testbed},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/thesis_lowres.pdf , https://gnunet.org/git/bibliography.git/tree/docs/thesis.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/thesis_lowres.pdf , https://gnunet.org/git/bibliography.git/plain/docs/thesis.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Totakura, Sree Harsha}
@@ -667,9 +713,9 @@ We specifically target HPC systems like compute clusters and supercomputers and
address = {Munich},
abstract = {Automatic crash handlers support software developers in finding bugs and fixing the problems in their code. Most of them behave similarly in providing the developer with a (symbolic) stack trace and a memory dump of the crashed application. This introduces some problems that we try to fix with our proposed automatic bug reporting system called "Monkey".
-In this paper we describe the problems that occur when debugging widely distributed systems and how Monkey handles them. First, we describe our Motivation for develop- ing the Monkey system. Afterwards we present the most common existing automatic crash handlers and how they work. Thirdly you will get an overview of the Monkey system and its components. In the fourth chapter we will analyze one report gener- ated by Monkey, evaluate an online experiment we conducted and present some of our finding during the development of the clustering algorithm used to categorize crash reports. Last, we discuss some of Monkeys features and compare them to the existing approaches. Also some ideas for the future development of the Monkey system are presented before we conclude that Monkey{\textquoteright}s approach is promising, but some work is still left to establish Monkey in the open source community},
+In this paper we describe the problems that occur when debugging widely distributed systems and how Monkey handles them. First, we describe our Motivation for develop- ing the Monkey system. Afterwards we present the most common existing automatic crash handlers and how they work. Thirdly you will get an overview of the Monkey system and its components. In the fourth chapter we will analyze one report gener- ated by Monkey, evaluate an online experiment we conducted and present some of our finding during the development of the clustering algorithm used to categorize crash reports. Last, we discuss some of Monkeys features and compare them to the existing approaches. Also some ideas for the future development of the Monkey system are presented before we conclude that Monkey's approach is promising, but some work is still left to establish Monkey in the open source community},
www_section = {automatic, clustering, debugging, GDB, GNUnet, report, Tor},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/main_0.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/main_0.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Markus Teich}
@@ -686,7 +732,7 @@ In this paper we describe the problems that occur when debugging widely distribu
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p169-al-ameen.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/p169-al-ameen.pdf},
author = {Al-Ameen, Mahdi N. and Matthew Wright}
}
@book {sep-privacy,
@@ -706,7 +752,7 @@ In this paper we describe the problems that occur when debugging widely distribu
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 -- such as DANE or TACK -- 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},
www_section = {certificate, pinning, PKI, public key pinning, TLS, TOFU, trust on first use, X.509},
journal = {unknown},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tofu-pinning.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/tofu-pinning.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Gabor X Toth},
@@ -714,12 +760,12 @@ In this paper we describe the problems that occur when debugging widely distribu
}
@mastersthesis {2013_5,
title = {Speeding Up Tor with SPDY},
- volume = {Master{\textquoteright}s in Computer Science},
+ volume = {Master's in Computer Science},
year = {2013},
month = nov,
pages = {0--124},
school = {Technische Universitaet Muenchen},
- type = {Master{\textquoteright}s},
+ type = {Master's},
address = {Garching bei Muenchen},
abstract = {SPDY is a rather new protocol which is an alternative to HTTP. It was designed to address inefficiencies in the latter and thereby improve latency and reduce bandwidth consumption.
@@ -729,7 +775,7 @@ Furthermore, we focus on the SPDY server push feature which allows servers to se
This thesis includes extensive measurement data highlighting the possible benefits of using SPDY instead of HTTP and HTTPS (1.0 or 1.1), especially with respect to networks experiencing latency or loss. Moreover, the real profit from using SPDY within the Tor network on loading some of the most popular web sites is presented. Finally, evaluations of the proposed push prediction algorithm are given for emphasizing the possible gain of employing it at SPDY reverse and forward proxies},
www_section = {anonymity, HTTP, privacy, spdy, Tor},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/uzunov2013torspdy.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/uzunov2013torspdy.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Andrey Uzunov}
@@ -741,7 +787,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
number = {1987},
year = {2013},
month = mar,
- abstract = {The Web has become a user-centric platform where users post, share, annotate, comment and forward content be it text, videos, pictures, URLs, etc. This social dimension creates tremendous new opportunities for information exchange over the Internet, as exemplified by the surprising and exponential growth of social networks and collaborative platforms. Yet, niche content is sometimes difficult to retrieve using traditional search engines because they target the mass rather than the individual. Likewise, relieving users from useless notification is tricky in a world where there is so much information and so little of interest for each and every one of us. We argue that ultra-specific content could be retrieved and disseminated should search and notification be personalized to fit this new setting. We also argue that users{\textquoteright} interests should be implicitly captured by the system rather than relying on explicit classifications simply because the world is by nature unstructured, dynamic and users do not want to be hampered in their actions by a tight and static framework. In this paper, we review some existing personalization approaches, most of which are centralized. We then advocate the need for fully decentralized systems because personalization raises two main issues. Firstly, personalization requires information to be stored and maintained at a user granularity which can significantly hurt the scalability of a centralized solution. Secondly, at a time when the {\textquoteleft}big brother is watching you{\textquoteright} attitude is prominent, users may be more and more reluctant to give away their personal data to the few large companies that can afford such personalization. We start by showing how to achieve personalization in decentralized systems and conclude with the research agenda ahead},
+ abstract = {The Web has become a user-centric platform where users post, share, annotate, comment and forward content be it text, videos, pictures, URLs, etc. This social dimension creates tremendous new opportunities for information exchange over the Internet, as exemplified by the surprising and exponential growth of social networks and collaborative platforms. Yet, niche content is sometimes difficult to retrieve using traditional search engines because they target the mass rather than the individual. Likewise, relieving users from useless notification is tricky in a world where there is so much information and so little of interest for each and every one of us. We argue that ultra-specific content could be retrieved and disseminated should search and notification be personalized to fit this new setting. We also argue that users' interests should be implicitly captured by the system rather than relying on explicit classifications simply because the world is by nature unstructured, dynamic and users do not want to be hampered in their actions by a tight and static framework. In this paper, we review some existing personalization approaches, most of which are centralized. We then advocate the need for fully decentralized systems because personalization raises two main issues. Firstly, personalization requires information to be stored and maintained at a user granularity which can significantly hurt the scalability of a centralized solution. Secondly, at a time when the {\textquoteleft}big brother is watching you' attitude is prominent, users may be more and more reluctant to give away their personal data to the few large companies that can afford such personalization. We start by showing how to achieve personalization in decentralized systems and conclude with the research agenda ahead},
issn = {1364-503X},
doi = {10.1098/rsta.2012.0380},
www_section = unsorted,
@@ -754,7 +800,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
year = {2013},
www_section = {anonymity network, arbitrary hidden services, command and control channels, data privacy, deanonymize hidden services, DuckDuckGo search engine, hidden services, Internet, Internet service privacy, privacy, search engines, Silk Road, Tor, Tor hidden services, volunteer based anonymity network, volunteer operated relays},
doi = {10.1109/SP.2013.15},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Trawling_for_tor_HS.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Trawling_for_tor_HS.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Biryukov, A. and Pustogarov, I. and Weinmann, R.}
@@ -766,7 +812,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
publisher = {IEEE},
organization = {IEEE},
abstract = {We present WHATSUP, a collaborative filtering system for disseminating news items in a large-scale dynamic setting with no central authority. WHATSUP constructs an implicit social network based on user profiles that express the opinions of users about the news items they receive (like-dislike). Users with similar tastes are clustered using a similarity metric reflecting long-standing and emerging (dis)interests. News items are disseminated through a novel heterogeneous gossip protocol that (1) biases the orientation of its targets towards those with similar interests, and (2) amplifies dissemination based on the level of interest in every news item. We report on an extensive evaluation of WHATSUP through (a) simulations, (b) a ModelNet emulation on a cluster, and (c) a PlanetLab deployment based on real datasets. We show that WHATSUP outperforms various alternatives in terms of accurate and complete delivery of relevant news items while preserving the fundamental advantages of standard gossip: namely, simplicity of deployment and robustness},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/whatsup.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/whatsup.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Antoine Boutet and Davide Frey and Rachid Guerraoui and Arnaud Jegou and Anne-Marie Kermarrec}
@@ -784,7 +830,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
issn = {0146-4833},
doi = {10.1145/2377677.2377699},
url = {http://doi.acm.org/10.1145/2377677.2377699},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/autonetkit-small.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/autonetkit-small.pdf},
author = {Knight, Simon and Jaboldinov, Askar and Maennel, Olaf and Phillips, Iain and Roughan, Matthew}
}
@book {2012_0,
@@ -800,20 +846,20 @@ This thesis includes extensive measurement data highlighting the possible benefi
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BLIP2012Alaggan.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/BLIP2012Alaggan.pdf},
www_section = unsorted,
author = {Alaggan, Mohammad and Gambs, S{\'e}bastien and Kermarrec, Anne-Marie},
editor = {Richa, Andr{\'e}aW. and Scheideler, Christian}
}
@conference {congestion-tor12,
title = {Congestion-aware Path Selection for Tor},
- booktitle = {FC{\textquoteright}12--Proceedings of the 16th International Conference in Financial Cryptography and Data Security },
+ booktitle = {FC'12--Proceedings of the 16th International Conference in Financial Cryptography and Data Security },
year = {2012},
month = feb,
address = {Bonaire},
- abstract = {Tor, an anonymity network formed by volunteer nodes, uses the estimated bandwidth of the nodes as a central feature of its path selection algorithm. The current load on nodes is not considered in this algorithm, however, and we observe that some nodes persist in being under-utilized or congested. This can degrade the network{\textquoteright}s performance, discourage Tor adoption, and consequently reduce the size of Tor{\textquoteright}s anonymity set. In an effort to reduce congestion and improve load balancing, we propose a congestion-aware path selection algorithm. Using latency as an indicator of congestion, clients use opportunistic and lightweight active measurements to evaluate the congestion state of nodes, and reject nodes that appear congested. Through experiments conducted on the live Tor network, we verify our hypothesis that clients can infer congestion using latency and show that congestion-aware path selection can improve performance},
+ abstract = {Tor, an anonymity network formed by volunteer nodes, uses the estimated bandwidth of the nodes as a central feature of its path selection algorithm. The current load on nodes is not considered in this algorithm, however, and we observe that some nodes persist in being under-utilized or congested. This can degrade the network's performance, discourage Tor adoption, and consequently reduce the size of Tor's anonymity set. In an effort to reduce congestion and improve load balancing, we propose a congestion-aware path selection algorithm. Using latency as an indicator of congestion, clients use opportunistic and lightweight active measurements to evaluate the congestion state of nodes, and reject nodes that appear congested. Through experiments conducted on the live Tor network, we verify our hypothesis that clients can infer congestion using latency and show that congestion-aware path selection can improve performance},
www_section = {algorithms, Tor, volunteer nodes},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FC\%2712\%20-\%20Congestion-aware\%20Path\%20Selection\%20for\%20Tor.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/FC\%2712\%20-\%20Congestion-aware\%20Path\%20Selection\%20for\%20Tor.pdf},
url = {https://bibliography.gnunet.org},
author = {Tao Wang and Kevin Bauer and Clara Forero and Ian Goldberg}
}
@@ -828,7 +874,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
isbn = {978-1-4503-1628-6},
doi = {10.1145/2387238.2387253},
url = {http://doi.acm.org/10.1145/2387238.2387253},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/crisp-mswim.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/crisp-mswim.pdf},
author = {Sadiq, Umair and Kumar, Mohan and Wright, Matthew}
}
@article {DBLP:journals/corr/abs-1202-4503,
@@ -840,7 +886,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
abstract = {While the Internet was conceived as a decentralized network, the most widely used web applications today tend toward centralization. Control increasingly rests with centralized service providers who, as a consequence, have also amassed unprecedented amounts of data about the behaviors and personalities of individuals. Developers, regulators, and consumer advocates have looked to alternative decentralized architectures as the natural response to threats posed by these centralized services. The result has been a great variety of solutions that include personal data stores (PDS), infomediaries, Vendor Relationship Management (VRM) systems, and federated and distributed social networks. And yet, for all these efforts, decentralized personal data architectures have seen little adoption. This position paper attempts to account for these failures, challenging the accepted wisdom in the web community on the feasibility and desirability of these approaches. We start with a historical discussion of the development of various categories of decentralized personal data architectures. Then we survey the main ideas to illustrate the common themes among these efforts. We tease apart the design characteristics of these systems from the social values that they (are intended to) promote. We use this understanding to point out numerous drawbacks of the decentralization paradigm, some inherent and others incidental. We end with recommendations for designers of these systems for working towards goals that are achievable, but perhaps more limited in scope and ambition},
www_section = {distributed social networks, economics, personal data stores, policy, privacy, web},
url = {https://bibliography.gnunet.org},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CoRR\%20-\%20Critical\%20look\%20at\%20decentralization.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_2,
@@ -854,7 +900,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
address = {Garching bei Muenchen},
abstract = {This thesis presents a novel approach for decentralized evaluation of regular expressions for capability discovery in DHT-based overlays. The system provides support for announcing capabilities expressed as regular expressions and discovering participants offering adequate capabilities. The idea behind our approach is to convert regular expressions into finite automatons and store the corresponding states and transitions in a DHT. We show how locally constructed DFA are merged in the DHT into an NFA without the knowledge of any NFA already present in the DHT and without the need for any central authority. Furthermore we present options of optimizing the DFA. There exist several possible applications for this general approach of decentralized regular expression evaluation. However, in this thesis we focus on the application of discovering users that are willing to provide network access using a specified protocol to a particular destination. We have implemented the system for our proposed approach and conducted a simulation. Moreover we present the results of an emulation of the implemented system in a cluster},
www_section = {DFA, distributed hash table, GNUnet, NFA, regular expressions, search},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/szengel2012ms.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/szengel2012ms.pdf},
url = {https://bibliography.gnunet.org},
author = {Maximilian Szengel}
}
@@ -865,11 +911,11 @@ This thesis includes extensive measurement data highlighting the possible benefi
month = sep,
pages = {0--116},
school = {TU Munich},
- type = {Master{\textquoteright}s},
+ type = {Master's},
address = {Garching bei Muenchen},
- abstract = {This thesis presents the design and implementation of the GNU Alternative Domain System (GADS), a decentralized, secure name system providing memorable names for the Internet as an alternative to the Domain Name System (DNS). The system builds on ideas from Rivest{\textquoteright}s Simple Distributed Security Infrastructure (SDSI) to address a central issue with providing a decentralized mapping of secure identifiers to memorable names: providing a global, secure and memorable mapping is impossible without a trusted authority. SDSI offers an alternative by linking local name spaces; GADS uses the transitivity provided by the SDSI design to build a decentralized and censorship resistant name system without a trusted root based on secure delegation of authority. Additional details need to be considered in order to enable GADS to integrate smoothly with the World Wide Web. While following links on the Web matches following delegations in GADS, the existing HTTP-based infrastructure makes many assumptions about globally unique names; however, proxies can be used to enable legacy applications to function with GADS. This work presents the fundamental goals and ideas behind GADS, provides technical details on how GADS has been implemented and discusses deployment issues for using GADS with existing systems. We discuss how GADS and legacy DNS can interoperate during a transition period and what additional security advantages GADS offers over DNS with Security Extensions (DNSSEC). Finally, we present the results of a survey into surfing behavior, which suggests that the manual introduction of new direct links in GADS will be infrequent},
+ abstract = {This thesis presents the design and implementation of the GNU Alternative Domain System (GADS), a decentralized, secure name system providing memorable names for the Internet as an alternative to the Domain Name System (DNS). The system builds on ideas from Rivest's Simple Distributed Security Infrastructure (SDSI) to address a central issue with providing a decentralized mapping of secure identifiers to memorable names: providing a global, secure and memorable mapping is impossible without a trusted authority. SDSI offers an alternative by linking local name spaces; GADS uses the transitivity provided by the SDSI design to build a decentralized and censorship resistant name system without a trusted root based on secure delegation of authority. Additional details need to be considered in order to enable GADS to integrate smoothly with the World Wide Web. While following links on the Web matches following delegations in GADS, the existing HTTP-based infrastructure makes many assumptions about globally unique names; however, proxies can be used to enable legacy applications to function with GADS. This work presents the fundamental goals and ideas behind GADS, provides technical details on how GADS has been implemented and discusses deployment issues for using GADS with existing systems. We discuss how GADS and legacy DNS can interoperate during a transition period and what additional security advantages GADS offers over DNS with Security Extensions (DNSSEC). Finally, we present the results of a survey into surfing behavior, which suggests that the manual introduction of new direct links in GADS will be infrequent},
www_section = {censorship resistance, decentralized, DNS, GNU Name System, GNUnet},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/schanzen2012msc.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/schanzen2012msc.pdf},
url = {https://bibliography.gnunet.org},
author = {Martin Schanzenbach}
}
@@ -882,13 +928,13 @@ This thesis includes extensive measurement data highlighting the possible benefi
pages = {497--516},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
- abstract = {In this work we revisit the question of basing cryptography on imperfect randomness. Bosley and Dodis (TCC{\textquoteright}07) showed that if a source of randomness R is {\textquotedblleft}good enough{\textquotedblright} to generate a secret key capable of encrypting k bits, then one can deterministically extract nearly k almost uniform bits from R, suggesting that traditional privacy notions (namely, indistinguishability of encryption) requires an {\textquotedblleft}extractable{\textquotedblright} source of randomness. Other, even stronger impossibility results are known for achieving privacy under specific {\textquotedblleft}non-extractable{\textquotedblright} sources of randomness, such as the {\gamma}-Santha-Vazirani (SV) source, where each next bit has fresh entropy, but is allowed to have a small bias {\gamma} < 1 (possibly depending on prior bits).
-We ask whether similar negative results also hold for a more recent notion of privacy called differential privacy (Dwork et al., TCC{\textquoteright}06), concentrating, in particular, on achieving differential privacy with the Santha-Vazirani source. We show that the answer is no. Specifically, we give a differentially private mechanism for approximating arbitrary {\textquotedblleft}low sensitivity{\textquotedblright} functions that works even with randomness coming from a {\gamma}-Santha-Vazirani source, for any {\gamma} < 1. This provides a somewhat surprising {\textquotedblleft}separation{\textquotedblright} between traditional privacy and differential privacy with respect to imperfect randomness.
+ abstract = {In this work we revisit the question of basing cryptography on imperfect randomness. Bosley and Dodis (TCC'07) showed that if a source of randomness R is {\textquotedblleft}good enough{\textquotedblright} to generate a secret key capable of encrypting k bits, then one can deterministically extract nearly k almost uniform bits from R, suggesting that traditional privacy notions (namely, indistinguishability of encryption) requires an {\textquotedblleft}extractable{\textquotedblright} source of randomness. Other, even stronger impossibility results are known for achieving privacy under specific {\textquotedblleft}non-extractable{\textquotedblright} sources of randomness, such as the {\gamma}-Santha-Vazirani (SV) source, where each next bit has fresh entropy, but is allowed to have a small bias {\gamma} < 1 (possibly depending on prior bits).
+We ask whether similar negative results also hold for a more recent notion of privacy called differential privacy (Dwork et al., TCC'06), concentrating, in particular, on achieving differential privacy with the Santha-Vazirani source. We show that the answer is no. Specifically, we give a differentially private mechanism for approximating arbitrary {\textquotedblleft}low sensitivity{\textquotedblright} functions that works even with randomness coming from a {\gamma}-Santha-Vazirani source, for any {\gamma} < 1. This provides a somewhat surprising {\textquotedblleft}separation{\textquotedblright} between traditional privacy and differential privacy with respect to imperfect randomness.
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DPwithImperfectRandomness2012Dodis.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/DPwithImperfectRandomness2012Dodis.pdf},
www_section = unsorted,
author = {Dodis, Yevgeniy and L{\'o}pez-Alt, Adriana and Mironov, Ilya and Vadhan, Salil},
editor = {Safavi-Naini, Reihaneh and Canetti, Ran}
@@ -915,7 +961,7 @@ experimental results that demonstrate the viability, efficiency and
accuracy of the protocol},
www_section = {GNUnet, network security, network size estimation, peer-to-peer networking},
journal = {unknown},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/nse-techreport.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/nse-techreport.pdf},
url = {https://bibliography.gnunet.org},
author = {Nathan S Evans and Polot, Bartlomiej and Christian Grothoff}
}
@@ -931,7 +977,7 @@ accuracy of the protocol},
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},
www_section = {byzantine fault tolerance, GNUnet, network size estimation, proof of work},
url = {http://grothoff.org/christian/rrsize2012.pdf},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/paper-ifip.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/paper-ifip.pdf},
author = {Nathan S Evans and Polot, Bartlomiej and Christian Grothoff}
}
@conference {gossipico2012,
@@ -944,7 +990,7 @@ accuracy of the protocol},
organization = {Springer Verlag},
address = {Prague, CZ},
www_section = {network size estimation},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Gossipico.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Gossipico.pdf},
url = {https://bibliography.gnunet.org},
author = {Ruud van de Bovenkamp and Fernando Kuipers and Piet Van Mieghem}
}
@@ -954,7 +1000,7 @@ accuracy of the protocol},
year = {2012},
pages = {287--304},
www_section = {emulab, emulation, testbed},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/how-to-build-a-better-testbed.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/how-to-build-a-better-testbed.pdf},
url = {https://bibliography.gnunet.org},
author = {Fabien Hermenier and Robert Ricci}
}
@@ -965,9 +1011,9 @@ accuracy of the protocol},
month = apr,
address = {San Jose, CA},
abstract = {With mobile phones becoming first-class citizens in the online world, the rich location data they bring to the table is set to revolutionize all aspects of online life including content delivery, recommendation systems, and advertising. However, user-tracking is a concern with such location-based services, not only because location data can be linked uniquely to individuals, but because the low-level nature of current location APIs and the resulting dependence on the cloud to synthesize useful representations virtually guarantees such tracking.
-In this paper, we propose privacy-preserving location-based matching as a fundamental platform primitive and as an alternative to exposing low-level, latitude-longitude (lat-long) coordinates to applications. Applications set rich location-based triggers and have these be fired based on location updates either from the local device or from a remote device (e.g., a friend{\textquoteright}s phone). Our Koi platform, comprising a privacy-preserving matching service in the cloud and a phone-based agent, realizes this primitive across multiple phone and browser platforms. By masking low-level lat-long information from applications, Koi not only avoids leaking privacy-sensitive information, it also eases the task of programmers by providing a higher-level abstraction that is easier for applications to build upon. Koi{\textquoteright}s privacy-preserving protocol prevents the cloud service from tracking users. We verify the non-tracking properties of Koi using a theorem prover, illustrate how privacy guarantees can easily be added to a wide range of location-based applications, and show that our public deployment is performant, being able to perform 12K matches per second on a single core},
+In this paper, we propose privacy-preserving location-based matching as a fundamental platform primitive and as an alternative to exposing low-level, latitude-longitude (lat-long) coordinates to applications. Applications set rich location-based triggers and have these be fired based on location updates either from the local device or from a remote device (e.g., a friend's phone). Our Koi platform, comprising a privacy-preserving matching service in the cloud and a phone-based agent, realizes this primitive across multiple phone and browser platforms. By masking low-level lat-long information from applications, Koi not only avoids leaking privacy-sensitive information, it also eases the task of programmers by providing a higher-level abstraction that is easier for applications to build upon. Koi's privacy-preserving protocol prevents the cloud service from tracking users. We verify the non-tracking properties of Koi using a theorem prover, illustrate how privacy guarantees can easily be added to a wide range of location-based applications, and show that our public deployment is performant, being able to perform 12K matches per second on a single core},
www_section = {location privacy, matching},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/nsdi12-koi.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/nsdi12-koi.pdf},
url = {https://bibliography.gnunet.org},
author = {Saikat Guha and Mudit Jain and Venkata Padmanabhan}
}
@@ -979,11 +1025,11 @@ In this paper, we propose privacy-preserving location-based matching as a fundam
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {San Francisco, CA, USA},
- abstract = {Popular anonymous communication systems often require sending packets through a sequence of relays on dilated paths for strong anonymity protection. As a result, increased end-to-end latency renders such systems inadequate for the majority of Internet users who seek an intermediate level of anonymity protection while using latency-sensitive applications, such as Web applications. This paper serves to bridge the gap between communication systems that provide strong anonymity protection but with intolerable latency and non-anonymous communication systems by considering a new design space for the setting. More specifically, we explore how to achieve near-optimal latency while achieving an intermediate level of anonymity with a weaker yet practical adversary model (i.e., protecting an end-host{\textquoteright}s identity and location from servers)
-such that users can choose between the level of anonymity and usability. We propose Lightweight Anonymity and Privacy (LAP), an efficient network-based solution featuring lightweight path establishment and stateless communication, by concealing an end-host{\textquoteright}s topological location to enhance anonymity against
+ abstract = {Popular anonymous communication systems often require sending packets through a sequence of relays on dilated paths for strong anonymity protection. As a result, increased end-to-end latency renders such systems inadequate for the majority of Internet users who seek an intermediate level of anonymity protection while using latency-sensitive applications, such as Web applications. This paper serves to bridge the gap between communication systems that provide strong anonymity protection but with intolerable latency and non-anonymous communication systems by considering a new design space for the setting. More specifically, we explore how to achieve near-optimal latency while achieving an intermediate level of anonymity with a weaker yet practical adversary model (i.e., protecting an end-host's identity and location from servers)
+such that users can choose between the level of anonymity and usability. We propose Lightweight Anonymity and Privacy (LAP), an efficient network-based solution featuring lightweight path establishment and stateless communication, by concealing an end-host's topological location to enhance anonymity against
remote tracking. To show practicality, we demonstrate that LAP can work on top of the current Internet and proposed future Internet architectures},
www_section = {anonymous communication anonymity protection, LAP},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/LAP\%3A\%20Lightweight\%20Anonymity\%20and\%20Privacy.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/LAP\%3A\%20Lightweight\%20Anonymity\%20and\%20Privacy.pdf},
url = {https://bibliography.gnunet.org},
author = {Hsu-Chun Hsiao and Tiffany Hyun-Jin Kim and Adrian Perrig and Akira Yamada and Sam Nelson and Marco Gruteser and Wei Ming}
}
@@ -1012,14 +1058,14 @@ show that LASTor can deliver significant latency gains over the
default Tor client by simply accounting for the inferred locations
of Tor relays while choosing paths. Second, since the preference
for low latency paths reduces the entropy of path selection,
-we design LASTor{\textquoteright}s path selection algorithm to be tunable. A
+we design LASTor's path selection algorithm to be tunable. A
user can choose an appropriate tradeoff between latency and
anonymity by specifying a value between 0 (lowest latency) and
1 (highest anonymity) for a single parameter. Lastly, we develop
an efficient and accurate algorithm to identify paths on which
an AS can correlate traffic between the entry and exit segments.
This algorithm enables LASTor to avoid such paths and improve a
-user{\textquoteright}s anonymity, while the low runtime of the algorithm ensures
+user's anonymity, while the low runtime of the algorithm ensures
that the impact on end-to-end latency of communication is low.
By applying our techniques to measurements of real Internet
paths and by using LASTor to visit the top 200 websites from
@@ -1028,7 +1074,7 @@ comparison to the default Tor client, LASTor reduces median
latencies by 25\% while also reducing the false negative rate of
not detecting a potential snooping AS from 57\% to 11\%},
www_section = {anonymous communication, as, autonomous system, Tor},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/LASTor\%3A\%20A\%20Low-Latency\%20AS-Aware\%20Tor\%20Client.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/LASTor\%3A\%20A\%20Low-Latency\%20AS-Aware\%20Tor\%20Client.pdf},
url = {https://bibliography.gnunet.org},
author = {Masoud Akhoondi and Curtis Yu and Harsha V. Madhyastha}
}
@@ -1050,7 +1096,7 @@ We also simplify the lower bounds on noise for counting queries in [11] and also
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/LowerBoundsDP2012De.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/LowerBoundsDP2012De.pdf},
author = {De, Anindya},
editor = {Cramer, Ronald}
}
@@ -1061,7 +1107,7 @@ We also simplify the lower bounds on noise for counting queries in [11] and also
pages = {1--19},
publisher = {Springer},
www_section = {emulation, ModelNet, P2P emulation, traffic engineering},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/modelnet-si-ppna11.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/modelnet-si-ppna11.pdf},
url = {https://bibliography.gnunet.org},
author = {Rossi, D. and Veglia, P. and Sammarco, M. and Larroca, F.}
}
@@ -1074,10 +1120,10 @@ We also simplify the lower bounds on noise for counting queries in [11] and also
school = {Technische Universitaet Muenchen},
type = {Masters},
address = {Garching bei Muenchen},
- abstract = {Debugging is tedious and time consuming work that, for certain types of bugs, can and should be automated. Debugging distributed systems is more complex due to time dependencies between interacting processes. Another related problem is duplicate bug reports in bug repositories. Finding bug duplicates is hard and wastes developers{\textquoteright} time which may affect the development team{\textquoteright}s rate of bug fixes and new releases.
-In this master thesis we introduce Monkey, a new tool that provides a solution for automated classification, investigation and characterization of bugs, as well as a solution for comparing bug reports and avoiding duplicates. Our tool is particularly suitable for distributed systems due to its autonomy. We present Monkey{\textquoteright}s key design goals and architecture and give experimental results demonstrating the viability of our approach},
+ abstract = {Debugging is tedious and time consuming work that, for certain types of bugs, can and should be automated. Debugging distributed systems is more complex due to time dependencies between interacting processes. Another related problem is duplicate bug reports in bug repositories. Finding bug duplicates is hard and wastes developers' time which may affect the development team's rate of bug fixes and new releases.
+In this master thesis we introduce Monkey, a new tool that provides a solution for automated classification, investigation and characterization of bugs, as well as a solution for comparing bug reports and avoiding duplicates. Our tool is particularly suitable for distributed systems due to its autonomy. We present Monkey's key design goals and architecture and give experimental results demonstrating the viability of our approach},
www_section = {automation, debugging, distributed systems},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/safey-thesis-monkey.pdf , https://gnunet.org/git/bibliography.git/tree/docs/safey-presentation-monkey.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/safey-thesis-monkey.pdf , https://gnunet.org/git/bibliography.git/plain/docs/safey-presentation-monkey.pdf},
url = {https://bibliography.gnunet.org},
author = {Safey A. Halim}
}
@@ -1091,7 +1137,7 @@ for traversing NAT routers by exploiting their built-in FTP and IRC application-
significantly improves the success chance without requiring any user interaction at all. To demonstrate the framework, we show
a small test setup with laptop computers and home NAT routers},
www_section = {FTP-ALG, NAT},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WHW_12-NTALG.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/WHW_12-NTALG.pdf},
url = {https://bibliography.gnunet.org},
author = {Wander, M. and Holzapfel, S. and Wacker, A. and Weis, T.}
}
@@ -1102,7 +1148,7 @@ a small test setup with laptop computers and home NAT routers},
year = {2012},
www_section = {anonymity, distributed hash table},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/octopus_dht.pdf},
author = {Wang, Qiyan and Borisov, Nikita}
}
@conference {oakland2012-peekaboo,
@@ -1118,7 +1164,7 @@ include ones like those standardized by TLS, SSH, and IPsec, and even more compl
total upstream and downstream bandwidth to identify {\textemdash}with 98\% accuracy{\textemdash} which of two websites was visited. One implication of what we find is that, in the context of website identification, it is unlikely that bandwidth-efficient, general-
purpose TA countermeasures can ever provide the type of security targeted in prior work},
www_section = {encrypted traffic, machine learning, padding, privacy, traffic analysis countermeasures},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Peek-a-Boo\%2C\%20I\%20Still\%20See\%20You\%3A\%20Why\%20Efficient\%20Traffic\%20Analysis\%20Countermeasures\%20Fail.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Peek-a-Boo\%2C\%20I\%20Still\%20See\%20You\%3A\%20Why\%20Efficient\%20Traffic\%20Analysis\%20Countermeasures\%20Fail.pdf},
url = {https://bibliography.gnunet.org},
author = {Kevin P. Dyer and Scott Coull and Thomas Ristenpart and Thomas Shrimpton}
}
@@ -1128,12 +1174,12 @@ purpose TA countermeasures can ever provide the type of security targeted in pri
volume = {22},
year = {2012},
pages = {203--220},
- abstract = {Personalization technologies offer powerful tools for enhancing the user experience in a wide variety of systems, but at the same time raise new privacy concerns. For example, systems that personalize advertisements according to the physical location of the user or according to the user{\textquoteright}s friends{\textquoteright} search history, introduce new privacy risks that may discourage wide adoption of personalization technologies. This article analyzes the privacy risks associated with several current and prominent personalization trends, namely social-based personalization, behavioral profiling, and location-based personalization. We survey user attitudes towards privacy and personalization, as well as technologies that can help reduce privacy risks. We conclude with a discussion that frames risks and technical solutions in the intersection between personalization and privacy, as well as areas for further investigation. This frameworks can help designers and researchers to contextualize privacy challenges of solutions when designing personalization systems},
+ abstract = {Personalization technologies offer powerful tools for enhancing the user experience in a wide variety of systems, but at the same time raise new privacy concerns. For example, systems that personalize advertisements according to the physical location of the user or according to the user's friends' search history, introduce new privacy risks that may discourage wide adoption of personalization technologies. This article analyzes the privacy risks associated with several current and prominent personalization trends, namely social-based personalization, behavioral profiling, and location-based personalization. We survey user attitudes towards privacy and personalization, as well as technologies that can help reduce privacy risks. We conclude with a discussion that frames risks and technical solutions in the intersection between personalization and privacy, as well as areas for further investigation. This frameworks can help designers and researchers to contextualize privacy challenges of solutions when designing personalization systems},
www_section = {e-commerce, Human--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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Personalization2012Toch.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Personalization2012Toch.pdf},
author = {Toch, Eran and Wang, Yang and Cranor, LorrieFaith}
}
@conference {DBLP:conf/focs/DworkNV12,
@@ -1160,7 +1206,7 @@ purpose TA countermeasures can ever provide the type of security targeted in pri
journal = {Proc. CoNEXT},
year = {2012},
www_section = {emulation, mininet, network, virtualization},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mininet-hifi.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/mininet-hifi.pdf},
url = {https://bibliography.gnunet.org},
author = {Handigol, N. and Heller, B. and Jeyakumar, V. and Lantz, B. and McKeown, N.}
}
@@ -1184,7 +1230,7 @@ Saturn is not only that it effectively tackles all three issues together{\textem
providing fault tolerance over DHTs{\textemdash}but also that it can be applied on top of any order-preserving DHT enabling it to dynamically
handle replication and, thus, to trade off replication costs for fair load distribution and fault tolerance},
www_section = {distributed hash table, load balancing, range queries, Saturn},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/saturn-range-dht.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/saturn-range-dht.pdf},
url = {https://bibliography.gnunet.org},
author = {Theoni Pitoura and Nikos Ntarmos and Peter Triantafillou}
}
@@ -1194,12 +1240,12 @@ handle replication and, thus, to trade off replication costs for fair load distr
volume = {37},
year = {2012},
pages = {119--132},
- abstract = {With the explosion of Web 2.0 application such as blogs, social and professional networks, and various other types of social media, the rich online information and various new sources of knowledge flood users and hence pose a great challenge in terms of information overload. It is critical to use intelligent agent software systems to assist users in finding the right information from an abundance of Web data. Recommender systems can help users deal with information overload problem efficiently by suggesting items (e.g., information and products) that match users{\textquoteright} personal interests. The recommender technology has been successfully employed in many applications such as recommending films, music, books, etc. The purpose of this report is to give an overview of existing technologies for building personalized recommender systems in social networking environment, to propose a research direction for addressing user profiling and cold start problems by exploiting user-generated content newly available in Web 2.0},
+ abstract = {With the explosion of Web 2.0 application such as blogs, social and professional networks, and various other types of social media, the rich online information and various new sources of knowledge flood users and hence pose a great challenge in terms of information overload. It is critical to use intelligent agent software systems to assist users in finding the right information from an abundance of Web data. Recommender systems can help users deal with information overload problem efficiently by suggesting items (e.g., information and products) that match users' personal interests. The recommender technology has been successfully employed in many applications such as recommending films, music, books, etc. The purpose of this report is to give an overview of existing technologies for building personalized recommender systems in social networking environment, to propose a research direction for addressing user profiling and cold start problems by exploiting user-generated content newly available in Web 2.0},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PersonalizedRecommender2012Zhou.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PersonalizedRecommender2012Zhou.pdf},
author = {Zhou, Xujuan and Xu, Yue and Li, Yuefeng and Josang, Audun and Cox, Clive}
}
@article {2012_15,
@@ -1209,11 +1255,11 @@ handle replication and, thus, to trade off replication costs for fair load distr
year = {2012},
month = mar,
pages = {1--43},
- abstract = {Monte Carlo tree search (MCTS) is a recently proposed search method that combines the precision of tree search with the generality of random sampling. It has received considerable interest due to its spectacular success in the difficult problem of computer Go, but has also proved beneficial in a range of other domains. This paper is a survey of the literature to date, intended to provide a snapshot of the state of the art after the first five years of MCTS research. We outline the core algorithm{\textquoteright}s derivation, impart some structure on the many variations and enhancements that have been proposed, and summarize the results from the key game and nongame domains to which MCTS methods have been applied. A number of open research questions indicate that the field is ripe for future work},
+ abstract = {Monte Carlo tree search (MCTS) is a recently proposed search method that combines the precision of tree search with the generality of random sampling. It has received considerable interest due to its spectacular success in the difficult problem of computer Go, but has also proved beneficial in a range of other domains. This paper is a survey of the literature to date, intended to provide a snapshot of the state of the art after the first five years of MCTS research. We outline the core algorithm's derivation, impart some structure on the many variations and enhancements that have been proposed, and summarize the results from the key game and nongame domains to which MCTS methods have been applied. A number of open research questions indicate that the field is ripe for future work},
www_section = {AI, artificial intelligence, bandit-based methods, computer go., game search, MCTS, monte carlo tree search, UCB, UCT, upper confidence bounds, upper confidence bounds for trees},
issn = {1943-068X},
doi = {10.1109/TCIAIG.2012.2186810},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Browne\%20et\%20al\%20-\%20A\%20survey\%20of\%20MCTS\%20methods.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Browne\%20et\%20al\%20-\%20A\%20survey\%20of\%20MCTS\%20methods.pdf},
url = {https://bibliography.gnunet.org},
author = {Cameron Browne and Edward Powley and Daniel Whitehouse and Simon Lucas and Peter I. Cowling and Philipp Rohlfshagen and Stephen Tavener and Diego Perez and Spyridon Samothrakis and Simon Colton}
}
@@ -1228,7 +1274,7 @@ handle replication and, thus, to trade off replication costs for fair load distr
www_section = {Arrays, Bismuth, bloom filters, distributed systems, Filtering theory, filters, Fingerprint recognition, forwarding, information processing, measurement data summarization, networking costs, overlay networks, Peer to peer computing, peer-to-peer computing, Peer-to-peer systems, Probabilistic logic, probabilistic structures, probabilistic techniques, probability, routing, telecommunication network routing},
issn = {1553-877X},
doi = {10.1109/SURV.2011.031611.00024},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/TheoryandPracticeBloomFilter2011Tarkoma.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/TheoryandPracticeBloomFilter2011Tarkoma.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Tarkoma, S. and Rothenberg, C.E. and Lagerspetz, E.}
@@ -1245,19 +1291,19 @@ handle replication and, thus, to trade off replication costs for fair load distr
isbn = {978-1-4503-1189-2},
doi = {10.1145/2189736.2189749},
url = {http://doi.acm.org/10.1145/2189736.2189749},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WebPersonalization2012Zeng.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/WebPersonalization2012Zeng.pdf},
author = {Zeng, Yi and Zhong, Ning and Ren, Xu and Wang, Yan}
}
@conference {pets2011-bagai,
title = {An Accurate System-Wide Anonymity Metric for Probabilistic Attacks},
- booktitle = {PETS{\textquoteright}11--Proceedings of the 11th Privacy Enhancing Technologies Symposium},
+ booktitle = {PETS'11--Proceedings of the 11th Privacy Enhancing Technologies Symposium},
year = {2011},
month = jul,
address = {Waterloo, Canada},
abstract = {We give a critical analysis of the system-wide anonymity metric of Edman et al. [3], which is based on the permanent value of a doubly-stochastic matrix. By providing an intuitive understanding of the permanent of such a matrix, we show that a metric that looks no further than this composite value is at best a rough indicator of anonymity. We identify situations where its inaccuracy is acute, and reveal a better anonymity indicator. Also, by constructing an information-preserving embedding of a smaller class of attacks into the wider class for which this metric was proposed, we show that this metric fails to possess desirable
generalization properties. Finally, we present a new anonymity metric that does not exhibit these shortcomings. Our new metric is accurate as well as general},
www_section = {combinatorial matrix theory, probabilistic attacks, system-wide anonymity metric},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PETS\%2711\%20-\%20An\%20Accurate\%20System-Wide\%20Anonymity\%20Metric\%20for\%20Probabilistic\%20Attacks.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PETS\%2711\%20-\%20An\%20Accurate\%20System-Wide\%20Anonymity\%20Metric\%20for\%20Probabilistic\%20Attacks.pdf},
url = {https://bibliography.gnunet.org},
author = {Rajiv Bagai and Huabo Lu and Rong Li and Bin Tang}
}
@@ -1270,40 +1316,40 @@ generalization properties. Finally, we present a new anonymity metric that does
address = {San Francisco, California},
abstract = {This paper presents details on the design and implementation of a scalable framework for evaluating peer-to-peer protocols. Unlike systems based on simulation, emulation-based systems enable the experimenter to obtain data that reflects directly on the concrete implementation in much greater detail. This paper argues that emulation is a better model for experiments with peer-to-peer protocols since it can provide scalability and high flexibility while eliminating the cost of moving from experimentation to deployment. We discuss our unique experience with large-scale emulation using the GNUnet peer-to-peer framework and provide experimental results to support these claims },
www_section = {distributed hash table, emulation, GNUnet, scalability, security analysis},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cset2011.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cset2011.pdf},
url = {https://bibliography.gnunet.org},
author = {Nathan S Evans and Christian Grothoff}
}
@conference {bnymble11,
title = {BNymble: More anonymous blacklisting at almost no cost},
- booktitle = {FC{\textquoteright}11--Proceedings of Financial Cryptography and Data Security },
+ booktitle = {FC'11--Proceedings of Financial Cryptography and Data Security },
year = {2011},
month = feb,
address = {St. Lucia},
abstract = {Anonymous blacklisting schemes allow online service providers to prevent future anonymous access by abusive users while preserving the privacy of all anonymous users (both abusive and non-abusive). The first scheme proposed for this purpose was Nymble, an extremely efficient scheme based only on symmetric primitives; however, Nymble relies on trusted third parties who can collude to de-anonymize users of the scheme. Two recently proposed schemes, Nymbler and Jack, reduce the trust placed in these third parties at the expense of using less-efficient asymmetric crypto primitives. We present BNymble, a scheme which matches the anonymity guarantees of Nymbler and Jack while (nearly) maintaining the efficiency of the original Nymble. The key insight of
BNymble is that we can achieve the anonymity goals of these more recent schemes by replacing only the infrequent {\textquotedblleft}User Registration{\textquotedblright} protocol from Nymble with asymmetric primitives. We prove the security of BNymble, and report on its efficiency},
www_section = {anonymous access, anonymous blacklisting, BNymble},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FC\%2711\%20-\%20BNymble.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/FC\%2711\%20-\%20BNymble.pdf},
url = {https://bibliography.gnunet.org},
author = {Peter Lofgren and Nicholas J. Hopper}
}
@conference {wpes11-bridgespa,
title = {BridgeSPA: Improving Tor Bridges with Single Packet Authorization},
- booktitle = {WPES{\textquoteright}11--Proceedings of the Workshop on Privacy in the Electronic Society },
+ booktitle = {WPES'11--Proceedings of the Workshop on Privacy in the Electronic Society },
year = {2011},
month = oct,
publisher = {ACM},
organization = {ACM},
address = {Chicago, IL, United States},
- abstract = {Tor is a network designed for low-latency anonymous communications. Tor clients form circuits through relays that are listed in a public directory, and then relay their encrypted traffic through these circuits. This indirection makes it difficult for a local adversary to determine with whom a particular Tor user is communicating. In response, some local adversaries restrict access to Tor by blocking each of the publicly listed relays. To deal with such an adversary, Tor uses bridges, which are unlisted relays that can be used as alternative entry points into the Tor network. Unfortunately, issues with Tor{\textquoteright}s bridge implementation make it easy to discover large numbers of bridges. An adversary that hoards this information may use it to determine when each bridge is online over time. If a bridge operator also browses with Tor on the same machine, this information may be sufficient to deanonymize him. We present BridgeSPA as a method to mitigate this issue. A client using BridgeSPA relies on innocuous single packet authorization (SPA) to present a time-limited key to a bridge. Before this authorization takes place, the bridge will not reveal whether it is online. We have implemented BridgeSPA as a working proof-of-concept, which is available under an open-source licence},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WPES\%2711\%20-\%20bridgeSPA.pdf},
+ abstract = {Tor is a network designed for low-latency anonymous communications. Tor clients form circuits through relays that are listed in a public directory, and then relay their encrypted traffic through these circuits. This indirection makes it difficult for a local adversary to determine with whom a particular Tor user is communicating. In response, some local adversaries restrict access to Tor by blocking each of the publicly listed relays. To deal with such an adversary, Tor uses bridges, which are unlisted relays that can be used as alternative entry points into the Tor network. Unfortunately, issues with Tor's bridge implementation make it easy to discover large numbers of bridges. An adversary that hoards this information may use it to determine when each bridge is online over time. If a bridge operator also browses with Tor on the same machine, this information may be sufficient to deanonymize him. We present BridgeSPA as a method to mitigate this issue. A client using BridgeSPA relies on innocuous single packet authorization (SPA) to present a time-limited key to a bridge. Before this authorization takes place, the bridge will not reveal whether it is online. We have implemented BridgeSPA as a working proof-of-concept, which is available under an open-source licence},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/WPES\%2711\%20-\%20bridgeSPA.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Rob Smits and Divam Jain and Sarah Pidcock and Ian Goldberg and Urs Hengartner}
}
@conference {ccs2011-cirripede,
title = {Cirripede: Circumvention Infrastructure using Router Redirection with Plausible Deniability},
- booktitle = {CCS{\textquoteright}11--Proceedings of the 18th ACM conference on Computer and Communications Security},
+ booktitle = {CCS'11--Proceedings of the 18th ACM conference on Computer and Communications Security},
year = {2011},
month = oct,
publisher = {ACM},
@@ -1313,7 +1359,7 @@ BNymble is that we can achieve the anonymity goals of these more recent schemes
We therefore propose Cirripede, a system that can be used for unobservable communication with Internet destinations. Cirripede is designed to be deployed by ISPs; it intercepts connections from clients to innocent-looking destinations and redirects them to the true destination requested by the client. The communication is encoded in a way that is indistinguishable from normal communications to anyone without the master secret key, while public-key cryptography is used to eliminate the need for any secret information that must be shared with Cirripede users.
Cirripede is designed to work scalably with routers that handle large volumes of traffic while imposing minimal overhead on ISPs and not disrupting existing traffic. This allows Cirripede proxies to be strategically deployed at central locations, making access to Cirripede very difficult to block. We built a proof-of-concept implementation of Cirripede and performed a testbed evaluation of its performance properties},
www_section = {censorship-resistance, unobservability},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CCS\%2711\%20-\%20Cirripede.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CCS\%2711\%20-\%20Cirripede.pdf},
url = {https://bibliography.gnunet.org},
author = {Amir Houmansadr and Giang T. K. Nguyen and Matthew Caesar and Borisov, Nikita}
}
@@ -1328,7 +1374,7 @@ Cirripede is designed to work scalably with routers that handle large volumes of
issn = {0362-5915},
doi = {10.1145/2043652.2043659},
url = {http://doi.acm.org/10.1145/2043652.2043659},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/TopK-Processing2011Bai.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/TopK-Processing2011Bai.pdf},
author = {Bai, Xiao and Guerraoui, Rachid and Kermarrec, Anne-Marie and Leroy, Vincent}
}
@article {2011_1,
@@ -1351,7 +1397,7 @@ and sequences. It discusses some properties needed to implement non-trivial CRDT
www_section = {commutative operations, data replication, optimistic replication},
journal = {unknown},
isbn = {0249-6399},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/crdt.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/crdt.pdf},
url = {https://bibliography.gnunet.org},
author = {Marc Shapiro and Nuno Preguica and Carlos Baquero and Marek Zawirski}
}
@@ -1372,26 +1418,26 @@ and sequences. It discusses some properties needed to implement non-trivial CRDT
}
@conference {foci11-decoy,
title = {Decoy Routing: Toward Unblockable Internet Communication},
- booktitle = {FOCI{\textquoteright}11--Proceedings of the USENIX Workshop on Free and Open Communications on the Internet},
+ booktitle = {FOCI'11--Proceedings of the USENIX Workshop on Free and Open Communications on the Internet},
year = {2011},
month = aug,
address = {San Francisco, CA, USA},
abstract = {We present decoy routing, a mechanism capable of circumventing common network filtering strategies. Unlike other circumvention techniques, decoy routing does not require a client to connect to a specific IP address (which
is easily blocked) in order to provide circumvention. We show that if it is possible for a client to connect to any unblocked host/service, then decoy routing could be used to connect them to a blocked destination without cooperation from the host. This is accomplished by placing the circumvention service in the network itself -- where a single device could proxy traffic between a significant fraction of hosts -- instead of at the edge},
www_section = {decoy routing, Internet communication, network filter},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FOCI\%2711\%20-\%20Decoy\%20Routing\%3A\%20Toward\%20Unblockable\%20Internet\%20Communication.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/FOCI\%2711\%20-\%20Decoy\%20Routing\%3A\%20Toward\%20Unblockable\%20Internet\%20Communication.pdf},
url = {https://bibliography.gnunet.org},
author = {Josh Karlin and Daniel Ellard and Alden W. Jackson and Christine E. Jones and Greg Lauer and David P. Mankins and W. Timothy Strayer}
}
@conference {pets2011-defenestrator,
title = {DefenestraTor: Throwing out Windows in Tor},
- booktitle = {PETS{\textquoteright}11--Proceedings of the 11th Privacy Enhancing Technologies Symposium },
+ booktitle = {PETS'11--Proceedings of the 11th Privacy Enhancing Technologies Symposium },
year = {2011},
month = jul,
address = {Waterloo, Canada},
- abstract = {Tor is one of the most widely used privacy enhancing technologies for achieving online anonymity and resisting censorship. While conventional wisdom dictates that the level of anonymity offered by Tor increases as its user base grows, the most significant obstacle to Tor adoption continues to be its slow performance. We seek to enhance Tor{\textquoteright}s performance by offering techniques to control congestion and improve flow control, thereby reducing unnecessary delays. To reduce congestion, we first evaluate small fixed-size circuit windows and a dynamic circuit window that adaptively re-sizes in response to perceived congestion. While these solutions improve web page response times and require modification only to exit routers, they generally offer poor flow control and slower downloads relative to Tor{\textquoteright}s current design. To improve flow control while reducing congestion, we implement N23, an ATM-style per-link algorithm that allows Tor routers to explicitly cap their queue lengths and signal congestion via back-pressure. Our results show that N23 offers better congestion and flow control, resulting in improved web page response times and faster page loads compared to Tor{\textquoteright}s current design and other window-based approaches. We also argue that our proposals do not enable any new attacks on Tor users{\textquoteright} privacy},
+ abstract = {Tor is one of the most widely used privacy enhancing technologies for achieving online anonymity and resisting censorship. While conventional wisdom dictates that the level of anonymity offered by Tor increases as its user base grows, the most significant obstacle to Tor adoption continues to be its slow performance. We seek to enhance Tor's performance by offering techniques to control congestion and improve flow control, thereby reducing unnecessary delays. To reduce congestion, we first evaluate small fixed-size circuit windows and a dynamic circuit window that adaptively re-sizes in response to perceived congestion. While these solutions improve web page response times and require modification only to exit routers, they generally offer poor flow control and slower downloads relative to Tor's current design. To improve flow control while reducing congestion, we implement N23, an ATM-style per-link algorithm that allows Tor routers to explicitly cap their queue lengths and signal congestion via back-pressure. Our results show that N23 offers better congestion and flow control, resulting in improved web page response times and faster page loads compared to Tor's current design and other window-based approaches. We also argue that our proposals do not enable any new attacks on Tor users' privacy},
www_section = {congestion, DefenestraTor, online anonymity, performance, privacy enhancing technologies, Tor, Windows},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PETS\%2711\%20-\%20DefenestraTor.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PETS\%2711\%20-\%20DefenestraTor.pdf},
url = {https://bibliography.gnunet.org},
author = {Mashael AlSabah and Kevin Bauer and Ian Goldberg and Dirk Grunwald and Damon McCoy and Stefan Savage and Geoffrey M. Voelker}
}
@@ -1405,53 +1451,53 @@ We initiate an examination whether there are advantages to a paradigm where both
* When we require that the error is o(n{\surd}) and the number of rounds is constant, there is no benefit in the new paradigm.
* When we allow an error of O(n{\surd}), the new paradigm yields more efficient protocols when we consider protocols that compute symmetric functions.
Our results also yield new separations between the local and global models of computations for private data analysis},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DistributedPrivateData2008Beimel.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/DistributedPrivateData2008Beimel.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Amos Beimel and Kobbi Nissim and Eran Omri}
}
@conference {cset11-experimentor,
title = {ExperimenTor: A Testbed for Safe and Realistic Tor Experimentation},
- booktitle = {CSET{\textquoteright}11--Proceedings of the USENIX Workshop on Cyber Security Experimentation and Test},
+ booktitle = {CSET'11--Proceedings of the USENIX Workshop on Cyber Security Experimentation and Test},
year = {2011},
month = aug,
address = {San Francisco, CA, USA},
- abstract = {Tor is one of the most widely-used privacy enhancing technologies for achieving online anonymity and resisting censorship. Simultaneously, Tor is also an evolving research network on which investigators perform experiments to improve the network{\textquoteright}s resilience to attacks and enhance its performance. Existing methods for studying Tor have included analytical modeling, simulations, small-scale network emulations, small-scale PlanetLab deployments, and measurement and analysis of the live Tor network. Despite the growing body of work concerning Tor, there is no widely accepted methodology for conducting Tor research in a manner that preserves realism while protecting live users{\textquoteright} privacy. In an effort to propose a standard, rigorous experimental framework for
+ abstract = {Tor is one of the most widely-used privacy enhancing technologies for achieving online anonymity and resisting censorship. Simultaneously, Tor is also an evolving research network on which investigators perform experiments to improve the network's resilience to attacks and enhance its performance. Existing methods for studying Tor have included analytical modeling, simulations, small-scale network emulations, small-scale PlanetLab deployments, and measurement and analysis of the live Tor network. Despite the growing body of work concerning Tor, there is no widely accepted methodology for conducting Tor research in a manner that preserves realism while protecting live users' privacy. In an effort to propose a standard, rigorous experimental framework for
conducting Tor research in a way that ensures safety and realism, we present the design of ExperimenTor, a large-scale Tor network emulation toolkit and testbed. We also report our early experiences with prototype testbeds currently deployed at four research institutions},
www_section = {experimentation, ExperimenTor, privacy enhancing technologies, Tor},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CSET\%2711\%20-\%20ExperimenTor.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CSET\%2711\%20-\%20ExperimenTor.pdf},
url = {https://bibliography.gnunet.org},
author = {Kevin Bauer and Micah Sherr and Damon McCoy and Dirk Grunwald}
}
@conference {acsac11-tortoise,
title = {Exploring the Potential Benefits of Expanded Rate Limiting in Tor: Slow and Steady Wins the Race With Tortoise},
- booktitle = {ACSAC{\textquoteright}11--Proceedings of 2011 Annual Computer Security Applications Conference},
+ booktitle = {ACSAC'11--Proceedings of 2011 Annual Computer Security Applications Conference},
year = {2011},
month = dec,
address = {Orlando, FL, USA},
abstract = {Tor is a volunteer-operated network of application-layer relays that enables users to communicate privately and anonymously. Unfortunately, Tor often exhibits poor performance due to congestion caused by the unbalanced ratio of clients to available relays, as well as a disproportionately high consumption of network capacity by a small fraction of filesharing users.
-This paper argues the very counterintuitive notion that slowing down traffic on Tor will increase the bandwidth capacity of the network and consequently improve the experience of interactive web users. We introduce Tortoise, a system for rate limiting Tor at its ingress points. We demonstrate that Tortoise incurs little penalty for interactive web users, while significantly decreasing the throughput for filesharers. Our techniques provide incentives to filesharers to configure their Tor clients to also relay traffic, which in turn improves the network{\textquoteright}s overall performance. We present large-scale emulation results that indicate that interactive users will achieve a significant speedup if even a small fraction of clients opt to run relays},
+This paper argues the very counterintuitive notion that slowing down traffic on Tor will increase the bandwidth capacity of the network and consequently improve the experience of interactive web users. We introduce Tortoise, a system for rate limiting Tor at its ingress points. We demonstrate that Tortoise incurs little penalty for interactive web users, while significantly decreasing the throughput for filesharers. Our techniques provide incentives to filesharers to configure their Tor clients to also relay traffic, which in turn improves the network's overall performance. We present large-scale emulation results that indicate that interactive users will achieve a significant speedup if even a small fraction of clients opt to run relays},
www_section = {anonymity, performance, Tor},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ACSAC\%2711\%20-\%20Tortoise.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ACSAC\%2711\%20-\%20Tortoise.pdf},
url = {https://bibliography.gnunet.org},
author = {W. Brad Moore and Chris Wacek and Micah Sherr}
}
@conference {acsac11-backlit,
title = {Exposing Invisible Timing-based Traffic Watermarks with BACKLIT},
- booktitle = {ACSAC{\textquoteright}11--Proceedings of 2011 Annual Computer Security Applications Conference },
+ booktitle = {ACSAC'11--Proceedings of 2011 Annual Computer Security Applications Conference },
year = {2011},
month = dec,
address = {Orlando, FL, USA},
- abstract = {Traffic watermarking is an important element in many network security and privacy applications, such as tracing botnet C\&C communications and deanonymizing peer-to-peer VoIP calls. The state-of-the-art traffic watermarking schemes are usually based on packet timing information and they are notoriously difficult to detect. In this paper, we show for the first time that even the most sophisticated timing-based watermarking schemes (e.g., RAINBOW and SWIRL) are not invisible by proposing a new detection system called BACKLIT. BACKLIT is designed according to the observation that any practical timing-based traffic watermark will cause noticeable alterations in the intrinsic timing features typical of TCP flows. We propose five metrics that are sufficient for detecting four state-of-the-art traffic watermarks for bulk transfer and interactive traffic. BACKLIT can be easily deployed in stepping stones and anonymity networks (e.g., Tor), because it does not rely on strong assumptions and can be realized in an active or passive mode. We have conducted extensive experiments to evaluate BACKLIT{\textquoteright}s detection performance using the PlanetLab platform. The results show that BACKLIT can detect watermarked network flows
+ abstract = {Traffic watermarking is an important element in many network security and privacy applications, such as tracing botnet C\&C communications and deanonymizing peer-to-peer VoIP calls. The state-of-the-art traffic watermarking schemes are usually based on packet timing information and they are notoriously difficult to detect. In this paper, we show for the first time that even the most sophisticated timing-based watermarking schemes (e.g., RAINBOW and SWIRL) are not invisible by proposing a new detection system called BACKLIT. BACKLIT is designed according to the observation that any practical timing-based traffic watermark will cause noticeable alterations in the intrinsic timing features typical of TCP flows. We propose five metrics that are sufficient for detecting four state-of-the-art traffic watermarks for bulk transfer and interactive traffic. BACKLIT can be easily deployed in stepping stones and anonymity networks (e.g., Tor), because it does not rely on strong assumptions and can be realized in an active or passive mode. We have conducted extensive experiments to evaluate BACKLIT's detection performance using the PlanetLab platform. The results show that BACKLIT can detect watermarked network flows
with high accuracy and few false positives},
www_section = {BACKLIT, detection system, invisible, network security, packet timing information, privacy, traffic watermark},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ACSAC\%2711\%20-\%20BACKLIT.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ACSAC\%2711\%20-\%20BACKLIT.pdf},
url = {https://bibliography.gnunet.org},
author = {Xiapu Luo and Peng Zhou and Junjie Zhang and Roberto Perdisci and Wenke Lee and Rocky K. C. Chang}
}
@conference {wpes11-faust,
title = {FAUST: Efficient, TTP-Free Abuse Prevention by Anonymous Whitelisting},
- booktitle = {WPES{\textquoteright}11--Proceedings of the Workshop on Privacy in the Electronic Society},
+ booktitle = {WPES'11--Proceedings of the Workshop on Privacy in the Electronic Society},
year = {2011},
month = oct,
publisher = {ACM},
@@ -1460,24 +1506,24 @@ with high accuracy and few false positives},
abstract = {We introduce Faust, a solution to the {\textquotedblleft}anonymous blacklisting problem:{\textquotedblright} allow an anonymous user to prove that she is authorized to access an online service such that if the user misbehaves, she retains her anonymity but will be unable to
authenticate in future sessions. Faust uses no trusted third parties and is one to two orders of magnitude more efficient than previous schemes without trusted third parties. The key idea behind Faust is to eliminate the explicit blacklist used in all previous approaches, and rely instead on an implicit whitelist, based on blinded authentication tokens},
www_section = {anonymous authentication, anonymous blacklisting, privacy-enhancing revocation},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WPES\%2711\%20-\%20FAUST.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/WPES\%2711\%20-\%20FAUST.pdf},
url = {https://bibliography.gnunet.org},
author = {Peter Lofgren and Nicholas J. Hopper}
}
@conference {Prusty:2011:FIO:2046707.2046731,
title = {Forensic investigation of the OneSwarm anonymous filesharing system},
booktitle = {Proceedings of the 18th ACM conference on Computer and communications security},
- series = {CCS {\textquoteright}11},
+ series = {CCS '11},
year = {2011},
pages = {201--214},
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
- abstract = {OneSwarm is a system for anonymous p2p file sharing in use by thousands of peers. It aims to provide Onion Routing-like privacy and BitTorrent-like performance. We demonstrate several flaws in OneSwarm{\textquoteright}s design and implementation through three different attacks available to forensic investigators. First, we prove that the current design is vulnerable to a novel timing attack that allows just two attackers attached to the same target to determine if it is the source of queried content. When attackers comprise 15\% of OneSwarm peers, we expect over 90\% of remaining peers will be attached to two attackers and therefore vulnerable. Thwarting the attack increases OneSwarm query response times, making them longer than the equivalent in Onion Routing. Second, we show that OneSwarm{\textquoteright}s vulnerability to traffic analysis by colluding attackers is much greater than was previously reported, and is much worse than Onion Routing. We show for this second attack that when investigators comprise 25\% of peers, over 40\% of the network can be investigated with 80\% precision to find the sources of content. Our examination of the OneSwarm source code found differences with the technical paper that significantly reduce security. For the implementation in use by thousands of people, attackers that comprise 25\% of the network can successfully use this second attack against 98\% of remaining peers with 95\% precision. Finally, we show that a novel application of a known TCP-based attack allows a single attacker to identify whether a neighbor is the source of data or a proxy for it. Users that turn off the default rate-limit setting are exposed. Each attack can be repeated as investigators leave and rejoin the network. All of our attacks are successful in a forensics context: Law enforcement can use them legally ahead of a warrant. Furthermore, private investigators, who have fewer restrictions on their behavior, can use them more easily in pursuit of evidence for such civil suits as copyright infringement},
+ abstract = {OneSwarm is a system for anonymous p2p file sharing in use by thousands of peers. It aims to provide Onion Routing-like privacy and BitTorrent-like performance. We demonstrate several flaws in OneSwarm's design and implementation through three different attacks available to forensic investigators. First, we prove that the current design is vulnerable to a novel timing attack that allows just two attackers attached to the same target to determine if it is the source of queried content. When attackers comprise 15\% of OneSwarm peers, we expect over 90\% of remaining peers will be attached to two attackers and therefore vulnerable. Thwarting the attack increases OneSwarm query response times, making them longer than the equivalent in Onion Routing. Second, we show that OneSwarm's vulnerability to traffic analysis by colluding attackers is much greater than was previously reported, and is much worse than Onion Routing. We show for this second attack that when investigators comprise 25\% of peers, over 40\% of the network can be investigated with 80\% precision to find the sources of content. Our examination of the OneSwarm source code found differences with the technical paper that significantly reduce security. For the implementation in use by thousands of people, attackers that comprise 25\% of the network can successfully use this second attack against 98\% of remaining peers with 95\% precision. Finally, we show that a novel application of a known TCP-based attack allows a single attacker to identify whether a neighbor is the source of data or a proxy for it. Users that turn off the default rate-limit setting are exposed. Each attack can be repeated as investigators leave and rejoin the network. All of our attacks are successful in a forensics context: Law enforcement can use them legally ahead of a warrant. Furthermore, private investigators, who have fewer restrictions on their behavior, can use them more easily in pursuit of evidence for such civil suits as copyright infringement},
www_section = {anonymity, OneSwarm, p2p network},
isbn = {978-1-4503-0948-6},
doi = {http://doi.acm.org/10.1145/2046707.2046731},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/prusty.ccs_.2011.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/prusty.ccs_.2011.pdf},
url = {https://bibliography.gnunet.org},
author = {Prusty, Swagatika and Brian Neil Levine and Marc Liberatore}
}
@@ -1492,7 +1538,7 @@ research efforts have focused on using anonymous blacklisting systems (which are
problem and survey the literature on anonymous blacklisting systems, comparing and contrasting the architecture of various existing schemes, and discussing the tradeoffs inherent with each design. The literature on anonymous blacklisting systems lacks a unified set of definitions; each scheme operates under different trust assumptions and provides different security and privacy guarantees. Therefore, before we discuss the existing approaches in detail, we first propose a formal definition for anonymous blacklisting systems, and a set of security and privacy properties that these systems should possess. We also
outline a set of new performance requirements that anonymous blacklisting systems should satisfy to maximize their potential for real-world adoption, and give formal definitions for several optional features already supported by some schemes in the literature},
www_section = {anonymity, anonymous blacklisting, authentication, privacy enhancing technologies, privacy-enhanced revocation},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Formalizing\%20Anonymous\%20Blacklisting\%20Systems.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Formalizing\%20Anonymous\%20Blacklisting\%20Systems.pdf},
url = {https://bibliography.gnunet.org},
author = {Ryan Henry and Ian Goldberg}
}
@@ -1503,7 +1549,7 @@ outline a set of new performance requirements that anonymous blacklisting system
address = {Amsterdam, Netherlands},
abstract = {This paper introduces the current research and future plans of the Free Secure Network Systems Group at the Technische Universit\ät M\ünchen. In particular, we provide some insight into the development process and architecture of the GNUnet P2P framework and the challenges we are currently working on},
www_section = {anonymity, GNUnet, routing},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/syssec2011.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/syssec2011.pdf},
url = {https://bibliography.gnunet.org},
author = {Christian Grothoff}
}
@@ -1517,7 +1563,7 @@ outline a set of new performance requirements that anonymous blacklisting system
chapter = {77},
www_section = {ECC, Ed25519, EdDSA, GNUnet},
url = {http://ed25519.cr.yp.to/papers.html},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ed25519-20110926.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ed25519-20110926.pdf},
author = {Daniel J. Bernstein and Niels Duif and Tanja Lange and Peter Schwabe and Bo-Yin Hang}
}
@book {2011_5,
@@ -1530,11 +1576,11 @@ outline a set of new performance requirements that anonymous blacklisting system
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
abstract = {Differential privacy is a recent notion, and while it is nice conceptually it has been difficult to apply in practice. The parameters of differential privacy have an intuitive theoretical interpretation, but the implications and impacts on the risk of disclosure in practice have not yet been studied, and choosing appropriate values for them is non-trivial. Although the privacy parameter {\epsilon} in differential privacy is used to quantify the privacy risk posed by releasing statistics computed on sensitive data, {\epsilon} is not an absolute measure of privacy but rather a relative measure. In effect, even for the same value of {\epsilon} , the privacy guarantees enforced by differential privacy are different based on the domain of attribute in question and the query supported. We consider the probability of identifying any particular individual as being in the database, and demonstrate the challenge of setting the proper value of {\epsilon} given the goal of protecting individuals in the database with some fixed probability},
- www_section = {Differential Privacy, Privacy Parameter, {\epsilon}},
+ www_section = {Differential Privacy, Privacy Parameter, epsilon},
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Choosing-\%CE\%B5-2011Lee.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Choosing-\%CE\%B5-2011Lee.pdf},
author = {Lee, Jaewoo and Clifton, Chris},
editor = {Lai, Xuejia and Zhou, Jianying and Li, Hui}
}
@@ -1547,21 +1593,21 @@ outline a set of new performance requirements that anonymous blacklisting system
type = {PhD},
abstract = {Conventional wisdom dictates that the level of anonymity offered by low latency anonymity networks increases as the user base grows. However, the most significant obstacle to increased adoption of such systems is that their security and performance properties are perceived to be weak. In an effort to help foster adoption, this dissertation aims to better understand and improve security, anonymity, and performance in low latency anonymous communication systems.
-To better understand the security and performance properties of a popular low latency anonymity network, we characterize Tor, focusing on its application protocol distribution, geopolitical client and router distributions, and performance. For instance, we observe that peer-to-peer file sharing protocols use an unfair portion of the network{\textquoteright}s scarce bandwidth. To reduce the congestion produced by bulk downloaders in networks such as Tor, we design, implement, and analyze an anonymizing network tailored specifically for the BitTorrent peer-to-peer file sharing protocol. We next analyze Tor{\textquoteright}s security and anonymity properties and empirically show that Tor is vulnerable to practical end-to-end traffic correlation attacks launched by relatively weak adversaries that inflate their bandwidth claims to attract traffic and thereby compromise key positions on clients{\textquoteright} paths. We also explore the security and performance trade-offs that revolve around path length design decisions and we show that shorter paths offer performance benefits and provide increased resilience to certain attacks. Finally, we discover a source of performance degradation in Tor that results from poor congestion and flow control. To improve Tor{\textquoteright}s performance and grow its user base, we offer a fresh approach to congestion and flow control inspired by techniques from IP and ATM networks},
+To better understand the security and performance properties of a popular low latency anonymity network, we characterize Tor, focusing on its application protocol distribution, geopolitical client and router distributions, and performance. For instance, we observe that peer-to-peer file sharing protocols use an unfair portion of the network's scarce bandwidth. To reduce the congestion produced by bulk downloaders in networks such as Tor, we design, implement, and analyze an anonymizing network tailored specifically for the BitTorrent peer-to-peer file sharing protocol. We next analyze Tor's security and anonymity properties and empirically show that Tor is vulnerable to practical end-to-end traffic correlation attacks launched by relatively weak adversaries that inflate their bandwidth claims to attract traffic and thereby compromise key positions on clients' paths. We also explore the security and performance trade-offs that revolve around path length design decisions and we show that shorter paths offer performance benefits and provide increased resilience to certain attacks. Finally, we discover a source of performance degradation in Tor that results from poor congestion and flow control. To improve Tor's performance and grow its user base, we offer a fresh approach to congestion and flow control inspired by techniques from IP and ATM networks},
www_section = {low latency anonymous networks, performance, security},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kevin-thesis.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/kevin-thesis.pdf},
url = {https://bibliography.gnunet.org},
author = {Kevin Bauer}
}
@conference {wk11-malice-vs-anon,
title = {Malice versus AN.ON: Possible Risks of Missing Replay and Integrity Protection},
- booktitle = {FC{\textquoteright}11--Proceedings of Financial Cryptography and Data Security },
+ booktitle = {FC'11--Proceedings of Financial Cryptography and Data Security },
year = {2011},
month = feb,
address = {St. Lucia},
abstract = {In this paper we investigate the impact of missing replay protection as well as missing integrity protection concerning a local attacker in AN.ON. AN.ON is a low latency anonymity network mostly used to anonymize web traffic. We demonstrate that both protection mechanisms are important by presenting two attacks that become feasible as soon as the mechanisms are missing. We mount both attacks on the AN.ON network which neither implements replay protection nor integrity protection yet},
www_section = {AN.ON, anonymity network, integrity protection, replay protection},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FC\%2711\%20-\%20Malice\%20versus\%20AN.ON_.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/FC\%2711\%20-\%20Malice\%20versus\%20AN.ON_.pdf},
url = {https://bibliography.gnunet.org},
author = {Benedikt Westermann and Dogan Kesdogan}
}
@@ -1578,7 +1624,7 @@ To better understand the security and performance properties of a popular low la
issn = {1532-0626},
doi = {10.1002/cpe.1751},
url = {http://dx.doi.org/10.1002/cpe.1751},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Tariq2011Meeting.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Tariq2011Meeting.pdf},
author = {Tariq, Muhammad Adnan and Boris Koldehofe and Gerald G. Koch and Khan, Imran and Kurt Rothermel}
}
@mastersthesis {2011_6,
@@ -1604,7 +1650,7 @@ emulation framework capable of running a large number of nodes using our full co
www_section = {distributed hash table, Freenet, GNUnet, NAT, R5N, Tor},
isbn = {3-937201-26-2},
issn = {1868-2642},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NET-2011-08-1.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/NET-2011-08-1.pdf},
url = {https://bibliography.gnunet.org},
author = {Nathan S Evans}
}
@@ -1619,21 +1665,21 @@ emulation framework capable of running a large number of nodes using our full co
issn = {1936-6442},
doi = {10.1007/s12083-010-0075-1},
url = {http://dx.doi.org/10.1007/s12083-010-0075-1},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Privacy_PPNA2011Das.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Privacy_PPNA2011Das.pdf},
author = {Das, Kamalika and Bhaduri, Kanishka and Kargupta, Hillol}
}
@conference {LEBLOND:2011:INRIA-00574178:1,
title = {One Bad Apple Spoils the Bunch: Exploiting P2P Applications to Trace and Profile Tor Users},
- booktitle = {4th USENIX Workshop on Large-Scale Exploits and Emergent Threats (LEET {\textquoteright}11)},
+ booktitle = {4th USENIX Workshop on Large-Scale Exploits and Emergent Threats (LEET '11)},
year = {2011},
month = mar,
publisher = {USENIX},
organization = {USENIX},
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},
+ 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'' 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},
www_section = {anonymity, Tor},
url = {http://hal.inria.fr/inria-00574178/PDF/btor.pdf},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/btor.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@article {perea-tissec11,
@@ -1645,16 +1691,16 @@ emulation framework capable of running a large number of nodes using our full co
pages = {29:1--29:34},
publisher = {ACM},
address = {New York, NY, USA},
- abstract = {Several anonymous authentication schemes allow servers to revoke a misbehaving user{\textquoteright}s future accesses.
+ abstract = {Several anonymous authentication schemes allow servers to revoke a misbehaving user's future accesses.
Traditionally, these schemes have relied on powerful Trusted Third Parties (TTPs) capable of deanonymizing
-(or linking) users{\textquoteright} connections. Such TTPs are undesirable because users{\textquoteright} anonymity is not guaranteed, and users must trust them to judge {\textquoteleft}misbehavior{\textquoteright} fairly. Recent schemes such as Blacklistable Anonymous Credentials (BLAC) and Enhanced Privacy ID (EPID) support {\textquotedblleft}privacy-enhanced revocation{\textquotedblright} {\textemdash} servers can revoke misbehaving users without a TTP{\textquoteright}s involvement, and without learning the revoked users{\textquoteright} identities.
-In BLAC and EPID, however, the computation required for authentication at the server is linear in the size (L) of the revocation list, which is impractical as the size approaches thousands of entries. We propose PEREA, a new anonymous authentication scheme for which this bottleneck of computation is independent of the size of the revocation list. Instead, the time complexity of authentication is linear in the size of a revocation window K L, the number of subsequent authentications before which a user{\textquoteright}s misbehavior must be recognized if the user is to be revoked. We extend PEREA to support more complex revocation policies that take the severity of misbehaviors into account. Users can authenticate anonymously if their naughtiness, i.e., the sum of the severities of their blacklisted misbehaviors, is below a certain naughtiness threshold.
+(or linking) users' connections. Such TTPs are undesirable because users' anonymity is not guaranteed, and users must trust them to judge {\textquoteleft}misbehavior' fairly. Recent schemes such as Blacklistable Anonymous Credentials (BLAC) and Enhanced Privacy ID (EPID) support {\textquotedblleft}privacy-enhanced revocation{\textquotedblright} {\textemdash} servers can revoke misbehaving users without a TTP's involvement, and without learning the revoked users' identities.
+In BLAC and EPID, however, the computation required for authentication at the server is linear in the size (L) of the revocation list, which is impractical as the size approaches thousands of entries. We propose PEREA, a new anonymous authentication scheme for which this bottleneck of computation is independent of the size of the revocation list. Instead, the time complexity of authentication is linear in the size of a revocation window K L, the number of subsequent authentications before which a user's misbehavior must be recognized if the user is to be revoked. We extend PEREA to support more complex revocation policies that take the severity of misbehaviors into account. Users can authenticate anonymously if their naughtiness, i.e., the sum of the severities of their blacklisted misbehaviors, is below a certain naughtiness threshold.
We call our extension PEREA-Naughtiness. We prove the security of our constructions, and validate their efficiency as compared to BLAC both analytically and quantitatively},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/TISSEC\%20-\%20PEREA.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/TISSEC\%20-\%20PEREA.pdf},
author = {Man Ho Au and Patrick P. Tsang and Apu Kapadia}
}
@article {gauger2011lj,
@@ -1677,13 +1723,13 @@ We call our extension PEREA-Naughtiness. We prove the security of our constructi
abstract = {Existing anonymous communication systems like Tor do not scale well as they require all users to maintain up-to-date information about all available Tor relays in the system. Current proposals for scaling anonymous communication advocate a peer-to-peer (P2P) approach. While the P2P paradigm scales to millions of nodes, it provides new opportunities to compromise anonymity. In this paper, we step away from the P2P paradigm and advocate a client-server approach to scalable anonymity. We propose PIR-Tor, an architecture for the Tor network in which users obtain information about only a few onion routers using private information retrieval techniques. Obtaining information about only a few onion routers is the key to the scalability of our approach, while the use of private retrieval information techniques helps preserve client anonymity. The security of our architecture depends on the security of PIR schemes which are
well understood and relatively easy to analyze, as opposed to peer-to-peer designs that require analyzing extremely complex and dynamic systems. In particular, we demonstrate that reasonable parameters of our architecture provide equivalent security to that of the Tor network. Moreover, our experimental results show that the overhead of PIR-Tor is manageable even when the Tor network scales by two orders of magnitude},
www_section = {anonymous communication, peer to peer, PIR-Tor},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/USENIX\%20-\%20PIR-Tor.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/USENIX\%20-\%20PIR-Tor.pdf},
url = {https://bibliography.gnunet.org},
author = {Prateek Mittal and Femi Olumofin and Carmela Troncoso and Borisov, Nikita and Ian Goldberg}
}
@conference {DK11,
title = {Practical Privacy-Preserving Multiparty Linear Programming Based on Problem Transformation},
- booktitle = {PASSAT{\textquoteright}11--Proceedings of the Third IEEE International Conference on Information Privacy, Security, Risk and Trust},
+ booktitle = {PASSAT'11--Proceedings of the Third IEEE International Conference on Information Privacy, Security, Risk and Trust},
year = {2011},
month = oct,
pages = {916--924},
@@ -1692,7 +1738,7 @@ well understood and relatively easy to analyze, as opposed to peer-to-peer desig
address = {Boston, Massachusetts, USA},
abstract = {Cryptographic solutions to privacy-preserving multiparty linear programming are slow. This makes them unsuitable for many economically important applications, such as supply chain optimization, whose size exceeds their practically feasible input range. In this paper we present a privacy-preserving trans- formation that allows secure outsourcing of the linear program computation in an ef?cient manner. We evaluate security by quantifying the leakage about the input after the transformation and present implementation results. Using this transformation, we can mostly replace the costly cryptographic operations and securely solve problems several orders of magnitude larger},
www_section = {cryptography, SMC},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PASSAT\%2711\%20-\%20Multiparty\%20linear\%20programming.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PASSAT\%2711\%20-\%20Multiparty\%20linear\%20programming.pdf},
url = {https://bibliography.gnunet.org},
author = {Dreier, Jannik and Florian Kerschbaum}
}
@@ -1717,7 +1763,7 @@ anonymously hosting HTTP (Eepsite) services in the network.
Key design choices made by I2P developers, in particular
performance-based peer selection, enable a sophisticated adversary
with modest resources to break key security assumptions. Our attack
-first obtains an estimate of the victim{\textquoteright}s view of the network. Then,
+first obtains an estimate of the victim's view of the network. Then,
the adversary selectively targets a small number of peers used by the
victim with a denial-of-service attack while giving the victim the
opportunity to replace those peers with other peers that are
@@ -1729,7 +1775,7 @@ This thesis provides the necessary background on I2P, gives details on
the attack --- including experimental data from measurements against the
actual I2P network --- and discusses possible solutions},
www_section = {anonymity, attack, denial-of-service, I2P},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/herrmann2011mt.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/herrmann2011mt.pdf},
url = {https://bibliography.gnunet.org},
author = {Michael Herrmann}
}
@@ -1745,12 +1791,12 @@ actual I2P network --- and discusses possible solutions},
of determining the identity of peers that are anonymously hosting HTTP services (Eepsite) in the network.
Key design choices made by I2P developers, in particular
-performance-based peer selection, enable a sophisticated adversary with modest resources to break key security assumptions. Our attack first obtains an estimate of the victim{\textquoteright}s view of the network. Then, the adversary selectively targets a small number of peers used by the
+performance-based peer selection, enable a sophisticated adversary with modest resources to break key security assumptions. Our attack first obtains an estimate of the victim's view of the network. Then, the adversary selectively targets a small number of peers used by the
victim with a denial-of-service attack while giving the victim the opportunity to replace those peers with other peers that are controlled by the adversary. Finally, the adversary performs some simple measurements to determine the identity of the peer hosting the service.
This paper provides the necessary background on I2P, gives details on the attack --- including experimental data from measurements against the actual I2P network --- and discusses possible solutions},
www_section = {anonymity, attack, Guard, I2P, onion routing},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pet2011i2p.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/pet2011i2p.pdf},
url = {https://bibliography.gnunet.org},
author = {Michael Herrmann and Christian Grothoff}
}
@@ -1771,19 +1817,19 @@ private mechanism, will only gain a negligible advantage (up to a privacy parame
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PrivateSimilarity2011Alaggan.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {proximax11,
title = {Proximax: Fighting Censorship With an Adaptive System for Distribution of Open Proxies},
- booktitle = {FC{\textquoteright}11--Proceedings of Financial Cryptography and Data Security },
+ booktitle = {FC'11--Proceedings of Financial Cryptography and Data Security },
year = {2011},
month = feb,
address = {St. Lucia},
abstract = {Many people currently use proxies to circumvent government censorship that blocks access to content on the Internet. Unfortunately, the dissemination channels used to distribute proxy server locations are increasingly being monitored to discover and quickly block these proxies. This has given rise to a large number of ad hoc dissemination channels that leverage trust networks to reach legitimate users and at the same time prevent proxy server addresses from falling into the hands of censors. To address this problem in a more principled manner, we present Proximax, a robust system that continuously distributes pools of proxies to a large number of channels. The key research challenge in Proximax is to distribute the proxies among the different channels in a way that maximizes the usage of these proxies while minimizing the risk of having them blocked. This is challenging because of two conflicting goals: widely disseminating the location of the proxies to fully utilize their capacity and preventing (or at least delaying) their discovery by censors. We present a practical system that lays out a design and analytical model that balances these factors},
www_section = {government censorship, Proximax, proxy},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FC\%2711\%20-\%20Proximax.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/FC\%2711\%20-\%20Proximax.pdf},
url = {https://bibliography.gnunet.org},
author = {Kirill Levchenko and Damon McCoy}
}
@@ -1807,7 +1853,7 @@ private mechanism, will only gain a negligible advantage (up to a privacy parame
abstract = {This paper describes a new secure DHT routing algorithm for open,
decentralized P2P networks operating in a restricted-route environment with malicious participants. We have implemented our routing algorithm and have evaluated its performance under various topologies and in the presence of malicious peers. For small-world topologies, our algorithm provides significantly better performance when compared to existing methods. In more densely connected topologies, our performance is better than or on par with other designs},
www_section = {distributed hash table, GNUnet, R5N, routing},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/nss2011.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/nss2011.pdf},
url = {https://bibliography.gnunet.org},
author = {Nathan S Evans and Christian Grothoff}
}
@@ -1818,13 +1864,13 @@ decentralized P2P networks operating in a restricted-route environment with mali
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
address = {Berlin, Heidelberg},
- abstract = {Differential privacy is a notion that has emerged in the community of statistical databases, as a response to the problem of protecting the privacy of the database{\textquoteright}s participants when performing statistical queries. The idea is that a randomized query satisfies differential privacy if the likelihood of obtaining a certain answer for a database x is not too different from the likelihood of obtaining the same answer on adjacent databases, i.e. databases which differ from x for only one individual. Information flow is an area of Security concerned with the problem of controlling the leakage of confidential information in programs and protocols. Nowadays, one of the most established approaches to quantify and to reason about leakage is based on the R{\'e}nyi min entropy version of information theory.
+ abstract = {Differential privacy is a notion that has emerged in the community of statistical databases, as a response to the problem of protecting the privacy of the database's participants when performing statistical queries. The idea is that a randomized query satisfies differential privacy if the likelihood of obtaining a certain answer for a database x is not too different from the likelihood of obtaining the same answer on adjacent databases, i.e. databases which differ from x for only one individual. Information flow is an area of Security concerned with the problem of controlling the leakage of confidential information in programs and protocols. Nowadays, one of the most established approaches to quantify and to reason about leakage is based on the R{\'e}nyi min entropy version of information theory.
In this paper, we analyze critically the notion of differential privacy in light of the conceptual framework provided by the R{\'e}nyi 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{\'e}nyi 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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DifferentialPrivacy2011Alvim.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/DifferentialPrivacy2011Alvim.pdf},
www_section = unsorted,
author = {Alvim, M{\'a}rio S. and Andr{\'e}s, Miguel E.}
}
@@ -1834,12 +1880,12 @@ privacy and leakage, due to the graph symmetries induced by the adjacency relati
note = {\url{http://eprint.iacr.org/}},
month = apr,
institution = {Cryptology ePrint Archive},
- 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},
+ 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's ladder that performs a fixed sequence of curve and field operations. This paper describes a timing attack vulnerability in OpenSSL'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},
www_section = {elliptic curve cryptography, lattice attacks, public-key cryptography, side-channel attacks, timing attacks},
journal = {unknown},
issn = {2011/232},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Brumley\%20\%26\%20Tuveri\%20-\%20Timing\%20Attacks.pdf},
author = {Billy Bob Brumley and Nicola Tuveri}
}
@conference {2011_12,
@@ -1848,10 +1894,10 @@ privacy and leakage, due to the graph symmetries induced by the adjacency relati
year = {2011},
month = jun,
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 },
+ abstract = {There's a lot of buzz out there about "replacing" Facebook with a privacy-enhanced, decentralized, ideally open source something. In this talk we'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're not as concerned about privacy as we are, the scalability problem still persists },
www_section = {GNUnet, privacy, social networks},
url = {http://secushare.org/2011-FSW-Scalability-Paranoia},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/2011-FSW-Scalability-Paranoia.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/2011-FSW-Scalability-Paranoia.pdf},
author = {Carlo v. Loesch and Gabor X Toth and Mathias Baumann}
}
@article {Murillo:2011:SCT:1938287.1938323,
@@ -1869,7 +1915,7 @@ privacy and leakage, due to the graph symmetries induced by the adjacency relati
issn = {0924-669X},
doi = {10.1007/s10489-009-0178-7},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_13,
@@ -1879,7 +1925,7 @@ privacy and leakage, due to the graph symmetries induced by the adjacency relati
year = {2011},
month = jan,
pages = {75--85 },
- 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},
+ 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'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'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},
www_section = {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},
@@ -1887,7 +1933,7 @@ privacy and leakage, due to the graph symmetries induced by the adjacency relati
}
@conference {conf/ndss/BackesMP11,
title = {A Security API for Distributed Social Networks},
- booktitle = {NDSS{\textquoteright}11--Proceedings of the Network and Distributed Security Symposium},
+ booktitle = {NDSS'11--Proceedings of the Network and Distributed Security Symposium},
year = {2011},
month = feb,
publisher = {The Internet Society},
@@ -1898,7 +1944,7 @@ includes methods for establishing social relations and for sharing resources. Th
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},
www_section = {API, online-social-networks, security},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/NDSS\%2711\%20-\%20Security\%20API\%20for\%20Distributed\%20Social\%20Networks.pdf},
author = {Michael Backes and Maffei, Matteo and Pecina, Kim}
}
@conference {DBLP:conf/sigecom/GhoshR11,
@@ -1924,31 +1970,31 @@ In this paper, we embrace the social aspects of the Web 2.0 by considering a nov
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SocialMarket2011Frey.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SocialMarket2011Frey.pdf},
www_section = unsorted,
author = {Frey, Davide and J{\'e}gou, Arnaud and Kermarrec, Anne-Marie},
editor = {D{\'e}fago, Xavier and Petit, Franck and Villain, Vincent}
}
@conference {ccs2011-stealthy,
title = {Stealthy Traffic Analysis of Low-Latency Anonymous Communication Using Throughput Fingerprinting},
- booktitle = {CCS{\textquoteright}11--Proceedings of the 18th ACM conference on Computer and Communications Security},
+ booktitle = {CCS'11--Proceedings of the 18th ACM conference on Computer and Communications Security},
year = {2011},
month = oct,
publisher = {ACM},
organization = {ACM},
address = {Chicago, IL, United States},
- abstract = {Anonymity systems such as Tor aim to enable users to communicate in a manner that is untraceable by adversaries that control a small number of machines. To provide efficient service to users, these anonymity systems make full use of forwarding capacity when sending traffic between intermediate relays. In this paper, we show that doing this leaks information about the set of Tor relays in a circuit (path). We present attacks that, with high confidence and based solely on throughput information, can (a) reduce the attacker{\textquoteright}s uncertainty about the bottleneck relay of any Tor circuit whose throughput can be observed, (b) exactly identify the guard relay(s) of a Tor user when circuit throughput can be observed over multiple connections, and (c) identify whether two concurrent TCP connections belong to the same Tor user, breaking unlinkability. Our attacks are stealthy, and cannot be readily detected by a user or by Tor relays. We validate our attacks using experiments over the live Tor network. We find that the attacker can substantially reduce the entropy of a bottleneck relay distribution of a Tor circuit whose throughput can be observed{\textemdash}the entropy gets
+ abstract = {Anonymity systems such as Tor aim to enable users to communicate in a manner that is untraceable by adversaries that control a small number of machines. To provide efficient service to users, these anonymity systems make full use of forwarding capacity when sending traffic between intermediate relays. In this paper, we show that doing this leaks information about the set of Tor relays in a circuit (path). We present attacks that, with high confidence and based solely on throughput information, can (a) reduce the attacker's uncertainty about the bottleneck relay of any Tor circuit whose throughput can be observed, (b) exactly identify the guard relay(s) of a Tor user when circuit throughput can be observed over multiple connections, and (c) identify whether two concurrent TCP connections belong to the same Tor user, breaking unlinkability. Our attacks are stealthy, and cannot be readily detected by a user or by Tor relays. We validate our attacks using experiments over the live Tor network. We find that the attacker can substantially reduce the entropy of a bottleneck relay distribution of a Tor circuit whose throughput can be observed{\textemdash}the entropy gets
reduced by a factor of 2 in the median case.
-Such information leaks from a single Tor circuit can be combined over multiple connections to exactly identify a user{\textquoteright}s guard relay(s). Finally, we are also able to link two connections from the same initiator with a crossover error rate of less
+Such information leaks from a single Tor circuit can be combined over multiple connections to exactly identify a user's guard relay(s). Finally, we are also able to link two connections from the same initiator with a crossover error rate of less
than 1.5\% in under 5 minutes. Our attacks are also more accurate and require fewer resources than previous attacks on Tor},
www_section = {anonymity, attacks, throughput},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CCS\%2711\%20-\%20Throughput-fingerprinting.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CCS\%2711\%20-\%20Throughput-fingerprinting.pdf},
url = {https://bibliography.gnunet.org},
author = {Prateek Mittal and Ahmed Khurshid and Joshua Juen and Matthew Caesar and Borisov, Nikita}
}
@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},
+ booktitle = {NDSS'11--Proceedings of the Network and Distributed Security Symposium},
year = {2011},
month = feb,
address = {San Diego, CA, USA},
@@ -1956,7 +2002,7 @@ than 1.5\% in under 5 minutes. Our attacks are also more accurate and require fe
scalable approach for flow correlation than passive traffic analysis. Previous designs of scalable watermarks, however, were subject to multi-flow attacks. They also introduced delays too large to be used in most environments. We design SWIRL, a Scalable Watermark that is Invisible and Resilient to packet Losses. SWIRL is the first watermark that is practical to use for large-scale traffic analysis. SWIRL uses a flow-dependent approach to resist multi-flow
attacks, marking each flow with a different pattern. SWIRL is robust to packet losses and network jitter, yet it introduces only small delays that are invisible to both benign users and determined adversaries. We analyze the performance of SWIRL both analytically and on the PlanetLab testbed, demonstrating very low error rates. We consider applications of SWIRL to stepping stone detection and linking anonymous communication. We also propose a novel application of watermarks to defend against congestion attacks on Tor},
www_section = {anonymity, SWIRL, traffic analysis, watermarking},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NDSS11-2.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/NDSS11-2.pdf},
url = {https://bibliography.gnunet.org},
author = {Amir Houmansadr and Borisov, Nikita}
}
@@ -1966,16 +2012,16 @@ attacks, marking each flow with a different pattern. SWIRL is robust to packet l
year = {2011},
month = aug,
address = {San Francisco, CA, USA},
- abstract = {In this paper, we present Telex, a new approach to resisting state-level Internet censorship. Rather than attempting to win the cat-and-mouse game of finding open proxies, we leverage censors{\textquoteright} unwillingness to completely block day-to-day Internet access. In effect, Telex converts innocuous, unblocked websites into proxies, without their explicit collaboration. We envision that friendly ISPs would deploy Telex stations on paths between censors{\textquoteright} networks and popular, uncensored Internet destinations. Telex stations would monitor seemingly innocuous flows for a special {\textquotedblleft}tag{\textquotedblright} and transparently divert them to a forbidden website or service instead. We propose a new cryptographic scheme based on elliptic curves for tagging TLS handshakes such that the tag is visible to a Telex
+ abstract = {In this paper, we present Telex, a new approach to resisting state-level Internet censorship. Rather than attempting to win the cat-and-mouse game of finding open proxies, we leverage censors' unwillingness to completely block day-to-day Internet access. In effect, Telex converts innocuous, unblocked websites into proxies, without their explicit collaboration. We envision that friendly ISPs would deploy Telex stations on paths between censors' networks and popular, uncensored Internet destinations. Telex stations would monitor seemingly innocuous flows for a special {\textquotedblleft}tag{\textquotedblright} and transparently divert them to a forbidden website or service instead. We propose a new cryptographic scheme based on elliptic curves for tagging TLS handshakes such that the tag is visible to a Telex
station but not to a censor. In addition, we use our tagging scheme to build a protocol that allows clients to connect to Telex stations while resisting both passive and active attacks. We also present a proof-of-concept implementation that demonstrates the feasibility of our system},
www_section = {anticensorship, network infrastructure state-level censorship, proxy, telex},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Telex\%3A\%20Anticensorship\%20in\%20the\%20Network\%20Infrastructure.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Telex\%3A\%20Anticensorship\%20in\%20the\%20Network\%20Infrastructure.pdf},
url = {https://bibliography.gnunet.org},
author = {Eric Wustrow and Scott Wolchok and Ian Goldberg and J. Alex Halderman}
}
@conference {ccs2011-trust,
title = {Trust-based Anonymous Communication: Adversary Models and Routing Algorithms},
- booktitle = {CCS{\textquoteright}11--Proceedings of the 18th ACM conference on Computer and Communications Security},
+ booktitle = {CCS'11--Proceedings of the 18th ACM conference on Computer and Communications Security},
year = {2011},
month = oct,
publisher = {ACM},
@@ -1983,31 +2029,31 @@ station but not to a censor. In addition, we use our tagging scheme to build a p
address = {Chicago, IL, United States},
abstract = {We introduce a novel model of routing security that incorporates the ordinarily overlooked variations in trust that users have for different parts of the network. We focus on anonymous communication, and in particular onion routing, although we expect the approach to apply more broadly. This paper provides two main contributions. First, we present a novel model to consider the various security concerns for route selection in anonymity networks when users vary their trust over parts of the network. Second, to show the usefulness of our model, we present as an example a new algorithm to select paths in onion routing. We analyze its effectiveness against deanonymization and other information leaks, and particularly how it fares in our model versus existing algorithms, which do not consider trust. In contrast to those, we find that our trust-based routing strategy can protect anonymity against an adversary capable of attacking a significant fraction of the network},
www_section = {anonymous communication, onion routing, privacy, trust},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CCS\%2711\%20-\%20Trust-based\%20Anonymous\%20Communication1.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CCS\%2711\%20-\%20Trust-based\%20Anonymous\%20Communication1.pdf},
url = {https://bibliography.gnunet.org},
author = {Aaron Johnson and Paul Syverson and Roger Dingledine and Nick Mathewson}
}
@conference {Yang:2011:USN:2068816.2068841,
title = {Uncovering social network sybils in the wild},
booktitle = {Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference},
- series = {IMC {\textquoteright}11},
+ series = {IMC '11},
year = {2011},
month = nov,
pages = {259--268},
publisher = {ACM},
organization = {ACM},
address = {Berlin, Germany},
- abstract = {Sybil accounts are fake identities created to unfairly increase the power or resources of a single user. Researchers have long known about the existence of Sybil accounts in online communities such as file-sharing systems, but have not been able to perform large scale measurements to detect them or measure their activities. In this paper, we describe our efforts to detect, characterize and understand Sybil account activity in the Renren online social network (OSN). We use ground truth provided by Renren Inc. to build measurement based Sybil account detectors, and deploy them on Renren to detect over 100,000 Sybil accounts. We study these Sybil accounts, as well as an additional 560,000 Sybil accounts caught by Renren, and analyze their link creation behavior. Most interestingly, we find that contrary to prior conjecture, Sybil accounts in OSNs do not form tight-knit communities. Instead, they integrate into the social graph just like normal users. Using link creation timestamps, we verify that the large majority of links between Sybil accounts are created accidentally, unbeknownst to the attacker. Overall, only a very small portion of Sybil accounts are connected to other Sybils with social links. Our study shows that existing Sybil defenses are unlikely to succeed in today{\textquoteright}s OSNs, and we must design new techniques to effectively detect and defend against Sybil attacks},
+ abstract = {Sybil accounts are fake identities created to unfairly increase the power or resources of a single user. Researchers have long known about the existence of Sybil accounts in online communities such as file-sharing systems, but have not been able to perform large scale measurements to detect them or measure their activities. In this paper, we describe our efforts to detect, characterize and understand Sybil account activity in the Renren online social network (OSN). We use ground truth provided by Renren Inc. to build measurement based Sybil account detectors, and deploy them on Renren to detect over 100,000 Sybil accounts. We study these Sybil accounts, as well as an additional 560,000 Sybil accounts caught by Renren, and analyze their link creation behavior. Most interestingly, we find that contrary to prior conjecture, Sybil accounts in OSNs do not form tight-knit communities. Instead, they integrate into the social graph just like normal users. Using link creation timestamps, we verify that the large majority of links between Sybil accounts are created accidentally, unbeknownst to the attacker. Overall, only a very small portion of Sybil accounts are connected to other Sybils with social links. Our study shows that existing Sybil defenses are unlikely to succeed in today's OSNs, and we must design new techniques to effectively detect and defend against Sybil attacks},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%2711\%20-\%20Uncovering\%20social\%20network\%20sybils.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {wpes11-panchenko,
title = {Website Fingerprinting in Onion Routing Based Anonymization Networks},
- booktitle = {WPES{\textquoteright}11--Proceedings of the Workshop on Privacy in the Electronic Society},
+ booktitle = {WPES'11--Proceedings of the Workshop on Privacy in the Electronic Society},
year = {2011},
month = oct,
publisher = {ACM},
@@ -2018,14 +2064,14 @@ fingerprinting solely based on volume, time, and direction of the traffic. As a
results of existing works on a given state-of-the-art dataset in Tor from 3\% to 55\% and in JAP from 20\% to 80\%. The datasets assume a closed-world with 775 websites only. In a next step, we transfer our findings to a more complex and realistic open-world scenario, i.e., recognition of several websites in a set of thousands of random unknown websites. To the best of our knowledge, this work is the first successful attack in the open-world scenario. We achieve a surprisingly high true positive rate of up to 73\% for a false positive rate of 0.05\%. Finally, we show preliminary results of a proof-of-concept implementation that applies camouflage as a countermeasure to hamper the fingerprinting attack. For
JAP, the detection rate decreases from 80\% to 4\% and for Tor it drops from 55\% to about 3\%},
www_section = {anonymous communication, pattern recognition, privacy, traffic analysis, website fingerprinting},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WPES\%2711\%20-\%20Fingerprinting.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/WPES\%2711\%20-\%20Fingerprinting.pdf},
url = {https://bibliography.gnunet.org},
author = {Andriy Panchenko and Lukas Niessen and Andreas Zinnen and Thomas Engel}
}
@conference {Eppstein:2011:WDE:2018436.2018462,
- title = {What{\textquoteright}s the difference?: efficient set reconciliation without prior context},
+ title = {What's the difference?: efficient set reconciliation without prior context},
booktitle = {Proceedings of the ACM SIGCOMM 2011 conference},
- series = {SIGCOMM {\textquoteright}11},
+ series = {SIGCOMM '11},
year = {2011},
pages = {218--229},
publisher = {ACM},
@@ -2035,7 +2081,7 @@ JAP, the detection rate decreases from 80\% to 4\% and for Tor it drops from 55\
isbn = {978-1-4503-0797-0},
doi = {10.1145/2018436.2018462},
url = {http://doi.acm.org/10.1145/2018436.2018462},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EppGooUye-SIGCOMM-11.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/EppGooUye-SIGCOMM-11.pdf},
author = {Eppstein, David and Goodrich, Michael T. and Uyeda, Frank and Varghese, George}
}
@article {journals/corr/abs-1109-0971,
@@ -2047,7 +2093,7 @@ JAP, the detection rate decreases from 80\% to 4\% and for Tor it drops from 55\
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},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CoRR\%20-\%20X-Vine.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CoRR\%20-\%20X-Vine.pdf},
author = {Prateek Mittal and Matthew Caesar and Borisov, Nikita}
}
@conference {2011_16,
@@ -2055,11 +2101,11 @@ JAP, the detection rate decreases from 80\% to 4\% and for Tor it drops from 55\
booktitle = {Security and Privacy (SP), 2011 IEEE Symposium on},
year = {2011},
month = {May},
- abstract = {Many commercial websites use recommender systems to help customers locate products and content. Modern recommenders are based on collaborative filtering: they use patterns learned from users{\textquoteright} behavior to make recommendations, usually in the form of related-items lists. The scale and complexity of these systems, along with the fact that their outputs reveal only relationships between items (as opposed to information about users), may suggest that they pose no meaningful privacy risk.
-In this paper, we develop algorithms which take a moderate amount of auxiliary information about a customer and infer this customer{\textquoteright}s transactions from temporal changes in the public outputs of a recommender system. Our inference attacks are passive and can be carried out by any Internet user. We evaluate their feasibility using public data from popular websites Hunch, Last.fm, LibraryThing, and Amazon},
+ abstract = {Many commercial websites use recommender systems to help customers locate products and content. Modern recommenders are based on collaborative filtering: they use patterns learned from users' behavior to make recommendations, usually in the form of related-items lists. The scale and complexity of these systems, along with the fact that their outputs reveal only relationships between items (as opposed to information about users), may suggest that they pose no meaningful privacy risk.
+In this paper, we develop algorithms which take a moderate amount of auxiliary information about a customer and infer this customer's transactions from temporal changes in the public outputs of a recommender system. Our inference attacks are passive and can be carried out by any Internet user. We evaluate their feasibility using public data from popular websites Hunch, Last.fm, LibraryThing, and Amazon},
www_section = {accuracy, Amazon, collaboration, collaborative filtering, commercial Web sites, consumer behaviour, Covariance matrix, customer transactions, data privacy, groupware, History, Hunch, Inference algorithms, inference attacks, inference mechanisms, information filtering, Internet, Internet user, Last.fm, Library Thing, privacy, privacy risks, recommender systems, Web sites},
doi = {10.1109/SP.2011.40},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Youmightlike2011Calandrino.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Youmightlike2011Calandrino.pdf},
url = {https://bibliography.gnunet.org},
author = {Calandrino, J.A. and Kilzer, A. and Narayanan, A. and Felten, E.W. and Shmatikov, V.}
}
@@ -2071,7 +2117,7 @@ In this paper, we develop algorithms which take a moderate amount of auxiliary i
type = {masters},
address = {M{\"u}nchen},
www_section = {Botnet, distributed hash table, GNUnet},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Polot2010.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Polot2010.pdf},
url = {https://bibliography.gnunet.org},
author = {Polot, Bartlomiej}
}
@@ -2081,7 +2127,7 @@ In this paper, we develop algorithms which take a moderate amount of auxiliary i
year = {2010},
month = sep,
www_section = {random walks, recommender system},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/opodis10_HAL.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/opodis10_HAL.pdf},
url = {https://bibliography.gnunet.org},
author = {Anne-Marie Kermarrec and Vincent Leroy and Afshin Moin and Christopher Thraves}
}
@@ -2100,7 +2146,7 @@ In this paper, we develop algorithms which take a moderate amount of auxiliary i
}
@conference {2010_2,
title = {Autonomous NAT Traversal},
- booktitle = {10th IEEE International Conference on Peer-to-Peer Computing (IEEE P2P{\textquoteright}10)},
+ booktitle = {10th IEEE International Conference on Peer-to-Peer Computing (IEEE P2P'10)},
year = {2010},
publisher = {IEEE},
organization = {IEEE},
@@ -2109,7 +2155,7 @@ In this paper, we develop algorithms which take a moderate amount of auxiliary i
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},
www_section = {GNUnet, ICMP, NAT, P2P},
url = {http://grothoff.org/christian/pwnat.pdf},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pwnat.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/pwnat.pdf},
author = {Andreas M{\"u}ller and Nathan S Evans and Christian Grothoff and Samy Kamkar}
}
@article {Yeoh:2008:BAB:1402298.1402307,
@@ -2125,24 +2171,24 @@ method for establishing connections to peers behind NAT. The proposed method fo
issn = {1076-9757},
doi = {10.1613/jair.2849},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Journal\%20of\%20AI\%20-\%20BnB-ADOPT.pdf},
author = {Yeoh, William and Felner, Ariel and Koenig, Sven}
}
@conference {incentives-fc10,
title = {Building Incentives into Tor},
- booktitle = {Proceedings of Financial Cryptography (FC {\textquoteright}10)},
+ booktitle = {Proceedings of Financial Cryptography (FC '10)},
year = {2010},
month = jan,
abstract = {Distributed anonymous communication networks like Tor depend on volunteers to donate their resources. However, the efforts of Tor volunteers have not grown as fast as the demands on the Tor network.We explore techniques to incentivize Tor users to relay Tor traffic too; if users contribute resources to the Tor overlay, they should receive faster service in return. In our design, the central Tor directory authorities measure performance and publish a list of Tor relays that should be given higher priority when establishing circuits. Simulations of our proposed design show that conforming users receive significant improvements in performance, in some cases experiencing twice the network throughput of selfish users who do not relay traffic for the Tor network},
www_section = {Tor},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/incentives-fc10.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/incentives-fc10.pdf},
url = {https://bibliography.gnunet.org},
- author = {Tsuen-Wan {\textquoteleft}{\textquoteleft}Johnny{\textquoteright}{\textquoteright} Ngan and Roger Dingledine and Dan S. Wallach},
+ author = {Tsuen-Wan {\textquoteleft}{\textquoteleft}Johnny'' Ngan and Roger Dingledine and Dan S. Wallach},
editor = {Radu Sion}
}
@conference {1827424,
title = {Cordies: expressive event correlation in distributed systems},
- booktitle = {DEBS {\textquoteright}10: Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems},
+ booktitle = {DEBS '10: Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems},
year = {2010},
pages = {26--37},
publisher = {ACM},
@@ -2166,7 +2212,7 @@ 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.)},
www_section = {GNUnet, HKDF, HMAC, key derivation},
url = {http://eprint.iacr.org/2010/264},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/264.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/264.pdf},
publisher = {unknown},
author = {Hugo Krawczyk}
}
@@ -2177,17 +2223,17 @@ Beyond the theoretical interest in modeling KDFs, this work is intended to addre
month = sep,
pages = {0--66},
school = {University of Helsinki},
- type = {Master{\textquoteright}s Thesis},
+ type = {Master's Thesis},
address = {Helsinki},
- abstract = {As the virtual world grows more complex, finding a standard way for storing data becomes increasingly important. Ideally, each data item would be brought into the computer system only once. References for data items need to be cryptographically verifiable, so the data can maintain its identity while being passed around. This way there will be only one copy of the users family photo album, while the user can use multiple tools to show or manipulate the album. Copies of users data could be stored on some of his family members computer, some of his computers, but also at some online services which he uses. When all actors operate over one replicated copy of the data, the system automatically avoids a single point of failure. Thus the data will not disappear with one computer breaking, or one service provider going out of business. One shared copy also makes it possible to delete a piece of data from all systems at once, on users request. In our research we tried to find a model that would make data manageable to users, and make it possible to have the same data stored at various locations. We studied three systems, Persona, Freenet, and GNUnet, that suggest different models for protecting user data. The main application areas of the systems studied include securing online social networks, providing anonymous web, and preventing censorship in file-sharing. Each of the systems studied store user data on machines belonging to third parties. The systems differ in measures they take to protect their users from data loss, forged information, censorship, and being monitored. All of the systems use cryptography to secure names used for the content, and to protect the data from outsiders. Based on the gained knowledge, we built a prototype platform called Peerscape, which stores user data in a synchronized, protected database. Data items themselves are protected with cryptography against forgery, but not encrypted as the focus has been disseminating the data directly among family and friends instead of letting third parties store the information. We turned the synchronizing database into peer-to-peer web by revealing its contents through an integrated http server. The REST-like http API supports development of applications in javascript. To evaluate the platform{\textquoteright}s suitability for application development we wrote some simple applications, including a public chat room, bittorrent site, and a flower growing game. During our early tests we came to the conclusion that using the platform for simple applications works well. As web standards develop further, writing applications for the platform should become easier. Any system this complex will have its problems, and we are not expecting our platform to replace the existing web, but are fairly impressed with the results and consider our work important from the perspective of managing user data},
+ abstract = {As the virtual world grows more complex, finding a standard way for storing data becomes increasingly important. Ideally, each data item would be brought into the computer system only once. References for data items need to be cryptographically verifiable, so the data can maintain its identity while being passed around. This way there will be only one copy of the users family photo album, while the user can use multiple tools to show or manipulate the album. Copies of users data could be stored on some of his family members computer, some of his computers, but also at some online services which he uses. When all actors operate over one replicated copy of the data, the system automatically avoids a single point of failure. Thus the data will not disappear with one computer breaking, or one service provider going out of business. One shared copy also makes it possible to delete a piece of data from all systems at once, on users request. In our research we tried to find a model that would make data manageable to users, and make it possible to have the same data stored at various locations. We studied three systems, Persona, Freenet, and GNUnet, that suggest different models for protecting user data. The main application areas of the systems studied include securing online social networks, providing anonymous web, and preventing censorship in file-sharing. Each of the systems studied store user data on machines belonging to third parties. The systems differ in measures they take to protect their users from data loss, forged information, censorship, and being monitored. All of the systems use cryptography to secure names used for the content, and to protect the data from outsiders. Based on the gained knowledge, we built a prototype platform called Peerscape, which stores user data in a synchronized, protected database. Data items themselves are protected with cryptography against forgery, but not encrypted as the focus has been disseminating the data directly among family and friends instead of letting third parties store the information. We turned the synchronizing database into peer-to-peer web by revealing its contents through an integrated http server. The REST-like http API supports development of applications in javascript. To evaluate the platform's suitability for application development we wrote some simple applications, including a public chat room, bittorrent site, and a flower growing game. During our early tests we came to the conclusion that using the platform for simple applications works well. As web standards develop further, writing applications for the platform should become easier. Any system this complex will have its problems, and we are not expecting our platform to replace the existing web, but are fairly impressed with the results and consider our work important from the perspective of managing user data},
www_section = {content centric, ECRS, Freenet, GNUnet, P2P, Peerscape, Persona},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/twr-dp2pwa.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/twr-dp2pwa.pdf},
url = {https://bibliography.gnunet.org},
author = {Toni Ruottu}
}
@conference {continual,
title = {Differential Privacy Under Continual Observation},
- booktitle = {Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC{\textquoteright}10)},
+ booktitle = {Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC'10)},
year = {2010},
month = {June},
pages = {715--724},
@@ -2201,9 +2247,9 @@ Beyond the theoretical interest in modeling KDFs, this work is intended to addre
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},
+ 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' 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's privacy incurred by participating in a database},
url = {http://research.microsoft.com/apps/pubs/default.aspx?id=135704},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DisclousrePrevention2010Dwork.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/DisclousrePrevention2010Dwork.pdf},
www_section = unsorted,
author = {Cynthia Dwork and Moni Naor}
}
@@ -2213,7 +2259,7 @@ Beyond the theoretical interest in modeling KDFs, this work is intended to addre
month = dec,
school = {IRISA},
type = {phd},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DistributingSocialApp2010Leroy.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/DistributingSocialApp2010Leroy.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Vincent Leroy}
@@ -2231,28 +2277,28 @@ Beyond the theoretical interest in modeling KDFs, this work is intended to addre
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/drac-pet2010.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/drac-pet2010.pdf},
author = {Danezis, George and Claudia Diaz and Troncoso, Carmela and Laurie, Ben},
editor = {Atallah, MikhailJ. and Hopper, Nicholas J}
}
@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},
+ title = {Efficient DHT attack mitigation through peers' ID distribution },
+ booktitle = {HOTP2P'10--International Workshop on Hot Topics in Peer-to-Peer Systems},
year = {2010},
month = apr,
address = {Atlanta, Georgia, USA},
abstract = {We present a new solution to protect the widely deployed KAD DHT against localized attacks which can take control over DHT entries. We show through measurements that the IDs distribution of the best peers found after a lookup
-process follows a geometric distribution. We then use this result to detect DHT attacks by comparing real peers{\textquoteright} ID distributions to the theoretical one thanks to the Kullback-Leibler divergence. When an attack is detected, we propose countermeasures that progressively remove suspicious peers from the list of possible contacts to provide a safe DHT access. Evaluations show that our
+process follows a geometric distribution. We then use this result to detect DHT attacks by comparing real peers' ID distributions to the theoretical one thanks to the Kullback-Leibler divergence. When an attack is detected, we propose countermeasures that progressively remove suspicious peers from the list of possible contacts to provide a safe DHT access. Evaluations show that our
method detects the most efficient attacks with a very small false-negative rate, while countermeasures successfully filter almost all malicious peers involved in an attack. Moreover, our solution completely fits the current design of the KAD network and introduces no network overhead},
www_section = {attack detection, attack mitigation, distributed hash table, IDs distribution, KAD, Sybil attack},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/HotP2P\%2710\%20-\%20KAD\%20DHT\%20attack\%20mitigation.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/HotP2P\%2710\%20-\%20KAD\%20DHT\%20attack\%20mitigation.pdf},
url = {https://bibliography.gnunet.org},
author = {Cholez, Thibault and Chrisment, Isabelle and Festor, Olivier}
}
@conference {Koch:2010:EPL:1827418.1827440,
title = {Event processing for large-scale distributed games},
booktitle = {Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems},
- series = {DEBS {\textquoteright}10},
+ series = {DEBS '10},
year = {2010},
pages = {103--104},
publisher = {ACM},
@@ -2274,7 +2320,7 @@ method detects the most efficient attacks with a very small false-negative rate,
organization = { ACM/IFIP/USENIX},
abstract = {While social networks provide news from old buddies, you can learn a lot more from people you do not know, but with whom you share many interests. We show in this paper how to build a network of anonymous social acquaintances using a gossip protocol we call Gossple, and how to leverage such a network to enhance navigation within Web 2.0 collaborative applications, {\`a} la LastFM and Delicious. Gossple nodes (users) periodically gossip digests of their interest profiles and compute their distances (in terms of interest) with respect to other nodes. This is achieved with little bandwidth and storage, fast convergence, and without revealing which profile is associated with which user. We evaluate Gossple on real traces from various Web 2.0 applications with hundreds of PlanetLab hosts and thousands of simulated nodes},
www_section = {gossple, social networks},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/gossple2010Bertier.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/gossple2010Bertier.pdf},
url = {https://bibliography.gnunet.org},
author = {Marin Bertier and Davide Frey and Rachid Guerraoui and Anne-Marie Kermarrec and Vincent Leroy}
}
@@ -2288,40 +2334,40 @@ method detects the most efficient attacks with a very small false-negative rate,
abstract = {Redundancy is the basic technique to provide reliability in storage systems consisting of multiple components. A redundancy scheme defines how the redundant data are produced and maintained. The simplest redundancy scheme is replication, which however suffers from storage inefficiency. Another approach is erasure coding, which provides the same level of reliability as replication using a significantly smaller amount of storage. When redundant data are lost, they need to be replaced. While replacing replicated data consists in a simple copy, it becomes a complex operation with erasure codes: new data are produced performing a coding over some other available data. The amount of data to be read and coded is d times larger than the amount of data produced, where d, called repair degree, is larger than 1 and depends on the structure of the code. This implies that coding has a larger computational and I/O cost, which, for distributed storage systems, translates into increased network traffic. Participants of Peer-to-Peer systems often have ample storage and CPU power, but their network bandwidth may be limited. For these reasons existing coding techniques are not suitable for P2P storage. This work explores the design space between replication and the existing erasure codes. We propose and evaluate a new class of erasure codes, called Hierarchical Codes, which allows to reduce the network traffic due to maintenance without losing the benefits given by traditional erasure codes},
www_section = {dependability, erasure codes, peer-to-peer networking, reliability, storage},
doi = {10.1007/s12083-009-0044-8},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Duminuco\%20\%26\%20Biersack\%20-\%20Hierarchical\%20Codes.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Duminuco\%20\%26\%20Biersack\%20-\%20Hierarchical\%20Codes.pdf},
url = {https://bibliography.gnunet.org},
author = {Alessandro Duminuco and E W Biersack}
}
@conference {2010_7,
- title = {How Accurately Can One{\textquoteright}s Interests Be Inferred from Friends?},
+ title = {How Accurately Can One's Interests Be Inferred from Friends?},
booktitle = {Proceedings of the 19th International Conference on World Wide Web},
year = {2010},
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
abstract = {Search and recommendation systems must effectively model user interests in order to provide personalized results. The proliferation of social software makes social network an increasingly important source for user interest modeling, be-
-cause of the social influence and correlation among friends. However, there are large variations in people{\textquoteright}s contribution of social content. Therefore, it is impractical to accurately model interests for all users. As a result, applications need to decide whether to utilize a user interest model based on its
+cause of the social influence and correlation among friends. However, there are large variations in people's contribution of social content. Therefore, it is impractical to accurately model interests for all users. As a result, applications need to decide whether to utilize a user interest model based on its
accuracy. To address this challenge, we present a study on the accuracy of user interests inferred from three types of social content: social bookmarking, file sharing, and electronic communication, in an organizational social network within a large-scale enterprise. First, we demonstrate that combining different types of social content to infer user interests
outperforms methods that use only one type of social content. Second, we present a technique to predict the inference accuracy based on easily observed network characteristics, including user activeness, network in-degree, out-degree, and betweenness centrality},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/InterestsInference2010Wen.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/InterestsInference2010Wen.pdf},
author = {Wen, Zhen and Lin, Ching-Yung}
}
@article {tissec-latency-leak,
title = {How Much Anonymity does Network Latency Leak?},
journal = {ACM Transactions on Information and System Security},
year = {2010},
- month = {forthcoming},
+ month = jan,
pages = {82--91},
abstract = {Low-latency anonymity systems such as Tor, AN.ON, Crowds, and Anonymizer.com aim to provide anonymous connections that are both untraceable by "local" adversaries who control only a few machines, and have low enough delay to support anonymous use of network services like web browsing and remote login. One consequence of these goals is that these services leak some information about the network latency between the sender and one or more nodes in the system. This paper reports on three experiments that partially measure the extent to which such leakage can compromise anonymity. First, using a public dataset of pairwise round-trip times (RTTs) between 2000 Internet hosts, we estimate that on average, knowing the network location of host A and the RTT to host B leaks 3.64 bits of information about the network location of B. Second, we describe an attack that allows a pair of colluding web sites to predict, based on local timing information and with no additional resources, whether two connections from the same Tor exit node are using the same circuit with 17\% equal error rate. Finally, we describe an attack that allows a malicious website, with access to a network coordinate system and one corrupted Tor router, to recover roughly 6.8 bits of network location per hour},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tissec-latency-leak.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/tissec-latency-leak.pdf},
author = {Nicholas J. Hopper and Eugene Y. Vasserman and Eric Chan-Tin}
}
@conference {DBLP:conf/tridentcom/NguyenRKFMB10,
@@ -2330,7 +2376,7 @@ outperforms methods that use only one type of social content. Second, we present
year = {2010},
pages = {3--18},
www_section = {autonetkit, emulation, netkit, network, testbed, virtualization},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/AutoNetkit_0.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/AutoNetkit_0.pdf},
url = {https://bibliography.gnunet.org},
author = {Hung X. Nguyen and Roughan, Matthew and Knight, Simon and Nick Falkner and Maennel, Olaf and Randy Bush}
}
@@ -2345,18 +2391,18 @@ outperforms methods that use only one type of social content. Second, we present
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},
www_section = {BitTorrent, Freeloading, game theory, incentives, PeerLive, prices, QoS},
url = {http://eprints.ucl.ac.uk/19490/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/19490.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/19490.pdf},
author = {Raul Leonardo Landa Gamiochipi}
}
@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},
+ 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' 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},
www_section = {distributed storage, Malugo, peer-to-peer storage},
journal = {unknown},
doi = {10.1504/IJAHUC.2010.032995},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Malugo.pdf},
author = {Chan, Yu-Wei and Ho, Tsung-Hsuan and Shih, Po-Chi and Chung, Yeh-Ching}
}
@conference {DBLP:conf/tridentcom/AlbrechtH10,
@@ -2365,7 +2411,7 @@ outperforms methods that use only one type of social content. Second, we present
year = {2010},
pages = {401--411},
www_section = {distributed applications, emulation, GENI, PlanetLab, testbed},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/gush.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/gush.pdf},
url = {https://bibliography.gnunet.org},
author = {Jeannie R. Albrecht and Danny Yuxing Huang}
}
@@ -2375,26 +2421,26 @@ outperforms methods that use only one type of social content. Second, we present
year = {2010},
pages = {69--83},
www_section = {emulation, P2P, testbed},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/A\%20Novel\%20Testbed\%20for\%20P2P\%20Networks.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/A_Novel_Testbed_for_P2P_Networks.pdf},
url = {https://bibliography.gnunet.org},
author = {Pekka H. J. Per{\"a}l{\"a} and Jori P. Paananen and Milton Mukhopadhyay and Jukka-Pekka Laulajainen}
}
@conference {Locher:2010:PKN:2018057.2018085,
title = {Poisoning the Kad network},
- booktitle = {ICDCN{\textquoteright}10--Proceedings of the 11th International Conference on Distributed Computing and Networking},
- series = {ICDCN{\textquoteright}10},
+ booktitle = {ICDCN'10--Proceedings of the 11th International Conference on Distributed Computing and Networking},
+ series = {ICDCN'10},
year = {2010},
month = jan,
pages = {195--206},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
address = {Kolkata, India},
- abstract = {Since the demise of the Overnet network, the Kad network has become not only the most popular but also the only widely used peer-to-peer system based on a distributed hash table. It is likely that its user base will continue to grow in numbers over the next few years as, unlike the eDonkey network, it does not depend on central servers, which increases scalability and reliability. Moreover, the Kad network is more efficient than unstructured systems such as Gnutella. However, we show that today{\textquoteright}s Kad network can be attacked in several ways by carrying out several (well-known) attacks on the Kad network. The presented attacks could be used either to hamper the correct functioning of the network itself, to censor contents, or to harm other entities in the Internet not participating in the Kad network such as ordinary web servers. While there are simple heuristics to reduce the impact of some of the attacks, we believe that the presented attacks cannot be thwarted easily in any fully decentralized peer-to-peer system without some kind of a centralized certification and verification authority},
+ abstract = {Since the demise of the Overnet network, the Kad network has become not only the most popular but also the only widely used peer-to-peer system based on a distributed hash table. It is likely that its user base will continue to grow in numbers over the next few years as, unlike the eDonkey network, it does not depend on central servers, which increases scalability and reliability. Moreover, the Kad network is more efficient than unstructured systems such as Gnutella. However, we show that today's Kad network can be attacked in several ways by carrying out several (well-known) attacks on the Kad network. The presented attacks could be used either to hamper the correct functioning of the network itself, to censor contents, or to harm other entities in the Internet not participating in the Kad network such as ordinary web servers. While there are simple heuristics to reduce the impact of some of the attacks, we believe that the presented attacks cannot be thwarted easily in any fully decentralized peer-to-peer system without some kind of a centralized certification and verification authority},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ICDCN\%2710\%20-\%20Poisoning\%20the\%20Kad\%20Network.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ICDCN\%2710\%20-\%20Poisoning\%20the\%20Kad\%20Network.pdf},
author = {Thomas Locher and Mysicka, David and Stefan Schmid and Roger Wattenhofer}
}
@conference {FessiIPTComm2010,
@@ -2404,7 +2450,7 @@ outperforms methods that use only one type of social content. Second, we present
month = {August},
pages = {141--152},
address = {Munich, Germany},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fessi_iptcomm_2010.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fessi_iptcomm_2010.pdf},
url = {https://bibliography.gnunet.org},
www_section = unsorted,
author = {Fessi, Ali and Nathan S Evans and Heiko Niedermayer and Ralph Holz}
@@ -2422,7 +2468,7 @@ outperforms methods that use only one type of social content. Second, we present
issn = {0146-4833},
doi = {10.1145/1851275.1851198},
url = {http://doi.acm.org/10.1145/1851275.1851198},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/oneswarm_SIGCOMM.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/oneswarm_SIGCOMM.pdf},
author = {Isdal, Tomas and Piatek, Michael and Krishnamurthy, Arvind and Anderson, Thomas}
}
@article {1667071,
@@ -2438,7 +2484,7 @@ outperforms methods that use only one type of social content. Second, we present
www_section = {keywords, privacy, search, text mining},
issn = {1533-5399},
doi = {http://doi.acm.org/10.1145/1667067.1667071},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/privacy_preserving_similarity.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/privacy_preserving_similarity.pdf},
url = {https://bibliography.gnunet.org},
author = {Pang, Hweehwa and Shen, Jialie and Krishnan, Ramayya}
}
@@ -2454,12 +2500,12 @@ outperforms methods that use only one type of social content. Second, we present
isbn = {978-1-60558-945-9},
doi = {10.1145/1739041.1739059},
url = {http://doi.acm.org/10.1145/1739041.1739059},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PrivateRecordMatching2010Inan.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PrivateRecordMatching2010Inan.pdf},
author = {Inan, Ali and Kantarcioglu, Murat and Ghinita, Gabriel and Bertino, Elisa}
}
@conference {1827425,
title = {Providing basic security mechanisms in broker-less publish/subscribe systems},
- booktitle = {DEBS {\textquoteright}10: Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems},
+ booktitle = {DEBS '10: Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems},
year = {2010},
pages = {38--49},
publisher = {ACM},
@@ -2470,7 +2516,7 @@ outperforms methods that use only one type of social content. Second, we present
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DIP_2872.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/DIP_2872.pdf},
author = {Tariq, Muhammad Adnan and Boris Koldehofe and Altaweel, Ala and Kurt Rothermel}
}
@article {1672334,
@@ -2482,12 +2528,12 @@ outperforms methods that use only one type of social content. Second, we present
pages = {131--132},
publisher = {ACM},
address = {New York, NY, USA},
- abstract = {End-to-End connectivity in today{\textquoteright}s Internet can no longer be taken for granted. Middleboxes, mobility, and protocol heterogeneity complicate application development and often result in application-specific solutions. In our demo we present ariba: an overlay-based approach to handle such network challenges and to provide consistent homogeneous network primitives in order to ease application and service development},
+ abstract = {End-to-End connectivity in today's Internet can no longer be taken for granted. Middleboxes, mobility, and protocol heterogeneity complicate application development and often result in application-specific solutions. In our demo we present ariba: an overlay-based approach to handle such network challenges and to provide consistent homogeneous network primitives in order to ease application and service development},
www_section = {heterogeneity, overlay networks, P2P},
issn = {0146-4833},
doi = {10.1145/1672308.1672334},
url = {http://portal.acm.org/citation.cfm?doid=1672308.1672334$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p131-v40n1n-huebschA.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_11,
@@ -2507,7 +2553,7 @@ outperforms methods that use only one type of social content. Second, we present
title = {Scalable Application-Layer Multicast Simulations with OverSim},
booktitle = {7th Annual IEEE Consumer Communiations \& Networking Conference},
year = {2010},
- abstract = {Application-Layer Multicast has become a promising class of protocols since IP Multicast has not found wide area deployment in the Internet. Developing such protocols requires in-depth analysis of their properties even with large numbers of participants---a characteristic which is at best hard to achieve in real network experiments. Several well-known simulation frameworks have been developed and used in recent years, but none has proved to be fitting the requirements for analyzing large-scale application-layer networks. In this paper we propose the OverSim framework as a promising simulation environment for scalabe Application-Layer Multicast research. We show that OverSim is able to manage even overlays with several thousand participants in short time while consuming comparably little memory. We compare the framework{\textquoteright}s runtime properties with the two exemplary Application-Layer Mutlicast protocols Scribe and NICE. The results show that both simulation time and memory consumption grow linearly with the number of nodes in highly feasible dimensions},
+ abstract = {Application-Layer Multicast has become a promising class of protocols since IP Multicast has not found wide area deployment in the Internet. Developing such protocols requires in-depth analysis of their properties even with large numbers of participants---a characteristic which is at best hard to achieve in real network experiments. Several well-known simulation frameworks have been developed and used in recent years, but none has proved to be fitting the requirements for analyzing large-scale application-layer networks. In this paper we propose the OverSim framework as a promising simulation environment for scalabe Application-Layer Multicast research. We show that OverSim is able to manage even overlays with several thousand participants in short time while consuming comparably little memory. We compare the framework's runtime properties with the two exemplary Application-Layer Mutlicast protocols Scribe and NICE. The results show that both simulation time and memory consumption grow linearly with the number of nodes in highly feasible dimensions},
www_section = {multicast, NICE, OverSim, Scribe},
url = {https://bibliography.gnunet.org},
author = {Stephan Krause and H{\"u}bsch, Christian}
@@ -2515,18 +2561,18 @@ outperforms methods that use only one type of social content. Second, we present
@conference {Burkhart:2010:SPA:1929820.1929840,
title = {SEPIA: privacy-preserving aggregation of multi-domain network events and statistics},
booktitle = {Proceedings of the 19th USENIX conference on Security},
- series = {USENIX Security{\textquoteright}10},
+ series = {USENIX Security'10},
year = {2010},
month = aug,
pages = {15--15},
publisher = {USENIX Association},
organization = {USENIX Association},
address = {Washington, DC, USA},
- 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},
+ 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's protocols on real traffic traces of 17 networks and show how they provide new possibilities for distributed troubleshooting and early anomaly detection},
www_section = {privacy, secure multi-party computation, SMC},
isbn = {888-7-6666-5555-4},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/USENIX\%20Security\%2710\%20-\%20SEPIA.pdf},
author = {Burkhart, Martin and Strasser, Mario and Many, Dilip and Dimitropoulos, Xenofontas}
}
@conference {Marks2010a,
@@ -2547,12 +2593,12 @@ outperforms methods that use only one type of social content. Second, we present
publisher = {Springer Berlin, Heidelberg},
organization = {Springer Berlin, Heidelberg},
address = {Essen, Germany},
- abstract = {The presentation of a landmark paper by Chu et al. at SIGMETRICS 2000 introduced application layer multicast (ALM) as completely new area of network research. Many researchers have since proposed ALM protocols, and have shown that these protocols only put a small burden on the network in terms of link-stress and -stretch. However, since the network is typically not a bottleneck, user acceptance remains the limiting factor for the deployment of ALM. In this paper we present an in-depth study of the user-perceived performance of the NICE ALM protocol. We use the OverSim simulation framework to evaluate delay experienced by a user and bandwidth consumption on the user{\textquoteright}s access link in large multicast groups and under aggressive churn models. Our major results are (1) latencies grow moderate with increasing number of nodes as clusters get optimized, (2) join delays get optimized over time, and (3) despite being a tree-dissemination protocol NICE handles churn surprisingly well when adjusting heartbeat intervals accordingly. We conclude that NICE comes up to the user{\textquoteright}s expectations even for large groups and under high churn.
+ abstract = {The presentation of a landmark paper by Chu et al. at SIGMETRICS 2000 introduced application layer multicast (ALM) as completely new area of network research. Many researchers have since proposed ALM protocols, and have shown that these protocols only put a small burden on the network in terms of link-stress and -stretch. However, since the network is typically not a bottleneck, user acceptance remains the limiting factor for the deployment of ALM. In this paper we present an in-depth study of the user-perceived performance of the NICE ALM protocol. We use the OverSim simulation framework to evaluate delay experienced by a user and bandwidth consumption on the user's access link in large multicast groups and under aggressive churn models. Our major results are (1) latencies grow moderate with increasing number of nodes as clusters get optimized, (2) join delays get optimized over time, and (3) despite being a tree-dissemination protocol NICE handles churn surprisingly well when adjusting heartbeat intervals accordingly. We conclude that NICE comes up to the user's expectations even for large groups and under high churn.
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/User-Perceived\%20Performance\%20of\%20the\%20NICE\%20Application\%20Layer\%20Multicast\%20Protocol\%20in\%20Large\%20and\%20Highly\%20Dynamic\%20Groups_1.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/User-Perceived\%20Performance\%20of\%20the\%20NICE\%20Application\%20Layer\%20Multicast\%20Protocol\%20in\%20Large\%20and\%20Highly\%20Dynamic\%20Groups_1.pdf},
www_section = unsorted,
author = {H{\"u}bsch, Christian and Mayer, Christoph P. and Oliver Waldhorst}
}
@@ -2573,28 +2619,28 @@ This work was partially funded as part of the Spontaneous Virtual Networks (SpoV
pages = {380--389},
publisher = {ACM},
organization = {ACM},
- abstract = {Tor is an anonymous communications network with thousands of router nodes worldwide. An intuition reflected in much of the literature on anonymous communications is that, as an anonymity network grows, it becomes more secure against a given observer because the observer will see less of the network. In particular, as the Tor network grows from volunteers operating relays all over the world, it becomes less and less likely for a single autonomous system (AS) to be able to observe both ends of an anonymous connection. Yet, as the network continues to grow significantly, no analysis has been done to determine if this intuition is correct. Further, modifications to Tor{\textquoteright}s path selection algorithm to help clients avoid an AS-level observer have not been proposed and analyzed.
+ abstract = {Tor is an anonymous communications network with thousands of router nodes worldwide. An intuition reflected in much of the literature on anonymous communications is that, as an anonymity network grows, it becomes more secure against a given observer because the observer will see less of the network. In particular, as the Tor network grows from volunteers operating relays all over the world, it becomes less and less likely for a single autonomous system (AS) to be able to observe both ends of an anonymous connection. Yet, as the network continues to grow significantly, no analysis has been done to determine if this intuition is correct. Further, modifications to Tor's path selection algorithm to help clients avoid an AS-level observer have not been proposed and analyzed.
-Five years ago a previous study examined the AS-level threat against client and destination addresses chosen a priori to be likely or interesting to examine. Using an AS-level path inference algorithm with improved accuracy, more extensive Internet routing data, and, most importantly, a model of typical Tor client AS-level sources and destinations based on data gathered from the live network, we demonstrate that the threat of a single AS observing both ends of an anonymous Tor connection is greater than previously thought. We look at the growth of the Tor network over the past five years and show that its explosive growth has had only a small impact on the network{\textquoteright}s robustness against an AS-level attacker. Finally, we propose and evaluate the effectiveness of some simple, AS-aware path selection algorithms that avoid the computational overhead imposed by full AS-level path inference algorithms. Our results indicate that a novel heuristic we propose is more effective against an AS-level observer than other commonly proposed heuristics for improving location diversity in path selection},
+Five years ago a previous study examined the AS-level threat against client and destination addresses chosen a priori to be likely or interesting to examine. Using an AS-level path inference algorithm with improved accuracy, more extensive Internet routing data, and, most importantly, a model of typical Tor client AS-level sources and destinations based on data gathered from the live network, we demonstrate that the threat of a single AS observing both ends of an anonymous Tor connection is greater than previously thought. We look at the growth of the Tor network over the past five years and show that its explosive growth has had only a small impact on the network's robustness against an AS-level attacker. Finally, we propose and evaluate the effectiveness of some simple, AS-aware path selection algorithms that avoid the computational overhead imposed by full AS-level path inference algorithms. Our results indicate that a novel heuristic we propose is more effective against an AS-level observer than other commonly proposed heuristics for improving location diversity in path selection},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EdmanS09.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/EdmanS09.pdf},
author = {Matthew Edman and Paul Syverson},
editor = {Ehab Al-Shaer and Somesh Jha and Angelos D. Keromytis}
}
@conference {Attrapadung:2009:AES:1696791.1696811,
title = {Attribute-Based Encryption Supporting Direct/Indirect Revocation Modes},
booktitle = {Proceedings of the 12th IMA International Conference on Cryptography and Coding},
- series = {Cryptography and Coding {\textquoteright}09},
+ series = {Cryptography and Coding '09},
year = {2009},
month = dec,
pages = {278--300},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
address = {Cirencester, UK},
- 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},
+ 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' 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},
@@ -2613,13 +2659,13 @@ Five years ago a previous study examined the AS-level threat against client and
isbn = {978-1-60558-894-0},
doi = {10.1145/1653662.1653707},
url = {http://portal.acm.org/citation.cfm?id=1653662.1653707},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/TroncosoD09.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/TroncosoD09.pdf},
author = {Carmela Troncoso and George Danezis},
editor = {Ehab Al-Shaer and Somesh Jha and Angelos D. Keromytis}
}
@conference {1659021,
title = {Bloom filters and overlays for routing in pocket switched networks},
- booktitle = {Co-Next Student Workshop {\textquoteright}09: Proceedings of the 5th international student workshop on Emerging networking experiments and technologies},
+ booktitle = {Co-Next Student Workshop '09: Proceedings of the 5th international student workshop on Emerging networking experiments and technologies},
year = {2009},
pages = {43--44},
publisher = {ACM},
@@ -2630,13 +2676,13 @@ Five years ago a previous study examined the AS-level threat against client and
isbn = {978-1-60558-751-6},
doi = {10.1145/1658997.1659021},
url = {http://portal.acm.org/citation.cfm?doid=1658997.1659021$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/conext09-phdworkshop-cameraready.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/conext09-phdworkshop-cameraready.pdf},
author = {Mayer, Christoph P.}
}
@conference {Knoll:2009:BPS:1590968.1591829,
title = {Bootstrapping Peer-to-Peer Systems Using IRC},
- booktitle = {WETICE{\textquoteright}09--Proceedings of the 18th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises},
- series = {WETICE {\textquoteright}09},
+ booktitle = {WETICE'09--Proceedings of the 18th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises},
+ series = {WETICE '09},
year = {2009},
month = jun,
pages = {122--127},
@@ -2656,7 +2702,7 @@ Five years ago a previous study examined the AS-level threat against client and
year = {2009},
month = {April},
www_section = {Byzantine Resilient Sampling, Random Membership, random sampling},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Brahms-Comnet-Mar09.pdf , https://gnunet.org/git/bibliography.git/tree/docs/Brahms-rps-mar09.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Brahms-Comnet-Mar09.pdf , https://gnunet.org/git/bibliography.git/plain/docs/Brahms-rps-mar09.pdf},
url = {https://bibliography.gnunet.org},
author = {Edward Bortnikov and Maxim Gurevich and Idit Keidar and Gabriel Kliot and Alexander Shraer}
}
@@ -2686,7 +2732,7 @@ Five years ago a previous study examined the AS-level threat against client and
abstract = {Private scalar product protocols have proved to be interesting in various applications such as data mining, data integration, trust computing, etc. In 2007, Yao et al. proposed a distributed scalar product protocol with application to privacy-preserving computation of trust [1]. This protocol is split in two phases: an homorphic encryption computation; and a private multi-party summation protocol. The summation protocol has two drawbacks: first, it generates a non-negligible communication overhead; and second, it introduces a security flaw. The contribution of this present paper is two-fold. We first prove that the protocol of [1] is not secure in the semi-honest model by showing that it is not resistant to collusion attacks and we give an example of a collusion attack, with only four participants. Second, we propose to use a superposed sending round as an alternative to the multi-party summation protocol, which results in better security properties and in a reduction of the communication costs. In particular, regarding security, we show that the previous scheme was vulnerable to collusions of three users whereas in our proposal we can t isin [1..n--1] and define a protocol resisting to collusions of up to t users},
www_section = {collaboration, collusion-resistant distributed protocol, Computer applications, computer networks, cryptographic protocols, cryptography, data privacy, distributed computing, homorphic encryption computation, Laboratories, Portable media players, privacy-preserving computation, Privacy-preserving computation of trust, private multiparty summation protocol, scalar product protocol, secure multi-party computation, Secure scalar product, security, Superposed sending., Telephony, trust computation},
doi = {10.1109/NCA.2009.48},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CollusionResistant2009Melchor.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CollusionResistant2009Melchor.pdf},
url = {https://bibliography.gnunet.org},
author = {Melchor, C.A. and Ait-Salem, B. and Gaborit, P.}
}
@@ -2712,11 +2758,11 @@ Five years ago a previous study examined the AS-level threat against client and
We present a framework for analyzing privacy and anonymity in social networks and develop a new re-identification algorithm targeting anonymized social-network graphs. To demonstrate its effectiveness on real-world networks, we show that a third of the users who can be verified to have accounts on both Twitter, a popular microblogging service, and Flickr, an online photo-sharing site, can be re-identified in the anonymous Twitter graph with only a 12\% error rate.
-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},
+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's auxiliary information is small},
www_section = {anonymity, network topology, privacy},
isbn = {978-0-7695-3633-0},
url = {http://randomwalker.info/social-networks/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NarayananS09.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/NarayananS09.pdf},
author = {Arvind Narayanan and Vitaly Shmatikov}
}
@article {Badishi:2009:DFC:1550962.1551186,
@@ -2728,12 +2774,12 @@ Our de-anonymization algorithm is based purely on the network topology, does not
pages = {613--622},
publisher = {Academic Press, Inc},
address = {Orlando, FL, USA},
- abstract = {Celeste is a robust peer-to-peer object store built on top of a distributed hash table (DHT). Celeste is a working system, developed by Sun Microsystems Laboratories. During the development of Celeste, we faced the challenge of complete object deletion, and moreover, of deleting {\textquoteright}{\textquoteright}files{\textquoteright}{\textquoteright} composed of several different objects. This important problem is not solved by merely deleting meta-data, as there are scenarios in which all file contents must be deleted, e.g., due to a court order. Complete file deletion in a realistic peer-to-peer storage system has not been previously dealt with due to the intricacy of the problem--the system may experience high churn rates, nodes may crash or have intermittent connectivity, and the overlay network may become partitioned at times. We present an algorithm that eventually deletes all file contents, data and meta-data, in the aforementioned complex scenarios. The algorithm is fully functional and has been successfully integrated into Celeste},
+ abstract = {Celeste is a robust peer-to-peer object store built on top of a distributed hash table (DHT). Celeste is a working system, developed by Sun Microsystems Laboratories. During the development of Celeste, we faced the challenge of complete object deletion, and moreover, of deleting ''files'' composed of several different objects. This important problem is not solved by merely deleting meta-data, as there are scenarios in which all file contents must be deleted, e.g., due to a court order. Complete file deletion in a realistic peer-to-peer storage system has not been previously dealt with due to the intricacy of the problem--the system may experience high churn rates, nodes may crash or have intermittent connectivity, and the overlay network may become partitioned at times. We present an algorithm that eventually deletes all file contents, data and meta-data, in the aforementioned complex scenarios. The algorithm is fully functional and has been successfully integrated into Celeste},
www_section = {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_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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_3,
@@ -2747,14 +2793,14 @@ Our de-anonymization algorithm is based purely on the network topology, does not
Unlike prior privacy work concerned with cryptographically securing the computation of recommendations, differential privacy constrains a computation in a way that precludes any inference about the underlying records from its output. Such algorithms necessarily introduce uncertainty--i.e., noise--to computations, trading accuracy for privacy.
-We find that several of the leading approaches in the Netflix Prize competition can be adapted to provide differential privacy, without significantly degrading their accuracy. To adapt these algorithms, we explicitly factor them into two parts, an aggregation/learning phase that can be performed with differential privacy guarantees, and an individual recommendation phase that uses the learned correlations and an individual{\textquoteright}s data to provide personalized recommendations. The adaptations are non-trivial, and involve both careful analysis of the per-record sensitivity of the algorithms to calibrate noise, as well as new post-processing steps to mitigate the impact of this noise.
+We find that several of the leading approaches in the Netflix Prize competition can be adapted to provide differential privacy, without significantly degrading their accuracy. To adapt these algorithms, we explicitly factor them into two parts, an aggregation/learning phase that can be performed with differential privacy guarantees, and an individual recommendation phase that uses the learned correlations and an individual's data to provide personalized recommendations. The adaptations are non-trivial, and involve both careful analysis of the per-record sensitivity of the algorithms to calibrate noise, as well as new post-processing steps to mitigate the impact of this noise.
We measure the empirical trade-off between accuracy and privacy in these adaptations, and find that we can provide non-trivial formal privacy guarantees while still outperforming the Cinematch baseline Netflix provides},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PrivateRecommender2009McSherry.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PrivateRecommender2009McSherry.pdf},
author = {McSherry, Frank and Mironov, Ilya}
}
@conference {2009_4,
@@ -2764,7 +2810,7 @@ We measure the empirical trade-off between accuracy and privacy in these adaptat
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},
www_section = {multicast},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/nice-wli.pdf},
author = {H{\"u}bsch, Christian and Oliver Waldhorst}
}
@mastersthesis {2009_5,
@@ -2780,7 +2826,7 @@ We measure the empirical trade-off between accuracy and privacy in these adaptat
}
@conference {Cholez:2009:ESA:1574663.1574671,
title = {Evaluation of Sybil Attacks Protection Schemes in KAD},
- booktitle = {AIMS{\textquoteright}09--Proceedings of the 3rd International Conference on Autonomous Infrastructure, Management and Security: Scalability of Networks and Services},
+ booktitle = {AIMS'09--Proceedings of the 3rd International Conference on Autonomous Infrastructure, Management and Security: Scalability of Networks and Services},
series = {Lecture Notes in Computer Science},
volume = {5637},
year = {2009},
@@ -2794,7 +2840,7 @@ We measure the empirical trade-off between accuracy and privacy in these adaptat
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/AIMS\%2709\%20-\%20Sybil\%20attacks\%20protection\%20schemes\%20in\%20KAD.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/AIMS\%2709\%20-\%20Sybil\%20attacks\%20protection\%20schemes\%20in\%20KAD.pdf},
author = {Cholez, Thibault and Chrisment, Isabelle and Festor, Olivier}
}
@book {Bogetoft:2009:SMC:1601990.1602018,
@@ -2814,7 +2860,7 @@ We measure the empirical trade-off between accuracy and privacy in these adaptat
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Bogetoft\%20et\%20al.\%20-\%20Secure\%20multiparty\%20computation\%20goes\%20live.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@@ -2825,17 +2871,17 @@ We measure the empirical trade-off between accuracy and privacy in these adaptat
month = {November},
publisher = {ACM},
organization = {ACM},
- abstract = {We examine peer-to-peer anonymous communication systems that use Distributed Hash Table algorithms for relay selection. We show that common design flaws in these schemes lead to highly effective attacks against the anonymity provided by the schemes. These attacks stem from attacks on DHT routing, and are not mitigated by the well-known DHT security mechanisms due to a fundamental mismatch between the security requirements of DHT routing{\textquoteright}s put/get functionality and anonymous routing{\textquoteright}s relay selection functionality. Our attacks essentially allow an adversary that controls only a small fraction of the relays to function as a global active adversary. We apply these attacks in more detail to two schemes: Salsa and Cashmere. In the case of Salsa, we show that an attacker that controls 10\% of the relays in a network of size 10,000 can compromise more than 80\% of all completed circuits; and in the case of Cashmere, we show that an attacker that controls 20\% of the relays in a network of size 64000 can compromise 42\% of the circuits},
+ abstract = {We examine peer-to-peer anonymous communication systems that use Distributed Hash Table algorithms for relay selection. We show that common design flaws in these schemes lead to highly effective attacks against the anonymity provided by the schemes. These attacks stem from attacks on DHT routing, and are not mitigated by the well-known DHT security mechanisms due to a fundamental mismatch between the security requirements of DHT routing's put/get functionality and anonymous routing's relay selection functionality. Our attacks essentially allow an adversary that controls only a small fraction of the relays to function as a global active adversary. We apply these attacks in more detail to two schemes: Salsa and Cashmere. In the case of Salsa, we show that an attacker that controls 10\% of the relays in a network of size 10,000 can compromise more than 80\% of all completed circuits; and in the case of Cashmere, we show that an attacker that controls 20\% of the relays in a network of size 64000 can compromise 42\% of the circuits},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/wpes09-dht-attack.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/wpes09-dht-attack.pdf},
author = {Andrew Tran and Nicholas J. Hopper and Yongdae Kim}
}
@conference {1656984,
title = {Heterogeneous gossip},
- booktitle = {Middleware {\textquoteright}09: Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware},
+ booktitle = {Middleware '09: Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware},
year = {2009},
pages = {1--20},
publisher = {Springer-Verlag New York, Inc},
@@ -2846,7 +2892,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},
www_section = {heterogeneity, load balancing},
url = {http://portal.acm.org/citation.cfm?id=1656984$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/middleware-monod.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@article {EURECOM+2885,
@@ -2859,19 +2905,19 @@ This paper presents HEAP, HEterogeneity-Aware gossip Protocol, where nodes dynam
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 eDonkey, a peer-to-peer file sharing system with several million simultaneous users. We have been crawling a representative subset of KAD every five minutes for six months and obtained information about geographical distribution of peers, session times, daily usage, and peer lifetime. We have found that session times are Weibull distributed and we show how this information can be exploited to make the publishing mechanism much more efficient. Peers are identified by the so-called KAD ID, which up to now was assumed to be persistent. However, we observed that a fraction of peers changes their KAD ID as frequently as once a session. This change of KAD IDs makes it difficult to characterize end-user behavior. For this reason we have been crawling the entire KAD network once a day for more than a year to track end-users with static IP addresses, which allows us to estimate end-user lifetime and the fraction of end-users changing their KAD ID},
www_section = {churn, distributed hash table, KAD, Kademlia},
issn = {1063-6692},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Long\%20Term\%20Study\%20of\%20Peer\%20Behavior\%20in\%20the\%20kad\%20DHT.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Long\%20Term\%20Study\%20of\%20Peer\%20Behavior\%20in\%20the\%20kad\%20DHT.pdf},
url = {https://bibliography.gnunet.org},
author = {Steiner, Moritz and En-Najjary, Taoufik and E W Biersack}
}
@conference {1551621,
title = {Maintaining reference graphs of globally accessible objects in fully decentralized distributed systems},
- booktitle = {HPDC {\textquoteright}09: Proceedings of the 18th ACM international symposium on High performance distributed computing},
+ booktitle = {HPDC '09: Proceedings of the 18th ACM international symposium on High performance distributed computing},
year = {2009},
pages = {59--60},
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
- abstract = {Since the advent of electronic computing, the processors{\textquoteright} clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of processing cores per machine started to rise. In near future, these cores will become more specialized, and their inter-connections will form complex networks, both on-chip and beyond. This trend opens new fields of applications for high performance computing: Heterogeneous architectures offer different functionalities and thus support a wider range of applications. The increased compute power of these systems allows more complex simulations and numerical computations. Falling costs enable even small companies to invest in multi-core systems and clusters. However, the growing complexity might impede this growth. Imagine a cluster of thousands of interconnected heterogeneous processor cores. A software developer will need a deep knowledge about the underlying infrastructure as well as the data and communication dependencies in her application to partition it optimally across the available cores. Moreover, a predetermined partitioning scheme cannot reflect failing processors or additionally provided resources. In our poster, we introduce J-Cell, a project that aims at simplifying high performance distributed computing. J-Cell offers a single system image, which allows applications to run transparently on heterogeneous multi-core machines. It distributes code, objects and threads onto the compute resources which may be added or removed at run-time. This dynamic property leads to an ad-hoc network of processors and cores. In this network, a fully decentralized object localization and retrieval algorithm guarantees the access to distributed shared objects},
+ abstract = {Since the advent of electronic computing, the processors' clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of processing cores per machine started to rise. In near future, these cores will become more specialized, and their inter-connections will form complex networks, both on-chip and beyond. This trend opens new fields of applications for high performance computing: Heterogeneous architectures offer different functionalities and thus support a wider range of applications. The increased compute power of these systems allows more complex simulations and numerical computations. Falling costs enable even small companies to invest in multi-core systems and clusters. However, the growing complexity might impede this growth. Imagine a cluster of thousands of interconnected heterogeneous processor cores. A software developer will need a deep knowledge about the underlying infrastructure as well as the data and communication dependencies in her application to partition it optimally across the available cores. Moreover, a predetermined partitioning scheme cannot reflect failing processors or additionally provided resources. In our poster, we introduce J-Cell, a project that aims at simplifying high performance distributed computing. J-Cell offers a single system image, which allows applications to run transparently on heterogeneous multi-core machines. It distributes code, objects and threads onto the compute resources which may be added or removed at run-time. This dynamic property leads to an ad-hoc network of processors and cores. In this network, a fully decentralized object localization and retrieval algorithm guarantees the access to distributed shared objects},
www_section = {globally accessible objects, single system image},
isbn = {978-1-60558-587-1},
doi = {10.1145/1551609.1551621},
@@ -2880,7 +2926,7 @@ This paper presents HEAP, HEterogeneity-Aware gossip Protocol, where nodes dynam
}
@conference { moscibroda:on,
title = {On Mechanism Design without Payments for Throughput Maximization},
- booktitle = {INFOCOM{\textquoteright}09. Proceedings of the 28th IEEE International Conference on Computer Communications},
+ booktitle = {INFOCOM'09. Proceedings of the 28th IEEE International Conference on Computer Communications},
year = {2009},
month = apr,
pages = {972--980},
@@ -2891,7 +2937,7 @@ This paper presents HEAP, HEterogeneity-Aware gossip Protocol, where nodes dynam
www_section = {distributed systems, game-theoretic, individual performance, mechanism design, payment, throughtput maximization},
isbn = {978-1-4244-3512-8 },
doi = {http://dx.doi.org/10.1109/INFCOM.2009.5062008},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/INFOCOMM\%2709\%20-\%20Mechanism\%20design\%20without\%20payments.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/INFOCOMM\%2709\%20-\%20Mechanism\%20design\%20without\%20payments.pdf},
author = {Thomas Moscibroda and Stefan Schmid}
}
@conference {DBLP:conf/ccs/VassermanJTHK09,
@@ -2905,7 +2951,7 @@ This paper presents HEAP, HEterogeneity-Aware gossip Protocol, where nodes dynam
isbn = {978-1-60558-894-0},
doi = {10.1145/1653662.1653709},
url = {http://portal.acm.org/citation.cfm?id=1653662.1653709},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/VassermanJTHK09.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@@ -2927,7 +2973,7 @@ Search gives a slight performance increase over standard Monte-Carlo search.
In addition, the most effective improvements appeared to be the application of
pseudo-random simulations and limiting simulation lengths, while other techniques have been shown to be less effective or even ineffective. Overall, when applying the best performing techniques, an AI with advanced playing strength has been created, such that further research is likely to push this performance to a strength of expert level},
www_section = {artificial intelligence, MCTS, modern board game, Monte-Carlo Tree Search, search techniques},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Thesis\%20-\%20F.Schadd.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Thesis\%20-\%20F.Schadd.pdf},
url = {https://bibliography.gnunet.org},
author = {Frederik Christiaan Schadd}
}
@@ -2945,7 +2991,7 @@ pseudo-random simulations and limiting simulation lengths, while other technique
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/MultiParty2009Narayanan.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@@ -2954,12 +3000,12 @@ pseudo-random simulations and limiting simulation lengths, while other technique
journal = {IEEE Transactions on Dependable and Secure Computing (TDSC)},
year = {2009},
month = {September},
- abstract = {Anonymizing networks such as Tor allow users to access Internet services privately by using a series of routers to hide the client{\textquoteright}s IP address from the server. The success of such networks, however, has been limited by users employing this anonymity for abusive purposes such as defacing popular websites. Website administrators routinely rely on IP-address blocking for disabling access to misbehaving users, but blocking IP addresses is not practical if the abuser routes through an anonymizing network. As a result, administrators block {\em all} known exit nodes of anonymizing networks, denying anonymous access to honest and dishonest users alike. To address this problem, we present Nymble, a system in which \emph{servers can blacklist misbehaving users without compromising their anonymity}. Our system is thus agnostic to different servers{\textquoteright} definitions of misbehavior {\textemdash} servers can block users for whatever reason, and the privacy of blacklisted users is maintained},
+ abstract = {Anonymizing networks such as Tor allow users to access Internet services privately by using a series of routers to hide the client's IP address from the server. The success of such networks, however, has been limited by users employing this anonymity for abusive purposes such as defacing popular websites. Website administrators routinely rely on IP-address blocking for disabling access to misbehaving users, but blocking IP addresses is not practical if the abuser routes through an anonymizing network. As a result, administrators block {\em all} known exit nodes of anonymizing networks, denying anonymous access to honest and dishonest users alike. To address this problem, we present Nymble, a system in which \emph{servers can blacklist misbehaving users without compromising their anonymity}. Our system is thus agnostic to different servers' definitions of misbehavior {\textemdash} servers can block users for whatever reason, and the privacy of blacklisted users is maintained},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/nymble-tdsc.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/nymble-tdsc.pdf},
author = {Patrick P. Tsang and Apu Kapadia and Cory Cornelius and Sean Smith}
}
@book {2009_8,
@@ -2971,12 +3017,12 @@ pseudo-random simulations and limiting simulation lengths, while other technique
pages = {1--18},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
- abstract = {We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common unbiased random bit, guaranteeing that even if one of the parties is malicious, it cannot significantly bias the output of the honest party. A classical result by Cleve [STOC {\textquoteright}86] showed that for any two-party r-round coin-flipping protocol there exists an efficient adversary that can bias the output of the honest party by Ω(1/r). However, the best previously known protocol only guarantees O(1/√r) bias, and the question of whether Cleve{\textquoteright}s bound is tight has remained open for more than twenty years.
-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)},
+ abstract = {We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common unbiased random bit, guaranteeing that even if one of the parties is malicious, it cannot significantly bias the output of the honest party. A classical result by Cleve [STOC '86] showed that for any two-party r-round coin-flipping protocol there exists an efficient adversary that can bias the output of the honest party by Ω(1/r). However, the best previously known protocol only guarantees O(1/√r) bias, and the question of whether Cleve's bound is tight has remained open for more than twenty years.
+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'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/OptimallyFairCoinToss2009Moran.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/OptimallyFairCoinToss2009Moran.pdf},
author = {Moran, Tal and Naor, Moni and Segev, Gil},
editor = {Reingold, Omer}
}
@@ -2988,7 +3034,7 @@ In this paper we establish the optimal trade-off between the round complexity an
www_section = {distributed systems, P2P},
author = {unknown},
url = {http://www.net.in.tum.de/de/mitarbeiter/holz/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/unisono_kuvs-ngn.pdf}
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/unisono_kuvs-ngn.pdf}
}
@conference {2009_10,
title = {Peer Profiling and Selection in the I2P Anonymous Network},
@@ -2997,13 +3043,13 @@ In this paper we establish the optimal trade-off between the round complexity an
month = mar,
address = {TU Dresden, Germany },
www_section = {I2P},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/I2P-PET-CON-2009.1.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/I2P-PET-CON-2009.1.pdf},
url = {https://bibliography.gnunet.org},
author = {Lars Schimmer}
}
@conference {p2p09-peersim,
title = {PeerSim: A Scalable P2P Simulator},
- booktitle = {P2P{\textquoteright}09--Proceedings of the 9th International Conference on Peer-to-Peer},
+ booktitle = {P2P'09--Proceedings of the 9th International Conference on Peer-to-Peer},
year = {2009},
month = sep,
pages = {99--100},
@@ -3013,34 +3059,34 @@ In this paper we establish the optimal trade-off between the round complexity an
isbn = {978-1-4244-5066-4 },
doi = {http://dx.doi.org/10.1109/P2P.2009.5284506},
url = {http://peersim.sourceforge.net/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/P2P\%2709\%20-\%20PeerSim.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/P2P\%2709\%20-\%20PeerSim.pdf},
author = {Alberto Montresor and M{\'a}rk Jelasity and Gian Paolo Jesi and Spyros Voulgaris}
}
@conference {Plank:2009:PEE:1525908.1525927,
title = {A performance evaluation and examination of open-source erasure coding libraries for storage},
- booktitle = {FAST{\textquoteright}09--Proccedings of the 7th Conference on File and Storage Technologies},
+ booktitle = {FAST'09--Proccedings of the 7th Conference on File and Storage Technologies},
year = {2009},
month = feb,
pages = {253--265},
publisher = {USENIX Association},
organization = {USENIX Association},
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},
+ 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'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},
www_section = {erasure coding, libraries, open-source, storage},
url = {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}
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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'Hearn, Zooko}
}
@conference {5328076,
title = {Performance Evaluation of On-Demand Multipath Distance Vector Routing Protocol under Different Traffic Models},
- booktitle = {International Conference on Advances in Recent Technologies in Communication and Computing, 2009. ARTCom {\textquoteright}09},
+ booktitle = {International Conference on Advances in Recent Technologies in Communication and Computing, 2009. ARTCom '09},
year = {2009},
month = oct,
pages = {77--80},
abstract = {Traffic models are the heart of any performance evaluation of telecommunication networks. Understanding the nature of traffic in high speed, high bandwidth communication system is essential for effective operation and performance evaluation of the networks. Many routing protocols reported in the literature for Mobile ad hoc networks(MANETS) have been primarily designed and analyzed under the assumption of CBR traffic models, which is unable to capture the statistical characteristics of the actual traffic. It is necessary to evaluate the performance properties of MANETs in the context of more realistic traffic models. In an effort towards this end, this paper evaluates the performance of adhoc on demand multipath distance vector (AOMDV) routing protocol in the presence of poisson and bursty self similar traffic and compares them with that of CBR traffic. Different metrics are considered in analyzing the performance of routing protocol including packet delivery ratio, throughput and end to end delay. Our simulation results indicate that the packet delivery fraction and throughput in AOMDV is increased in the presence of self similar traffic compared to other traffic. Moreover, it is observed that the end to end delay in the presence of self similar traffic is lesser than that of CBR and higher than that of poisson traffic},
www_section = {ad-hoc networks, AOMDV, distance vector, multi-path, performance},
doi = {10.1109/ARTCom.2009.31},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/multipath-dv-perf.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/multipath-dv-perf.pdf},
author = {Malarkodi, B. and Rakesh, P. and Venkataramani, B.}
}
@conference { evans2009tor,
@@ -3050,21 +3096,21 @@ In this paper we establish the optimal trade-off between the round complexity an
pages = {33--50},
publisher = {USENIX},
organization = {USENIX},
- abstract = {In 2005, Murdoch and Danezis demonstrated the first practical congestion attack against a deployed anonymity network. They could identify which relays were on a target Tor user{\textquoteright}s path by building paths one at a time through every Tor relay and introducing congestion. However, the original attack was performed on only 13 Tor relays on the nascent and lightly loaded Tor network.
+ abstract = {In 2005, Murdoch and Danezis demonstrated the first practical congestion attack against a deployed anonymity network. They could identify which relays were on a target Tor user's path by building paths one at a time through every Tor relay and introducing congestion. However, the original attack was performed on only 13 Tor relays on the nascent and lightly loaded Tor network.
-We show that the attack from their paper is no longer practical on today{\textquoteright}s 1500-relay heavily loaded Tor network. The attack doesn{\textquoteright}t scale because a) the attacker needs a tremendous amount of bandwidth to measure enough relays during the attack window, and b) there are too many
+We show that the attack from their paper is no longer practical on today's 1500-relay heavily loaded Tor network. The attack doesn't scale because a) the attacker needs a tremendous amount of bandwidth to measure enough relays during the attack window, and b) there are too many
false positives now that many other users are adding congestion at the same time as the attacks.
-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},
+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's deployed Tor network. By coming up with a model to better understand Tor's routing behavior under congestion, we further provide a statistical analysis characterizing how effective our attack is in each case},
www_section = {anonymity, attack, denial-of-service, installation, Tor},
url = {http://grothoff.org/christian/tor.pdf},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tor.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/tor.pdf},
author = {Nathan S Evans and Roger Dingledine and Christian Grothoff}
}
@conference {Duminuco:2009:PSR:1584339.1584602,
title = {A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems},
- booktitle = {ICDCS{\textquoteright}09--Proceedings of the 29th IEEE International Conference on Distributed Computing Systems},
- series = {ICDCS {\textquoteright}09},
+ booktitle = {ICDCS'09--Proceedings of the 29th IEEE International Conference on Distributed Computing Systems},
+ series = {ICDCS '09},
year = {2009},
month = jun,
pages = {376--384},
@@ -3076,7 +3122,7 @@ We then strengthen the original congestion attack by combining it with a novel b
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ICDCS\%2709\%20-\%20Regenerating\%20codes\%20for\%20p2p\%20backup\%20systems.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ICDCS\%2709\%20-\%20Regenerating\%20codes\%20for\%20p2p\%20backup\%20systems.pdf},
author = {Alessandro Duminuco and E W Biersack}
}
@conference {2009_11,
@@ -3086,12 +3132,12 @@ We then strengthen the original congestion attack by combining it with a novel b
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
- abstract = {We report on the design and implementation of the Privacy Integrated Queries (PINQ) platform for privacy-preserving data analysis. PINQ provides analysts with a programming interface to unscrubbed data through a SQL-like language. At the same time, the design of PINQ{\textquoteright}s analysis language and its careful implementation provide formal guarantees of differential privacy for any and all uses of the platform. PINQ{\textquoteright}s unconditional structural guarantees require no trust placed in the expertise or diligence of the analysts, substantially broadening the scope for design and deployment of privacy-preserving data analysis, especially by non-experts},
+ abstract = {We report on the design and implementation of the Privacy Integrated Queries (PINQ) platform for privacy-preserving data analysis. PINQ provides analysts with a programming interface to unscrubbed data through a SQL-like language. At the same time, the design of PINQ's analysis language and its careful implementation provide formal guarantees of differential privacy for any and all uses of the platform. PINQ's unconditional structural guarantees require no trust placed in the expertise or diligence of the analysts, substantially broadening the scope for design and deployment of privacy-preserving data analysis, especially by non-experts},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PrivacyIntergratedQueries2009McSherry.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PrivacyIntergratedQueries2009McSherry.pdf},
author = {McSherry, Frank D.}
}
@conference {Tariqetal:2009:ProbLatencyBounds,
@@ -3106,12 +3152,12 @@ We then strengthen the original congestion attack by combining it with a novel b
isbn = {978-3-540-92666-5},
doi = {10.1007/978-3-540-92666-5},
url = {http://www.springerlink.com/content/x36578745jv7wr88/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/QoS_pubsub.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/QoS_pubsub.pdf},
author = {Tariq, Muhammad Adnan and Boris Koldehofe and Gerald G. Koch and Kurt Rothermel}
}
@conference {conf/infocom/WuLR09,
title = {Queuing Network Models for Multi-Channel P2P Live Streaming Systems},
- booktitle = {INFOCOM{\textquoteright}09. Proceedings of the 28th IEEE International Conference on Computer Communications},
+ booktitle = {INFOCOM'09. Proceedings of the 28th IEEE International Conference on Computer Communications},
year = {2009},
month = apr,
pages = {73--81},
@@ -3122,11 +3168,11 @@ We then strengthen the original congestion attack by combining it with a novel b
www_section = {dblp, multi-channel, p2p streaming system},
isbn = {978-1-4244-3512-8 },
doi = {http://dx.doi.org/10.1109/INFCOM.2009.5061908},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/INFOCOM\%2709\%20-\%20Queusing\%20models\%20for\%20p2p\%20streaming\%20systems.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/INFOCOM\%2709\%20-\%20Queusing\%20models\%20for\%20p2p\%20streaming\%20systems.pdf},
author = {Wu, Di and Yong Liu and Keith W. Ross}
}
@conference {wpes09-bridge-attack,
- title = {On the risks of serving whenever you surf: Vulnerabilities in Tor{\textquoteright}s blocking resistance design},
+ title = {On the risks of serving whenever you surf: Vulnerabilities in Tor's blocking resistance design},
booktitle = {Proceedings of the Workshop on Privacy in the Electronic Society (WPES 2009)},
year = {2009},
month = {November},
@@ -3137,7 +3183,7 @@ We then strengthen the original congestion attack by combining it with a novel b
isbn = {978-1-60558-783-7},
doi = {10.1145/1655188.1655193},
url = {http://portal.acm.org/citation.cfm?id=1655193},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/wpes09-bridge-attack.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/wpes09-bridge-attack.pdf},
author = {Jon McLachlan and Nicholas J. Hopper}
}
@article {2009_12,
@@ -3151,12 +3197,12 @@ We then strengthen the original congestion attack by combining it with a novel b
issn = {0304-3975},
doi = {10.1016/j.tcs.2008.10.003},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/OPODIS-116b.pdf},
author = {Awerbuch, Baruch and Scheideler, Christian}
}
@conference {1658999,
title = {Scalable landmark flooding: a scalable routing protocol for WSNs},
- booktitle = {Co-Next Student Workshop {\textquoteright}09: Proceedings of the 5th international student workshop on Emerging networking experiments and technologies},
+ booktitle = {Co-Next Student Workshop '09: Proceedings of the 5th international student workshop on Emerging networking experiments and technologies},
year = {2009},
pages = {1--2},
publisher = {ACM},
@@ -3169,7 +3215,7 @@ In this paper, we propose Scalable Landmark Flooding (SLF), a new routing protoc
isbn = {978-1-60558-751-6},
doi = {10.1145/1658997.1658999},
url = {http://portal.acm.org/citation.cfm?id=1658997.1658999$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/di09slf.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/di09slf.pdf},
author = {Di, Pengfei and Thomas Fuhrmann}
}
@conference {ccs09-torsk,
@@ -3186,7 +3232,7 @@ Unlike previous proposals for P2P anonymity schemes, Torsk does not require all
isbn = {978-1-60558-894-0},
doi = {10.1145/1653662.1653733},
url = {http://portal.acm.org/citation.cfm?id=1653662.1653733},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ccs09-torsk.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ccs09-torsk.pdf},
author = {Jon McLachlan and Andrew Tran and Nicholas J. Hopper and Yongdae Kim}
}
@conference {2009_13,
@@ -3196,7 +3242,7 @@ Unlike previous proposals for P2P anonymity schemes, Torsk does not require all
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/gsn09-security-mayer.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/gsn09-security-mayer.pdf},
author = {Mayer, Christoph P.}
}
@book {2009_14,
@@ -3206,12 +3252,12 @@ Unlike previous proposals for P2P anonymity schemes, Torsk does not require all
volume = {Volume 5918/2009},
year = {2009},
pages = {65--76},
- abstract = {In peer-to-peer storage systems, peers can freely join and leave the system at any time. Ensuring high data availability in such an environment is a challenging task. In this paper we analyze the costs of achieving data availability in fully decentralized peer-to-peer systems. We mainly address the problem of churn and what effect maintaining availability has on network bandwidth. We discuss two different redundancy techniques -- replication and erasure coding -- and consider their monitoring and repairing costs analytically. We calculate the bandwidth costs using basic costs equations and two different Markov reward models. One for centralized monitoring system and the other for distributed monitoring. We show a comparison of the numerical results accordingly. Depending on these results, we determine the best redundancy and maintenance strategy that corresponds to peer{\textquoteright}s failure probability},
+ abstract = {In peer-to-peer storage systems, peers can freely join and leave the system at any time. Ensuring high data availability in such an environment is a challenging task. In this paper we analyze the costs of achieving data availability in fully decentralized peer-to-peer systems. We mainly address the problem of churn and what effect maintaining availability has on network bandwidth. We discuss two different redundancy techniques -- replication and erasure coding -- and consider their monitoring and repairing costs analytically. We calculate the bandwidth costs using basic costs equations and two different Markov reward models. One for centralized monitoring system and the other for distributed monitoring. We show a comparison of the numerical results accordingly. Depending on these results, we determine the best redundancy and maintenance strategy that corresponds to peer's failure probability},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fulltext3.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fulltext3.pdf},
publisher = {unknown},
author = {Yaser Houri and Manfred Jobmann and Thomas Fuhrmann}
}
@@ -3247,7 +3293,7 @@ mous communication},
isbn = {978-1-60558-894-0},
doi = {10.1145/1653662.1653683},
url = {http://doi.acm.org/10.1145/1653662.1653683},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/shadowwalker-ccs09.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/shadowwalker-ccs09.pdf},
author = {Mittal, Prateek and Borisov, Nikita}
}
@article {2009_16,
@@ -3260,7 +3306,7 @@ mous communication},
author = {unknown},
doi = {10.1155/2009/617203},
url = {http://www.hindawi.com/journals/ijdmb/2009/617203.html},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/617203.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/617203.pdf},
editor = {Georg Acher and Detlef Fliegl and Thomas Fuhrmann}
}
@mastersthesis {2009_17,
@@ -3276,9 +3322,9 @@ mous communication},
We will first survey existing algorithms for centralised constraint satisfaction, and describe how they have been modified to handle distributed constraint satisfaction. The method by which each algorithm achieves completeness will be investigated and analysed by application of a new theorem.
We will then present a new algorithm, Support-Based Distributed Search, developed explicitly for distributed constraint satisfaction rather than being derived from centralised algorithms. This algorithm is inspired by the inherent structure of human arguments and similar mechanisms we observe in real-world negotiations.
A number of modifications to this new algorithm are considered, and comparisons are made with existing algorithms, effectively demonstrating its place within the field. Empirical analysis is then conducted, and comparisons are made to state-of-the-art algorithms most able to handle large distributed constraint satisfaction problems.
-Finally, it is argued that any future development in distributed constraint satisfaction will necessitate changes in the algorithms used to solve small {\textquoteleft}embedded{\textquoteright} constraint satisfaction problems. The impact on embedded constraint satisfaction problems is considered, with a brief presentation of an improved algorithm for hypertree decomposition},
+Finally, it is argued that any future development in distributed constraint satisfaction will necessitate changes in the algorithms used to solve small {\textquoteleft}embedded' constraint satisfaction problems. The impact on embedded constraint satisfaction problems is considered, with a brief presentation of an improved algorithm for hypertree decomposition},
www_section = {algorithms, distributed constraint satisfaction},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Thesis\%20-\%20P.Harvey.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Thesis\%20-\%20P.Harvey.pdf},
author = {Peter Harvey}
}
@conference {DBLP:conf/sp/DanezisG09,
@@ -3288,12 +3334,12 @@ Finally, it is argued that any future development in distributed constraint sati
pages = {269--282},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
- abstract = {Sphinx is a cryptographic message format used to relay anonymized messages within a mix network. It is more compact than any comparable scheme, and supports a full set of security features: indistinguishable replies, hiding the path length and relay position, as well as providing unlinkability for each leg of the message{\textquoteright}s journey over the network. We prove the full cryptographic security of Sphinx in the random oracle model, and we describe how it can be used as an efficient drop-in replacement in deployed remailer systems},
+ abstract = {Sphinx is a cryptographic message format used to relay anonymized messages within a mix network. It is more compact than any comparable scheme, and supports a full set of security features: indistinguishable replies, hiding the path length and relay position, as well as providing unlinkability for each leg of the message's journey over the network. We prove the full cryptographic security of Sphinx in the random oracle model, and we describe how it can be used as an efficient drop-in replacement in deployed remailer systems},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DanezisG09.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/DanezisG09.pdf},
author = {George Danezis and Ian Goldberg}
}
@conference {2009_18,
@@ -3303,7 +3349,7 @@ Finally, it is argued that any future development in distributed constraint sati
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},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/RI070302.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/RI070302.pdf},
author = {Jorge Alfonso Briones-Garc{\i}a and Boris Koldehofe and Kurt Rothermel}
}
@booklet {2009_19,
@@ -3314,7 +3360,7 @@ Finally, it is argued that any future development in distributed constraint sati
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/TM-2009-3.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/TM-2009-3.pdf},
author = {Ralph Holz and Mayer, Christoph P. and Sebastian Mies and Heiko Niedermayer and Tariq, Muhammad Adnan}
}
@conference {DBLP:conf/infocom/LandaGCMR09,
@@ -3329,25 +3375,25 @@ Finally, it is argued that any future development in distributed constraint sati
abstract = {Although direct reciprocity (Tit-for-Tat) contribution systems have been successful in reducing free-loading in peer-to-peer overlays, it has been shown that, unless the contribution network is dense, they tend to be slow (or may even fail) to converge [1]. On the other hand, current indirect reciprocity mechanisms based on reputation systems tend to be susceptible to sybil attacks, peer slander and whitewashing.In this paper we present PledgeRoute, an accounting mechanism for peer contributions that is based on social capital. This mechanism allows peers to contribute resources to one set of peers and use this contribution to obtain services from a different set of peers, at a different time. PledgeRoute is completely decentralised, can be implemented in both structured and unstructured peer-to-peer systems, and it is resistant to the three kinds of attacks mentioned above.To achieve this, we model contribution transitivity as a routing problem in the contribution network of the peer-to-peer overlay, and we present arguments for the routing behaviour and the sybilproofness of our contribution transfer procedures on this basis. Additionally, we present mechanisms for the seeding of the contribution network, and a combination of incentive mechanisms and reciprocation policies that motivate peers to adhere to the protocol and maximise their service contributions to the overlay},
www_section = {p2p network, reprocity mechanism, sybilproof},
isbn = {978-1-4244-3512-8},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/INFOCOM\%2709\%20-\%20Sybilproof\%20Indirect\%20Reprocity\%20Mechanism\%20for\%20P2P\%20Networks\%20.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/INFOCOM\%2709\%20-\%20Sybilproof\%20Indirect\%20Reprocity\%20Mechanism\%20for\%20P2P\%20Networks\%20.pdf},
author = {Raul Leonardo Landa Gamiochipi and David Griffin and Richard G. Clegg and Eleni Mykoniati and Miguel Rio}
}
@conference {Resnick:2009:STT:1566374.1566423,
title = {Sybilproof Transitive Trust Protocols},
- booktitle = {EC{\textquoteright}09. Proceedings of the 10th ACM Conference on Electronic commerce},
- series = {EC {\textquoteright}09},
+ booktitle = {EC'09. Proceedings of the 10th ACM Conference on Electronic commerce},
+ series = {EC '09},
year = {2009},
month = jul,
pages = {345--354},
publisher = {ACM},
organization = {ACM},
address = {Stanford, California, USA},
- abstract = {We study protocols to enable one user (the principal) to make potentially profitable but risky interactions with another user (the agent), in the absence of direct trust between the two parties. In such situations, it is possible to enable the interaction indirectly through a chain of credit or "trust" links. We introduce a model that provides insight into many disparate applications, including open currency systems, network trust aggregation systems, and manipulation-resistant recommender systems. Each party maintains a trust account for each other party. When a principal{\textquoteright}s trust balance for an agent is high enough to cover potential losses from a bad interaction, direct trust is sufficient to enable the interaction. Allowing indirect trust opens up more interaction opportunities, but also expands the strategy space of an attacker seeking to exploit the community for its own ends. We show that with indirect trust exchange protocols, some friction is unavoidable: any protocol that satisfies a natural strategic safety property that we call sum-sybilproofness can sometimes lead to a reduction in expected overall trust balances even on interactions that are profitable in expectation. Thus, for long-term growth of trust accounts, which are assets enabling risky but valuable interactions, it may be necessary to limit the use of indirect trust. We present the hedged-transitive protocol and show that it achieves the optimal rate of expected growth in trust accounts, among all protocols satisfying the sum-sybilproofness condition},
+ abstract = {We study protocols to enable one user (the principal) to make potentially profitable but risky interactions with another user (the agent), in the absence of direct trust between the two parties. In such situations, it is possible to enable the interaction indirectly through a chain of credit or "trust" links. We introduce a model that provides insight into many disparate applications, including open currency systems, network trust aggregation systems, and manipulation-resistant recommender systems. Each party maintains a trust account for each other party. When a principal's trust balance for an agent is high enough to cover potential losses from a bad interaction, direct trust is sufficient to enable the interaction. Allowing indirect trust opens up more interaction opportunities, but also expands the strategy space of an attacker seeking to exploit the community for its own ends. We show that with indirect trust exchange protocols, some friction is unavoidable: any protocol that satisfies a natural strategic safety property that we call sum-sybilproofness can sometimes lead to a reduction in expected overall trust balances even on interactions that are profitable in expectation. Thus, for long-term growth of trust accounts, which are assets enabling risky but valuable interactions, it may be necessary to limit the use of indirect trust. We present the hedged-transitive protocol and show that it achieves the optimal rate of expected growth in trust accounts, among all protocols satisfying the sum-sybilproofness condition},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EC\%2709\%20-\%20Sybilproof\%20transitive\%20trust\%20protocols.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/EC\%2709\%20-\%20Sybilproof\%20transitive\%20trust\%20protocols.pdf},
author = {Paul Resnick and Sami, Rahul}
}
@mastersthesis {Douglas-thesis,
@@ -3356,9 +3402,9 @@ Finally, it is argued that any future development in distributed constraint sati
month = mar,
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},
+ 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'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Douglas-thesis.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Douglas-thesis.pdf},
author = {Douglas Kelly}
}
@conference {2009_20,
@@ -3381,26 +3427,26 @@ Finally, it is argued that any future development in distributed constraint sati
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Rio de Janeiro},
- abstract = {In this paper we explore the interaction between content distribution and traffic engineering. Because a traffic engineer may be unaware of the structure of content distribution systems or overlay networks, this management of the network does not fully anticipate how traffic might change as a result of his actions. Content distribution systems that assign servers at the application level can respond very rapidly to changes in the routing of the network. Consequently, the traffic engineer{\textquoteright}s decisions may almost never be applied to the intended traffic. We use a game-theoretic framework in which infinitesimal users of a network select the source of content, and the traffic engineer decides how the traffic will route through the network. We formulate a game and prove the existence of equilibria. Additionally, we present a setting in which equilibria are socially optimal, essentially unique, and stable. Conditions under which efficiency loss may be bounded are presented, and the results are extended to the cases of general overlay networks and multiple autonomous systems},
+ abstract = {In this paper we explore the interaction between content distribution and traffic engineering. Because a traffic engineer may be unaware of the structure of content distribution systems or overlay networks, this management of the network does not fully anticipate how traffic might change as a result of his actions. Content distribution systems that assign servers at the application level can respond very rapidly to changes in the routing of the network. Consequently, the traffic engineer's decisions may almost never be applied to the intended traffic. We use a game-theoretic framework in which infinitesimal users of a network select the source of content, and the traffic engineer decides how the traffic will route through the network. We formulate a game and prove the existence of equilibria. Additionally, we present a setting in which equilibria are socially optimal, essentially unique, and stable. Conditions under which efficiency loss may be bounded are presented, and the results are extended to the cases of general overlay networks and multiple autonomous systems},
www_section = {content distribution, traffic engineering},
isbn = {978-1-4244-3512-8},
doi = {10.1109/INFCOM.2009.5061960},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/INFOCOM\%2709\%20-\%20Traffic\%20Engineering\%20vs.\%20Content\%20Distribution.PDF},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/INFOCOM\%2709\%20-\%20Traffic\%20Engineering\%20vs.\%20Content\%20Distribution.PDF},
author = {Dominic DiPalantino and Ramesh Johari}
}
@conference {morphing09,
title = {Traffic Morphing: An efficient defense against statistical traffic analysis},
- booktitle = {Proceedings of the Network and Distributed Security Symposium--{NDSS} {\textquoteright}09},
+ booktitle = {Proceedings of the Network and Distributed Security Symposium--{NDSS} '09},
year = {2009},
month = feb,
publisher = {IEEE},
organization = {IEEE},
- abstract = {Recent work has shown that properties of network traffic that remain observable after encryption, namely packet sizes and timing, can reveal surprising information about the traffic{\textquoteright}s contents (e.g., the language of a VoIP call [29], passwords in secure shell logins [20], or even web browsing habits [21, 14]). While there are some legitimate uses for encrypted traffic analysis, these techniques also raise important questions about the privacy of encrypted communications. A common tactic for
+ abstract = {Recent work has shown that properties of network traffic that remain observable after encryption, namely packet sizes and timing, can reveal surprising information about the traffic's contents (e.g., the language of a VoIP call [29], passwords in secure shell logins [20], or even web browsing habits [21, 14]). While there are some legitimate uses for encrypted traffic analysis, these techniques also raise important questions about the privacy of encrypted communications. A common tactic for
mitigating such threats is to pad packets to uniform sizes or to send packets at fixed timing intervals; however, this approach is often inefficient. In this paper, we propose a novel method for thwarting statistical traffic analysis
algorithms by optimally morphing one class of traffic to look like another class. Through the use of convex optimization
techniques, we show how to optimally modify packets in real-time to reduce the accuracy of a variety of traffic classifiers while incurring much less overhead than padding. Our evaluation of this technique against two published traffic classifiers for VoIP [29] and web traffic [14] shows that morphing works well on a wide range of network data{\textemdash}in some cases, simultaneously providing better privacy and lower overhead than na{\textasciidieresis}{\i}ve defenses},
www_section = {privacy, traffic analysis, VoIP},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/morphing09.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/morphing09.pdf},
author = {Charles Wright and Scott Coull and Fabian Monrose}
}
@book {2009_22,
@@ -3410,18 +3456,18 @@ techniques, we show how to optimally modify packets in real-time to reduce the a
volume = {Volume 5918/2009},
year = {2009},
pages = {174--184},
- abstract = {Network Coordinates are a basic building block for most peer-to-peer applications nowadays. They optimize the peer selection process by allowing the nodes to preferably attach to peers to whom they then experience a low round trip time. Albeit there has been substantial research effort in this topic over the last years, the optimization of the various network coordinate algorithms has not been pursued systematically yet. Analyzing the well-known Vivaldi algorithm and its proposed optimizations with several sets of extensive Internet traffic traces, we found that in face of current Internet data most of the parameters that have been recommended in the original papers are a magnitude too high. Based on this insight, we recommend modified parameters that improve the algorithms{\textquoteright} performance significantly},
+ abstract = {Network Coordinates are a basic building block for most peer-to-peer applications nowadays. They optimize the peer selection process by allowing the nodes to preferably attach to peers to whom they then experience a low round trip time. Albeit there has been substantial research effort in this topic over the last years, the optimization of the various network coordinate algorithms has not been pursued systematically yet. Analyzing the well-known Vivaldi algorithm and its proposed optimizations with several sets of extensive Internet traffic traces, we found that in face of current Internet data most of the parameters that have been recommended in the original papers are a magnitude too high. Based on this insight, we recommend modified parameters that improve the algorithms' performance significantly},
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fulltext.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fulltext.pdf},
publisher = {unknown},
author = {Benedikt Elser and Andreas F{\"o}rschler and Thomas Fuhrmann}
}
@conference {1582481,
title = {Using link-layer broadcast to improve scalable source routing},
- booktitle = {IWCMC {\textquoteright}09: Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing},
+ booktitle = {IWCMC '09: Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing},
year = {2009},
month = jan,
pages = {466--471},
@@ -3430,19 +3476,19 @@ techniques, we show how to optimally modify packets in real-time to reduce the a
address = {New York, NY, USA},
abstract = {Scalable source routing (SSR) is a network layer routing protocol that provides services that are similar to those of structured peer-to-peer overlays.
-In this paper, we describe several improvements to the SSR protocol. They aim at providing nodes with more up-to-date routing information: 1. The use of link-layer broadcast enables all neighbors of a node to contribute to the forwarding process. 2. A light-weight and fast selection mechanism avoids packet duplication and optimizes the source route iteratively. 3. Nodes implicitly learn the network{\textquoteright}s topology from overheard broadcast messages.
+In this paper, we describe several improvements to the SSR protocol. They aim at providing nodes with more up-to-date routing information: 1. The use of link-layer broadcast enables all neighbors of a node to contribute to the forwarding process. 2. A light-weight and fast selection mechanism avoids packet duplication and optimizes the source route iteratively. 3. Nodes implicitly learn the network's topology from overheard broadcast messages.
We present simulation results which show the performance gain of the proposed improvements: 1. The delivery ratio in settings with high mobility increases. 2. The required per-node state can be reduced as compared with the original SSR protocol. 3. The route stretch decreases. --- These improvements are achieved without increasing the routing overhead},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/di09broadcastssr.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/di09broadcastssr.pdf},
author = {Di, Pengfei and Thomas Fuhrmann}
}
@conference {ccsw09-fingerprinting,
title = {Website fingerprinting: attacking popular privacy enhancing technologies with the multinomial naive-bayes classifier},
- booktitle = {Proceedings of the 2009 ACM workshop on Cloud computing security (CCSW {\textquoteright}09)},
+ booktitle = {Proceedings of the 2009 ACM workshop on Cloud computing security (CCSW '09)},
year = {2009},
pages = {31--42},
publisher = {ACM},
@@ -3450,17 +3496,17 @@ We present simulation results which show the performance gain of the proposed im
address = {New York, NY, USA},
abstract = {Privacy enhancing technologies like OpenSSL, OpenVPN or Tor establish an encrypted tunnel that enables users to hide content and addresses of requested websites from external observers This protection is endangered by local traffic analysis attacks that allow an external, passive attacker between the PET system and the user to uncover the identity of the requested sites. However, existing proposals for such attacks are not practicable yet.
-We present a novel method that applies common text mining techniques to the normalised frequency distribution of observable IP packet sizes. Our classifier correctly identifies up to 97\% of requests on a sample of 775 sites and over 300,000 real-world traffic dumps recorded over a two-month period. It outperforms previously known methods like Jaccard{\textquoteright}s classifier and Na{\"\i}ve Bayes that neglect packet frequencies altogether or rely on absolute frequency values, respectively. Our method is system-agnostic: it can be used against any PET without alteration. Closed-world results indicate that many popular single-hop and even multi-hop systems like Tor and JonDonym are vulnerable against this general fingerprinting attack. Furthermore, we discuss important real-world issues, namely false alarms and the influence of the browser cache on accuracy},
+We present a novel method that applies common text mining techniques to the normalised frequency distribution of observable IP packet sizes. Our classifier correctly identifies up to 97\% of requests on a sample of 775 sites and over 300,000 real-world traffic dumps recorded over a two-month period. It outperforms previously known methods like Jaccard's classifier and Na{\"\i}ve Bayes that neglect packet frequencies altogether or rely on absolute frequency values, respectively. Our method is system-agnostic: it can be used against any PET without alteration. Closed-world results indicate that many popular single-hop and even multi-hop systems like Tor and JonDonym are vulnerable against this general fingerprinting attack. Furthermore, we discuss important real-world issues, namely false alarms and the influence of the browser cache on accuracy},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ccsw09-fingerprinting.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ccsw09-fingerprinting.pdf},
author = {Dominik Herrmann and Rolf Wendolsky and Hannes Federrath}
}
@conference {1590633,
title = {Wireless Sensor Networks: A Survey},
- booktitle = {WAINA {\textquoteright}09: Proceedings of the 2009 International Conference on Advanced Information Networking and Applications Workshops},
+ booktitle = {WAINA '09: Proceedings of the 2009 International Conference on Advanced Information Networking and Applications Workshops},
year = {2009},
pages = {636--641},
publisher = {IEEE Computer Society},
@@ -3487,7 +3533,7 @@ We present a novel method that applies common text mining techniques to the norm
isbn = {978-3-642-04443-4},
doi = {10.1007/978-3-642-04444-1},
url = {http://www.springerlink.com/content/t6q86u137t4762k8/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DanezisDKT09.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/DanezisDKT09.pdf},
author = {George Danezis and Claudia Diaz and Emilia K{\"a}sper and Carmela Troncoso},
editor = {Michael Backes and Peng Ning}
}
@@ -3505,22 +3551,22 @@ The solutions are efficient, with bandwidth and latency overheads of under 4\% a
isbn = {978-1-60558-783-7 },
doi = {10.1145/1655188.1655195},
url = {http://portal.acm.org/citation.cfm?id=1655188.1655195},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/wpes09-xpay.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/wpes09-xpay.pdf},
author = {Yao Chen and Radu Sion and Bogdan Carbunar}
}
@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},
+ booktitle = {AmI-Blocks'08, European Conference on Ambient Intelligence 2008 manuscript No},
year = {2008},
month = jan,
abstract = {Ambient Intelligence pursues the vision that small networked computers will jointly perform tasks that create the illusion of an intelligent environment. One of the most pressing challenges in this context is the question how one could easily develop software for such highly complex, but resource-scarce systems. In this paper we present a snapshot of our ongoing work towards facilitating oftware development for Am- bient Intelligence systems. In particular, we present the AmbiComp [1] platform. It consists of small, modular hardware, a
exible rmware including a Java Virtual Machine, and an Eclipse-based integrated development environment},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/publ_2008_eickhold-fuhrmann-saballus-ua_ambicomp.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_1,
title = {Analyzing Unreal Tournament 2004 Network Traffic Characteristics},
- booktitle = {CGAT{\textquoteright}08 Singapore, 28th-30th},
+ booktitle = {CGAT'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},
@@ -3528,21 +3574,21 @@ exible rmware including a Java Virtual Machine, and an Eclipse-based integrated
}
@conference {Zivan:2008:ALS:1402821.1402895,
title = {Anytime local search for distributed constraint optimization},
- booktitle = {AAMAS{\textquoteright}08--Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems },
- series = {AAMAS {\textquoteright}08},
+ booktitle = {AAMAS'08--Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems },
+ series = {AAMAS '08},
year = {2008},
month = may,
pages = {1449--1452},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
organization = {International Foundation for Autonomous Agents and Multiagent Systems},
address = {Estoril, Portugal},
- abstract = {Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small problems. Distributed local search algorithms can be used for solving DisCOPs. However, because of the differences between the global evaluation of a system{\textquoteright}s state and the private evaluation of states by agents, agents are unaware of the global best state which is explored by the algorithm. Previous attempts to use local search algorithms for solving DisCOPs reported the state held by the system at the termination of the algorithm, which was not necessarily the best state explored.
+ abstract = {Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small problems. Distributed local search algorithms can be used for solving DisCOPs. However, because of the differences between the global evaluation of a system's state and the private evaluation of states by agents, agents are unaware of the global best state which is explored by the algorithm. Previous attempts to use local search algorithms for solving DisCOPs reported the state held by the system at the termination of the algorithm, which was not necessarily the best state explored.
-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)},
+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'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)},
www_section = {algorithms, BFS-Tree, DCOP, DisCOPs, framework},
isbn = {978-0-9817381-2-3},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/AAAI\%2708\%20-\%20Local\%20search\%20for\%20DCOP.pdf},
author = {Zivan, Roie}
}
@booklet {WongSirer2008ApproximateMatching,
@@ -3554,26 +3600,26 @@ A general framework for implementing distributed local search algorithms for Dis
author = {Bernard Wong, Aleksandrs Slivkins and Emin G{\"u}n Sirer}
}
@conference {Yang:2008:ABD:1403027.1403032,
- title = {Auction, but don{\textquoteright}t block},
- booktitle = {NetEcon{\textquoteright}08. Proceedings of the 3rd International Workshop on Economics of Networked Systems},
- series = {NetEcon {\textquoteright}08},
+ title = {Auction, but don't block},
+ booktitle = {NetEcon'08. Proceedings of the 3rd International Workshop on Economics of Networked Systems},
+ series = {NetEcon '08},
year = {2008},
month = aug,
pages = {19--24},
publisher = {ACM},
organization = {ACM},
address = {Seattle, WA, USA},
- abstract = {This paper argues that ISP{\textquoteright}s recent actions to block certain applications (e.g. BitTorrent) and attempts to differentiate traffic could be a signal of bandwidth scarcity. Bandwidth-intensive applications such as VoD could have driven the traffic demand to the capacity limit of their networks. This paper proposes to let ISPs auction their bandwidth, instead of blocking or degrading applications. A user places a bid in a packet header based on how much he values the communication. When congestion occurs, ISPs allocate bandwidth to those users that value their packets the most, and charge them the Vickrey auction price. We outline a design that addresses the technical challenges to support this auction and analyze its feasibility. Our analysis suggests that the design have reasonable overhead and could be feasible with modern hardware},
+ abstract = {This paper argues that ISP's recent actions to block certain applications (e.g. BitTorrent) and attempts to differentiate traffic could be a signal of bandwidth scarcity. Bandwidth-intensive applications such as VoD could have driven the traffic demand to the capacity limit of their networks. This paper proposes to let ISPs auction their bandwidth, instead of blocking or degrading applications. A user places a bid in a packet header based on how much he values the communication. When congestion occurs, ISPs allocate bandwidth to those users that value their packets the most, and charge them the Vickrey auction price. We outline a design that addresses the technical challenges to support this auction and analyze its feasibility. Our analysis suggests that the design have reasonable overhead and could be feasible with modern hardware},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NetEcon\%2708\%20-\%20Yang\%20-\%20Auction\%2C\%20but\%20don\%27t\%20block.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/NetEcon\%2708\%20-\%20Yang\%20-\%20Auction\%2C\%20but\%20don\%27t\%20block.pdf},
author = {Yang, Xiaowei}
}
@conference {1387603,
title = {BFT protocols under fire},
- booktitle = {NSDI{\textquoteright}08: Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation},
+ booktitle = {NSDI'08: Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation},
year = {2008},
pages = {189--204},
publisher = {USENIX Association},
@@ -3586,7 +3632,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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BFTSim-nsdi08.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/BFTSim-nsdi08.pdf},
author = {Singh, Atul and Das, Tathagata and Maniatis, Petros and Peter Druschel and Roscoe, Timothy}
}
@conference {bauer:alpaca2008,
@@ -3601,11 +3647,11 @@ We use the simulator to compare representative protocols under identical conditi
www_section = {ad-hoc networks, anonymity, P2P, privacy},
doi = {10.1145/1461464.1461465},
url = {http://portal.acm.org/citation.cfm?id=1461465},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/bauer-alpaca2008.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/bauer-alpaca2008.pdf},
author = {Kevin Bauer and Damon McCoy and Dirk Grunwald and Douglas Sicker}
}
@article {Levin:2008:BAA:1402946.1402987,
- title = {BitTorrent is an Auction: Analyzing and Improving BitTorrent{\textquoteright}s Incentives},
+ title = {BitTorrent is an Auction: Analyzing and Improving BitTorrent's Incentives},
journal = {SIGCOMM Computer Communication Review},
volume = {38},
year = {2008},
@@ -3613,12 +3659,12 @@ We use the simulator to compare representative protocols under identical conditi
pages = {243--254},
publisher = {ACM},
address = {New York, NY, USA},
- abstract = {Incentives play a crucial role in BitTorrent, motivating users to upload to others to achieve fast download times for all peers. Though long believed to be robust to strategic manipulation, recent work has empirically shown that BitTorrent does not provide its users incentive to follow the protocol. We propose an auction-based model to study and improve upon BitTorrent{\textquoteright}s incentives. The insight behind our model is that BitTorrent uses, not tit-for-tat as widely believed, but an auction to decide which peers to serve. Our model not only captures known, performance-improving strategies, it shapes our thinking toward new, effective strategies. For example, our analysis demonstrates, counter-intuitively, that BitTorrent peers have incentive to intelligently under-report what pieces of the file they have to their neighbors. We implement and evaluate a modification to BitTorrent in which peers reward one another with proportional shares of bandwidth. Within our game-theoretic model, we prove that a proportional-share client is strategy-proof. With experiments on PlanetLab, a local cluster, and live downloads, we show that a proportional-share unchoker yields faster downloads against BitTorrent and BitTyrant clients, and that under-reporting pieces yields prolonged neighbor interest},
+ abstract = {Incentives play a crucial role in BitTorrent, motivating users to upload to others to achieve fast download times for all peers. Though long believed to be robust to strategic manipulation, recent work has empirically shown that BitTorrent does not provide its users incentive to follow the protocol. We propose an auction-based model to study and improve upon BitTorrent's incentives. The insight behind our model is that BitTorrent uses, not tit-for-tat as widely believed, but an auction to decide which peers to serve. Our model not only captures known, performance-improving strategies, it shapes our thinking toward new, effective strategies. For example, our analysis demonstrates, counter-intuitively, that BitTorrent peers have incentive to intelligently under-report what pieces of the file they have to their neighbors. We implement and evaluate a modification to BitTorrent in which peers reward one another with proportional shares of bandwidth. Within our game-theoretic model, we prove that a proportional-share client is strategy-proof. With experiments on PlanetLab, a local cluster, and live downloads, we show that a proportional-share unchoker yields faster downloads against BitTorrent and BitTyrant clients, and that under-reporting pieces yields prolonged neighbor interest},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%20Comput.\%20Commun.\%20Rev.\%20-\%20BitTorrent\%20is\%20an\%20Auction.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SIGCOMM\%20Comput.\%20Commun.\%20Rev.\%20-\%20BitTorrent\%20is\%20an\%20Auction.pdf},
author = {Levin, Dave and LaCurts, Katrina and Spring, Neil and Bobby Bhattacharjee}
}
@conference { bootstrap2008gauthierdickey,
@@ -3630,10 +3676,10 @@ We use the simulator to compare representative protocols under identical conditi
organization = {IEEE},
address = {Turku, Finland},
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},
+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's private IP addresses},
www_section = {bootstrapping, DNS, installation, P2P},
url = {http://grothoff.org/christian/bootstrap.pdf},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/bootstrap.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/bootstrap.pdf},
author = {Chis GauthierDickey and Christian Grothoff}
}
@conference {shimshock-pet2008,
@@ -3650,7 +3696,7 @@ present experimental results demonstrating that with this approach it is efficie
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/shimshock-pet2008.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/shimshock-pet2008.pdf},
author = {Eric Shimshock and Matt Staats and Nicholas J. Hopper}
}
@conference {danezis-pet2008,
@@ -3667,7 +3713,7 @@ present experimental results demonstrating that with this approach it is efficie
isbn = {978-3-540-70629-8},
doi = {10.1007/978-3-540-70630-4},
url = {http://www.springerlink.com/content/q2r7g81286026576/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/danezis-pet2008.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/danezis-pet2008.pdf},
author = {George Danezis and Paul Syverson},
editor = {Borisov, Nikita and Ian Goldberg}
}
@@ -3685,7 +3731,7 @@ present experimental results demonstrating that with this approach it is efficie
issn = {1063-6692},
doi = {10.1109/TNET.2007.900406},
url = {http://portal.acm.org/citation.cfm?id=1373992$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/stutzbach.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/stutzbach.pdf},
author = {Stutzbach, Daniel and Rejaie, Reza and Sen, Subhabrata}
}
@conference {torspinISC08,
@@ -3702,7 +3748,7 @@ To evaluate our novel attack, we used a real-world anonymizing system, TOR. We s
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/torspinISC08.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/torspinISC08.pdf},
author = {Vasilis Pappas and Elias Athanasopoulos and Sotiris Ioannidis and Evangelos P. Markatos}
}
@conference {MarPi08,
@@ -3719,15 +3765,15 @@ To evaluate our novel attack, we used a real-world anonymizing system, TOR. We s
isbn = {978-0-7695-3095-6},
doi = {10.1109/AINA.2008.117},
url = {http://portal.acm.org/citation.cfm?id=1395079.1395235},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/MarPi08.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/MarPi08.pdf},
author = {Igor Margasinski and Michal Pioro}
}
@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)},
+ booktitle = { Proc. 1st Int.Workshop on Massively Multiuser Virtual Environments (MMVE'08)},
year = {2008},
url = {http://www.spovnet.de/files/publications/MMVEConsistency.pdf/view},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/MMVEConsistency.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/MMVEConsistency.pdf},
author = {Gregor Schiele and Richard S{\"u}selbeck and Arno Wacker and Triebel, Tonio and Christian Becker}
}
@mastersthesis {2008_3,
@@ -3743,7 +3789,7 @@ To evaluate our novel attack, we used a real-world anonymizing system, TOR. We s
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},
author = {unknown},
url = {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}
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Kutzner\%20-\%20The\%20descentralized\%20file\%20system\%20Igor-FS\%20as\%20an\%20application_0.pdf}
}
@article { vrancx:decentralized,
title = {Decentralized Learning in Markov Games},
@@ -3754,7 +3800,7 @@ Often, part of the problem is to access large files in a share way. Until now, t
pages = {976--981},
abstract = {Learning automata (LA) were recently shown to be valuable tools for designing multiagent reinforcement learning algorithms. One of the principal contributions of the LA theory is that a set of decentralized independent LA is able to control a finite Markov chain with unknown transition probabilities and rewards. In this paper, we propose to extend this algorithm to Markov games-a straightforward extension of single-agent Markov decision problems to distributed multiagent decision problems. We show that under the same ergodic assumptions of the original theorem, the extended algorithm will converge to a pure equilibrium point between agent policies},
www_section = {algorithms, descentralized learning, LA, learning automata},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IEEE\%20Transactions\%20on\%20Systems\%20-\%20Descentralized\%20learning.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IEEE\%20Transactions\%20on\%20Systems\%20-\%20Descentralized\%20learning.pdf},
author = {Peter Vrancx and Katja Verbeeck and Ann Now{\'e}}
}
@conference {ccs2008:wang,
@@ -3771,14 +3817,14 @@ Often, part of the problem is to access large files in a share way. Until now, t
isbn = {978-1-59593-810-7},
doi = {10.1145/1455770.1455812},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {Dischinger:2008:DBB:1452520.1452523,
title = {Detecting BitTorrent Blocking},
- booktitle = {IMC{\textquoteright}08. Proceedings of the 8th ACM SIGCOMM conference on Internet measurement},
- series = {IMC {\textquoteright}08},
+ booktitle = {IMC'08. Proceedings of the 8th ACM SIGCOMM conference on Internet measurement},
+ series = {IMC '08},
year = {2008},
month = oct,
pages = {3--8},
@@ -3790,12 +3836,12 @@ Often, part of the problem is to access large files in a share way. Until now, t
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IMC\%2708\%20-\%20Detecting\%20BitTorrent\%20Blocking.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IMC\%2708\%20-\%20Detecting\%20BitTorrent\%20Blocking.pdf},
author = {Dischinger, Marcel and Mislove, Alan and Haeberlen, Andreas and P. Krishna Gummadi}
}
@conference {clog-the-queue,
- title = {Don{\textquoteright}t Clog the Queue: Circuit Clogging and Mitigation in P2P anonymity schemes},
- booktitle = {Proceedings of Financial Cryptography (FC {\textquoteright}08)},
+ title = {Don't Clog the Queue: Circuit Clogging and Mitigation in P2P anonymity schemes},
+ booktitle = {Proceedings of Financial Cryptography (FC '08)},
year = {2008},
month = jan,
publisher = {Springer-Verlag Berlin, Heidelberg},
@@ -3804,12 +3850,12 @@ Often, part of the problem is to access large files in a share way. Until now, t
www_section = {anonymity, P2P, Tor},
doi = {10.1007/978-3-540-85230-8_3},
url = {http://portal.acm.org/citation.cfm?id=1428551},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/clog-the-queue.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/clog-the-queue.pdf},
author = {Jon McLachlan and Nicholas J. Hopper}
}
@article {DBLP:journals/pvldb/Amer-YahiaBLS08,
title = {Efficient network aware search in collaborative tagging sites},
- journal = {PVLDB{\textquoteright}08},
+ journal = {PVLDB'08},
volume = {1},
number = {1},
year = {2008},
@@ -3821,7 +3867,7 @@ Often, part of the problem is to access large files in a share way. Until now, t
@conference {BecchiCrowley2008EfficientRegexEval,
title = {Efficient regular expression evaluation: theory to practice},
booktitle = {Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems},
- series = {ANCS {\textquoteright}08},
+ series = {ANCS '08},
year = {2008},
pages = {50--59},
publisher = {ACM},
@@ -3848,7 +3894,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
issn = {1063-6692},
doi = {10.1109/TNET.2007.897962},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.74.8097.pdf},
author = {Spyropoulos, Thrasyvoulos and Psounis, Konstantinos and Raghavendra, Cauligi S.}
}
@conference {CoNext2008,
@@ -3857,9 +3903,9 @@ To deal with such networks researchers have suggested to use flooding-based rout
year = {2008},
month = {December},
address = {Madrid, Spain},
- abstract = {A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals into an existing overlay, and re-wiring to cope with changing network conditions. Previous work has considered the problem from two perspectives: devising practical heuristics for specific applications designed to work well in real deployments, and providing abstractions for the underlying problem that are analytically tractable, especially via game-theoretic analysis. In this paper, we unify these two thrusts by using insights gleaned from novel, realistic theoretic models in the design of Egoist -- a distributed overlay routing system that we implemented, deployed, and evaluated on PlanetLab. Using extensive measurements of paths between nodes, we demonstrate that Egoist{\textquoteright}s neighbor selection primitives significantly outperform existing heuristics on a variety of performance metrics, including delay, available bandwidth, and node utilization. Moreover, we demonstrate that Egoist is competitive with an optimal, but unscalable full-mesh approach, remains highly effective under significant churn, is robust to cheating, and incurs minimal overhead. Finally, we use a multiplayer peer-to-peer game to demonstrate the value of Egoist to end-user applications},
+ abstract = {A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals into an existing overlay, and re-wiring to cope with changing network conditions. Previous work has considered the problem from two perspectives: devising practical heuristics for specific applications designed to work well in real deployments, and providing abstractions for the underlying problem that are analytically tractable, especially via game-theoretic analysis. In this paper, we unify these two thrusts by using insights gleaned from novel, realistic theoretic models in the design of Egoist -- a distributed overlay routing system that we implemented, deployed, and evaluated on PlanetLab. Using extensive measurements of paths between nodes, we demonstrate that Egoist's neighbor selection primitives significantly outperform existing heuristics on a variety of performance metrics, including delay, available bandwidth, and node utilization. Moreover, we demonstrate that Egoist is competitive with an optimal, but unscalable full-mesh approach, remains highly effective under significant churn, is robust to cheating, and incurs minimal overhead. Finally, we use a multiplayer peer-to-peer game to demonstrate the value of Egoist to end-user applications},
www_section = {EGOIST, game theory, overlay networks, routing, selfish neighbor selection},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CoNEXT2008.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CoNEXT2008.pdf},
author = {Georgios Smaragdakis and Vassilis Lekakis and Nikolaos Laoutaris and Azer Bestavros and Byers, John W. and Mema Roussopoulos}
}
@booklet {LOCEntropy2008,
@@ -3868,29 +3914,29 @@ To deal with such networks researchers have suggested to use flooding-based rout
year = {2008},
month = {October},
publisher = {IACR},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/LOCEntropy2008.pdf},
- author = {Luke O{\textquoteright}Connor}
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/LOCEntropy2008.pdf},
+ author = {Luke O'Connor}
}
@book {2008_4,
- title = {Estimating The Size Of Peer-To-Peer Networks Using Lambert{\textquoteright}s W Function},
+ title = {Estimating The Size Of Peer-To-Peer Networks Using Lambert's W Function},
booktitle = {Grid Computing--Achievements and Prospects},
year = {2008},
pages = {61--72},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
address = {New York, NY, USA},
- abstract = { In this work, we address the problem of locally estimating the size of a Peer-to-Peer (P2P) network using local information. We present a novel approach for estimating the size of a peer-to-peer (P2P) network, fitting the sum of new neighbors discovered at each iteration of a breadth-first search (BFS) with a logarithmic function, and then using Lambert{\textquoteright}s W function to solve a root of a ln(n) + b--n = 0, where n is the network size. With rather little computation, we reach an estimation error of at most 10 percent, only allowing the BFS to iterate to the third level},
+ abstract = { In this work, we address the problem of locally estimating the size of a Peer-to-Peer (P2P) network using local information. We present a novel approach for estimating the size of a peer-to-peer (P2P) network, fitting the sum of new neighbors discovered at each iteration of a breadth-first search (BFS) with a logarithmic function, and then using Lambert's W function to solve a root of a ln(n) + b--n = 0, where n is the network size. With rather little computation, we reach an estimation error of at most 10 percent, only allowing the BFS to iterate to the third level},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Grid\%20Computing\%20-\%20Estimating\%20The\%20Size\%20Of\%20Peer-To-Peer\%20Networks.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {Junges:2008:EPD:1402298.1402308,
title = {Evaluating the performance of DCOP algorithms in a real world, dynamic problem},
booktitle = {AAMAS8--Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems},
- series = {AAMAS {\textquoteright}08},
+ series = {AAMAS '08},
year = {2008},
month = may,
pages = {599--606},
@@ -3901,12 +3947,12 @@ To deal with such networks researchers have suggested to use flooding-based rout
www_section = {coordination, DCOP, distributed constraint optimization, traffic control},
isbn = {978-0-9817381-1-6},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/AAMAS08\%20-\%20DCOP\%20algorithms\%20in\%20a\%20real\%20world\%20problem.pdf},
author = {Junges, Robert and Bazzan, Ana L. C.}
}
@conference {DBLP:conf/icc/ChenCLNC08,
title = {Experimental Analysis of Super-Seeding in BitTorrent},
- booktitle = {ICC{\textquoteright}08--Proceedings of the 2008 IEEE International Conference on Communications},
+ booktitle = {ICC'08--Proceedings of the 2008 IEEE International Conference on Communications},
year = {2008},
month = may,
pages = {65--69},
@@ -3917,13 +3963,13 @@ To deal with such networks researchers have suggested to use flooding-based rout
www_section = {BitTorrent, super-seeding},
isbn = {978-1-4244-2075-9},
doi = {http://dx.doi.org/10.1109/ICC.2008.20},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ICC\%2708\%20-\%20Super-Seeding\%20in\%20BitTorrent.PDF},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ICC\%2708\%20-\%20Super-Seeding\%20in\%20BitTorrent.PDF},
author = {Zhijia Chen and Yang Chen and Chuang Lin and Vaibhav Nivargi and Pei Cao}
}
@conference {Ben-David:2008:FSS:1455770.1455804,
title = {FairplayMP: a system for secure multi-party computation},
- booktitle = {CCS{\textquoteright}08--Proceedings of the 15th ACM conference on Computer and communications security},
- series = {CCS {\textquoteright}08},
+ booktitle = {CCS'08--Proceedings of the 15th ACM conference on Computer and communications security},
+ series = {CCS '08},
year = {2008},
month = oct,
pages = {257--266},
@@ -3935,7 +3981,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
isbn = {978-1-59593-810-7},
doi = {10.1145/1455770.1455804},
url = {http://doi.acm.org/10.1145/1455770.1455804},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CCS\%2708\%20-\%20FairplayMP.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CCS\%2708\%20-\%20FairplayMP.pdf},
author = {Ben-David, Assaf and Nisan, Noam and Pinkas, Benny}
}
@article {2008_5,
@@ -3944,12 +3990,12 @@ To deal with such networks researchers have suggested to use flooding-based rout
volume = {108},
year = {2008},
pages = {210--213},
- abstract = {Bloom filters are a randomized data structure for membership queries dating back to 1970. Bloom filters sometimes give erroneous answers to queries, called false positives. Bloom analyzed the probability of such erroneous answers, called the false-positive rate, and Bloom{\textquoteright}s analysis has appeared in many publications throughout the years. We show that Bloom{\textquoteright}s analysis is incorrect and give a correct analysis},
+ abstract = {Bloom filters are a randomized data structure for membership queries dating back to 1970. Bloom filters sometimes give erroneous answers to queries, called false positives. Bloom analyzed the probability of such erroneous answers, called the false-positive rate, and Bloom's analysis has appeared in many publications throughout the years. We show that Bloom's analysis is incorrect and give a correct analysis},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FalsepositiverateBloomFilter2008Bose.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@article {Wang:2008:GAI:1412757.1412971,
@@ -3961,12 +4007,12 @@ To deal with such networks researchers have suggested to use flooding-based rout
pages = {2961--2974},
publisher = {Elsevier North-Holland, Inc},
address = {New York, NY, USA},
- abstract = {Inter-ISP traffic flow determines the settlement between ISPs and affects the perceived performance of ISP services. In today{\textquoteright}s Internet, the inter-ISP traffic flow patterns are controlled not only by ISPs{\textquoteright} policy-based routing configuration and traffic engineering, but also by application layer routing. The goal of this paper is to study the economic implications of this shift in Internet traffic control assuming rational ISPs and subscribers. For this purpose, we build a general traffic model that predicts traffic patterns based on subscriber distribution and abstract traffic controls such as caching functions and performance sensitivity functions. We also build a game-theoretic model of subscribers picking ISPs, and ISPs making provisioning and peering decisions. In particular, we apply this to a local market where two ISPs compete for market share of subscribers under two traffic patterns: {\textquoteright}{\textquoteright}Web{\textquoteright}{\textquoteright} and {\textquoteright}{\textquoteright}P2P overlay{\textquoteright}{\textquoteright}, that typifies the transition the current Internet is going through. Our methodology can be used to quantitatively demonstrate that (1) while economy of scale is the predominant property of the competitive ISP market, P2P traffic may introduce unfair distribution of peering benefit (i.e. free-riding); (2) the large ISP can restore more fairness by reducing its private capacity (bandwidth throttling), which has the drawback of hurting business growth; and (3) ISPs can reduce the level of peering (e.g. by reducing peering bandwidth) to restore more fairness, but this has the side-effect of also reducing the ISPs{\textquoteright} collective bargaining power towards subscribers},
+ abstract = {Inter-ISP traffic flow determines the settlement between ISPs and affects the perceived performance of ISP services. In today's Internet, the inter-ISP traffic flow patterns are controlled not only by ISPs' policy-based routing configuration and traffic engineering, but also by application layer routing. The goal of this paper is to study the economic implications of this shift in Internet traffic control assuming rational ISPs and subscribers. For this purpose, we build a general traffic model that predicts traffic patterns based on subscriber distribution and abstract traffic controls such as caching functions and performance sensitivity functions. We also build a game-theoretic model of subscribers picking ISPs, and ISPs making provisioning and peering decisions. In particular, we apply this to a local market where two ISPs compete for market share of subscribers under two traffic patterns: ''Web'' and ''P2P overlay'', that typifies the transition the current Internet is going through. Our methodology can be used to quantitatively demonstrate that (1) while economy of scale is the predominant property of the competitive ISP market, P2P traffic may introduce unfair distribution of peering benefit (i.e. free-riding); (2) the large ISP can restore more fairness by reducing its private capacity (bandwidth throttling), which has the drawback of hurting business growth; and (3) ISPs can reduce the level of peering (e.g. by reducing peering bandwidth) to restore more fairness, but this has the side-effect of also reducing the ISPs' collective bargaining power towards subscribers},
www_section = {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_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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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.}
}
@conference {saballus08gaos,
@@ -3979,7 +4025,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
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},
www_section = {distributed hash table},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/saballus08gaos.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/saballus08gaos.pdf},
author = {Bjoern Saballus and Johannes Eickhold and Thomas Fuhrmann}
}
@booklet { back-hash,
@@ -3987,7 +4033,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/hashcash.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/hashcash.pdf},
author = {Adam Back}
}
@conference {2008_6,
@@ -3996,7 +4042,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/koch08confidence.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/koch08confidence.pdf},
author = {Gerald G. Koch and Boris Koldehofe and Kurt Rothermel}
}
@conference {sassaman-pet2008,
@@ -4012,14 +4058,14 @@ To deal with such networks researchers have suggested to use flooding-based rout
isbn = {978-3-540-70629-8},
doi = {10.1007/978-3-540-70630-4},
url = {http://www.springerlink.com/content/179453h161722821/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/sassaman-pet2008.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/sassaman-pet2008.pdf},
author = {George Danezis and Len Sassaman},
editor = {Borisov, Nikita and Ian Goldberg}
}
@conference {Boldyreva:2008:IEE:1455770.1455823,
title = {Identity-based encryption with efficient revocation},
- booktitle = {CCS{\textquoteright}08--Proceedings of the 15th ACM Conference on Computer and Communications Security},
- series = {CCS {\textquoteright}08},
+ booktitle = {CCS'08--Proceedings of the 15th ACM Conference on Computer and Communications Security},
+ series = {CCS '08},
year = {2008},
month = oct,
pages = {417--426},
@@ -4031,7 +4077,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CCS\%2708\%20-\%20Identity-based\%20encryption\%20with\%20efficient\%20revocation.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CCS\%2708\%20-\%20Identity-based\%20encryption\%20with\%20efficient\%20revocation.pdf},
author = {Boldyreva, Alexandra and Goyal, Vipul and Kumar, Virendra}
}
@conference {DBLP:conf/p2p/AmannEHF08,
@@ -4043,7 +4089,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
www_section = {distributed storage, P2P},
doi = {10.1109/P2P.2008.19},
url = {http://www.pubzone.org/dblp/conf/p2p/AmannEHF08},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/amann08igorfs.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/amann08igorfs.pdf},
author = {Bernhard Amann and Benedikt Elser and Yaser Houri and Thomas Fuhrmann}
}
@conference {diaz-pet2008,
@@ -4060,7 +4106,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/diaz-pet2008.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/diaz-pet2008.pdf},
author = {Claudia Diaz and Carmela Troncoso and Andrei Serjantov},
editor = {Borisov, Nikita and Ian Goldberg}
}
@@ -4072,10 +4118,10 @@ To deal with such networks researchers have suggested to use flooding-based rout
publisher = {USENIX Association Berkeley, CA, USA},
organization = {USENIX Association Berkeley, CA, USA},
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},
+ 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'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},
www_section = {anonymity, pseudonym, Tor},
url = {http://portal.acm.org/citation.cfm?id=1496726},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/improved-clockskew.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/improved-clockskew.pdf},
author = {Sebastian Zander and Steven J. Murdoch}
}
@mastersthesis {reardon-thesis,
@@ -4089,12 +4135,12 @@ traffic and computational latency to determine there is a substantial component
Tor multiplexes multiple streams of data over a single TCP connection. This is not a wise use of TCP, and as such results in the unfair application of congestion control. We illustrate an example of this occurrence on a Tor node on the live network and also illustrate how packet dropping and reordering cause interference between the multiplexed streams.
Our solution is to use a TCP-over-DTLS (Datagram Transport Layer Security) transport between routers, and give each stream of data its own TCP connection. We give our design for our proposal, and details about its implementation. Finally, we perform experiments on our implemented version to illustrate that our proposal has in fact resolved the multiplexing issues discovered in our system performance analysis. The future work gives a number of steps towards optimizing and improving our work, along with some tangential ideas that were discovered during research.
Additionally, the open-source software projects latency proxy and libspe, which were designed for our purposes but programmed for universal applicability, are discussed},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/reardon-thesis.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/reardon-thesis.pdf},
author = {Reardon, Joel}
}
@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},
+ booktitle = {GI'08. Proceedings of 11th IEEE Global Internet Symposium 2008},
year = {2008},
month = apr,
publisher = {IEEE Computer Society},
@@ -4103,7 +4149,7 @@ Additionally, the open-source software projects latency proxy and libspe, which
abstract = {Despite recent improvements, P2P systems are still plagued by fundamental issues such as overlay/underlay topological and routing mismatch, which affects their performance and causes traffic strains on the ISPs. In this work, we aim to improve overall system performance for ISPs as well as P2P systems by means of traffic localization through improved collaboration between ISPs and P2P systems. More specifically, we study the effects of different ISP/P2P topologies as well as a broad range of influential user behavior characteristics, namely content availability, churn, and query patterns, on end-user and ISP experience. We show that ISP-aided P2P locality benefits both P2P users and ISPs, measured in terms of improved content download times, increased network locality of query responses and desired content, and overall reduction in P2P traffic},
www_section = {isp, P2P},
isbn = {978-1-4244-2219-7 },
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/isp-aidedp2p.PDF},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/isp-aidedp2p.PDF},
author = {Vinay Aggarwal and Obi Akonjang and Feldmann, Anja}
}
@conference {ccs2008:mittal,
@@ -4122,7 +4168,7 @@ We study this trade-off in two P2P anonymous systems, Salsa and AP3. In both cas
isbn = {978-1-59593-810-7},
doi = {10.1145/1455770.1455805},
url = {http://portal.acm.org/citation.cfm?id=1455805},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ccs2008-mittal.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ccs2008-mittal.pdf},
author = {Prateek Mittal and Borisov, Nikita},
editor = {Paul Syverson and Somesh Jha and Xiaolan Zhang}
}
@@ -4140,7 +4186,7 @@ We study this trade-off in two P2P anonymous systems, Salsa and AP3. In both cas
issn = {0920-8542},
doi = {10.1007/s11227-007-0126-4},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Journal\%20of\%20Supercomputing\%20-\%20Insight\%20into\%20redundancy\%20schemes\%20in\%20DHTs.pdf},
author = {Chen, Guihai and Qiu, Tongqing and Wu, Fan}
}
@conference {DBLP:conf/usenix/HiblerRSDGSWL08,
@@ -4149,7 +4195,7 @@ We study this trade-off in two P2P anonymous systems, Salsa and AP3. In both cas
year = {2008},
pages = {113--128},
www_section = {emulab, emulation, testbed, virtualization},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/emulab.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/emulab.pdf},
author = {Mike Hibler and Robert Ricci and Leigh Stoller and Jonathon Duerig and Shashi Guruprasad and Tim Stack and Kirk Webb and Jay Lepreau}
}
@article {nussbaum2008p2plab,
@@ -4164,7 +4210,7 @@ We study this trade-off in two P2P anonymous systems, Salsa and AP3. In both cas
issn = {1532-0634},
doi = {10.1002/cpe.1242},
url = {http://dx.doi.org/10.1002/cpe.1242},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p2plab-cpe.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/p2plab-cpe.pdf},
author = {Nussbaum, Lucas and Richard, Olivier}
}
@article {1390683,
@@ -4179,7 +4225,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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/jmlr08.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/jmlr08.pdf},
author = {Rieck, Konrad and Laskov, Pavel}
}
@article {1358311,
@@ -4211,14 +4257,14 @@ Experiments on data sets from bioinformatics, text processing and computer secur
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/murdoch-pet2008.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/murdoch-pet2008.pdf},
author = {Steven J. Murdoch and Robert N. M. Watson},
editor = {Borisov, Nikita and Ian Goldberg}
}
@conference {pizzonia2008netkit,
title = {Netkit: easy emulation of complex networks on inexpensive hardware},
booktitle = {Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks \& communities},
- series = {TridentCom {\textquoteright}08},
+ series = {TridentCom '08},
year = {2008},
pages = {7:1--7:10},
publisher = {ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)},
@@ -4227,7 +4273,7 @@ Experiments on data sets from bioinformatics, text processing and computer secur
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/a7-pizzonia.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/a7-pizzonia.pdf},
author = {Pizzonia, Maurizio and Rimondini, Massimo}
}
@article {1341892,
@@ -4239,18 +4285,18 @@ Experiments on data sets from bioinformatics, text processing and computer secur
pages = {1--35},
publisher = {ACM},
address = {New York, NY, USA},
- abstract = {Ah hoc networks offer increased coverage by using multihop communication. This architecture makes services more vulnerable to internal attacks coming from compromised nodes that behave arbitrarily to disrupt the network, also referred to as Byzantine attacks. In this work, we examine the impact of several Byzantine attacks performed by individual or colluding attackers. We propose ODSBR, the first on-demand routing protocol for ad hoc wireless networks that provides resilience to Byzantine attacks caused by individual or colluding nodes. The protocol uses an adaptive probing technique that detects a malicious link after log n faults have occurred, where n is the length of the path. Problematic links are avoided by using a route discovery mechanism that relies on a new metric that captures adversarial behavior. Our protocol never partitions the network and bounds the amount of damage caused by attackers. We demonstrate through simulations ODSBR{\textquoteright}s effectiveness in mitigating Byzantine attacks. Our analysis of the impact of these attacks versus the adversary{\textquoteright}s effort gives insights into their relative strengths, their interaction, and their importance when designing multihop wireless routing protocols},
+ abstract = {Ah hoc networks offer increased coverage by using multihop communication. This architecture makes services more vulnerable to internal attacks coming from compromised nodes that behave arbitrarily to disrupt the network, also referred to as Byzantine attacks. In this work, we examine the impact of several Byzantine attacks performed by individual or colluding attackers. We propose ODSBR, the first on-demand routing protocol for ad hoc wireless networks that provides resilience to Byzantine attacks caused by individual or colluding nodes. The protocol uses an adaptive probing technique that detects a malicious link after log n faults have occurred, where n is the length of the path. Problematic links are avoided by using a route discovery mechanism that relies on a new metric that captures adversarial behavior. Our protocol never partitions the network and bounds the amount of damage caused by attackers. We demonstrate through simulations ODSBR's effectiveness in mitigating Byzantine attacks. Our analysis of the impact of these attacks versus the adversary's effort gives insights into their relative strengths, their interaction, and their importance when designing multihop wireless routing protocols},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ODSBR-TISSEC.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ODSBR-TISSEC.pdf},
author = {Awerbuch, Baruch and Curtmola, Reza and Holmer, David and Nita-Rotaru, Cristina and Rubens, Herbert}
}
@conference {Hartline:2008:OMD:1374376.1374390,
title = {Optimal mechanism design and money burning},
- booktitle = {STOC{\textquoteright}08. Proceedings of the 40th annual ACM Symposium on Theory of Computing},
- series = {STOC {\textquoteright}08},
+ booktitle = {STOC'08. Proceedings of the 40th annual ACM Symposium on Theory of Computing},
+ series = {STOC '08},
year = {2008},
month = may,
pages = {75--84},
@@ -4262,7 +4308,7 @@ Experiments on data sets from bioinformatics, text processing and computer secur
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/STOC\%2708\%20-\%20Optimal\%20mechanism\%20design\%20and\%20money\%20burning.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/STOC\%2708\%20-\%20Optimal\%20mechanism\%20design\%20and\%20money\%20burning.pdf},
author = {Jason D. Hartline and Roughgarden, Tim}
}
@article {Xie:2008:PPP:1402946.1402999,
@@ -4279,7 +4325,7 @@ Experiments on data sets from bioinformatics, text processing and computer secur
issn = {0146-4833},
doi = {http://doi.acm.org/10.1145/1402946.1402999},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {raykova-pet2008,
@@ -4292,11 +4338,11 @@ Experiments on data sets from bioinformatics, text processing and computer secur
organization = {Springer},
address = {Leuven, Belgium},
abstract = {Despite the growth of the Internet and the increasing concern for privacy of online communications, current deployments of anonymization networks depend on a very small set of nodes that volunteer their bandwidth. We believe that the main reason is not disbelief in their ability to protect anonymity, but rather the practical limitations in bandwidth and latency that stem from limited participation. This limited participation, in turn, is due to a lack of incentives to participate. We propose providing economic incentives, which historically have worked very well.
-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 -- when adopted individually -- provably fail},
+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' anonymity, although payment techniques mentioned previously -- when adopted individually -- provably fail},
www_section = {anonymity, onion routing, Tor},
doi = {10.1007/978-3-540-70630-4},
url = {http://www.springerlink.com/content/r1h1046823587382/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/raykova-pet2008.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@@ -4313,7 +4359,7 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
isbn = {978-1-59593-810-7},
doi = {10.1145/1455770.1455813},
url = {http://portal.acm.org/citation.cfm?id=1455813},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/perea-ccs08.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@@ -4329,7 +4375,7 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
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 },
www_section = {mix, traffic analysis},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/troncoso-pet2008.pdf},
author = {Carmela Troncoso and Benedikt Gierlichs and Bart Preneel and Ingrid Verbauwhede},
editor = {Borisov, Nikita and Ian Goldberg}
}
@@ -4341,17 +4387,17 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
publisher = {IEEE CS Press},
organization = {IEEE CS Press},
address = {Turku, Finland},
- abstract = {Tor (The Onion Routing) provides a secure mechanism for offering TCP-based services while concealing the hidden server{\textquoteright}s IP address. In general the acceptance of services strongly relies on its QoS properties. For potential Tor users, provided the anonymity is secured, probably the most important QoS parameter is the time until they finally get response by such a hidden service. Internally, overall response times are constituted by several steps invisible for the user. We provide comprehensive measurements of all relevant latencies and a detailed statistical analysis with special focus on the overall response times. Thereby, we gain valuable insights that enable us to give certain statistical assertions and to suggest improvements in the hidden service protocol and its implementation},
+ abstract = {Tor (The Onion Routing) provides a secure mechanism for offering TCP-based services while concealing the hidden server's IP address. In general the acceptance of services strongly relies on its QoS properties. For potential Tor users, provided the anonymity is secured, probably the most important QoS parameter is the time until they finally get response by such a hidden service. Internally, overall response times are constituted by several steps invisible for the user. We provide comprehensive measurements of all relevant latencies and a detailed statistical analysis with special focus on the overall response times. Thereby, we gain valuable insights that enable us to give certain statistical assertions and to suggest improvements in the hidden service protocol and its implementation},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/loesing2008performance.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/loesing2008performance.pdf},
author = {Karsten Loesing and Werner Sandmann and Christian Wilms and Guido Wirtz}
}
@conference {Shafaat:2008:PAN:1485753.1485763,
title = {A Practical Approach to Network Size Estimation for Structured Overlays},
- booktitle = {IWSOS{\textquoteright}08--Proceedings of the 3rd International Workshop on Self-Organizing Systems},
+ booktitle = {IWSOS'08--Proceedings of the 3rd International Workshop on Self-Organizing Systems},
series = {Lecture Notes in Computer Science},
volume = {5343},
year = {2008},
@@ -4365,7 +4411,7 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IWSOS\%2708\%20-\%20Network\%20Size\%20Estimation\%20for\%20Structured\%20Overlays.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IWSOS\%2708\%20-\%20Network\%20Size\%20Estimation\%20for\%20Structured\%20Overlays.pdf},
author = {Shafaat, Tallat M. and Ali Ghodsi and Seif Haridi}
}
@article {2008_8,
@@ -4379,7 +4425,7 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
abstract = {Abstract. In Distributed Constraint Satisfaction Problems, agents often desire to find a solution while revealing as little as possible about their variables and constraints. So far, most algorithms for DisCSP do not guarantee privacy of this information. This paper describes some simple obfuscation techniques that can be used with DisCSP algorithms such as DPOP, and provide sensible privacy guarantees based on the distributed solving process without sacrificing its efficiency},
www_section = {algorithms, DisCSP algorithm, distributed constraint satisfaction, optimization, privacy, SMC},
journal = {unknown},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Tech\%20Report\%20-\%20Privacy\%20guarantees\%20through\%20DCS.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Tech\%20Report\%20-\%20Privacy\%20guarantees\%20through\%20DCS.pdf},
author = {Boi Faltings and Thomas Leaute and Adrian Petcu}
}
@book {springerlink:10.1007/978-0-387-70992-5,
@@ -4401,19 +4447,19 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
abstract = {Monte-Carlo Tree Search (MCTS) is a new best-first search guided by the results of Monte-Carlo simulations. In this article, we introduce two progressive strategies for MCTS, called progressive bias and progressive unpruning. They enable the use of relatively time-expensive heuristic knowledge without speed reduction. Progressive bias directs the search according to heuristic knowledge. Progressive unpruning first reduces the branching factor, and then increases it gradually again. Experiments assess that the two progressive strategies significantly improve the level of our Go program Mango. Moreover, we see that the combination of both strategies performs even better on larger board sizes},
www_section = {computer go, MCTS heuristic search, Monte-Carlo Tree Search},
doi = {10.1142/S1793005708001094},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NMNC\%20-\%20Progressive\%20strategies\%20for\%20MCTS.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/NMNC\%20-\%20Progressive\%20strategies\%20for\%20MCTS.pdf},
author = {Guillaume M. J-B. Chaslot and Mark H. M. Winands and H. Jaap van den Herik and Jos W. H. M. Uiterwijk and Bruno Bouzy}
}
@conference {di08iptps,
title = {Providing KBR Service for Multiple Applications},
- booktitle = {The 7th International Workshop on Peer-to-Peer Systems (IPTPS {\textquoteright}08)},
+ booktitle = {The 7th International Workshop on Peer-to-Peer Systems (IPTPS '08)},
year = {2008},
type = {publication},
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 },
www_section = {distributed hash table, P2P},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/di08iptps.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/di08iptps.pdf},
author = {Di, Pengfei and Kendy Kutzner and Thomas Fuhrmann}
}
@conference {quant-adhoc,
@@ -4429,12 +4475,12 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/quant-adhoc.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/quant-adhoc.pdf},
author = {Marie Elisabeth Gaup Moe}
}
@conference {Goldberg:2008:RTA:1402958.1402989,
title = {Rationality and Traffic Attraction: Incentives for Honest Path Announcements in BGP},
- booktitle = {SIGCOMM{\textquoteright}08. Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication},
+ booktitle = {SIGCOMM'08. Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication},
series = {SIGCOMM Computer Communication Review},
year = {2008},
month = oct,
@@ -4442,12 +4488,12 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
publisher = {ACM},
organization = {ACM},
address = {Seattle, WA},
- abstract = {We study situations in which autonomous systems (ASes) may have incentives to send BGP announcements differing from the AS-level paths that packets traverse in the data plane. Prior work on this issue assumed that ASes seek only to obtain the best possible outgoing path for their traffic. In reality, other factors can influence a rational AS{\textquoteright}s behavior. Here we consider a more natural model, in which an AS is also interested in attracting incoming traffic (e.g., because other ASes pay it to carry their traffic). We ask what combinations of BGP enhancements and restrictions on routing policies can ensure that ASes have no incentive to lie about their data-plane paths. We find that protocols like S-BGP alone are insufficient, but that S-BGP does suffice if coupled with additional (quite unrealistic) restrictions on routing policies. Our game-theoretic analysis illustrates the high cost of ensuring that the ASes honestly announce data-plane paths in their BGP path announcements},
+ abstract = {We study situations in which autonomous systems (ASes) may have incentives to send BGP announcements differing from the AS-level paths that packets traverse in the data plane. Prior work on this issue assumed that ASes seek only to obtain the best possible outgoing path for their traffic. In reality, other factors can influence a rational AS's behavior. Here we consider a more natural model, in which an AS is also interested in attracting incoming traffic (e.g., because other ASes pay it to carry their traffic). We ask what combinations of BGP enhancements and restrictions on routing policies can ensure that ASes have no incentive to lie about their data-plane paths. We find that protocols like S-BGP alone are insufficient, but that S-BGP does suffice if coupled with additional (quite unrealistic) restrictions on routing policies. Our game-theoretic analysis illustrates the high cost of ensuring that the ASes honestly announce data-plane paths in their BGP path announcements},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%2708\%20-\%20Rationality\%20and\%20traffic\%20attraction.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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.}
}
@conference {androulaki-pet2008,
@@ -4464,7 +4510,7 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/getTechreport.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/getTechreport.pdf},
author = {Elli Androulaki and Seung Geol Choi and Steven M. Bellovin and Tal Malkin},
editor = {Borisov, Nikita and Ian Goldberg}
}
@@ -4475,12 +4521,12 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Washington, DC, USA},
- abstract = {We present a new class of statistical deanonymization attacks against high-dimensional micro-data, such as individual preferences, recommendations, transaction records and so on. Our techniques are robust to perturbation in the data and tolerate some mistakes in the adversary{\textquoteright}s background knowledge. We apply our de-anonymization methodology to the Netflix Prize dataset, which contains anonymous movie ratings of 500,000 subscribers of Netflix, the world{\textquoteright}s largest online movie rental service. We demonstrate that an adversary who knows only a little bit about an individual subscriber can easily identify this subscriber{\textquoteright}s record in the dataset. Using the Internet Movie Database as the source of background knowledge, we successfully identified the Netflix records of known users, uncovering their apparent political preferences and other potentially sensitive information},
+ abstract = {We present a new class of statistical deanonymization attacks against high-dimensional micro-data, such as individual preferences, recommendations, transaction records and so on. Our techniques are robust to perturbation in the data and tolerate some mistakes in the adversary's background knowledge. We apply our de-anonymization methodology to the Netflix Prize dataset, which contains anonymous movie ratings of 500,000 subscribers of Netflix, the world's largest online movie rental service. We demonstrate that an adversary who knows only a little bit about an individual subscriber can easily identify this subscriber's record in the dataset. Using the Internet Movie Database as the source of background knowledge, we successfully identified the Netflix records of known users, uncovering their apparent political preferences and other potentially sensitive information},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Deanonymization2008narayanan.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Deanonymization2008narayanan.pdf},
author = {Narayanan, Arvind and Shmatikov, Vitaly}
}
@conference {mccoy-pet2008,
@@ -4499,7 +4545,7 @@ To sample the results, we show that web traffic makes up the majority of the con
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mccoy-pet2008.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@@ -4522,13 +4568,13 @@ To sample the results, we show that web traffic makes up the majority of the con
@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},
+ note = {Vortrag auf dem Fachgespr{\"a}ch der GI/ITG-Fachgruppe {\textquoteleft}{\textquoteleft}Kommunikation und Verteilte Systeme'' Future Internet},
publisher = {NEC, Heidelberg},
author = {Roland Bless and Oliver Waldhorst and Mayer, Christoph P.}
}
@conference {conf/infocom/WangLX08,
title = {Stable Peers: Existence, Importance, and Application in Peer-to-Peer Live Video Streaming},
- booktitle = {INFOCOM{\textquoteright}08. Proceedings of the 27th IEEE International Conference on Computer Communications},
+ booktitle = {INFOCOM'08. Proceedings of the 27th IEEE International Conference on Computer Communications},
year = {2008},
month = apr,
pages = {1364--1372},
@@ -4539,7 +4585,7 @@ To sample the results, we show that web traffic makes up the majority of the con
www_section = {peer-to-peer live video streaming, stable peer},
isbn = {978-1-4244-2025-4 },
doi = {http://dx.doi.org/10.1109/INFOCOM.2008.194},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/INFOCOM\%2708\%20-\%20Stable\%20peers.PDF},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/INFOCOM\%2708\%20-\%20Stable\%20peers.PDF},
author = {Wang, Feng and Liu, Jiangchuan and Xiong, Yongqiang}
}
@booklet {DD08Survey,
@@ -4551,7 +4597,7 @@ To sample the results, we show that web traffic makes up the majority of the con
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},
www_section = {onion routing, robustness},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/DD08Survey.pdf},
author = {George Danezis and Claudia Diaz}
}
@conference {Infocom2008,
@@ -4562,12 +4608,12 @@ To sample the results, we show that web traffic makes up the majority of the con
address = {Phoenix, AZ},
abstract = {In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective data files. BitTorrent-like swarming protocols are ideal choices for handling such massive data volume transfers. The original BitTorrent targets one-to-many broadcasts of a single file to a very large number of receivers and thus, by necessity, employs an almost random overlay topology. n-way broadcast applications on the other hand, owing to their inherent n-squared nature, are realizable only in small to medium scale networks. In this paper, we show that we can leverage this scale constraint to construct optimized overlay topologies that take into consideration the end-to-end characteristics of the network and as a consequence deliver far superior performance compared to random and myopic (local) approaches. We present the Max-Min and Max- Sum peer-selection policies used by individual nodes to select their neighbors. The first one strives to maximize the available bandwidth to the slowest destination, while the second maximizes the aggregate output rate. We design a swarming protocol suitable for n-way broadcast and operate it on top of overlay graphs formed by nodes that employ Max-Min or Max-Sum policies. Using trace-driven simulation and measurements from a PlanetLab prototype implementation, we demonstrate that the performance of swarming on top of our constructed topologies is far superior to the performance of random and myopic overlays. Moreover, we show how to modify our swarming protocol to allow it to accommodate selfish nodes},
www_section = {EGOIST, game theory, routing},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Infocom2008.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Infocom2008.pdf},
author = {Georgios Smaragdakis and Nikolaos Laoutaris and Pietro Michiardi and Azer Bestavros and Byers, John W. and Mema Roussopoulos}
}
@conference {1456474,
title = {Tahoe: the least-authority filesystem},
- booktitle = {StorageSS {\textquoteright}08: Proceedings of the 4th ACM international workshop on Storage security and survivability},
+ booktitle = {StorageSS '08: Proceedings of the 4th ACM international workshop on Storage security and survivability},
year = {2008},
pages = {21--26},
publisher = {ACM},
@@ -4578,8 +4624,8 @@ To sample the results, we show that web traffic makes up the majority of the con
isbn = {978-1-60558-299-3},
doi = {10.1145/1456469.1456474},
url = {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}
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/lafs.pdf},
+ author = {Wilcox-O'Hearn, Zooko and Warner, Brian}
}
@booklet {fuhrmann08comparable,
title = {Towards Comparable Network Simulations},
@@ -4590,7 +4636,7 @@ To sample the results, we show that web traffic makes up the majority of the con
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/towards_comparable_network_simulations.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/towards_comparable_network_simulations.pdf},
author = {Di, Pengfei and Yaser Houri and Kendy Kutzner and Thomas Fuhrmann}
}
@conference {2008_12,
@@ -4598,10 +4644,10 @@ To sample the results, we show that web traffic makes up the majority of the con
booktitle = {Information Security and Assurance, 2008. ISA 2008. International Conference on},
year = {2008},
month = {April},
- abstract = {Privacy is ultimately important, and there is a fair amount of research about it. However, few empirical studies about the cost of privacy are conducted. In the area of secure multiparty computation, the scalar product has long been reckoned as one of the most promising building blocks in place of the classic logic gates. The reason is not only the scalar product complete, which is as good as logic gates, but also the scalar product is much more efficient than logic gates. As a result, we set to study the computation and communication resources needed for some of the most well-known and frequently referred secure scalar-product protocols, including the composite-residuosity, the invertible-matrix, the polynomial-sharing, and the commodity-based approaches. Besides the implementation remarks of these approaches, we analyze and compare their execution time, computation time, and random number consumption, which are the most concerned resources when talking about secure protocols. Moreover, Fairplay the benchmark approach implementing Yao{\textquoteright}s famous circuit evaluation protocol, is included in our experiments in order to demonstrate the potential for the scalar product to replace logic gates},
+ abstract = {Privacy is ultimately important, and there is a fair amount of research about it. However, few empirical studies about the cost of privacy are conducted. In the area of secure multiparty computation, the scalar product has long been reckoned as one of the most promising building blocks in place of the classic logic gates. The reason is not only the scalar product complete, which is as good as logic gates, but also the scalar product is much more efficient than logic gates. As a result, we set to study the computation and communication resources needed for some of the most well-known and frequently referred secure scalar-product protocols, including the composite-residuosity, the invertible-matrix, the polynomial-sharing, and the commodity-based approaches. Besides the implementation remarks of these approaches, we analyze and compare their execution time, computation time, and random number consumption, which are the most concerned resources when talking about secure protocols. Moreover, Fairplay the benchmark approach implementing Yao's famous circuit evaluation protocol, is included in our experiments in order to demonstrate the potential for the scalar product to replace logic gates},
www_section = {circuit evaluation protocol, Circuits, commodity-based, composite residuosity, composite-residuosity, Computational efficiency, Costs, data privacy, empirical survey, Information science, information security, invertible-matrix, logic gates, polynomial-sharing, Polynomials, privacy, Proposals, protocols, scalar-product, secure multiparty computation, secure protocols, Secure scalar product, secure scalar-product protocols},
doi = {10.1109/ISA.2008.78},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EmpiricalAspects2009Wang.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/EmpiricalAspects2009Wang.pdf},
author = {I-Cheng Wang and Chih-Hao Shen and Tsan-sheng Hsu and Churn-Chung Liao and Da-Wei Wang and Zhan, J.}
}
@article {Pouwelse:2008:TSP:1331115.1331119,
@@ -4613,17 +4659,17 @@ To sample the results, we show that web traffic makes up the majority of the con
pages = {127--138},
publisher = {John Wiley and Sons Ltd},
address = {Chichester, UK},
- abstract = {Most current peer-to-peer (P2P) file-sharing systems treat their users as anonymous, unrelated entities, and completely disregard any social relationships between them. However, social phenomena such as friendship and the existence of communities of users with similar tastes or interests may well be exploited in such systems in order to increase their usability and performance. In this paper we present a novel social-based P2P file-sharing paradigm that exploits social phenomena by maintaining social networks and using these in content discovery, content recommendation, and downloading. Based on this paradigm{\textquoteright}s main concepts such as taste buddies and friends, we have designed and implemented the TRIBLER P2P file-sharing system as a set of extensions to BitTorrent. We present and discuss the design of TRIBLER, and we show evidence that TRIBLER enables fast content discovery and recommendation at a low additional overhead, and a significant improvement in download performance. Copyright {\textcopyright} 2007 John Wiley \& Sons, Ltd},
+ abstract = {Most current peer-to-peer (P2P) file-sharing systems treat their users as anonymous, unrelated entities, and completely disregard any social relationships between them. However, social phenomena such as friendship and the existence of communities of users with similar tastes or interests may well be exploited in such systems in order to increase their usability and performance. In this paper we present a novel social-based P2P file-sharing paradigm that exploits social phenomena by maintaining social networks and using these in content discovery, content recommendation, and downloading. Based on this paradigm's main concepts such as taste buddies and friends, we have designed and implemented the TRIBLER P2P file-sharing system as a set of extensions to BitTorrent. We present and discuss the design of TRIBLER, and we show evidence that TRIBLER enables fast content discovery and recommendation at a low additional overhead, and a significant improvement in download performance. Copyright {\textcopyright} 2007 John Wiley \& Sons, Ltd},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Concurrency\%20and\%20Computation\%20-\%20TRIBLER.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {1424615,
title = {Trust-Rated Authentication for Domain-Structured Distributed Systems},
- booktitle = {EuroPKI {\textquoteright}08: Proceedings of the 5th European PKI workshop on Public Key Infrastructure},
+ booktitle = {EuroPKI '08: Proceedings of the 5th European PKI workshop on Public Key Infrastructure},
year = {2008},
pages = {74--88},
publisher = {Springer-Verlag},
@@ -4634,12 +4680,12 @@ To sample the results, we show that web traffic makes up the majority of the con
isbn = {978-3-540-69484-7},
doi = {10.1007/978-3-540-69485-4},
url = {http://www.springerlink.com/content/k6786282r5378k42/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/AuthenticationEuroPKI2008.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/AuthenticationEuroPKI2008.pdf},
author = {Ralph Holz and Heiko Niedermayer and Hauck, Peter and Carle, Georg}
}
@conference {snader08,
title = {A Tune-up for Tor: Improving Security and Performance in the Tor Network},
- booktitle = {Proceedings of the Network and Distributed Security Symposium--NDSS {\textquoteright}08},
+ booktitle = {Proceedings of the Network and Distributed Security Symposium--NDSS '08},
year = {2008},
month = feb,
publisher = {Internet Society},
@@ -4648,7 +4694,7 @@ To sample the results, we show that web traffic makes up the majority of the con
www_section = {anonymity, Tor},
doi = {10.1109/NCM.2009.205},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/snader08.pdf},
author = {Robin Snader and Borisov, Nikita}
}
@conference {2008_13,
@@ -4660,7 +4706,7 @@ To sample the results, we show that web traffic makes up the majority of the con
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},
www_section = {heterogeneity, robustness},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/underlayabs-ngi08-final.pdf},
author = {Roland Bless and H{\"u}bsch, Christian and Sebastian Mies and Oliver Waldhorst}
}
@article {2008_14,
@@ -4677,13 +4723,13 @@ To sample the results, we show that web traffic makes up the majority of the con
volume = {abs/0803.0924},
year = {2008},
abstract = {Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept classes can be learned privately, namely, by an algorithm whose output does not depend too heavily on any one input or specific training example? More precisely, we investigate learning algorithms that satisfy differential privacy, a notion that provides strong confidentiality guarantees in contexts where aggregate information is released about a database containing sensitive information about individuals. We demonstrate that, ignoring computational constraints, it is possible to privately agnostically learn any concept class using a sample size approximately logarithmic in the cardinality of the concept class. Therefore, almost anything learnable is learnable privately: specifically, if a concept class is learnable by a (non-private) algorithm with polynomial sample complexity and output size, then it can be learned privately using a polynomial number of samples. We also present a computationally efficient private PAC learner for the class of parity functions. Local (or randomized response) algorithms are a practical class of private algorithms that have received extensive investigation. We provide a precise characterization of local private learning algorithms. We show that a concept class is learnable by a local algorithm if and only if it is learnable in the statistical query (SQ) model. Finally, we present a separation between the power of interactive and noninteractive local learning algorithms},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WhatCanWeLearnPrivately2008Kasiviswanthan.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/WhatCanWeLearnPrivately2008Kasiviswanthan.pdf},
author = {Shiva Prasad Kasiviswanathan and Homin K. Lee and Kobbi Nissim and Sofya Raskhodnikova and Adam Smith}
}
@conference {Jian:2008:WSP:1409540.1409546,
title = {Why Share in Peer-to-Peer Networks?},
- booktitle = {EC{\textquoteright}08. Proceedings of the 10th International Conference on Electronic Commerce},
- series = {ICEC {\textquoteright}08},
+ booktitle = {EC'08. Proceedings of the 10th International Conference on Electronic Commerce},
+ series = {ICEC '08},
year = {2008},
month = aug,
pages = {4:1--4:8},
@@ -4695,13 +4741,13 @@ To sample the results, we show that web traffic makes up the majority of the con
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EC\%2708\%20-\%20Why\%20share\%20in\%20peer-to-peer\%20networks.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_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},
+ series = {SASO '07},
year = {2007},
month = jul,
pages = {119--128},
@@ -4713,13 +4759,13 @@ To sample the results, we show that web traffic makes up the majority of the con
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SASO\%2707\%20-\%20Garbacki\%2C\%20Epema\%20\%26\%20van\%20Steen.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SASO\%2707\%20-\%20Garbacki\%2C\%20Epema\%20\%26\%20van\%20Steen.pdf},
author = {Garbacki, Pawel and Epema, Dick H. J. and van Steen, Maarten}
}
@conference {Garbacki:2007:ATP:1270401.1271766,
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},
+ series = {SASO '07},
year = {2007},
month = jul,
pages = {119--128},
@@ -4730,7 +4776,7 @@ To sample the results, we show that web traffic makes up the majority of the con
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SASO\%2707\%20-\%20Garbacki\%2C\%20Epema\%20\%26\%20van\%20Steen.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_0,
@@ -4746,7 +4792,7 @@ To sample the results, we show that web traffic makes up the majority of the con
journal = {unknown},
issn = {RR-07-205},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Tech\%20Report\%20-\%20Analyzing\%20peer\%20behavior\%20in\%20KAD.pdf},
author = {Steiner, Moritz and En-Najjary, Taoufik and E W Biersack}
}
@booklet {VenHeTon07,
@@ -4756,7 +4802,7 @@ To sample the results, we show that web traffic makes up the majority of the con
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},
www_section = {Rate-Distortion, secrecy, traffic analysis},
url = {http://cat.inist.fr/?aModele=afficheN\&cpsidt=20411836},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/0710.4903v1.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/0710.4903v1.pdf},
author = {Parvathinathan Venkitasubramaniam and Ting He and Lang Tong}
}
@conference {di07mass,
@@ -4769,25 +4815,25 @@ To sample the results, we show that web traffic makes up the majority of the con
www_section = {distributed hash table, scalable source routing},
isbn = {978-1-4244-1454-3},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/di07mass.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/di07mass.pdf},
author = {Di, Pengfei and Yaser Houri and Qing Wei and J{\"o}rg Widmer and Thomas Fuhrmann}
}
@conference {Ostrovsky:2007:AEN:1315245.1315270,
title = {Attribute-based encryption with non-monotonic access structures},
- booktitle = {CCS{\textquoteright}07--Proceedings of the 14th ACM Conference on Computer and Communications Security},
- series = {CCS {\textquoteright}07},
+ booktitle = {CCS'07--Proceedings of the 14th ACM Conference on Computer and Communications Security},
+ series = {CCS '07},
year = {2007},
month = oct,
pages = {195--203},
publisher = {ACM},
organization = {ACM},
address = {Alexandria, VA, USA},
- abstract = {We construct an Attribute-Based Encryption (ABE) scheme that allows a user{\textquoteright}s private key to be expressed in terms of any access formula over attributes. Previous ABE schemes were limited to expressing only monotonic access structures. We provide a proof of security for our scheme based on the Decisional Bilinear Diffie-Hellman (BDH) assumption. Furthermore, the performance of our new scheme compares favorably with existing, less-expressive schemes},
+ abstract = {We construct an Attribute-Based Encryption (ABE) scheme that allows a user's private key to be expressed in terms of any access formula over attributes. Previous ABE schemes were limited to expressing only monotonic access structures. We provide a proof of security for our scheme based on the Decisional Bilinear Diffie-Hellman (BDH) assumption. Furthermore, the performance of our new scheme compares favorably with existing, less-expressive schemes},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CCS\%2707\%20-\%20ABE\%20with\%20non-monotonic\%20access\%20structures.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CCS\%2707\%20-\%20ABE\%20with\%20non-monotonic\%20access\%20structures.pdf},
publisher = {unknown},
author = {Rafail Ostrovsky and Amit Sahai and Waters, Brent}
}
@@ -4795,7 +4841,7 @@ To sample the results, we show that web traffic makes up the majority of the con
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},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/batman-status.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/batman-status.pdf},
publisher = {unknown},
author = {Axel Neumann and Corinna Elektra Aichele and Marek Lindner}
}
@@ -4806,14 +4852,14 @@ To sample the results, we show that web traffic makes up the majority of the con
month = {October},
publisher = {ACM New York, NY, USA},
organization = {ACM New York, NY, USA},
- abstract = {Several credential systems have been proposed in which users can authenticate to services anonymously. Since anonymity can give users the license to misbehave, some variants allow the selective deanonymization (or linking) of misbehaving users upon a complaint to a trusted third party (TTP). The ability of the TTP to revoke a user{\textquoteright}s privacy at any time, however, is too strong a punishment for misbehavior. To limit the scope of deanonymization, systems such as "e-cash" have been proposed in which users are deanonymized under only certain types of well-defined misbehavior such as "double spending." While useful in some applications, it is not possible to generalize such techniques to more subjective definitions of misbehavior.
+ abstract = {Several credential systems have been proposed in which users can authenticate to services anonymously. Since anonymity can give users the license to misbehave, some variants allow the selective deanonymization (or linking) of misbehaving users upon a complaint to a trusted third party (TTP). The ability of the TTP to revoke a user's privacy at any time, however, is too strong a punishment for misbehavior. To limit the scope of deanonymization, systems such as "e-cash" have been proposed in which users are deanonymized under only certain types of well-defined misbehavior such as "double spending." While useful in some applications, it is not possible to generalize such techniques to more subjective definitions of misbehavior.
We present the first anonymous credential system in which services can "blacklist" misbehaving users without contacting a TTP. Since blacklisted users remain anonymous, misbehaviors can be judged subjectively without users fearing arbitrary deanonymization by a TTP},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ccs07-blac.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ccs07-blac.pdf},
author = {Patrick P. Tsang and Man Ho Au and Apu Kapadia and Sean Smith}
}
@article {Terpstra:2007:BRP:1282427.1282387,
@@ -4834,7 +4880,7 @@ For validation, we simulate a network with one million low-end peers and show Bu
issn = {0146-4833},
doi = {http://doi.acm.org/10.1145/1282427.1282387},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SIGCOMM\%20Computers\%20Communication\%20Review\%20-\%20Bubblestorm.pdf},
author = {Terpstra, Wesley W. and Jussi Kangasharju and Leng, Christof and Buchmann, Alejandro P.}
}
@booklet {cosic-2007-001,
@@ -4846,12 +4892,12 @@ For validation, we simulate a network with one million low-end peers and show Bu
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},
www_section = {anonymity, private information retrieval, pseudonym},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cosic-2007-001.pdf},
author = {Len Sassaman and Bart Preneel}
}
@conference {1759877,
title = {CFR: a peer-to-peer collaborative file repository system},
- booktitle = {GPC{\textquoteright}07: Proceedings of the 2nd international conference on Advances in grid and pervasive computing},
+ booktitle = {GPC'07: Proceedings of the 2nd international conference on Advances in grid and pervasive computing},
year = {2007},
pages = {100--111},
publisher = {Springer-Verlag},
@@ -4861,7 +4907,7 @@ For validation, we simulate a network with one million low-end peers and show Bu
www_section = {P2P, storage},
isbn = {978-3-540-72359-2},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@mastersthesis {1329865,
@@ -4898,7 +4944,7 @@ We develop our solution in two parts: a cheat-proof and real-time event ordering
}
@conference {conf/acsac/ADC07,
title = {Closed-Circuit Unobservable Voice Over IP},
- booktitle = {Proceedings of 23rd Annual Computer Security Applications Conference (ACSAC{\textquoteright}07), Miami, FL, USA},
+ booktitle = {Proceedings of 23rd Annual Computer Security Applications Conference (ACSAC'07), Miami, FL, USA},
year = {2007},
publisher = {IEEE Computer Society Press},
organization = {IEEE Computer Society Press},
@@ -4907,7 +4953,7 @@ We develop our solution in two parts: a cheat-proof and real-time event ordering
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ADC07.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ADC07.pdf},
author = {Carlos Aguilar Melchor and Yves Deswarte and Julien Iguchi-Cartigny}
}
@article {EdmanSY07,
@@ -4921,7 +4967,7 @@ We develop our solution in two parts: a cheat-proof and real-time event ordering
isbn = {142441329X},
doi = {10.1109/ISI.2007.379497},
url = {http://www.mendeley.com/research/a-combinatorial-approach-to-measuring-anonymity/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EdmanSY07.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/EdmanSY07.pdf},
author = {Matthew Edman and Fikret Sivrikaya and B{\"u}lent Yener}
}
@article {1273450,
@@ -4933,14 +4979,14 @@ We develop our solution in two parts: a cheat-proof and real-time event ordering
pages = {41--52},
publisher = {ACM},
address = {New York, NY, USA},
- abstract = {The Internet{\textquoteright}s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing scalability and designs algorithms that try to meet these limits. In particular, compact routing research shows that shortest-path routing, forming a core of traditional routing algorithms, cannot guarantee routing table (RT) sizes that on all network topologies grow slower than linearly as functions of the network size. However, there are plenty of compact routing schemes that relax the shortest-path requirement and allow for improved, sublinear RT size scaling that is mathematically provable for all static network topologies. In particular, there exist compact routing schemes designed for grids, trees, and Internet-like topologies that offer RT sizes that scale logarithmically with the network size.
+ abstract = {The Internet's routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing scalability and designs algorithms that try to meet these limits. In particular, compact routing research shows that shortest-path routing, forming a core of traditional routing algorithms, cannot guarantee routing table (RT) sizes that on all network topologies grow slower than linearly as functions of the network size. However, there are plenty of compact routing schemes that relax the shortest-path requirement and allow for improved, sublinear RT size scaling that is mathematically provable for all static network topologies. In particular, there exist compact routing schemes designed for grids, trees, and Internet-like topologies that offer RT sizes that scale logarithmically with the network size.
In this paper, we demonstrate that in view of recent results in compact routing research, such logarithmic scaling on Internet-like topologies is fundamentally impossible in the presence of topology dynamics or topology-independent (flat) addressing. We use analytic arguments to show that the number of routing control messages per topology change cannot scale better than linearly on Internet-like topologies. We also employ simulations to confirm that logarithmic RT size scaling gets broken by topology-independent addressing, a cornerstone of popular locator-identifier split proposals aiming at improving routing scaling in the presence of network topology dynamics or host mobility. These pessimistic findings lead us to the conclusion that a fundamental re-examination of assumptions behind routing models and abstractions is needed in order to find a routing architecture that would be able to scale "indefinitely},
www_section = {compact routing, internet routing, routing scalability},
issn = {0146-4833},
doi = {10.1145/1273445.1273450},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.102.5763.pdf},
author = {Krioukov, Dmitri and Fall, Kevin and Brady, Arthur}
}
@mastersthesis {2007_2,
@@ -4951,12 +4997,12 @@ In this paper, we demonstrate that in view of recent results in compact routing
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},
www_section = {backup, dependability, P2P, ubiquitous computing},
url = {http://ethesis.inp-toulouse.fr/archive/00000544/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/phd-thesis.fr_en.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/phd-thesis.fr_en.pdf},
author = {Ludovic Courtes}
}
@conference {fessi-iptcomm2007,
title = {A cooperative SIP infrastructure for highly reliable telecommunication services},
- booktitle = {IPTComm {\textquoteright}07: Proceedings of the 1st international conference on Principles, systems and applications of IP telecommunications},
+ booktitle = {IPTComm '07: Proceedings of the 1st international conference on Principles, systems and applications of IP telecommunications},
year = {2007},
pages = {29--38},
publisher = {ACM},
@@ -4975,12 +5021,12 @@ In this paper, we demonstrate that in view of recent results in compact routing
pages = {547--562},
publisher = {Springer},
organization = {Springer},
- abstract = {Anonymous communications provides an important privacy service by keeping passive eavesdroppers from linking communicating parties. However, using long-term statistical analysis of traffic sent to and from such a system, it is possible to link senders with their receivers. Cover traffic is an effective, but somewhat limited, counter strategy against this attack. Earlier work in this area proposes that privacy-sensitive users generate and send cover traffic to the system. However, users are not online all the time and cannot be expected to send consistent levels of cover traffic, drastically reducing the impact of cover traffic. We propose that the mix generate cover traffic that mimics the sending patterns of users in the system. This receiver-bound cover helps to make up for users that aren{\textquoteright}t there, confusing the attacker. We show through simulation how this makes it difficult for an attacker to discern cover from real traffic and perform attacks based on statistical analysis. Our results show that receiver-bound cover substantially increases the time required for these attacks to succeed. When our approach is used in combination with user-generated cover traffic, the attack takes a very long time to succeed},
+ abstract = {Anonymous communications provides an important privacy service by keeping passive eavesdroppers from linking communicating parties. However, using long-term statistical analysis of traffic sent to and from such a system, it is possible to link senders with their receivers. Cover traffic is an effective, but somewhat limited, counter strategy against this attack. Earlier work in this area proposes that privacy-sensitive users generate and send cover traffic to the system. However, users are not online all the time and cannot be expected to send consistent levels of cover traffic, drastically reducing the impact of cover traffic. We propose that the mix generate cover traffic that mimics the sending patterns of users in the system. This receiver-bound cover helps to make up for users that aren't there, confusing the attacker. We show through simulation how this makes it difficult for an attacker to discern cover from real traffic and perform attacks based on statistical analysis. Our results show that receiver-bound cover substantially increases the time required for these attacks to succeed. When our approach is used in combination with user-generated cover traffic, the attack takes a very long time to succeed},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/MalleshW07.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/MalleshW07.pdf},
author = {Nayantara Mallesh and Matthew Wright},
editor = {Joachim Biskup and Javier Lopez}
}
@@ -4990,14 +5036,14 @@ In this paper, we demonstrate that in view of recent results in compact routing
month = {December},
school = {University of Cambridge},
type = {phd},
- abstract = {The spread of wide-scale Internet surveillance has spurred interest in anonymity systems that protect users{\textquoteright} privacy by restricting unauthorised access to their identity. This requirement can be considered as a flow control policy in the well established field of multilevel secure systems. I apply previous research on covert channels (unintended means to communicate in violation of a security policy) to analyse several anonymity systems in an innovative way.
+ abstract = {The spread of wide-scale Internet surveillance has spurred interest in anonymity systems that protect users' privacy by restricting unauthorised access to their identity. This requirement can be considered as a flow control policy in the well established field of multilevel secure systems. I apply previous research on covert channels (unintended means to communicate in violation of a security policy) to analyse several anonymity systems in an innovative way.
One application for anonymity systems is to prevent collusion in competitions. I show how covert channels may be exploited to violate these protections and construct defences against such attacks, drawing from previous covert channel research and collusion-resistant voting systems.
In the military context, for which multilevel secure systems were designed, covert channels are increasingly eliminated by physical separation of interconnected single-role computers. Prior work on the remaining network covert channels has been solely based on protocol specifications. I examine some protocol implementations and show how the use of several covert channels can be detected and how channels can be modified to resist detection.
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/steven-thesis.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/steven-thesis.pdf},
author = {Steven J. Murdoch}
}
@conference {ccs07-doa,
@@ -5012,12 +5058,12 @@ This thesis demonstrates how theoretical models and generic methodologies relati
isbn = {978-1-59593-703-2},
doi = {10.1145/1315245.1315258},
url = {http://portal.acm.org/citation.cfm?id=1315258},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ccs07-doa.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ccs07-doa.pdf},
author = {Borisov, Nikita and George Danezis and Prateek Mittal and Parisa Tabriz}
}
@conference {1345798,
title = {Dependability Evaluation of Cooperative Backup Strategies for Mobile Devices},
- booktitle = {PRDC {\textquoteright}07: Proceedings of the 13th Pacific Rim International Symposium on Dependable Computing},
+ booktitle = {PRDC '07: Proceedings of the 13th Pacific Rim International Symposium on Dependable Computing},
year = {2007},
pages = {139--146},
publisher = {IEEE Computer Society},
@@ -5027,12 +5073,12 @@ This thesis demonstrates how theoretical models and generic methodologies relati
isbn = {0-7695-3054-0},
doi = {10.1109/PRDC.2007.29},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.65.8269_0.pdf},
author = {Ludovic Courtes and Hamouda, Ossama and Kaaniche, Mohamed and Killijian, Marc-Olivier and Powell, David}
}
@conference {wiangsripanawan-acsw07,
title = {Design principles for low latency anonymous network systems secure against timing attacks},
- booktitle = {Proceedings of the fifth Australasian symposium on ACSW frontiers (ACSW {\textquoteright}07)},
+ booktitle = {Proceedings of the fifth Australasian symposium on ACSW frontiers (ACSW '07)},
year = {2007},
pages = {183--191},
publisher = {Australian Computer Society, Inc},
@@ -5044,38 +5090,38 @@ In this paper, we investigate this claim against other low latency anonymous net
www_section = {anonymity, latency, Morphmix, Tarzan, timing attack, Tor},
isbn = {1-920-68285-X},
url = {http://portal.acm.org/citation.cfm?id=1274553},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/wiangsripanawan-acsw07.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/wiangsripanawan-acsw07.pdf},
author = {Rungrat Wiangsripanawan and Willy Susilo and Rei Safavi-Naini}
}
@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},
+ booktitle = {NSDI'07. Proceedings of the 4th USENIX Conference on Networked Systems Design Implementation},
+ series = {NSDI'07},
year = {2007},
month = apr,
pages = {1--1},
publisher = {USENIX Association},
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},
+ 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's BitTorrent client implementations},
www_section = {BitTorrent, free riding, incentives, peer-to-peer networking},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {Piatek:2007:IBR:1973430.1973431,
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},
+ booktitle = {NSDI'07. Proceedings of the 4th USENIX Conference on Networked Systems Design Implementation},
+ series = {NSDI'07},
year = {2007},
month = apr,
pages = {1--1},
publisher = {USENIX Association},
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},
+ 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's BitTorrent client implementations},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {diaz-wpes2007,
@@ -5092,7 +5138,7 @@ In this paper, we investigate this claim against other low latency anonymous net
isbn = {978-1-59593-883-1},
doi = {10.1145/1314333.1314347},
url = {http://portal.acm.org/citation.cfm?id=1314333.1314347},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/diaz-wpes2007.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/diaz-wpes2007.pdf},
author = {Claudia Diaz and Carmela Troncoso and George Danezis},
editor = {Ting Yu}
}
@@ -5107,8 +5153,8 @@ In this paper, we investigate this claim against other low latency anonymous net
}
@conference {Coulom:2006:ESB:1777826.1777833,
title = {Efficient selectivity and backup operators in Monte-Carlo tree search},
- booktitle = {CG{\textquoteright}06--Proceedings of the 5th international conference on Computers and games},
- series = {CG{\textquoteright}06},
+ booktitle = {CG'06--Proceedings of the 5th international conference on Computers and games},
+ series = {CG'06},
year = {2007},
pages = {72--83},
publisher = {Springer-Verlag},
@@ -5118,7 +5164,7 @@ In this paper, we investigate this claim against other low latency anonymous net
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CG\%2706\%20-\%20Selectivity\%20and\%20backup\%20operators\%20in\%20MCTS.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CG\%2706\%20-\%20Selectivity\%20and\%20backup\%20operators\%20in\%20MCTS.pdf},
author = {Coulom, R{\'e}mi}
}
@article {Machanavajjhala2007,
@@ -5131,7 +5177,7 @@ In this paper, we investigate this claim against other low latency anonymous net
}
@conference {Tang:2007:ESE:1260204.1260647,
title = {Empirical Study on the Evolution of PlanetLab},
- booktitle = {ICN{\textquoteright}07--Proceedings of the 6th International Conference on Networking},
+ booktitle = {ICN'07--Proceedings of the 6th International Conference on Networking},
year = {2007},
month = apr,
pages = {0--64},
@@ -5143,7 +5189,7 @@ In this paper, we investigate this claim against other low latency anonymous net
isbn = {0-7695-2805-8},
doi = {10.1109/ICN.2007.40},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ICN\%2707\%20-\%20PlanetLab.pdf},
author = {Tang, Li and Chen, Yin and Li, Fei and Zhang, Hui and Li, Jun}
}
@article {Member_enablingadaptive,
@@ -5156,7 +5202,7 @@ In this paper, we investigate this claim against other low latency anonymous net
www_section = {distributed packet scheduling, flexible media encoding, path diversity, peer-to-peer networking},
issn = {0163-6804},
doi = {10.1109/MCOM.2007.374427 },
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IEEE\%20Communications\%20Magazine\%20-\%20Video\%20Streaming\%20in\%20P2P\%20Systems.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IEEE\%20Communications\%20Magazine\%20-\%20Video\%20Streaming\%20in\%20P2P\%20Systems.pdf},
author = {Dan Jurca and Jacob Chakareski and Jean-Paul Wagner and Pascal Frossard}
}
@conference {Stathopoulos07end-to-endrouting,
@@ -5167,13 +5213,13 @@ In this paper, we investigate this claim against other low latency anonymous net
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},
www_section = {routing, wireless sensor network},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Stathopoulos07a.pdf},
author = {Thanos Stathopoulos and Heidemann, John and Martin Lukac and Deborah Estrin and William J. Kaiser}
}
@conference {Binzenhofer:2007:ECS:1769187.1769257,
title = {Estimating churn in structured P2P networks},
- booktitle = {ITC-20{\textquoteright}07--Proceedings of the 20th International Teletraffic Conference on Managing Traffic Performance in Converged Networks},
- series = {ITC20{\textquoteright}07},
+ booktitle = {ITC-20'07--Proceedings of the 20th International Teletraffic Conference on Managing Traffic Performance in Converged Networks},
+ series = {ITC20'07},
year = {2007},
month = jun,
pages = {630--641},
@@ -5184,7 +5230,7 @@ In this paper, we investigate this claim against other low latency anonymous net
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ITC-20\%2707\%20-\%20Estimating\%20churn\%20in\%20structured\%20p2p\%20networks.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ITC-20\%2707\%20-\%20Estimating\%20churn\%20in\%20structured\%20p2p\%20networks.pdf},
author = {Binzenh{\"o}fer, Andreas and Leibnitz, Kenji}
}
@article {10.1109/WOWMOM.2007.4351805,
@@ -5199,7 +5245,7 @@ In this paper, we investigate this claim against other low latency anonymous net
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/oualno-070618.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/oualno-070618.pdf},
author = {Nouha Oualha and Pietro Michiardi and Yves Roudier}
}
@conference {AthanRAM07,
@@ -5213,13 +5259,13 @@ In this paper, we investigate this claim against other low latency anonymous net
isbn = {978-3-540-75650-7},
doi = {10.1007/978-3-540-75651-4},
url = {http://www.springerlink.com/content/8120788t0l354vj6/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/AthanRAM07.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/AthanRAM07.pdf},
author = {Elias Athanasopoulos and Mema Roussopoulos and Kostas G. Anagnostakis and Evangelos P. Markatos}
}
@conference {Steiner:2007:GVK:1298306.1298323,
title = {A global view of KAD},
- booktitle = {IMC{\textquoteright}07--Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement},
- series = {IMC {\textquoteright}07},
+ booktitle = {IMC'07--Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement},
+ series = {IMC '07},
year = {2007},
month = oct,
pages = {117--122},
@@ -5233,7 +5279,7 @@ Peers are identified by the so called KAD ID, which was up to now assumed to rem
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IMC\%2707\%20-\%20A\%20global\%20view\%20of\%20KAD.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IMC\%2707\%20-\%20A\%20global\%20view\%20of\%20KAD.pdf},
author = {Steiner, Moritz and En-Najjary, Taoufik and E W Biersack}
}
@article {2007_3,
@@ -5246,7 +5292,7 @@ Peers are identified by the so called KAD ID, which was up to now assumed to rem
issn = {0734-2071},
doi = {10.1145/1275517.1275520},
url = {http://doi.acm.org/10.1145/1275517.1275520},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/GossipPeerSampling2007Jelasity.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/GossipPeerSampling2007Jelasity.pdf},
author = {Jelasity, M{\'a}rk and Voulgaris, Spyros and Guerraoui, Rachid and Kermarrec, Anne-Marie and van Steen, Maarten}
}
@article {2007_4,
@@ -5259,7 +5305,7 @@ Peers are identified by the so called KAD ID, which was up to now assumed to rem
issn = {0163-5980},
doi = {10.1145/1317379.1317381},
url = {http://doi.acm.org/10.1145/1317379.1317381},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Gossiping2007Kermarrrec.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Gossiping2007Kermarrrec.pdf},
author = {Kermarrec, Anne-Marie and van Steen, Maarten}
}
@article { feldman:hidden-action,
@@ -5273,7 +5319,7 @@ Peers are identified by the so called KAD ID, which was up to now assumed to rem
www_section = {action, communication network, hidden action, network routing},
issn = {0733-8716 },
doi = {10.1109/JSAC.2007.070810},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IEEE\%20Journal\%20\%2825\%29\%20-\%20Hidden-action\%20in\%20network\%20routing.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IEEE\%20Journal\%20\%2825\%29\%20-\%20Hidden-action\%20in\%20network\%20routing.pdf},
author = {Michal Feldman and John Chuang and Ion Stoica and S Shenker}
}
@article {so64132,
@@ -5290,7 +5336,7 @@ Peers are identified by the so called KAD ID, which was up to now assumed to rem
issn = {0163-5980},
doi = {10.1145/1317379.1317383},
url = {http://doc.utwente.nl/64132/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/robustgossip-final.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {adida07,
@@ -5307,13 +5353,13 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
isbn = {978-3-540-70935-0},
doi = {10.1007/978-3-540-70936-7},
url = {http://www.springerlink.com/content/j6p730488x602r28/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/adida07.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/adida07.pdf},
author = {Ben Adida and Douglas Wikstr{\"o}m}
}
@conference {Delerablee:2007:IBE:1781454.1781471,
title = {Identity-based broadcast encryption with constant size ciphertexts and private keys},
booktitle = {ASIACRYPT 2007--Proceedings of the Advances in Cryptology 13th International Conference on Theory and Application of Cryptology and Information Security},
- series = {ASIACRYPT{\textquoteright}07},
+ series = {ASIACRYPT'07},
year = {2007},
month = dec,
pages = {200--215},
@@ -5324,7 +5370,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ASIACRYPT\%2707\%20-\%20IBBE\%20with\%20constant\%20size\%20ciphertexts\%20and\%20private\%20keys.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ASIACRYPT\%2707\%20-\%20IBBE\%20with\%20constant\%20size\%20ciphertexts\%20and\%20private\%20keys.pdf},
author = {Delerabl{\'e}e, C{\'e}cile}
}
@article {KongHG07,
@@ -5341,7 +5387,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
issn = {1536-1233},
doi = {10.1109/TMC.2007.1021},
url = {http://portal.acm.org/citation.cfm?id=1272127},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/KongHG07.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/KongHG07.pdf},
author = {Jiejun Kong and Xiaoyan Hong and Mario Gerla}
}
@conference {Infocom2007-SNS,
@@ -5352,7 +5398,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
address = {Anchorage, AK},
www_section = {EGOIST, game theory, routing},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Infocom2007-sns.pdf},
author = {Nikolaos Laoutaris and Georgios Smaragdakis and Azer Bestavros and Byers, John W.}
}
@conference {overlier-pet2007,
@@ -5367,7 +5413,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
www_section = {public key cryptography},
doi = {10.1007/978-3-540-75551-7},
url = {http://www.springerlink.com/content/j68v312681l8v874/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/overlier-pet2007.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/overlier-pet2007.pdf},
author = {Lasse {\O}verlier and Paul Syverson},
editor = {Borisov, Nikita and Philippe Golle}
}
@@ -5399,7 +5445,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
isbn = {0-7695-2848-1},
doi = {10.1109/SP.2007.23},
url = {http://portal.acm.org/citation.cfm?id=1264203},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/goldberg-2007.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/goldberg-2007.pdf},
author = {Ian Goldberg}
}
@conference {slicing07,
@@ -5410,11 +5456,11 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
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},
www_section = {anonymity, onion routing, P2P, privacy},
url = {http://dspace.mit.edu/handle/1721.1/36344a},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/slicing07.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/slicing07.pdf},
author = {Sachin Katti and Jeffery Cohen and Dina Katabi}
}
@book {2007_5,
- title = {The Iterated Prisoner{\textquoteright}s Dilemma: 20 Years On},
+ title = {The Iterated Prisoner's Dilemma: 20 Years On},
series = {Advances in Natural Computation},
volume = {4},
year = {2007},
@@ -5422,7 +5468,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
publisher = {World Scientific Publishing Co. Pte. Ltd},
organization = {World Scientific Publishing Co. Pte. Ltd},
address = {Singapore},
- abstract = {In 1984, Robert Axelrod published a book, relating the story of two competitions which he ran, where invited academics entered strategies for "The Iterated Prisoners{\textquoteright} Dilemma". The book, almost 20 years on, is still widely read and cited by academics and the general public. As a celebration of that landmark work, we have recreated those competitions to celebrate its 20th anniversary, by again inviting academics to submit prisoners{\textquoteright} dilemma strategies. The first of these new competitions was run in July 2004, and the second in April 2005. "Iterated Prisoners{\textquoteright} Dilemma: 20 Years On essentially" provides an update of the Axelrod{\textquoteright}s book. Specifically, it presents the prisoners{\textquoteright} dilemma, its history and variants; highlights original Axelrod{\textquoteright}s work and its impact; discusses results of new competitions; and, showcases selected papers that reflect the latest researches in the area},
+ abstract = {In 1984, Robert Axelrod published a book, relating the story of two competitions which he ran, where invited academics entered strategies for "The Iterated Prisoners' Dilemma". The book, almost 20 years on, is still widely read and cited by academics and the general public. As a celebration of that landmark work, we have recreated those competitions to celebrate its 20th anniversary, by again inviting academics to submit prisoners' dilemma strategies. The first of these new competitions was run in July 2004, and the second in April 2005. "Iterated Prisoners' Dilemma: 20 Years On essentially" provides an update of the Axelrod's book. Specifically, it presents the prisoners' dilemma, its history and variants; highlights original Axelrod's work and its impact; discusses results of new competitions; and, showcases selected papers that reflect the latest researches in the area},
www_section = {dilemma, iterated prisoners, landmark work},
isbn = { 978-981-270-697-3 },
issn = {981-270-697-6},
@@ -5434,12 +5480,12 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
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},
www_section = {GPS},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {DBLP:conf/saint/SaitoMSSM07,
title = {Local Production, Local Consumption: Peer-to-Peer Architecture for a Dependable and Sustainable Social Infrastructure},
- booktitle = {SAINT{\textquoteright}07. Proceedings of the 2007 Symposium on Applications and the Internet},
+ booktitle = {SAINT'07. Proceedings of the 2007 Symposium on Applications and the Internet},
year = {2007},
month = jan,
pages = {0--58},
@@ -5452,7 +5498,7 @@ This translates itself into a design based on the philosophy of Local Production
This paper attempts to put existing works of P2P designs into the perspective of the five-layer architecture model to realize LPLC, and proposes future research directions toward integration of P2P studies for actualization of a dependable and sustainable social infrastructure},
www_section = {LPLC, P2P, peer-to-peer networking},
doi = {http://doi.ieeecomputersociety.org/10.1109/SAINT-W.2007.59},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SAINT\%2707\%20-\%20Local\%20production\%2C\%20local\%20consumption\%20p2p\%20architecture.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SAINT\%2707\%20-\%20Local\%20production\%2C\%20local\%20consumption\%20p2p\%20architecture.pdf},
author = {Saito, Kenji and Morino, Eiichi and Yoshihiko Suko and Takaaki Suzuki and Murai, Jun}
}
@conference {bauer:wpes2007,
@@ -5469,7 +5515,7 @@ We investigate how Tor{\^a}€™s routing optimizations impact its ability to pro
isbn = {978-1-59593-883-1},
doi = {10.1145/1314333.1314336},
url = {http://portal.acm.org/citation.cfm?id=1314336},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/bauer-wpes2007.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/bauer-wpes2007.pdf},
author = {Kevin Bauer and Damon McCoy and Dirk Grunwald and Tadayoshi Kohno and Douglas Sicker}
}
@article {2007_6,
@@ -5494,7 +5540,7 @@ be made without any modification. This paper provides
a solution to the open problem posed in [7] concerning
the creation of a deterministic method to map arbitrary
message to an elliptic curve},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ijns-2009-v8-n2-p169-176.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ijns-2009-v8-n2-p169-176.pdf},
author = {Brian King}
}
@conference {DBLP:conf/infocom/ZhangCY07,
@@ -5510,7 +5556,7 @@ message to an elliptic curve},
www_section = {march},
isbn = {1-4244-1047-9 },
doi = {http://dx.doi.org/10.1109/INFCOM.2007.131},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/INFOCOM\%2707\%20-\%20MARCH.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/INFOCOM\%2707\%20-\%20MARCH.pdf},
author = {Zhan Zhang and Shigang Chen and MyungKeun Yoon}
}
@conference {Magharei07meshor,
@@ -5526,7 +5572,7 @@ message to an elliptic curve},
www_section = {mesh, multple tree, overlay, P2P, peer-to-peer networking},
isbn = {1-4244-1047-9 },
doi = {http://dx.doi.org/10.1109/INFCOM.2007.168},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/INFOCOM\%2707\%20-\%20Mesh\%20or\%20multiple-tree.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/INFOCOM\%2707\%20-\%20Mesh\%20or\%20multiple-tree.pdf},
author = {Magharei, Nazanin and Rejaie, Reza}
}
@book {2007_7,
@@ -5545,7 +5591,7 @@ The realized protocols as well as the original protocol are constant-round and r
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/MultiPartyComputation2007Nishide.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/MultiPartyComputation2007Nishide.pdf},
author = {Nishide, Takashi and Ohta, Kazuo},
editor = {Okamoto, Tatsuaki and Wang, Xiaoyun}
}
@@ -5563,7 +5609,7 @@ The realized protocols as well as the original protocol are constant-round and r
issn = {1063-6692},
doi = {http://dx.doi.org/10.1109/TNET.2007.892850},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IEEE\%E2\%81\%84ACM\%20Banner\%20\%26\%20Orda.pdf},
author = {Banner, Ron and Orda, Ariel}
}
@conference {Dimakis:2010:NCD:1861840.1861868,
@@ -5581,7 +5627,7 @@ The realized protocols as well as the original protocol are constant-round and r
issn = {0018-9448},
doi = {http://dx.doi.org/10.1109/TIT.2010.2054295},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_8,
@@ -5599,7 +5645,7 @@ Although several solutions exist in the relevant literature for this problem, th
www_section = {privacy preserving data mining},
isbn = {978-1-920682-51-4},
url = {http://dl.acm.org/citation.cfm?id=1378245.1378274},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PrivacyPreserving2007Ambirbekyan.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PrivacyPreserving2007Ambirbekyan.pdf},
author = {Amirbekyan, Artak and Estivill-Castro, Vladimir}
}
@conference {2007_9,
@@ -5610,13 +5656,13 @@ Although several solutions exist in the relevant literature for this problem, th
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/hotmobile07.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/hotmobile07.pdf},
author = {Khaled A. Harras and Mike P. Wittie and Kevin C. Almeroth and Elizabeth M. Belding}
}
@conference {Petcu:2007:PNP:1625275.1625301,
title = {PC-DPOP: a new partial centralization algorithm for distributed optimization},
- booktitle = {IJCAI{\textquoteright}07--Proceedings of the 20th international joint conference on Artifical intelligence},
- series = {IJCAI{\textquoteright}07},
+ booktitle = {IJCAI'07--Proceedings of the 20th international joint conference on Artifical intelligence},
+ series = {IJCAI'07},
year = {2007},
month = jan,
pages = {167--172},
@@ -5632,7 +5678,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},
www_section = {algorithms, distributed constraint optimization, DPOP, OptAPO, partial centralization technique},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IJCAI\%2707\%20-\%20PC-DPOP.pdf},
author = {Adrian Petcu and Boi Faltings and Mailler, Roger}
}
@conference {fuhrmann07wons,
@@ -5645,7 +5691,7 @@ We also report strong efficiency gains over OptAPO in experiments on three probl
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},
www_section = {mobile Ad-hoc networks, P2P, scalable source routing},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann07wons.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fuhrmann07wons.pdf},
author = {Thomas Fuhrmann}
}
@book {2007_10,
@@ -5657,14 +5703,14 @@ We also report strong efficiency gains over OptAPO in experiments on three probl
pages = {330--342},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
- abstract = {Yao{\textquoteright}s classical millionaires{\textquoteright} problem is about securely determining whether x > y, given two input values x,y, which are held as private inputs by two parties, respectively. The output x > y becomes known to both parties.
-In this paper, we consider a variant of Yao{\textquoteright}s problem in which the inputs x,y as well as the output bit x > y are encrypted. Referring to the framework of secure n-party computation based on threshold homomorphic cryptosystems as put forth by Cramer, Damg{\r a}rd, and Nielsen at Eurocrypt 2001, we develop solutions for integer comparison, which take as input two lists of encrypted bits representing x and y, respectively, and produce an encrypted bit indicating whether x > y as output. Secure integer comparison is an important building block for applications such as secure auctions.
+ abstract = {Yao's classical millionaires' problem is about securely determining whether x > y, given two input values x,y, which are held as private inputs by two parties, respectively. The output x > y becomes known to both parties.
+In this paper, we consider a variant of Yao's problem in which the inputs x,y as well as the output bit x > y are encrypted. Referring to the framework of secure n-party computation based on threshold homomorphic cryptosystems as put forth by Cramer, Damg{\r a}rd, and Nielsen at Eurocrypt 2001, we develop solutions for integer comparison, which take as input two lists of encrypted bits representing x and y, respectively, and produce an encrypted bit indicating whether x > y as output. Secure integer comparison is an important building block for applications such as secure auctions.
In this paper, our focus is on the two-party case, although most of our results extend to the multi-party case. We propose new logarithmic-round and constant-round protocols for this setting, which achieve simultaneously very low communication and computational complexities. We analyze the protocols in detail and show that our solutions compare favorably to other known solutions},
- www_section = {homomorphic encryption, Millionaires{\textquoteright} problem, secure multi-party computation},
+ www_section = {homomorphic encryption, Millionaires' 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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IntegerComparisonSolution2007Garay.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IntegerComparisonSolution2007Garay.pdf},
author = {Garay, Juan and Schoenmakers, Berry and Villegas, Jos{\'e}},
editor = {Okamoto, Tatsuaki and Wang, Xiaoyun}
}
@@ -5692,7 +5738,7 @@ In this paper, we follow a performance-driven approach to design PRIME, a scalab
issn = {1063-6692},
doi = {http://dx.doi.org/10.1109/TNET.2008.2007434},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/INFOCOM\%2707\%20-\%20PRIME.pdf},
author = {Magharei, Nazanin and Rejaie, Reza}
}
@article {1273222,
@@ -5708,7 +5754,7 @@ In this paper, we follow a performance-driven approach to design PRIME, a scalab
www_section = {privacy, search},
issn = {0163-5840},
doi = {http://doi.acm.org/10.1145/1273221.1273222},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/2007j_sigirforum_shen.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/2007j_sigirforum_shen.pdf},
author = {Shen, Xuehua and Tan, Bin and Zhai, ChengXiang}
}
@booklet {Bellovin2007,
@@ -5731,14 +5777,14 @@ In this paper, we follow a performance-driven approach to design PRIME, a scalab
www_section = {keywords, privacy, private information retrieval, search, streaming},
issn = {0933-2790},
doi = {http://dx.doi.org/10.1007/s00145-007-0565-3},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Ostrovsky-Skeith.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Ostrovsky-Skeith.pdf},
author = {Rafail Ostrovsky and William E. Skeith}
}
@mastersthesis {kostas-thesis,
title = {Probabilistic and Information-Theoretic Approaches to Anonymity},
year = {2007},
month = {October},
- school = {Laboratoire d{\textquoteright}Informatique (LIX), {\'E}cole Polytechnique, Paris},
+ school = {Laboratoire d'Informatique (LIX), {\'E}cole Polytechnique, Paris},
type = {phd},
abstract = {As the number of Internet activities increases, there is a growing amount of personal information about the users that is transferred using public electronic means, making it feasible to collect a huge amount of information about a person. As a consequence, the need for mechanisms to protect such information is compelling. In this thesis, we study security protocols with an emphasis on the property of anonymity and we propose methods to express and verify this property.
@@ -5748,7 +5794,7 @@ Then we aim at quantitative definitions of anonymity. We view protocols as noisy
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kostas-thesis.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/kostas-thesis.pdf},
author = {Konstantinos Chatzikokolakis}
}
@conference {ChatziPP07,
@@ -5760,12 +5806,12 @@ Finally we study a problem that arises when we combine probabilities with nondet
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ChatziPP07.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ChatziPP07.pdf},
author = {Konstantinos Chatzikokolakis and Catuscia Palamidessi and Prakash Panangaden}
}
@proceedings {DBLP:conf/stoc/2007,
- booktitle = {Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC{\textquoteright}07)},
- journal = {Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC{\textquoteright}07)},
+ booktitle = {Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC'07)},
+ journal = {Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC'07)},
year = {2007},
month = {June},
publisher = {ACM},
@@ -5784,23 +5830,23 @@ Finally we study a problem that arises when we combine probabilities with nondet
address = {Munich, Germany},
abstract = {Unfortunately, from all known "Distributed Hash Table"-based overlay networks only a few of them relate to proximity in terms of latency. So a query routing can come with high latency when very distant hops are used. One can imagine hops are from one continent to the other in terms of here and back. Thereby it is possible that the target node is located close to the requesting node. Such cases increase query latency to a great extent and are responsible for performance bottlenecks of a query routing.
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},
+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's Vivaldi works with high quality with the used PING-message type},
www_section = {IGOR, neighbor selection, overlay-network, proximity route selection},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Kising\%20-\%20Proximity\%20Neighbor\%20Selection\%20for\%20IGOR.pdf},
author = {Yves Philippe Kising}
}
@conference {1361410,
title = {Purely functional system configuration management},
- booktitle = {HOTOS{\textquoteright}07: Proceedings of the 11th USENIX workshop on Hot topics in operating systems},
+ booktitle = {HOTOS'07: Proceedings of the 11th USENIX workshop on Hot topics in operating systems},
year = {2007},
pages = {1--6},
publisher = {USENIX Association},
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},
+ 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'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/dolstra.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/dolstra.pdf},
author = {Dolstra, Eelco and Hemel, Armijn}
}
@conference { pitchblack,
@@ -5813,13 +5859,13 @@ Exemplary analysis show that Merivaldi means only a modest burden for the networ
abstract = {In many networks, such as mobile ad-hoc networks and friend-to-friend overlay networks, direct communication between nodes is limited to specific neighbors. Often these networks have a small-world topology; while short paths exist between any pair of nodes in small-world networks, it is non-trivial to determine such paths with a distributed algorithm. Recently, Clarke and Sandberg
proposed the first decentralized routing algorithm that achieves efficient routing in such small-world networks.
-This paper is the first independent security analysis of Clarke and Sandberg{\textquoteright}s routing algorithm. We show that a relatively weak participating adversary can render the overlay ineffective without being detected, resulting in significant data loss due to the resulting load imbalance. We have measured the impact of the attack
-in a testbed of 800 nodes using minor modifications to Clarke and Sandberg{\textquoteright}s implementation of their routing algorithm in Freenet. Our experiments show that the attack is highly effective, allowing a small number of malicious nodes to cause rapid loss of data on the entire network.
+This paper is the first independent security analysis of Clarke and Sandberg's routing algorithm. We show that a relatively weak participating adversary can render the overlay ineffective without being detected, resulting in significant data loss due to the resulting load imbalance. We have measured the impact of the attack
+in a testbed of 800 nodes using minor modifications to Clarke and Sandberg's implementation of their routing algorithm in Freenet. Our experiments show that the attack is highly effective, allowing a small number of malicious nodes to cause rapid loss of data on the entire network.
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},
www_section = {denial-of-service, Freenet, installation, routing},
url = {http://grothoff.org/christian/pitchblack.pdf},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pitchblack.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/pitchblack.pdf},
author = {Nathan S Evans and Chis GauthierDickey and Christian Grothoff}
}
@conference {murdoch-pet2007,
@@ -5832,7 +5878,7 @@ We also discuss various proposed countermeasures designed to detect, thwart or l
address = {Ottawa, Canada},
abstract = {Existing low-latency anonymity networks are vulnerable to traffic analysis, so location diversity of nodes is essential to defend against attacks. Previous work has shown that simply ensuring geographical diversity of nodes does not resist, and in some cases exacerbates, the risk of traffic analysis by ISPs. Ensuring high autonomous-system (AS) diversity can resist this weakness. However, ISPs commonly connect to many other ISPs in a single location, known as an Internet eXchange (IX). This paper shows that IXes are a single point where traffic analysis can be performed. We examine to what extent this is true, through a case study of Tor nodes in the UK. Also, some IXes sample packets flowing through them for performance analysis reasons, and this data could be exploited to de-anonymize traffic. We then develop and evaluate Bayesian traffic analysis techniques capable of processing this sampled data},
www_section = {anonymity, Internet exchange, traffic analysis},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/murdoch-pet2007.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/murdoch-pet2007.pdf},
author = {Steven J. Murdoch and Piotr Zieli{\'n}ski},
editor = {Borisov, Nikita and Philippe Golle}
}
@@ -5850,7 +5896,7 @@ The System Architecture Group at the University of Karlsruhe in Germany has deve
One problem with this approach is, that each file system can only be accessed with the help of an identifier, which changes whenever a file system is modified. All clients have to be notified of the new identifier in a secure, fast and reliable way.
Usually the strategy to solve this type of problem is an encrypted multicast. This thesis presents and analyses several strategies of using multicast distributions to solve this problem and then unveils our final solution based on the Subset Difference method proposed by Naor et al},
www_section = {distributed file system, distributed hash table, peer-to-peer networking, store information},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Amann\%20-\%20Secure\%20asynchronous\%20change\%20notifications.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Amann\%20-\%20Secure\%20asynchronous\%20change\%20notifications.pdf},
author = {Bernhard Amann}
}
@conference {saballus07secure,
@@ -5866,7 +5912,7 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
www_section = {ad-hoc networks},
isbn = {978-3-8007-2980-7},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/saballus07secure.pdf},
author = {Bjoern Saballus and Sebastian Wallner and Markus Volkmer}
}
@article {Kaafar:2007:SIC:1282427.1282388,
@@ -5883,13 +5929,13 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
issn = {0146-4833},
doi = {http://doi.acm.org/10.1145/1282427.1282388},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {Conner:2007:SPM:1377934.1377937,
title = {Securing peer-to-peer media streaming systems from selfish and malicious behavior},
- booktitle = {MDS{\textquoteright}07. Proceedings of the 4th on Middleware Doctoral Symposium},
- series = {MDS {\textquoteright}07},
+ booktitle = {MDS'07. Proceedings of the 4th on Middleware Doctoral Symposium},
+ series = {MDS '07},
volume = {13},
year = {2007},
month = nov,
@@ -5897,12 +5943,12 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
publisher = {ACM},
organization = {ACM},
address = {Newport Beach, CA, USA},
- abstract = {We present a flexible framework for throttling attackers in peer-to-peer media streaming systems. In such systems, selfish nodes (e.g., free riders) and malicious nodes (e.g., DoS attackers) can overwhelm the system by issuing too many requests in a short interval of time. Since peer-to-peer systems are decentralized, it is difficult for individual peers to limit the aggregate download bandwidth consumed by other remote peers. This could potentially allow selfish and malicious peers to exhaust the system{\textquoteright}s available upload bandwidth. In this paper, we propose a framework to provide a solution to this problem by utilizing a subset of trusted peers (called kantoku nodes) that collectively monitor the bandwidth usage of untrusted peers in the system and throttle attackers. This framework has been evaluated through simulation thus far. Experiments with a full implementation on a network testbed are part of our future work},
+ abstract = {We present a flexible framework for throttling attackers in peer-to-peer media streaming systems. In such systems, selfish nodes (e.g., free riders) and malicious nodes (e.g., DoS attackers) can overwhelm the system by issuing too many requests in a short interval of time. Since peer-to-peer systems are decentralized, it is difficult for individual peers to limit the aggregate download bandwidth consumed by other remote peers. This could potentially allow selfish and malicious peers to exhaust the system's available upload bandwidth. In this paper, we propose a framework to provide a solution to this problem by utilizing a subset of trusted peers (called kantoku nodes) that collectively monitor the bandwidth usage of untrusted peers in the system and throttle attackers. This framework has been evaluated through simulation thus far. Experiments with a full implementation on a network testbed are part of our future work},
www_section = {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_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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/MDS\%2707\%20-\%20Conner\%20\%26\%20Nahrstedt\%20-\%20Securing\%20peer-to-peer\%20media\%20streaming\%20systems.pdf},
author = {Conner, William and Nahrstedt, Klara}
}
@conference {DBLP:conf/ladc/CourtesKP07,
@@ -5914,12 +5960,12 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
www_section = {backup, reputation, self-organization},
doi = {10.1007/978-3-540-75294-3},
url = {http://www.springerlink.com/content/p210q274g22j8g77/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.106.5673.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.106.5673.pdf},
author = {Ludovic Courtes and Killijian, Marc-Olivier and Powell, David}
}
@conference {1396915,
title = {S/Kademlia: A practicable approach towards secure key-based routing},
- booktitle = {ICPADS {\textquoteright}07: Proceedings of the 13th International Conference on Parallel and Distributed Systems},
+ booktitle = {ICPADS '07: Proceedings of the 13th International Conference on Parallel and Distributed Systems},
year = {2007},
pages = {1--8},
publisher = {IEEE Computer Society},
@@ -5929,12 +5975,12 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
isbn = {978-1-4244-1889-3},
doi = {10.1109/ICPADS.2007.4447808},
url = {http://portal.acm.org/citation.cfm?id=1396915$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SKademlia2007.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SKademlia2007.pdf},
author = {Baumgart, Ingmar and Sebastian Mies}
}
@conference {1326260,
title = {Skype4Games},
- booktitle = {NetGames {\textquoteright}07: Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games},
+ booktitle = {NetGames '07: Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games},
year = {2007},
pages = {13--18},
publisher = {ACM},
@@ -5945,7 +5991,7 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
isbn = {978-0-9804460-0-5},
doi = {10.1145/1326257.1326260},
url = {http://portal.acm.org/citation.cfm?id=1326260$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Triebel2007a.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Triebel2007a.pdf},
author = {Triebel, Tonio and Guthier, Benjamin and Effelsberg, Wolfgang}
}
@conference {space-efficient,
@@ -5959,17 +6005,17 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
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 },
www_section = {keywords, privacy},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/privsearch-aeolus.pdf},
author = {George Danezis and Claudia Diaz}
}
@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}},
+ booktitle = {Proc. 7th W{\"u}rzburg Workshop on IP: Joint EuroFGI and ITG Workshop on Visions of Future Generation Networks'},
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},
+ 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'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SpoVNet.pdf , https://gnunet.org/git/bibliography.git/tree/docs/Mies\%20-\%20SpoVNet.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SpoVNet.pdf , https://gnunet.org/git/bibliography.git/plain/docs/Mies\%20-\%20SpoVNet.pdf},
author = {Sebastian Mies}
}
@conference {ringstwice07,
@@ -5979,10 +6025,10 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
publisher = {Werkgemeenschap voor Informatie- en Communicatietheorie},
organization = {Werkgemeenschap voor Informatie- en Communicatietheorie},
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},
+ 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'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},
www_section = {private information retrieval},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ringstwice07.pdf},
author = {Meredith L. Patterson and Len Sassaman}
}
@conference {Li2007-tcloseness,
@@ -5994,14 +6040,14 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
}
@conference {saballus07distributed,
title = {Towards a Distributed Java VM in Sensor Networks using Scalable Source Routing},
- booktitle = {6. Fachgespraech Sensornetzwerke der GI/ITG Fachgruppe {\textquoteright}{\textquoteright}Kommunikation und Verteilte Systeme{\textquoteright}{\textquoteright}},
+ booktitle = {6. Fachgespraech Sensornetzwerke der GI/ITG Fachgruppe ''Kommunikation und Verteilte Systeme''},
year = {2007},
pages = {47--50},
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},
www_section = {distributed hash table, scalable source routing},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/saballus07distributed.pdf},
author = {Bjoern Saballus and Johannes Eickhold and Thomas Fuhrmann}
}
@conference {Sherr07towardsapplication-aware,
@@ -6015,12 +6061,12 @@ 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},
www_section = {anonymity, routing},
url = {http://portal.acm.org/citation.cfm?id=1361423},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/a3.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/a3.pdf},
author = {Micah Sherr and Boon Thau and Matt Blaze}
}
@conference {1270971,
title = {Towards Fair Event Dissemination},
- booktitle = {ICDCSW {\textquoteright}07: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops},
+ booktitle = {ICDCSW '07: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops},
year = {2007},
pages = {0--63},
publisher = {IEEE Computer Society},
@@ -6030,7 +6076,7 @@ We pose a grand challenge for anonymity: the development of a network architectu
isbn = {0-7695-2838-4},
doi = {10.1109/ICDCSW.2007.83},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.90.9758.pdf},
author = {Baehni, Sebastien and Rachid Guerraoui and Boris Koldehofe and Monod, Maxime}
}
@conference {troncoso-ih2007,
@@ -6049,7 +6095,7 @@ We pose a grand challenge for anonymity: the development of a network architectu
isbn = {978-3-540-77369-6},
doi = {10.1007/978-3-540-77370-2},
url = {http://www.springerlink.com/content/h5r4j539833k1k78/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/troncoso-ih2007.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/troncoso-ih2007.pdf},
author = {Carmela Troncoso and Claudia Diaz and Orr Dunkelman and Bart Preneel}
}
@conference {danezis-pet2007,
@@ -6063,7 +6109,7 @@ We pose a grand challenge for anonymity: the development of a network architectu
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 },
www_section = {anonymity, traffic analysis},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/danezis-pet2007.pdf},
author = {George Danezis and Claudia Diaz and Carmela Troncoso},
editor = {Borisov, Nikita and Philippe Golle}
}
@@ -6079,12 +6125,12 @@ We pose a grand challenge for anonymity: the development of a network architectu
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/UnconditionallySecureProtocol2007Li.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/UnconditionallySecureProtocol2007Li.pdf},
author = {Li, Ronghua and Wu, Chuankun}
}
@conference {tor-soups07,
title = {Usability of anonymous web browsing: an examination of Tor interfaces and deployability},
- booktitle = {Proceedings of the 3rd Symposium on Usable Privacy and Security (SOUPS {\textquoteright}07)},
+ booktitle = {Proceedings of the 3rd Symposium on Usable Privacy and Security (SOUPS '07)},
year = {2007},
month = {July},
pages = {41--51},
@@ -6096,7 +6142,7 @@ We pose a grand challenge for anonymity: the development of a network architectu
isbn = {978-1-59593-801-5},
doi = {10.1145/1280680.1280687},
url = {http://portal.acm.org/citation.cfm?id=1280680.1280687},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tor-soups07.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/tor-soups07.pdf},
author = {Jeremy Clark and Paul C. van Oorschot and Carlisle Adams}
}
@conference {kutzner07linearization,
@@ -6108,7 +6154,7 @@ We pose a grand challenge for anonymity: the development of a network architectu
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},
www_section = {scalable source routing},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kutzner07linearization.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/kutzner07linearization.pdf},
author = {Kendy Kutzner and Thomas Fuhrmann}
}
@article {1250746,
@@ -6127,12 +6173,12 @@ In this paper we describe Valgrind, a DBI framework designed for building heavyw
issn = {0362-1340},
doi = {10.1145/1273442.1250746},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.108.4263.pdf},
author = {Nethercote, Nicholas and Seward, Julian}
}
@article {2007_14,
title = {Vielleicht anonym? Die Enttarnung von StealthNet-Nutzern},
- journal = {c{\textquoteright}t magazin f{\"u}r computer technik},
+ journal = {c't magazin f{\"u}r computer technik},
year = {2007},
type = {Report},
www_section = {anonymity, file-sharing, Rshare, Stealthnet},
@@ -6152,7 +6198,7 @@ In this paper we describe Valgrind, a DBI framework designed for building heavyw
isbn = {0-7695-2679-9 },
doi = {10.1109/P2P.2006.1 },
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IEEE\%20Computer\%20Society\%20-\%202Fast.pdf},
author = {Garbacki, Pawel and Alexandru Iosup and Epema, Dick H. J. and van Steen, Maarten}
}
@mastersthesis {2006_0,
@@ -6162,7 +6208,7 @@ In this paper we describe Valgrind, a DBI framework designed for building heavyw
month = oct,
pages = {0--159},
school = {Eidgen{\"o}ssische Technische Hochschule Z{\"u}rich (ETH)},
- type = {Master{\textquoteright}s Thesis},
+ type = {Master's Thesis},
address = {Zurich, Switzerland},
www_section = {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},
@@ -6208,7 +6254,7 @@ In this paper we describe Valgrind, a DBI framework designed for building heavyw
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},
www_section = {anonymity, privacy},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/usability-weis2006.pdf},
author = {Roger Dingledine and Nick Mathewson},
editor = {Ross Anderson}
}
@@ -6218,20 +6264,20 @@ In this position paper we focus on the network effects of usability on privacy a
volume = {4661/2007},
year = {2006},
pages = {281--300},
- abstract = {We propose a framework in which anonymity protocols are interpreted as particular kinds of channels, and the degree of anonymity provided by the protocol as the converse of the channel{\textquoteright}s capacity. We also investigate how the adversary can test the system to try to infer the user{\textquoteright}s identity, and we study how his probability of success depends on the characteristics of the channel. We then illustrate how various notions of anonymity can be expressed in this framework, and show the relation with some definitions of probabilistic anonymity in literature.
+ abstract = {We propose a framework in which anonymity protocols are interpreted as particular kinds of channels, and the degree of anonymity provided by the protocol as the converse of the channel's capacity. We also investigate how the adversary can test the system to try to infer the user's identity, and we study how his probability of success depends on the characteristics of the channel. We then illustrate how various notions of anonymity can be expressed in this framework, and show the relation with some definitions of probabilistic anonymity in literature.
This work has been partially supported by the INRIA DREI {\'E}quipe Associ{\'e}e PRINTEMPS. The work of Konstantinos Chatzikokolakis and Catuscia Palamidessi has been also supported by the INRIA ARC project ProNoBiS},
www_section = {anonymity},
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.79.4460.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.79.4460.pdf},
author = {Konstantinos Chatzikokolakis and Catuscia Palamidessi and Prakash Panangaden}
}
@conference {Goyal:2006:AEF:1180405.1180418,
title = {Attribute-based encryption for fine-grained access control of encrypted data},
- booktitle = {CCS{\textquoteright}06--Proceedings of the 13th ACM Conference on Computer and Communications Security},
- series = {CCS {\textquoteright}06},
+ booktitle = {CCS'06--Proceedings of the 13th ACM Conference on Computer and Communications Security},
+ series = {CCS '06},
year = {2006},
month = oct,
pages = {89--98},
@@ -6243,7 +6289,7 @@ This work has been partially supported by the INRIA DREI {\'E}quipe Associ{\'e}e
isbn = {1-59593-518-5},
doi = {http://doi.acm.org/10.1145/1180405.1180418},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {alpha-mixing:pet2006,
@@ -6256,12 +6302,12 @@ This work has been partially supported by the INRIA DREI {\'E}quipe Associ{\'e}e
organization = {Springer},
address = {Cambridge, UK},
abstract = {Currently fielded anonymous communication systems either introduce too much delay and thus have few users and little security, or have many users but too little delay to provide protection against large attackers. By combining the user bases into the same network, and ensuring that all traffic is mixed together, we hope to lower delay and improve anonymity for both sets of users.
-Alpha-mixing is an approach that can be added to traditional batching strategies to let senders specify for each message whether they prefer security or speed. Here we describe how to add alpha-mixing to various mix designs, and show that mix networks with this feature can provide increased anonymity for all senders in the network. Along the way we encounter subtle issues to do with the attacker{\textquoteright}s knowledge of the security parameters of the users},
+Alpha-mixing is an approach that can be added to traditional batching strategies to let senders specify for each message whether they prefer security or speed. Here we describe how to add alpha-mixing to various mix designs, and show that mix networks with this feature can provide increased anonymity for all senders in the network. Along the way we encounter subtle issues to do with the attacker's knowledge of the security parameters of the users},
www_section = {anonymity},
isbn = {978-3-540-68790-0},
doi = {10.1007/11957454},
url = {http://www.springerlink.com/content/m23510526727k317/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/alpha-mixing-pet2006.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/alpha-mixing-pet2006.pdf},
author = {Roger Dingledine and Andrei Serjantov and Paul Syverson},
editor = {George Danezis and Philippe Golle}
}
@@ -6275,7 +6321,7 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
www_section = {ad-hoc networks, overlay networks, traffic analysis},
doi = {10.1109/PERCOMW.2006.28},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cramer06bootstrapping.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cramer06bootstrapping.pdf},
author = {Cramer, Curt and Thomas Fuhrmann}
}
@conference {UREbreak06,
@@ -6289,7 +6335,7 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
www_section = {traffic analysis, universal re-encryption},
doi = {10.1007/s10207-007-0033-y},
url = {http://www.springerlink.com/content/x038u85171776236/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/UREbreak06.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/UREbreak06.pdf},
author = {George Danezis}
}
@conference {morphmix:pet2006,
@@ -6301,12 +6347,12 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
publisher = {Springer},
organization = {Springer},
address = {Cambridge, UK},
- abstract = {MorphMix is a peer-to-peer circuit-based mix network designed to provide low-latency anonymous communication. MorphMix nodes incrementally construct anonymous communication tunnels based on recommendations from other nodes in the system; this P2P approach allows it to scale to millions of users. However, by allowing unknown peers to aid in tunnel construction, MorphMix is vulnerable to colluding attackers that only offer other attacking nodes in their recommendations. To avoid building corrupt tunnels, MorphMix employs a collusion detection mechanism to identify this type of misbehavior. In this paper, we challenge the assumptions of the collusion detection mechanism and demonstrate that colluding adversaries can compromise a significant fraction of all anonymous tunnels, and in some cases, a majority of all tunnels built. Our results suggest that mechanisms based solely on a node{\textquoteright}s local knowledge of the network are not sufficient to solve the difficult problem of detecting colluding adversarial behavior in a P2P system and that more sophisticated schemes may be needed},
+ abstract = {MorphMix is a peer-to-peer circuit-based mix network designed to provide low-latency anonymous communication. MorphMix nodes incrementally construct anonymous communication tunnels based on recommendations from other nodes in the system; this P2P approach allows it to scale to millions of users. However, by allowing unknown peers to aid in tunnel construction, MorphMix is vulnerable to colluding attackers that only offer other attacking nodes in their recommendations. To avoid building corrupt tunnels, MorphMix employs a collusion detection mechanism to identify this type of misbehavior. In this paper, we challenge the assumptions of the collusion detection mechanism and demonstrate that colluding adversaries can compromise a significant fraction of all anonymous tunnels, and in some cases, a majority of all tunnels built. Our results suggest that mechanisms based solely on a node's local knowledge of the network are not sufficient to solve the difficult problem of detecting colluding adversarial behavior in a P2P system and that more sophisticated schemes may be needed},
www_section = {collusion detection, P2P},
isbn = {978-3-540-68790-0},
doi = {10.1007/11957454},
url = {http://www.springerlink.com/content/p2612108665331n7/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/morphmix-pet2006.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/morphmix-pet2006.pdf},
author = {Parisa Tabriz and Borisov, Nikita},
editor = {George Danezis and Philippe Golle}
}
@@ -6324,7 +6370,7 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
issn = {0146-4833},
doi = {10.1145/1151659.1159937},
url = {http://portal.acm.org/citation.cfm?id=1159937$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BuildingAnASTopologyModel.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/BuildingAnASTopologyModel.pdf},
author = {M{\"u}hlbauer, Wolfgang and Feldmann, Anja and Maennel, Olaf and Roughan, Matthew and Uhlig, Steve}
}
@conference {thiele06debruijn,
@@ -6336,7 +6382,7 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
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},
www_section = {authentication, P2P},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/thiele06debruijn.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/thiele06debruijn.pdf},
author = {Manuel Thiele and Kendy Kutzner and Thomas Fuhrmann}
}
@article {adams06,
@@ -6348,23 +6394,23 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
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},
www_section = {privacy},
url = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=999672},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/adams06.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/adams06.pdf},
author = {Carlisle Adams}
}
@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},
+ booktitle = {ChinaCom '06. First International Conference on Communications and Networking in China},
year = {2006},
month = oct,
pages = {1--5},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Beijing, China},
- abstract = {In unstructured peer-to-peer systems, cooperation by the intermediate peers are essential for the success of queries. However, intermediate peers may choose to forward packets at a low priority or not forward the packets at all, which is referred as peers{\textquoteright} hidden action. Hidden action may lead to significant decrement of search efficiency. In contrast to building a global system with reputations or economics, we proposed MSSF, an improved search method, to help queries route around the peers with hidden action. MSSF does not need to check other peers{\textquoteright} behavior. It automatically adapts to change query routes according to the previous query results. Simulation results show that MSSF is more robust than Gnutella flooding when peers with hidden action increase},
+ abstract = {In unstructured peer-to-peer systems, cooperation by the intermediate peers are essential for the success of queries. However, intermediate peers may choose to forward packets at a low priority or not forward the packets at all, which is referred as peers' hidden action. Hidden action may lead to significant decrement of search efficiency. In contrast to building a global system with reputations or economics, we proposed MSSF, an improved search method, to help queries route around the peers with hidden action. MSSF does not need to check other peers' behavior. It automatically adapts to change query routes according to the previous query results. Simulation results show that MSSF is more robust than Gnutella flooding when peers with hidden action increase},
www_section = {cooperation, hidden action, unstructured peer-to-peer system},
isbn = {1-4244-0463-0 },
doi = {http://dx.doi.org/10.1109/CHINACOM.2006.344762},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ChinaCom\%2706\%20-\%20Combating\%20hidden\%20action\%20in\%20unstructured\%20p2p\%20systems.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ChinaCom\%2706\%20-\%20Combating\%20hidden\%20action\%20in\%20unstructured\%20p2p\%20systems.pdf},
author = {Qi Zhao and Jianzhong Zhang and Jingdong Xu}
}
@book {2006_2,
@@ -6388,12 +6434,12 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
volume = {Volume 4124/2006},
year = {2006},
abstract = {Our recently proposed scalable source routing (SSR) protocol combines source routing in the physical network with Chord-like routing in the virtual ring that is formed by the address space. Thereby, SSR provides self-organized routing in large unstructured networks of resource-limited devices. Its ability to quickly adapt to changes in the network topology makes it suitable not only for sensor-actuator networks but also for mobile ad-hoc networks. Moreover, SSR directly provides the key-based routing semantics, thereby making it an efficient basis for the scalable implementation of self-organizing, fully decentralized applications.
-In this paper we review SSR{\textquoteright}s self-organizing features and demonstrate how the combination of virtual and physical structures leads to emergence of stability and efficiency. In particular, we focus on SSR{\textquoteright}s resistance against node churn. Following the principle of combining virtual and physical structures, we propose an extension that stabilizes SSR in face of heavy node churn. Simulations demonstrate the effectiveness of this extension},
+In this paper we review SSR's self-organizing features and demonstrate how the combination of virtual and physical structures leads to emergence of stability and efficiency. In particular, we focus on SSR's resistance against node churn. Following the principle of combining virtual and physical structures, we propose an extension that stabilizes SSR in face of heavy node churn. Simulations demonstrate the effectiveness of this extension},
www_section = {Chord, scalable source routing, self-organization},
issn = {978-3-540-37658-3},
doi = {10.1007/11822035},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Combining\%20Virtual\%20and\%20Physical\%20Structures\%20for\%20Self-organized\%20Routing_0.pdf},
publisher = {unknown},
author = {Thomas Fuhrmann}
}
@@ -6408,15 +6454,15 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
}
@conference {1267366,
title = {Compare-by-hash: a reasoned analysis},
- booktitle = {ATEC {\textquoteright}06: Proceedings of the annual conference on USENIX {\textquoteright}06 Annual Technical Conference},
+ booktitle = {ATEC '06: Proceedings of the annual conference on USENIX '06 Annual Technical Conference},
year = {2006},
pages = {7--7},
publisher = {USENIX Association},
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},
+ 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'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.125.4474.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.125.4474.pdf},
author = {Black, John}
}
@article {2006_5,
@@ -6426,15 +6472,15 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
year = {2006},
month = jan,
pages = {1--7},
- abstract = {The WAT system, as used in Japan, allows for businesses to issue their own tickets (IOU{\textquoteright}s) which can circulate as a complementary currency within a community. This paper proposes a variation on that model, where the issuer of a ticket can offer a guarantee, in the form of some goods or services. The difference in value, along with a reasonable acceptance that the issuer is capable of delivering the service or goods, allows for a higher degree of confidence in the ticket, and therefore a greater liquidity},
+ abstract = {The WAT system, as used in Japan, allows for businesses to issue their own tickets (IOU's) which can circulate as a complementary currency within a community. This paper proposes a variation on that model, where the issuer of a ticket can offer a guarantee, in the form of some goods or services. The difference in value, along with a reasonable acceptance that the issuer is capable of delivering the service or goods, allows for a higher degree of confidence in the ticket, and therefore a greater liquidity},
www_section = {guarantee, peer-to-peer currencies},
issn = {1325-9547},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IJCCR\%20vol\%2010\%20\%282006\%29\%201\%20Ardron\%20and\%20Lietaer.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IJCCR\%20vol\%2010\%20\%282006\%29\%201\%20Ardron\%20and\%20Lietaer.pdf},
author = {Mitra Ardron and Bernard Lietaer}
}
@article {ishai2006ca,
title = {Cryptography from Anonymity},
- journal = {Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS{\textquoteright}06)-Volume 00},
+ journal = {Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)-Volume 00},
year = {2006},
pages = {239--248},
publisher = {IEEE Computer Society Washington, DC, USA},
@@ -6444,24 +6490,24 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
issn = {0272-5428},
doi = {10.1109/FOCS.2006.25},
url = {http://portal.acm.org/citation.cfm?id=1170505},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ishai2006ca.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ishai2006ca.pdf},
author = {Yuval Ishai and Eyal Kushilevitz and Rafail Ostrovsky and Amit Sahai}
}
@conference {Grolimund:2006:CFT:1173705.1174355,
title = {Cryptree: A Folder Tree Structure for Cryptographic File Systems},
- booktitle = {SRDS{\textquoteright}06--Proceedings of the 25th IEEE Symposium on Reliable Distributed Systems},
+ booktitle = {SRDS'06--Proceedings of the 25th IEEE Symposium on Reliable Distributed Systems},
year = {2006},
month = oct,
pages = {189--198},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Leeds, UK},
- abstract = {We present Cryptree, a cryptographic tree structure which facilitates access control in file systems operating on untrusted storage. Cryptree leverages the file system{\textquoteright}s folder hierarchy to achieve efficient and intuitive, yet simple, access control. The highlights are its ability to recursively grant access to a folder and all its subfolders in constant time, the dynamic inheritance of access rights which inherently prevents scattering of access rights, and the possibility to grant someone access to a file or folder without revealing the identities of other accessors. To reason about and to visualize Cryptree, we introduce the notion of cryptographic links. We describe the Cryptrees we have used to enforce read and write access in our own file system. Finally, we measure the performance of the Cryptree and compare it to other approaches},
+ abstract = {We present Cryptree, a cryptographic tree structure which facilitates access control in file systems operating on untrusted storage. Cryptree leverages the file system's folder hierarchy to achieve efficient and intuitive, yet simple, access control. The highlights are its ability to recursively grant access to a folder and all its subfolders in constant time, the dynamic inheritance of access rights which inherently prevents scattering of access rights, and the possibility to grant someone access to a file or folder without revealing the identities of other accessors. To reason about and to visualize Cryptree, we introduce the notion of cryptographic links. We describe the Cryptrees we have used to enforce read and write access in our own file system. Finally, we measure the performance of the Cryptree and compare it to other approaches},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SRDS\%2706\%20-\%20Cryptree.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SRDS\%2706\%20-\%20Cryptree.pdf},
author = {Dominik Grolimund and Luzius Meisser and Stefan Schmid and Roger Wattenhofer}
}
@conference {2006_6,
@@ -6470,7 +6516,7 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
year = {2006},
month = feb,
www_section = {Curve25519, ECC, ECDH, GNUnet},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/curve25519-20060209.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/curve25519-20060209.pdf},
author = {Daniel J. Bernstein}
}
@booklet {200,
@@ -6482,7 +6528,7 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
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},
www_section = {attack, P2P, robustness},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.60.8756.pdf},
author = {Jochen Dinger and Hannes Hartenstein}
}
@book {2006_7,
@@ -6506,11 +6552,11 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
publisher = {IEEE CS},
organization = {IEEE CS},
address = {Oakland, CA},
- 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},
+ 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'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},
www_section = {anonymity measurement, privacy, re-encryption},
doi = {10.1145/1698750.1698758},
url = {http://portal.acm.org/citation.cfm?id=1698750.1698758},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Golle-sp2006.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Golle-sp2006.pdf},
author = {Philippe Golle and XiaoFeng Wang and Jakobsson, Markus and Alex Tsow}
}
@book {2006_8,
@@ -6522,17 +6568,17 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
pages = {1--12},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
- 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},
+ 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' 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'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DifferentialPrivacy2006Dwork_0.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/DifferentialPrivacy2006Dwork_0.pdf},
author = {Dwork, Cynthia},
editor = {Bugliesi, Michele and Preneel, Bart and Sassone, Vladimiro and Wegener, Ingo}
}
@conference {1143821,
title = {A distributed data caching framework for mobile ad hoc networks},
- booktitle = {IWCMC {\textquoteright}06: Proceedings of the 2006 international conference on Wireless communications and mobile computing},
+ booktitle = {IWCMC '06: Proceedings of the 2006 international conference on Wireless communications and mobile computing},
year = {2006},
pages = {1357--1362},
publisher = {ACM},
@@ -6543,7 +6589,7 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
isbn = {1-59593-306-9},
doi = {10.1145/1143549.1143821},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_9,
@@ -6567,7 +6613,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},
www_section = {distributed hash table, distributed k-ary system, DKS},
url = {http://eprints.sics.se/516/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Ghodsi\%20-\%20Distributed\%20k-ary\%20System.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Ghodsi\%20-\%20Distributed\%20k-ary\%20System.pdf},
author = {Ali Ghodsi}
}
@conference {AhmedBoutaba2006DistributedPatternMatching,
@@ -6593,7 +6639,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
abstract = {Theoretical basis for the routing protocol of Freenet 0.7 },
www_section = {small-world},
url = {http://www.math.chalmers.se/~ossa/wrt.html},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/swroute.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/swroute.pdf},
author = {Sandberg, Oskar}
}
@book {2006_10,
@@ -6620,7 +6666,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
www_section = {ad-hoc networks, anonymity, routing},
doi = {10.1007/978-3-540-71789-8},
url = {http://www.springerlink.com/content/g6334148068w1254/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.74.1585.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.74.1585.pdf},
author = {Sk. Md. Mizanur Rahman and Atsuo Inomata and Takeshi Okamoto and Masahiro Mambo}
}
@conference {danezis:weis2006,
@@ -6631,7 +6677,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/danezis-weis2006.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/danezis-weis2006.pdf},
author = {George Danezis and Bettina Wittneben},
editor = {Ross Anderson}
}
@@ -6654,18 +6700,18 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
}
@conference {1143660,
title = {Estimation based erasure-coding routing in delay tolerant networks},
- booktitle = {IWCMC {\textquoteright}06: Proceedings of the 2006 international conference on Wireless communications and mobile computing},
+ booktitle = {IWCMC '06: Proceedings of the 2006 international conference on Wireless communications and mobile computing},
year = {2006},
pages = {557--562},
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
- abstract = {Wireless Delay Tolerant Networks (DTNs) are intermittently connected mobile wireless networks. Some well-known assumptions of traditional networks are no longer true in DTNs, which makes routing in DTNs a challenging problem. We observe that mobile nodes in realistic wireless DTNs may always have some mobility pattern information which can be used to estimate one node{\textquoteright}s ability to deliver a specific message. This estimation can greatly enhance the routing performance in DTNs. Furthermore, we adopt an alternative way to generate redundancy using erasure coding. With a fixed overhead, the erasure coding can generate a large number of message-blocks instead of a few replications, and therefore it allows the transmission of only a portion of message to a relay. This can greatly increase the routing diversity when combined with estimation-based approaches. We have conducted extensive simulations to evaluate the performance of our scheme. The results demonstrate that our scheme outperforms previously proposed schemes},
+ abstract = {Wireless Delay Tolerant Networks (DTNs) are intermittently connected mobile wireless networks. Some well-known assumptions of traditional networks are no longer true in DTNs, which makes routing in DTNs a challenging problem. We observe that mobile nodes in realistic wireless DTNs may always have some mobility pattern information which can be used to estimate one node's ability to deliver a specific message. This estimation can greatly enhance the routing performance in DTNs. Furthermore, we adopt an alternative way to generate redundancy using erasure coding. With a fixed overhead, the erasure coding can generate a large number of message-blocks instead of a few replications, and therefore it allows the transmission of only a portion of message to a relay. This can greatly increase the routing diversity when combined with estimation-based approaches. We have conducted extensive simulations to evaluate the performance of our scheme. The results demonstrate that our scheme outperforms previously proposed schemes},
www_section = {delay tolerant network},
isbn = {1-59593-306-9},
doi = {10.1145/1143549.1143660},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.61.249.pdf},
author = {Liao, Yong and Tan, Kun and Zhang, Zhensheng and Gao, Lixin}
}
@article {1217950,
@@ -6682,12 +6728,12 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
issn = {0163-5980},
doi = {10.1145/1218063.1217950},
url = {http://portal.acm.org/citation.cfm?id=1218063.1217950$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/epost-eurosys2006.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/epost-eurosys2006.pdf},
author = {Mislove, Alan and Post, Ansley and Haeberlen, Andreas and Peter Druschel}
}
@conference {guha6ess,
title = {An Experimental Study of the Skype Peer-to-Peer VoIP System},
- booktitle = {IPTPS{\textquoteright}06--Proceedings of The 5th International Workshop on Peer-to-Peer Systems },
+ booktitle = {IPTPS'06--Proceedings of The 5th International Workshop on Peer-to-Peer Systems },
year = {2006},
month = feb,
pages = {1--6},
@@ -6695,12 +6741,12 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
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},
www_section = {decentralized, indexing, overlay, P2P, skype, unstructured},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IPTPS\%2706\%20-\%20Skype\%20p2p\%20VoIP\%20System.pdf},
author = {Saikat Guha and Daswani, Neil and Jain, Ravi}
}
@conference {Saito:2006:FTI:1130897.1131000_0,
title = {Fair Trading of Information: A Proposal for the Economics of Peer-to-Peer Systems},
- booktitle = {ARES{\textquoteright}06. Proceedings of the First International Conference on Availability, Reliability and Security},
+ booktitle = {ARES'06. Proceedings of the First International Conference on Availability, Reliability and Security},
year = {2006},
month = apr,
pages = {764--771},
@@ -6712,12 +6758,12 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
isbn = {0-7695-2567-9},
doi = {10.1109/ARES.2006.62},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ARES\%2706\%20-\%20Fair\%20Trading\%20of\%20Information.pdf},
author = {Saito, Kenji and Morino, Eiichi and Murai, Jun}
}
@conference {Saito:2006:FTI:1130897.1131000,
title = {Fair Trading of Information: A Proposal for the Economics of Peer-to-Peer Systems},
- booktitle = {ARES{\textquoteright}06. Proceedings of the First International Conference on Availability, Reliability and Security},
+ booktitle = {ARES'06. Proceedings of the First International Conference on Availability, Reliability and Security},
year = {2006},
month = apr,
pages = {764--771},
@@ -6728,7 +6774,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
isbn = {0-7695-2567-9},
doi = {10.1109/ARES.2006.62},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ARES\%2706\%20-\%20Fair\%20Trading\%20of\%20Information.pdf},
author = {Saito, Kenji and Morino, Eiichi and Murai, Jun}
}
@article {1217937,
@@ -6744,7 +6790,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
issn = {0163-5980},
doi = {10.1145/1218063.1217937},
url = {http://portal.acm.org/citation.cfm?id=1218063.1217937$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Fireflies.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Fireflies.pdf},
author = {H{\r a}vard Johansen and Allavena, Andr{\'e} and Robbert Van Renesse}
}
@conference {Locher06freeriding,
@@ -6754,18 +6800,18 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
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},
www_section = {BitTorrent},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.67.9307.pdf},
author = {Thomas Locher and Patrick Moor and Stefan Schmid and Roger Wattenhofer}
}
@conference {Grolimund06havelaar:a,
title = {Havelaar: A Robust and Efficient Reputation System for Active Peer-to-Peer Systems},
- booktitle = {NetEcon{\textquoteright}06. 1st Workshop on the Economics of Networked Systems Ann Arbor},
+ booktitle = {NetEcon'06. 1st Workshop on the Economics of Networked Systems Ann Arbor},
year = {2006},
month = jun,
address = {Ann Arbor, Michigan},
- abstract = {Peer-to-peer (p2p) systems have the potential to harness huge amounts of resources. Unfortunately, however, it has been shown that most of today{\textquoteright}s p2p networks suffer from a large fraction of free-riders, which mostly consume resources without contributing much to the system themselves. This results in an overall performance degradation. One particularly interesting resource is bandwidth. Thereby, a service differentiation approach seems appropriate, where peers contributing higher upload bandwidth are rewarded with higher download bandwidth in return. Keeping track of the contribution of each peer in an open, decentralized environment, however, is not trivial; many systems which have been proposed are susceptible to false reports. Besides being prone to attacks, some solutions have a large communication and computation overhead, which can even be linear in the number of transactions{\textemdash}an unacceptable burden in practical and active systems. In this paper, we propose a reputation system which overcomes this scaling problem. Our analytical and simulation results are promising, indicating that the mechanism is accurate and efficient, especially when applied to systems where there are lots of transactions (e.g., due to erasure coding)},
+ abstract = {Peer-to-peer (p2p) systems have the potential to harness huge amounts of resources. Unfortunately, however, it has been shown that most of today's p2p networks suffer from a large fraction of free-riders, which mostly consume resources without contributing much to the system themselves. This results in an overall performance degradation. One particularly interesting resource is bandwidth. Thereby, a service differentiation approach seems appropriate, where peers contributing higher upload bandwidth are rewarded with higher download bandwidth in return. Keeping track of the contribution of each peer in an open, decentralized environment, however, is not trivial; many systems which have been proposed are susceptible to false reports. Besides being prone to attacks, some solutions have a large communication and computation overhead, which can even be linear in the number of transactions{\textemdash}an unacceptable burden in practical and active systems. In this paper, we propose a reputation system which overcomes this scaling problem. Our analytical and simulation results are promising, indicating that the mechanism is accurate and efficient, especially when applied to systems where there are lots of transactions (e.g., due to erasure coding)},
www_section = {free-riding, harvelaar, P2P, peer-to-peer networking, performance degradation, reputation system},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NetEcon\%2706\%20-\%20Harvelaar.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/NetEcon\%2706\%20-\%20Harvelaar.pdf},
author = {Dominik Grolimund and Luzius Meisser and Stefan Schmid and Roger Wattenhofer}
}
@conference {HotOrNot,
@@ -6775,12 +6821,12 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
month = {October},
publisher = {ACM New York, NY, USA},
organization = {ACM New York, NY, USA},
- abstract = {Location-hidden services, as offered by anonymity systems such as Tor, allow servers to be operated under a pseudonym. As Tor is an overlay network, servers hosting hidden services are accessible both directly and over the anonymous channel. Traffic patterns through one channel have observable effects on the other, thus allowing a service{\textquoteright}s pseudonymous identity and IP address to be linked. One proposed solution to this vulnerability is for Tor nodes to provide fixed quality of service to each connection, regardless of other traffic, thus reducing capacity but resisting such interference attacks. However, even if each connection does not influence the others, total throughput would still affect the load on the CPU, and thus its heat output. Unfortunately for anonymity, the result of temperature on clock skew can be remotely detected through observing timestamps. This attack works because existing abstract models of anonymity-network nodes do not take into account the inevitable imperfections of the hardware they run on. Furthermore, we suggest the same technique could be exploited as a classical covert channel and can even provide geolocation},
+ abstract = {Location-hidden services, as offered by anonymity systems such as Tor, allow servers to be operated under a pseudonym. As Tor is an overlay network, servers hosting hidden services are accessible both directly and over the anonymous channel. Traffic patterns through one channel have observable effects on the other, thus allowing a service's pseudonymous identity and IP address to be linked. One proposed solution to this vulnerability is for Tor nodes to provide fixed quality of service to each connection, regardless of other traffic, thus reducing capacity but resisting such interference attacks. However, even if each connection does not influence the others, total throughput would still affect the load on the CPU, and thus its heat output. Unfortunately for anonymity, the result of temperature on clock skew can be remotely detected through observing timestamps. This attack works because existing abstract models of anonymity-network nodes do not take into account the inevitable imperfections of the hardware they run on. Furthermore, we suggest the same technique could be exploited as a classical covert channel and can even provide geolocation},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/HotOrNot.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/HotOrNot.pdf},
author = {Steven J. Murdoch}
}
@conference {clonewars,
@@ -6796,12 +6842,12 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
isbn = {1-59593-518-5},
doi = {10.1145/1180405.1180431},
url = {http://portal.acm.org/citation.cfm?id=1180431},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/clonewars.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/clonewars.pdf},
author = {Jan Camenisch and Susan Hohenberger and Markulf Kohlweiss and Anna Lysyanskaya and Mira Meyerovich}
}
@conference {1157518,
title = {iDIBS: An Improved Distributed Backup System},
- booktitle = {ICPADS {\textquoteright}06: Proceedings of the 12th International Conference on Parallel and Distributed Systems},
+ booktitle = {ICPADS '06: Proceedings of the 12th International Conference on Parallel and Distributed Systems},
year = {2006},
pages = {58--67},
publisher = {IEEE Computer Society},
@@ -6812,7 +6858,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
isbn = {0-7695-2612-8},
doi = {10.1109/ICPADS.2006.52},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.94.4826.pdf},
author = {Morcos, Faruck and Chantem, Thidapat and Little, Philip and Gasiba, Tiago and Thain, Douglas}
}
@conference {clayton:pet2006,
@@ -6824,11 +6870,11 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
publisher = {Springer},
organization = {Springer},
address = {Cambridge, UK},
- 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},
+ 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'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/clayton-pet2006.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/clayton-pet2006.pdf},
author = {Richard Clayton and Steven J. Murdoch and Robert N. M. Watson},
editor = {George Danezis and Philippe Golle}
}
@@ -6842,7 +6888,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kutzner06igor.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/kutzner06igor.pdf},
author = {Kendy Kutzner and Thomas Fuhrmann}
}
@conference {conf/infocom/StutzbachR06,
@@ -6851,23 +6897,23 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
year = {2006},
publisher = {IEEE},
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},
+ 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'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},
www_section = {distributed hash table, redundancy},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/infocom06-kad.pdf},
author = {Stutzbach, Daniel and Rejaie, Reza}
}
@conference {Pai06improvingrobustness,
title = {Improving Robustness of Peer-to-Peer Streaming with Incentives},
- booktitle = {NetEcon{\textquoteright}06. 1st Workshop on the Economics of Networked Systems},
+ booktitle = {NetEcon'06. 1st Workshop on the Economics of Networked Systems},
year = {2006},
month = jun,
publisher = {ACM},
organization = {ACM},
address = {Ann Arbor, Michigan, USA},
- abstract = {In this paper we argue that a robust incentive mechanism is important in a real-world peer-to-peer streaming system to ensure that nodes contribute as much upload bandwidth as they can. We show that simple tit-for-tat mechanisms which work well in file-sharing systems like BitTorrent do not perform well given the additional delay and bandwidth constraints imposed by live streaming. We present preliminary experimental results for an incentive mechanism based on the Iterated Prisoner{\textquoteright}s Dilemma problem that allows all nodes to download with low packet loss when there is sufficient capacity in the system, but when the system is resource-starved, nodes that contribute upload bandwidth receive better service than those that do not. Moreover, our algorithm does not require nodes to rely on any information other than direct observations of its neighbors {\textquoteright} behavior towards it },
+ abstract = {In this paper we argue that a robust incentive mechanism is important in a real-world peer-to-peer streaming system to ensure that nodes contribute as much upload bandwidth as they can. We show that simple tit-for-tat mechanisms which work well in file-sharing systems like BitTorrent do not perform well given the additional delay and bandwidth constraints imposed by live streaming. We present preliminary experimental results for an incentive mechanism based on the Iterated Prisoner's Dilemma problem that allows all nodes to download with low packet loss when there is sufficient capacity in the system, but when the system is resource-starved, nodes that contribute upload bandwidth receive better service than those that do not. Moreover, our algorithm does not require nodes to rely on any information other than direct observations of its neighbors ' behavior towards it },
www_section = {peer-to-peer streaming, tit-for-tat},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NetEcon\%2706\%20-\%20Improving\%20robustness\%20of\%20p2p\%20streaming.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/NetEcon\%2706\%20-\%20Improving\%20robustness\%20of\%20p2p\%20streaming.pdf},
author = {Vinay Pai and Alexander E. Mohr}
}
@conference {ciaccio:pet2006,
@@ -6884,7 +6930,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
isbn = {978-3-540-68790-0},
doi = {10.1007/11957454},
url = {http://www.springerlink.com/content/v473127846n07255/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ciaccio-pet2006.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ciaccio-pet2006.pdf},
author = {Giuseppe Ciaccio},
editor = {George Danezis and Philippe Golle}
}
@@ -6897,30 +6943,30 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Lisboa, Portugal},
- abstract = {Peer-to-peer (P2P) applications such as BitTorrent ignore traffic costs at ISPs and generate a large amount of cross-ISP traffic. As a result, ISPs often throttle BitTorrent traffic to control the cost. In this paper, we examine a new approach to enhance BitTorrent traffic locality, biased neighbor selection, in which a peer chooses the majority, but not all, of its neighbors from peers within the same ISP. Using simulations, we show that biased neighbor selection maintains the nearly optimal performance of Bit- Torrent in a variety of environments, and fundamentally reduces the cross-ISP traffic by eliminating the traffic{\textquoteright}s linear growth with the number of peers. Key to its performance is the rarest first piece replication algorithm used by Bit- Torrent clients. Compared with existing locality-enhancing approaches such as bandwidth limiting, gateway peers, and caching, biased neighbor selection requires no dedicated servers and scales to a large number of BitTorrent networks},
+ abstract = {Peer-to-peer (P2P) applications such as BitTorrent ignore traffic costs at ISPs and generate a large amount of cross-ISP traffic. As a result, ISPs often throttle BitTorrent traffic to control the cost. In this paper, we examine a new approach to enhance BitTorrent traffic locality, biased neighbor selection, in which a peer chooses the majority, but not all, of its neighbors from peers within the same ISP. Using simulations, we show that biased neighbor selection maintains the nearly optimal performance of Bit- Torrent in a variety of environments, and fundamentally reduces the cross-ISP traffic by eliminating the traffic's linear growth with the number of peers. Key to its performance is the rarest first piece replication algorithm used by Bit- Torrent clients. Compared with existing locality-enhancing approaches such as bandwidth limiting, gateway peers, and caching, biased neighbor selection requires no dedicated servers and scales to a large number of BitTorrent networks},
www_section = {BitTorrent, neighbor selection, peer-to-peer networking, performance, traffic locality},
isbn = { 0-7695-2540-7},
issn = {1063-6927},
doi = {10.1109/ICDCS.2006.48 },
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ICDCS\%2706\%20-\%20Improving\%20traffic\%20locality\%20in\%20BitTorrent.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ICDCS\%2706\%20-\%20Improving\%20traffic\%20locality\%20in\%20BitTorrent.pdf},
author = {Ruchir Bindal and Pei Cao and William Chan and Jan Medved and George Suwala and Tony Bates and Amy Zhang}
}
@conference {Feigenbaum:2006:IIR:1134707.1134722,
title = {Incentive-compatible interdomain routing},
- booktitle = {EC{\textquoteright}06. Proceedings of the 7th ACM Conference on Electronic Commerce},
- series = {EC {\textquoteright}06},
+ booktitle = {EC'06. Proceedings of the 7th ACM Conference on Electronic Commerce},
+ series = {EC '06},
year = {2006},
month = jun,
pages = {130--139},
publisher = {ACM},
organization = {ACM},
address = {Arbor, Michigan},
- abstract = {The routing of traffic between Internet domains, or Autonomous Systems (ASes), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP). Using BGP, autonomous systems can apply semantically rich routing policies to choose interdomain routes in a distributed fashion. This expressiveness in routing-policy choice supports domains{\textquoteright} autonomy in network operations and in business decisions, but it comes at a price: The interaction of locally defined routing policies can lead to unexpected global anomalies, including route oscillations or overall protocol divergence. Networking researchers have addressed this problem by devising constraints on policies that guarantee BGP convergence without unduly limiting expressiveness and autonomy.In addition to taking this engineering or "protocol-design" approach, researchers have approached interdomain routing from an economic or "mechanism-design" point of view. It is known that lowest-cost-path (LCP) routing can be implemented in a truthful, BGP-compatible manner but that several other natural classes of routing policies cannot. In this paper, we present a natural class of interdomain-routing policies that is more realistic than LCP routing and admits incentive-compatible, BGP-compatible implementation. We also present several positive steps toward a general theory of incentive-compatible interdomain routing},
+ abstract = {The routing of traffic between Internet domains, or Autonomous Systems (ASes), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP). Using BGP, autonomous systems can apply semantically rich routing policies to choose interdomain routes in a distributed fashion. This expressiveness in routing-policy choice supports domains' autonomy in network operations and in business decisions, but it comes at a price: The interaction of locally defined routing policies can lead to unexpected global anomalies, including route oscillations or overall protocol divergence. Networking researchers have addressed this problem by devising constraints on policies that guarantee BGP convergence without unduly limiting expressiveness and autonomy.In addition to taking this engineering or "protocol-design" approach, researchers have approached interdomain routing from an economic or "mechanism-design" point of view. It is known that lowest-cost-path (LCP) routing can be implemented in a truthful, BGP-compatible manner but that several other natural classes of routing policies cannot. In this paper, we present a natural class of interdomain-routing policies that is more realistic than LCP routing and admits incentive-compatible, BGP-compatible implementation. We also present several positive steps toward a general theory of incentive-compatible interdomain routing},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EC\%2706\%20-\%20Incentive-compatible\%20interdomain\%20routing.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/EC\%2706\%20-\%20Incentive-compatible\%20interdomain\%20routing.pdf},
author = {Feigenbaum, Joan and Ramachandran, Vijay and Schapira, Michael}
}
@article {DBLP:journals/corr/abs-cs-0611016,
@@ -6930,7 +6976,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/0611016v1.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/0611016v1.pdf},
author = {Damien Martin-Guillerez and Michel Ban{\^a}tre and Paul Couderc}
}
@article {WrightMM06,
@@ -6945,7 +6991,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
www_section = {hidden Markov models, traffic classification},
issn = {1533-7928},
url = {http://portal.acm.org/citation.cfm?id=1248647},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WrightMM06.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/WrightMM06.pdf},
author = {Charles Wright and Fabian Monrose and Gerald M. Masson}
}
@conference {Liberatore:2006,
@@ -6961,7 +7007,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
isbn = {1-59593-518-5},
doi = {10.1145/1180405.1180437},
url = {http://portal.acm.org/citation.cfm?id=1180437},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Liberatore-2006.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Liberatore-2006.pdf},
author = {Marc Liberatore and Brian Neil Levine}
}
@mastersthesis {Saito:2004:MTP:968884.969522,
@@ -6974,7 +7020,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
address = {Washington, DC, USA},
keywords = {i-WAT, OpenPGP, WAT system},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Saito\%20-\%20i-WAT\%20Dissertation.pdf},
author = {Saito, Kenji}
}
@book {2006_12,
@@ -6990,7 +7036,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
isbn = {978-3-540-38875-3},
doi = {10.1007/11841036_42},
url = {http://dx.doi.org/10.1007/11841036_42},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/LessHashing2006Kirsch.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/LessHashing2006Kirsch.pdf},
author = {Kirsch, Adam and Mitzenmacher, Michael},
editor = {Azar, Yossi and Erlebach, Thomas}
}
@@ -7008,7 +7054,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
isbn = {978-3-540-68790-0},
doi = {10.1007/11957454},
url = {http://www.springerlink.com/content/y6l6412387663581/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cview-pet2006.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cview-pet2006.pdf},
author = {Andreas Pashalidis and Bernd Meyer},
editor = {George Danezis and Philippe Golle}
}
@@ -7022,7 +7068,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
www_section = {scalable source routing},
isbn = {1-4244-0054-6},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/di06linyphi.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/di06linyphi.pdf},
author = {Di, Pengfei and Massimiliano Marcon and Thomas Fuhrmann}
}
@conference {hs-attack06,
@@ -7037,7 +7083,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
isbn = {0-7695-2574-1},
doi = {10.1109/SP.2006.24},
url = {http://portal.acm.org/citation.cfm?id=1130366},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/hs-attack06.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/hs-attack06.pdf},
author = {Lasse {\O}verlier and Paul Syverson}
}
@conference {icdcs2006:m2,
@@ -7045,12 +7091,12 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
booktitle = {Proceedings of the 26th IEEE Conference on Distributed Computing Systems},
year = {2006},
month = {July},
- abstract = {We present a technique to achieve anonymous multicasting in mix networks to deliver content from producers to consumers. Employing multicast allows content producers to send (and mixes to forward) information to multiple consumers without repeating work for each individual consumer. In our approach, consumers register interest for content by creating paths in the mix network to the content{\textquoteright}s producers. When possible, these paths are merged in the network so that paths destined for the same producer share a common path suffix to the producer. When a producer sends content, the content travels this common suffix toward its consumers (in the reverse direction) and "branches" into multiple messages when necessary. We detail the design of this technique and then analyze the unlinkability of our approach against a global, passive adversary who controls both the producer and some mixes. We show that there is a subtle degradation of unlinkability that arises from multicast. We discuss techniques to tune our design to mitigate this degradation while retaining the benefits of multicast},
+ abstract = {We present a technique to achieve anonymous multicasting in mix networks to deliver content from producers to consumers. Employing multicast allows content producers to send (and mixes to forward) information to multiple consumers without repeating work for each individual consumer. In our approach, consumers register interest for content by creating paths in the mix network to the content's producers. When possible, these paths are merged in the network so that paths destined for the same producer share a common path suffix to the producer. When a producer sends content, the content travels this common suffix toward its consumers (in the reverse direction) and "branches" into multiple messages when necessary. We detail the design of this technique and then analyze the unlinkability of our approach against a global, passive adversary who controls both the producer and some mixes. We show that there is a subtle degradation of unlinkability that arises from multicast. We discuss techniques to tune our design to mitigate this degradation while retaining the benefits of multicast},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/icdcs2006-m2.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/icdcs2006-m2.pdf},
author = {Ginger Perng and Michael K. Reiter and Chenxi Wang}
}
@conference {ShWa-Relationship,
@@ -7065,7 +7111,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
isbn = {1-59593-556-8},
doi = {10.1145/1179601.1179611},
url = {http://portal.acm.org/citation.cfm?id=1179611},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ShWa-Relationship.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ShWa-Relationship.pdf},
author = {Vitaly Shmatikov and Ming-Hsui Wang}
}
@article {Godfrey:2006:MCD:1151659.1159931,
@@ -7082,16 +7128,16 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
issn = {0146-4833},
doi = {http://doi.acm.org/10.1145/1151659.1159931},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SIGCOMM\%20Comp.\%20Comm.\%20Rev.\%20-\%20Minimizing\%20churn\%20in\%20distributed\%20systems.pdf},
author = {Godfrey, Brighten and S Shenker and Ion Stoica}
}
@booklet {Stefansson06myriadstore,
title = {MyriadStore: A Peer-to-Peer Backup System},
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},
+ 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's nodes ensures that this restriction is fulfilled. Furthermore, MyriadStore minimizes bandwidth requirements and migration costs by treating separately the storage of the system'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},
www_section = {backup, P2P},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.126.5915.pdf},
author = {Birgir Stefansson and Antonios Thodis and Ali Ghodsi and Seif Haridi}
}
@article {Fragouli:2006:NCI:1111322.1111337,
@@ -7108,7 +7154,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
issn = {0146-4833},
doi = {http://doi.acm.org/10.1145/1111322.1111337},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {wpes06:heydt-benjamin,
@@ -7124,23 +7170,23 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
isbn = {1-59593-556-8},
doi = {10.1145/1179601.1179603 },
url = {http://portal.acm.org/citation.cfm?id=1179601.1179603},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/wpes06-heydt-benjamin.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/wpes06-heydt-benjamin.pdf},
author = {Andrei Serjantov and Benessa Defend}
}
@conference {Tati06onobject,
title = {On Object Maintenance in Peer-to-Peer Systems},
- booktitle = {IPTPS{\textquoteright}06--Proceedings of the 5th International Workshop on Peer-to-Peer Systems},
+ booktitle = {IPTPS'06--Proceedings of the 5th International Workshop on Peer-to-Peer Systems},
year = {2006},
month = feb,
address = {Santa Barbara, CA, USA},
abstract = {This paper, we revisit object maintenance in peer-to-peer systems, focusing on how temporary and permanent churn impact the overheads associated with object maintenance. We have a number of goals: to highlight how different environments exhibit different degrees of temporary and permanent churn; to provide further insight into how churn in different environments affects the tuning of object maintenance strategies; and to examinehow object maintenance and churn interact with other constraints such as storage capacity. When possible, we highlight behavior independent of particular object maintenance strategies. When an issue depends on a particular strategy, though, we explore it in the context of a strategy in essence similar to TotalRecall, which uses erasure coding, lazy repair of data blocks, and random indirect placement (we also assume that repairs incorporate remaining blocks rather than regenerating redundancy from scratch)},
www_section = {churn, P2P, peer-to-peer networking},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IPTPS\%2706\%20-\%20On\%20object\%20maintenance\%20in\%20p2p\%20systems.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IPTPS\%2706\%20-\%20On\%20object\%20maintenance\%20in\%20p2p\%20systems.pdf},
author = {Kiran Tati and Geoffrey M. Voelker}
}
@conference {1128335,
title = {OmniStore: A system for ubiquitous personal storage management},
- booktitle = {PERCOM {\textquoteright}06: Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications},
+ booktitle = {PERCOM '06: Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications},
year = {2006},
pages = {136--147},
publisher = {IEEE Computer Society},
@@ -7150,13 +7196,13 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
isbn = {0-7695-2518-0},
doi = {10.1109/PERCOM.2006.40},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.96.4283.pdf},
author = {Alexandros Karypidis and Spyros Lalis}
}
@conference {Fitzi:2006:OEM:1146381.1146407,
title = {Optimally efficient multi-valued byzantine agreement},
booktitle = {Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing},
- series = {PODC {\textquoteright}06},
+ series = {PODC '06},
year = {2006},
pages = {163--168},
publisher = {ACM},
@@ -7166,7 +7212,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
isbn = {1-59593-384-0},
doi = {10.1145/1146381.1146407},
url = {http://doi.acm.org/10.1145/1146381.1146407},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FitHir06.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/FitHir06.pdf},
author = {Fitzi, Matthias and Hirt, Martin}
}
@conference {2006_13,
@@ -7178,13 +7224,13 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
address = {Berlin, Heidelberg},
abstract = {In this work we provide efficient distributed protocols for generating shares of random noise, secure against malicious participants. The purpose of the noise generation is to create a distributed implementation of the privacy-preserving statistical databases described in recent papers [14, 4, 13]. In these databases, privacy is obtained by perturbing the true answer to a database query by the addition of a small amount of
Gaussian or exponentially distributed random noise. The computational power of even a simple form of these databases, when the query is just of the
-form sum over all rows {\textquoteright}i{\textquoteright} in the database of a function
+form sum over all rows 'i' in the database of a function
<i> f </i> applied to the data in row i, has been demonstrated in [4]. A distributed implementation eliminates the need for a trusted database administrator. The results for noise generation are of independent interest. The generation of Gaussian noise introduces a technique for distributing shares of many unbiased coins with fewer executions of verifiable secret sharing than would be needed using previous approaches (reduced by a factor of n). The generation of exponentially distributed noise uses
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/OurData2006Dwork.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/OurData2006Dwork.pdf},
author = {Dwork, Cynthia and Kenthapadi, Krishnaram and McSherry, Frank and Mironov, Ilya and Naor, Moni}
}
@booklet {Aad06packetcoding,
@@ -7193,7 +7239,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
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},
www_section = {anonymity, onion routing, robustness},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.88.2407_0.pdf},
author = {Imad Aad and Claude Castelluccia and Jean-Pierre Hubaux}
}
@article {Marx:2006:PGS:1140638.1140647,
@@ -7210,13 +7256,13 @@ two shallow circuits: one for generating many arbitrarily but identically biased
issn = {0304-3975},
doi = {10.1016/j.tcs.2005.10.007},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Marx\%20-\%20Parameterized\%20graph\%20separation\%20problems.pdf},
author = {Marx, D{\'a}niel}
}
@conference {Aekaterinidis2006PastryStrings,
title = {PastryStrings: A Comprehensive Content-Based Publish/Subscribe DHT Network},
booktitle = {Proceedings of the 26th IEEE International Conference on Distributed Computing Systems},
- series = {ICDCS {\textquoteright}06},
+ series = {ICDCS '06},
year = {2006},
pages = {0--23},
publisher = {IEEE Computer Society},
@@ -7229,8 +7275,8 @@ two shallow circuits: one for generating many arbitrarily but identically biased
}
@conference {Massoulie:2006:PCS:1146381.1146402,
title = {Peer counting and sampling in overlay networks: random walk methods},
- booktitle = {PODC {\textquoteright}06--Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing},
- series = {PODC {\textquoteright}06},
+ booktitle = {PODC '06--Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing},
+ series = {PODC '06},
year = {2006},
month = jul,
pages = {123--132},
@@ -7242,12 +7288,12 @@ two shallow circuits: one for generating many arbitrarily but identically biased
isbn = {1-59593-384-0},
doi = {http://doi.acm.org/10.1145/1146381.1146402},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_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},
+ booktitle = {HPDC'06--15th IEEE International Symposium on High Performance Distributed Computing},
year = {2006},
month = jun,
publisher = {IEEE Computer Society},
@@ -7257,23 +7303,23 @@ two shallow circuits: one for generating many arbitrarily but identically biased
www_section = {comparison, counting, network size estimation, peer to peer},
isbn = {1-4244-0307-3 },
doi = {http://dx.doi.org/10.1109/HPDC.2006.1652131},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/HPDC\%2706\%20-\%20Peer\%20to\%20peer\%20size\%20estimation\%20in\%20large\%20and\%20dynamic\%20networks.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/HPDC\%2706\%20-\%20Peer\%20to\%20peer\%20size\%20estimation\%20in\%20large\%20and\%20dynamic\%20networks.pdf},
author = {Erwan Le Merrer and Anne-Marie Kermarrec and Massouli{\'e}, Laurent}
}
@conference {1161264,
title = {Performance evaluation of chord in mobile ad hoc networks},
- booktitle = {MobiShare {\textquoteright}06: Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking},
+ booktitle = {MobiShare '06: Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking},
year = {2006},
pages = {48--53},
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
- abstract = {Mobile peer-to-peer applications recently have received growing interest. However, it is often assumed that structured peer-to-peer overlays cannot efficiently operate in mobile ad hoc networks (MANETs). The prevailing opinion is that this is due to the protocols{\textquoteright} high overhead cost. In this paper, we show that this opinion is misguided.We present a thorough simulation study evaluating Chord in the well-known MANET simulator GloMoSim. We found the main issue of deploying Chord in a MANET not to be its overhead, but rather the protocol{\textquoteright}s pessimistic timeout and failover strategy. This strategy enables fast lookup resolution in spite of highly dynamic node membership, which is a significant problem in the Internet context. However, with the inherently higher packet loss rate in a MANET, this failover strategy results in lookups being inconsistently forwarded even if node membership does not change},
+ abstract = {Mobile peer-to-peer applications recently have received growing interest. However, it is often assumed that structured peer-to-peer overlays cannot efficiently operate in mobile ad hoc networks (MANETs). The prevailing opinion is that this is due to the protocols' high overhead cost. In this paper, we show that this opinion is misguided.We present a thorough simulation study evaluating Chord in the well-known MANET simulator GloMoSim. We found the main issue of deploying Chord in a MANET not to be its overhead, but rather the protocol's pessimistic timeout and failover strategy. This strategy enables fast lookup resolution in spite of highly dynamic node membership, which is a significant problem in the Internet context. However, with the inherently higher packet loss rate in a MANET, this failover strategy results in lookups being inconsistently forwarded even if node membership does not change},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p48-cramer_ACM2006.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/p48-cramer_ACM2006.pdf},
author = {Cramer, Curt and Thomas Fuhrmann}
}
@article {albrecht2006planetlab,
@@ -7285,7 +7331,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
pages = {33--40},
publisher = {ACM},
www_section = {application management, PlanetLab, plush, resource allocation, resource discovery},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/plush.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/plush.pdf},
author = {Albrecht, J. and Tuttle, C. and Snoeren, A.C. and Vahdat, A.}
}
@conference {heydt-benjamin:pet2006,
@@ -7302,7 +7348,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
isbn = {978-3-540-68790-0},
doi = {10.1007/11957454},
url = {http://www.springerlink.com/content/c75053mr42n82wv5/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/heydt-benjamin-pet2006.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@@ -7314,23 +7360,23 @@ two shallow circuits: one for generating many arbitrarily but identically biased
abstract = {Data mining is frequently obstructed by privacy concerns. In many cases data is distributed, and bringing the data together in one place for analysis is not possible due to privacy laws (e.g. HIPAA) or policies. Privacy preserving data mining techniques have been developed to address this issue by providing mechanisms to mine the data while giving certain privacy guarantees. In this work we address the issue of privacy preserving nearest neighbor search, which forms the kernel of many data mining applications. To this end, we present a novel algorithm based on secure multiparty computation primitives to compute the nearest neighbors of records in horizontally distributed data. We show how this algorithm can be used in three important data mining algorithms, namely LOF outlier detection, SNN clustering, and kNN classification},
www_section = {Clustering algorithms, Computer science, Conferences, cryptography, Data mining, data privacy, distributed computing, Kernel, kNN classification, LOF outlier detection, Medical diagnostic imaging, multiparty computation primitives, nearest neighbor search, Nearest neighbor searches, pattern clustering, privacy preservation, SNN clustering},
doi = {10.1109/ICDMW.2006.133},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PrivacyPreserving2006Shaneck.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PrivacyPreserving2006Shaneck.pdf},
author = {Shaneck, M. and Yongdae Kim and Kumar, V.}
}
@conference { pianese:pulse,
title = {PULSE, a Flexible P2P Live Streaming System},
- booktitle = {INFOCOM{\textquoteright}06. Proceedings of the 25th IEEE International Conference on Computer Communications},
+ booktitle = {INFOCOM'06. Proceedings of the 25th IEEE International Conference on Computer Communications},
year = {2006},
month = apr,
pages = {-1--1},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Barcelona, Catalunya, Spain},
- abstract = {With the widespread availability of inexpensive broadband Internet connections for home-users, a large number of bandwidth-intensive applications previously not feasible have now become practical. This is the case for multimedia live streaming, for which end-user{\textquoteright}s dial-up/ISDN modem connections once were the bottleneck. The bottleneck is now mostly found on the server side: the bandwidth required for serving many clients at once is large and thus very costly to the broadcasting entity. Peer-to-peer systems for on-demand and live streaming have proved to be an encouraging solution, since they can shift the burden of content distribution from the server to the users of the network. In this work we introduce PULSE, a P2P system for live streaming whose main goals are flexibility, scalability, and robustness. We present the fundamental concepts that stand behind the design of PULSE along with its intended global behavior, and describe in detail the main algorithms running on its nodes},
+ abstract = {With the widespread availability of inexpensive broadband Internet connections for home-users, a large number of bandwidth-intensive applications previously not feasible have now become practical. This is the case for multimedia live streaming, for which end-user's dial-up/ISDN modem connections once were the bottleneck. The bottleneck is now mostly found on the server side: the bandwidth required for serving many clients at once is large and thus very costly to the broadcasting entity. Peer-to-peer systems for on-demand and live streaming have proved to be an encouraging solution, since they can shift the burden of content distribution from the server to the users of the network. In this work we introduce PULSE, a P2P system for live streaming whose main goals are flexibility, scalability, and robustness. We present the fundamental concepts that stand behind the design of PULSE along with its intended global behavior, and describe in detail the main algorithms running on its nodes},
www_section = {peer-to-peer networking, pulse},
isbn = {1-4244-0221-2 },
doi = {http://dx.doi.org/10.1109/INFOCOM.2006.42},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/INFOCOM\%2706\%20-\%20Pianese\%2C\%20Keller\%20\%26\%20Biersack\%20-\%20PULSE.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/INFOCOM\%2706\%20-\%20Pianese\%2C\%20Keller\%20\%26\%20Biersack\%20-\%20PULSE.pdf},
author = {Fabio Pianese and Joaqu{\'\i}n Keller and E W Biersack}
}
@booklet {fuhrmann06pushing-tr,
@@ -7341,12 +7387,12 @@ two shallow circuits: one for generating many arbitrarily but identically biased
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann06pushing.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fuhrmann06pushing.pdf},
author = {Thomas Fuhrmann and Di, Pengfei and Kendy Kutzner and Cramer, Curt}
}
@conference {1109601,
title = {The rainbow skip graph: a fault-tolerant constant-degree distributed data structure},
- booktitle = {SODA {\textquoteright}06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm},
+ booktitle = {SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm},
year = {2006},
pages = {384--393},
publisher = {ACM},
@@ -7356,7 +7402,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
www_section = {distributed hash table, Hydra, rainbow, RSG, skip graph, SkipNet},
isbn = {0-89871-605-5},
doi = {http://doi.acm.org/10.1145/1109557.1109601},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/rainbow.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/rainbow.pdf},
author = {Goodrich, Michael T. and Nelson, Michael J. and Sun, Jonathan Z.}
}
@article {1148681,
@@ -7371,7 +7417,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
abstract = {LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-tolerant distribution of data over computer networks. In this paper, we introduce Raptor codes, an extension of LT-codes with linear time encoding and decoding. We will exhibit a class of universal Raptor codes: for a given integer k and any real {\epsilon} > 0, Raptor codes in this class produce a potentially infinite stream of symbols such that any subset of symbols of size k(1 + {\epsilon}) is sufficient to recover the original k symbols with high probability. Each output symbol is generated using O(log(1/ {\epsilon})) operations, and the original symbols are recovered from the collected ones with O(k log(1/{\epsilon})) operations.We will also introduce novel techniques for the analysis of the error probability of the decoder for finite length Raptor codes. Moreover, we will introduce and analyze systematic versions of Raptor codes, i.e., versions in which the first output elements of the coding system coincide with the original k elements},
www_section = {802.11, encoding, erasure coding},
issn = {1063-6692},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/raptor.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/raptor.pdf},
author = {M. Amin Shokrollahi}
}
@article {2006_16,
@@ -7411,7 +7457,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
publisher = {Elsevier},
organization = {Elsevier},
www_section = {online marketplace, reputation mechanism},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Dellarocas\%20-\%20Reputation\%20Mechanisms.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Dellarocas\%20-\%20Reputation\%20Mechanisms.pdf},
author = {Chrysanthos Dellarocas}
}
@booklet {Miller06robustcomposition:,
@@ -7420,7 +7466,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
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},
www_section = {robustness},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.101.4674.pdf},
author = {Mark Samuel Miller}
}
@conference {Salsa,
@@ -7430,17 +7476,17 @@ two shallow circuits: one for generating many arbitrarily but identically biased
month = {October},
publisher = {ACM New York, NY, USA},
organization = {ACM New York, NY, USA},
- abstract = {Highly distributed anonymous communications systems have the promise to reduce the effectiveness of certain attacks and improve scalability over more centralized approaches. Existing approaches, however, face security and scalability issues. Requiring nodes to have full knowledge of the other nodes in the system, as in Tor and Tarzan, limits scalability and can lead to intersection attacks in peer-to-peer configurations. MorphMix avoids this requirement for complete system knowledge, but users must rely on untrusted peers to select the path. This can lead to the attacker controlling the entire path more often than is acceptable.To overcome these problems, we propose Salsa, a structured approach to organizing highly distributed anonymous communications systems for scalability and security. Salsa is designed to select nodes to be used in anonymous circuits randomly from the full set of nodes, even though each node has knowledge of only a subset of the network. It uses a distributed hash table based on hashes of the nodes{\textquoteright} IP addresses to organize the system. With a virtual tree structure, limited knowledge of other nodes is enough to route node lookups throughout the system. We use redundancy and bounds checking when performing lookups to prevent malicious nodes from returning false information without detection. We show that our scheme prevents attackers from biasing path selection, while incurring moderate overheads, as long as the fraction of malicious nodes is less than 20\%. Additionally, the system prevents attackers from obtaining a snapshot of the entire system until the number of attackers grows too large (e.g. 15\% for 10000 peers and 256 groups). The number of groups can be used as a tunable parameter in the system, depending on the number of peers, that can be used to balance performance and security},
+ abstract = {Highly distributed anonymous communications systems have the promise to reduce the effectiveness of certain attacks and improve scalability over more centralized approaches. Existing approaches, however, face security and scalability issues. Requiring nodes to have full knowledge of the other nodes in the system, as in Tor and Tarzan, limits scalability and can lead to intersection attacks in peer-to-peer configurations. MorphMix avoids this requirement for complete system knowledge, but users must rely on untrusted peers to select the path. This can lead to the attacker controlling the entire path more often than is acceptable.To overcome these problems, we propose Salsa, a structured approach to organizing highly distributed anonymous communications systems for scalability and security. Salsa is designed to select nodes to be used in anonymous circuits randomly from the full set of nodes, even though each node has knowledge of only a subset of the network. It uses a distributed hash table based on hashes of the nodes' IP addresses to organize the system. With a virtual tree structure, limited knowledge of other nodes is enough to route node lookups throughout the system. We use redundancy and bounds checking when performing lookups to prevent malicious nodes from returning false information without detection. We show that our scheme prevents attackers from biasing path selection, while incurring moderate overheads, as long as the fraction of malicious nodes is less than 20\%. Additionally, the system prevents attackers from obtaining a snapshot of the entire system until the number of attackers grows too large (e.g. 15\% for 10000 peers and 256 groups). The number of groups can be used as a tunable parameter in the system, depending on the number of peers, that can be used to balance performance and security},
www_section = {P2P, privacy},
isbn = {1-59593-518-5},
doi = {10.1145/1180405.1180409},
url = {http://portal.acm.org/citation.cfm?id=1180409},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Salsa.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Salsa.pdf},
author = {Arjun Nambiar}
}
@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 },
+ booktitle = {Sensor and Ad Hoc Communications and Networks, 2006. SECON '06. 2006 3rd Annual IEEE Communications Society on },
year = {2006},
month = sep,
abstract = {Routing in wireless networks is inherently difficult since their network topologies are typically unstructured and unstable. Therefore, many routing protocols for ad-hoc networks and sensor networks revert to flooding to acquire routes to previously unknown destinations. However, such an approach does not scale to large networks, especially when nodes need to communicate with many different destinations. This paper advocates a novel approach, the scalable source routing (SSR) protocol. It combines overlay-like routing in a virtual network structure with source routing in the physical network structure. As a consequence, SSR can efficiently provide the routing semantics of a structured routing overlay, making it an efficient basis for the scalable implementation of fully decentralized applications. In T. Fuhrmann (2005) it has been demonstrated that SSR can almost entirely avoid flooding, thus leading to a both memory and message efficient routing mechanism for large unstructured networks. This paper extends SSR to unstable networks, i. e. networks with churn where nodes frequently join and leave, the latter potentially ungracefully},
@@ -7460,7 +7506,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
This paper uses techniques from Secure Multiparty Computation (SMC) to develop {\textquotedblleft}secure protocols{\textquotedblright} for the CPFR (Collaborative Planning, Forecasting, and Replenishment) business process. The result is a process that permits supply-chain partners to capture all of the benefits of information-sharing and collaborative decision-making, but without disclosing their {\textquotedblleft}private{\textquotedblright} demandsignal (e.g., promotions) and cost information to one another. In our collaborative CPFR) scenario, the retailer and supplier engage in SMC protocols that result in: (1) a forecast that uses both the retailers and the suppliers observed demand signals to better forecast demand; and (2) prescribed order/shipment quantities based on system-wide costs and inventory levels (and on the joint forecasts) that minimize supply-chain expected cost/period. Our contributions are as follows: (1) we demonstrate that CPFR can be securely implemented without disclosing the private information of either partner; (2) we show that the CPFR business process is not incentive compatible without transfer payments and develop an incentive-compatible linear transfer-payment scheme for
collaborative forecasting; (3) we demonstrate that our protocols are not only secure (i.e., privacy preserving), but that neither partner is able to make accurate inferences about the others future demand signals from the outputs of the protocols; and (4) we illustrate the benefits of secure collaboration using simulation},
www_section = {chain computation management, CPFR, privacy, secure multi-party computation, secure supply, security, SMC},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Secure\%20Collaborative\%20Planning\%20Forecasting\%20and\%20Replenishment.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Secure\%20Collaborative\%20Planning\%20Forecasting\%20and\%20Replenishment.pdf},
author = {Atallah, Mikhail and Marina Blanton and Vinayak Deshpand and Frikken, Keith and Li, Jiangtao and Leroy Schwarz}
}
@article {brands06,
@@ -7472,7 +7518,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
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},
www_section = {authentication, cryptography, data sharing, privacy},
url = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=999695},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/brands06.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/brands06.pdf},
author = {Stefan Brands}
}
@conference {kutzner06securessr,
@@ -7484,12 +7530,12 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
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},
www_section = {cryptography, scalable source routing, sensor networks},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kutzner06securessr.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/kutzner06securessr.pdf},
author = {Kendy Kutzner and Christian Wallenta and Thomas Fuhrmann}
}
@conference {1158641,
title = {Security Considerations in Space and Delay Tolerant Networks},
- booktitle = {SMC-IT {\textquoteright}06: Proceedings of the 2nd IEEE International Conference on Space Mission Challenges for Information Technology},
+ booktitle = {SMC-IT '06: Proceedings of the 2nd IEEE International Conference on Space Mission Challenges for Information Technology},
year = {2006},
pages = {29--38},
publisher = {IEEE Computer Society},
@@ -7515,14 +7561,14 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
isbn = {978-3-540-68790-0},
doi = {10.1007/11957454},
url = {http://www.springerlink.com/content/n77w19002743xu51/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tap-pet2006.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/tap-pet2006.pdf},
author = {Ian Goldberg},
editor = {George Danezis and Philippe Golle}
}
@conference {Karnstedt2006SimilarityQueries,
title = {Similarity Queries on Structured Data in Structured Overlays},
booktitle = {Proceedings of the 22nd International Conference on Data Engineering Workshops},
- series = {ICDEW {\textquoteright}06},
+ series = {ICDEW '06},
year = {2006},
pages = {0--32},
publisher = {IEEE Computer Society},
@@ -7538,13 +7584,13 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
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},
www_section = {P2P},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/meis-paper04.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/meis-paper04.pdf},
editor = {unknown},
author = {Thomas Fuhrmann}
}
@conference {1170307,
title = {Storage Tradeoffs in a Collaborative Backup Service for Mobile Devices},
- booktitle = {EDCC {\textquoteright}06: Proceedings of the Sixth European Dependable Computing Conference},
+ booktitle = {EDCC '06: Proceedings of the Sixth European Dependable Computing Conference},
year = {2006},
pages = {129--138},
publisher = {IEEE Computer Society},
@@ -7554,7 +7600,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
isbn = {0-7695-2648-9},
doi = {10.1109/EDCC.2006.26},
url = {http://portal.acm.org/citation.cfm?id=1170307$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/slides.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/slides.pdf},
author = {Ludovic Courtes and Killijian, Marc-Olivier and Powell, David}
}
@article {Levine:2006,
@@ -7569,7 +7615,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
journal = {unknown},
www_section = {anonymity, security, Sybil attack},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_20,
@@ -7583,13 +7629,13 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
abstract = {In this survey, we summarize different modeling and solution concepts of networking games, as well as a number of different applications in telecommunications that make use of or can make use of networking games. We identify some of the mathematical challenges and methodologies that are involved in these problems. We include here work that has relevance to networking games in telecommunications from other areas, in particular from transportation planning},
www_section = {communication network, game theory},
doi = {10.1016/j.cor.2004.06.005},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/netgames.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/netgames.pdf},
author = {Eitan Altman and Thomas Boulogne and Rachid El-Azouzi and Tania Jim{\'e}nez and Laura Wynter}
}
@conference {Yu:2006:SDA:1159913.1159945,
title = {SybilGuard: defending against sybil attacks via social networks},
- booktitle = {SIGCOMM{\textquoteright}06. Proceedings of the 2006 conference on Applications, Technologies, Architectures, and Protocols for Computer Communications},
- series = {SIGCOMM {\textquoteright}06},
+ booktitle = {SIGCOMM'06. Proceedings of the 2006 conference on Applications, Technologies, Architectures, and Protocols for Computer Communications},
+ series = {SIGCOMM '06},
year = {2006},
month = sep,
pages = {267--278},
@@ -7601,7 +7647,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
isbn = {1-59593-308-5},
doi = {http://doi.acm.org/10.1145/1159913.1159945},
url = {http://doi.acm.org/10.1145/1159913.1159945},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%2706\%20-\%20SybilGuard.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SIGCOMM\%2706\%20-\%20SybilGuard.pdf},
author = {Yu, Haifeng and Kaminsky, Michael and Gibbons, Phillip B. and Flaxman, Abraham}
}
@article {citeulike:530977,
@@ -7616,7 +7662,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
www_section = {P2P, trust},
doi = {10.1016/j.comnet.2005.07.011},
url = {http://portal.acm.org/citation.cfm?id=1139713},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Marti-ElsevierScienceSubmitted05_0.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Marti-ElsevierScienceSubmitted05_0.pdf},
author = {Marti, Sergio and Hector Garcia-Molina}
}
@conference {ShWa-Timing06,
@@ -7631,7 +7677,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
isbn = {978-3-540-44601-9},
doi = {10.1007/11863908},
url = {http://www.springerlink.com/content/3n136578m4211484/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ShWa-Timing06.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ShWa-Timing06.pdf},
author = {Vitaly Shmatikov and Ming-Hsui Wang}
}
@conference {conf/infocom/SunHYL06,
@@ -7645,7 +7691,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
isbn = {1-4244-0349-9 },
doi = {10.1109/CISS.2006.286695 },
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Trust_infocom06_v4.pdf},
author = {Yan L. Sun and Zhu Han and Wei Yu and K. J. Ray Liu}
}
@book {2006_21,
@@ -7662,14 +7708,14 @@ This result immediately implies solutions to other long-standing open problems s
isbn = {978-3-540-32731-8},
doi = {10.1007/11681878_15},
url = {http://dx.doi.org/10.1007/11681878_15},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/UnconditionallySecure2006Damgard.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {Stutzbach:2006:UCP:1177080.1177105,
title = {Understanding churn in peer-to-peer networks},
- booktitle = {IMC{\textquoteright}06. Proceedings of the 6th ACM SIGCOMM Conference on Internet Measurement},
- series = {IMC {\textquoteright}06},
+ booktitle = {IMC'06. Proceedings of the 6th ACM SIGCOMM Conference on Internet Measurement},
+ series = {IMC '06},
year = {2006},
month = oct,
pages = {189--202},
@@ -7681,7 +7727,7 @@ This result immediately implies solutions to other long-standing open problems s
isbn = {1-59593-561-4},
doi = {http://doi.acm.org/10.1145/1177080.1177105},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IMC\%2706\%20-\%20Understanding\%20churn\%20in\%20p2p\%20networks.pdf},
author = {Stutzbach, Daniel and Rejaie, Reza}
}
@conference {valet:pet2006,
@@ -7698,7 +7744,7 @@ This result immediately implies solutions to other long-standing open problems s
isbn = {978-3-540-68790-0},
doi = {10.1007/11957454},
url = {http://www.springerlink.com/content/d58607007777r8l1/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/valet-pet2006.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/valet-pet2006.pdf},
author = {Lasse {\O}verlier and Paul Syverson},
editor = {George Danezis and Philippe Golle}
}
@@ -7725,7 +7771,7 @@ This result immediately implies solutions to other long-standing open problems s
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.102.5368.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.102.5368.pdf},
author = {J{\"o}rg Widmer}
}
@conference {pet05-borisov,
@@ -7741,7 +7787,7 @@ This result immediately implies solutions to other long-standing open problems s
isbn = {978-3-540-34745-3},
doi = {10.1007/11767831},
url = {http://www.springerlink.com/content/b0t0714165846m42/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pet05-borisov.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/pet05-borisov.pdf},
author = {Borisov, Nikita}
}
@mastersthesis {DiazThesis05,
@@ -7751,7 +7797,7 @@ This result immediately implies solutions to other long-standing open problems s
school = {Katholieke Universiteit Leuven},
type = {phd},
address = {Leuven, Belgium},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DiazThesis05.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/DiazThesis05.pdf},
author = {Claudia Diaz}
}
@booklet {Borisov:CSD-05-1390,
@@ -7762,7 +7808,7 @@ This result immediately implies solutions to other long-standing open problems s
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CSD-05-1390.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CSD-05-1390.pdf},
author = {Borisov, Nikita and Waddle, Jason}
}
@conference {sofem05-Klonowski,
@@ -7778,23 +7824,23 @@ We show that applying encoding based on universal re-encryption can solve many o
isbn = {978-3-540-24302-1},
doi = {10.1007/b105088},
url = {http://www.springerlink.com/content/9023b6ad0thaf51p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/sofem05-Klonowski.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/sofem05-Klonowski.pdf},
author = {Marek Klonowski and Miroslaw Kutylowski and Filip Zagorski}
}
@conference {1080833,
title = {Architecture and evaluation of an unplanned 802.11b mesh network},
- booktitle = {MobiCom {\textquoteright}05: Proceedings of the 11th annual international conference on Mobile computing and networking},
+ booktitle = {MobiCom '05: Proceedings of the 11th annual international conference on Mobile computing and networking},
year = {2005},
pages = {31--42},
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
- abstract = {This paper evaluates the ability of a wireless mesh architecture to provide high performance Internet access while demanding little deployment planning or operational management. The architecture considered in this paper has unplanned node placement (rather than planned topology), omni-directional antennas (rather than directional links), and multi-hop routing (rather than single-hop base stations). These design decisions contribute to ease of deployment, an important requirement for community wireless networks. However, this architecture carries the risk that lack of planning might render the network{\textquoteright}s performance unusably low. For example, it might be necessary to place nodes carefully to ensure connectivity; the omni-directional antennas might provide uselessly short radio ranges; or the inefficiency of multi-hop forwarding might leave some users effectively disconnected.The paper evaluates this unplanned mesh architecture with a case study of the Roofnet 802.11b mesh network. Roofnet consists of 37 nodes spread over four square kilometers of an urban area. The network provides users with usable performance despite lack of planning: the average inter-node throughput is 627 kbits/second, even though the average route has three hops.The paper evaluates multiple aspects of the architecture: the effect of node density on connectivity and throughput; the characteristics of the links that the routing protocol elects to use; the usefulness of the highly connected mesh afforded by omni-directional antennas for robustness and throughput; and the potential performance of a single-hop network using the same nodes as Roofnet},
+ abstract = {This paper evaluates the ability of a wireless mesh architecture to provide high performance Internet access while demanding little deployment planning or operational management. The architecture considered in this paper has unplanned node placement (rather than planned topology), omni-directional antennas (rather than directional links), and multi-hop routing (rather than single-hop base stations). These design decisions contribute to ease of deployment, an important requirement for community wireless networks. However, this architecture carries the risk that lack of planning might render the network's performance unusably low. For example, it might be necessary to place nodes carefully to ensure connectivity; the omni-directional antennas might provide uselessly short radio ranges; or the inefficiency of multi-hop forwarding might leave some users effectively disconnected.The paper evaluates this unplanned mesh architecture with a case study of the Roofnet 802.11b mesh network. Roofnet consists of 37 nodes spread over four square kilometers of an urban area. The network provides users with usable performance despite lack of planning: the average inter-node throughput is 627 kbits/second, even though the average route has three hops.The paper evaluates multiple aspects of the architecture: the effect of node density on connectivity and throughput; the characteristics of the links that the routing protocol elects to use; the usefulness of the highly connected mesh afforded by omni-directional antennas for robustness and throughput; and the potential performance of a single-hop network using the same nodes as Roofnet},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.62.3119.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.62.3119.pdf},
author = {Bicket, John and Aguayo, Daniel and Biswas, Sanjit and Robert Morris}
}
@article {1095816,
@@ -7811,12 +7857,12 @@ We show that applying encoding based on universal re-encryption can solve many o
issn = {0163-5980},
doi = {10.1145/1095809.1095816},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {Pouwelse05thebittorrent,
title = {The BiTtorrent P2P File-sharing System: Measurements and Analysis},
- booktitle = {IPTPS{\textquoteright}05. Proceedings of the 4th International Workshop on Peer-To-Peer Systems},
+ booktitle = {IPTPS'05. Proceedings of the 4th International Workshop on Peer-To-Peer Systems},
series = {Lecture Notes in Computer Science},
volume = {3640},
year = {2005},
@@ -7828,7 +7874,7 @@ We show that applying encoding based on universal re-encryption can solve many o
abstract = {Of the many P2P file-sharing prototypes in existence, BitTorrent is one of the few that has managed to attract millions of users. BitTorrent relies on other (global) components for file search, employs a moderator system to ensure the integrity of file data, and uses a bartering technique for downloading in order to prevent users from freeriding. In this paper we present a measurement study of BitTorrent in which we focus on four issues, viz. availability, integrity, flashcrowd handling, and download performance. The purpose of this paper is to aid in the understanding of a real P2P system that apparently has the right mechanisms to attract a large user community, to provide measurement data that may be useful in modeling P2P systems, and to identify design issues in such systems},
www_section = {BitTorrent, file-sharing},
doi = {10.1007/11558989_19},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IPTPS\%2705\%20-\%20The\%20BitTorrent\%3A\%20measurements\%20and\%20analysis.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IPTPS\%2705\%20-\%20The\%20BitTorrent\%3A\%20measurements\%20and\%20analysis.pdf},
author = {Johan Pouwelse and Garbacki, Pawel and Epema, Dick H. J. and Henk J. Sips}
}
@conference {ih05-Luke,
@@ -7844,12 +7890,12 @@ We show that applying encoding based on universal re-encryption can solve many o
isbn = {978-3-540-29039-1},
doi = {10.1007/11558859},
url = {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}
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ih05-Luke.pdf},
+ author = {Luke O'Connor}
}
@conference {1108067,
title = {Boundary Chord: A Novel Peer-to-Peer Algorithm for Replica Location Mechanism in Grid Environment},
- booktitle = {ISPAN {\textquoteright}05: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks},
+ booktitle = {ISPAN '05: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks},
year = {2005},
pages = {262--267},
publisher = {IEEE Computer Society},
@@ -7873,7 +7919,7 @@ We show that applying encoding based on universal re-encryption can solve many o
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/0409026v1.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/0409026v1.pdf},
author = {Henry D. Pfister and Igal Sason and R{\"u}diger L. Urbanke}
}
@conference {Zhuang05cashmere:resilient,
@@ -7882,9 +7928,9 @@ We show that applying encoding based on universal re-encryption can solve many o
year = {2005},
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},
+ 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'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cashmere.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cashmere.pdf},
author = {Li Zhuang and Feng Zhou and Ben Y. Zhao and Antony Rowstron}
}
@conference {ih05-csispir,
@@ -7895,12 +7941,12 @@ We show that applying encoding based on universal re-encryption can solve many o
pages = {62--76},
publisher = {Springer Berlin / Heidelberg},
organization = {Springer Berlin / Heidelberg},
- abstract = {{\textquotedblleft}Censorship resistant{\textquotedblright} systems attempt to prevent censors from imposing a particular distribution of content across a system. In this paper, we introduce a variation of censorship resistance (CR) that is resistant to selective filtering even by a censor who is able to inspect (but not alter) the internal contents and computations of each data server, excluding only the server{\textquoteright}s private signature key. This models a service provided by operators who do not hide their identities from censors. Even with such a strong adversarial model, our definition states that CR is only achieved if the censor must disable the entire system to filter selected content. We show that existing censorship resistant systems fail to meet this definition; that Private Information Retrieval (PIR) is necessary, though not sufficient, to achieve our definition of CR; and that CR is achieved through a modification of PIR for which known implementations exist},
+ abstract = {{\textquotedblleft}Censorship resistant{\textquotedblright} systems attempt to prevent censors from imposing a particular distribution of content across a system. In this paper, we introduce a variation of censorship resistance (CR) that is resistant to selective filtering even by a censor who is able to inspect (but not alter) the internal contents and computations of each data server, excluding only the server's private signature key. This models a service provided by operators who do not hide their identities from censors. Even with such a strong adversarial model, our definition states that CR is only achieved if the censor must disable the entire system to filter selected content. We show that existing censorship resistant systems fail to meet this definition; that Private Information Retrieval (PIR) is necessary, though not sufficient, to achieve our definition of CR; and that CR is achieved through a modification of PIR for which known implementations exist},
www_section = {censorship resistance, private information retrieval},
isbn = {978-3-540-29039-1},
doi = {10.1007/11558859},
url = {http://www.springerlink.com/content/f08707qw34614340/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ih05-csispir.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ih05-csispir.pdf},
author = {Ginger Perng and Michael K. Reiter and Chenxi Wang}
}
@conference {2005_0,
@@ -7920,17 +7966,17 @@ We show that applying encoding based on universal re-encryption can solve many o
issn = {1611-3349 (Online)},
doi = {10.1007/11558989},
url = {http://www.springerlink.com/content/l13550223q12l65v/about/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/chainsaw.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@booklet { guha05characterization,
title = {Characterization and measurement of tcp traversal through nats and firewalls},
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},
+ 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'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},
www_section = {firewall, NAT},
url = {http://portal.acm.org/citation.cfm?id=1251086.1251104},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/imc05-tcpnat.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/imc05-tcpnat.pdf},
author = {Saikat Guha and Paul Francis}
}
@conference {chl05-full:eurocrypt2005,
@@ -7942,13 +7988,13 @@ We show that applying encoding based on universal re-encryption can solve many o
pages = {302--321},
publisher = {Springer},
organization = {Springer},
- abstract = {This paper presents efficient off-line anonymous e-cash schemes where a user can withdraw a wallet containing 2^l coins each of which she can spend unlinkably. Our first result is a scheme, secure under the strong RSA and the y-DDHI assumptions, where the complexity of the withdrawal and spend operations is O(l+k) and the user{\textquoteright}s wallet can be stored using O(l+k) bits, where k is a security parameter. The best previously known schemes require at least one of these complexities to be O(2^l k). In fact, compared to previous e-cash schemes, our whole wallet of 2^l coins has about the same size as one coin in these schemes. Our scheme also offers exculpability of users, that is, the bank can prove to third parties that a user has double-spent.
+ abstract = {This paper presents efficient off-line anonymous e-cash schemes where a user can withdraw a wallet containing 2^l coins each of which she can spend unlinkably. Our first result is a scheme, secure under the strong RSA and the y-DDHI assumptions, where the complexity of the withdrawal and spend operations is O(l+k) and the user's wallet can be stored using O(l+k) bits, where k is a security parameter. The best previously known schemes require at least one of these complexities to be O(2^l k). In fact, compared to previous e-cash schemes, our whole wallet of 2^l coins has about the same size as one coin in these schemes. Our scheme also offers exculpability of users, that is, the bank can prove to third parties that a user has double-spent.
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/chl05-full-eurocrypt2005.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/chl05-full-eurocrypt2005.pdf},
author = {Jan Camenisch and Susan Hohenberger and Anna Lysyanskaya},
editor = {Ronald Cramer}
}
@@ -7965,7 +8011,7 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
isbn = {978-3-540-29039-1},
doi = {10.1007/11558859},
url = {http://www.springerlink.com/content/74461772r675l828/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ih05-danezisclulow.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ih05-danezisclulow.pdf},
author = {George Danezis and Jolyon Clulow}
}
@article {2005_1,
@@ -7975,38 +8021,38 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
year = {2005},
month = aug,
pages = {1457--1468},
- 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},
+ 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's immediate past action increases cooperation. Recursive information about the partners' previous partners' reputation further promotes cooperation, regardless of the cooperation costs},
www_section = {cooperation, experimental economics, reputation},
doi = {doi:10.1016/j.jpubeco.2004.03.008},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_2,
title = {Correctness of a gossip based membership protocol},
- booktitle = {PDOC{\textquoteright}05},
+ booktitle = {PDOC'05},
year = {2005},
publisher = {ACM},
organization = {ACM},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/gossip-podc05.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/gossip-podc05.pdf},
author = {Andre Allavena and Alan Demers and John E. Hopcroft}
}
@conference {Moore05counteringhidden-action,
title = {Countering Hidden-action Attacks on Networked Systems},
- booktitle = {WEIS{\textquoteright}05. Fourth Workshop on the Economics of Information Security},
+ booktitle = {WEIS'05. Fourth Workshop on the Economics of Information Security},
year = {2005},
month = jun,
address = {Cambridge, England},
abstract = {We define an economic category of hidden-action attacks: actions made attractive by a lack of observation. We then consider its implications for computer systems. Rather than structure contracts to compensate for incentive problems, we rely on insights from social capital theory to design network topologies and interactions that undermine the potential for hidden-action attacks},
www_section = {asymmetric information, computer security, decentralized, economics, information security, moral hazard, social capital},
doi = {10.1.1.119.8132},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WEIS\%2705\%20-\%20Moore\%20-\%20Counterin\%20hidden-action\%20attacks.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/WEIS\%2705\%20-\%20Moore\%20-\%20Counterin\%20hidden-action\%20attacks.pdf},
author = {Tyler Moore}
}
@conference {Massoulie:2005:CRS:1064212.1064215,
title = {Coupon replication systems},
- booktitle = {SIGMETRICS{\textquoteright}05. Proceedings of the 2005 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems},
- series = {SIGMETRICS {\textquoteright}05},
+ booktitle = {SIGMETRICS'05. Proceedings of the 2005 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems},
+ series = {SIGMETRICS '05},
year = {2005},
month = jun,
pages = {2--13},
@@ -8018,12 +8064,12 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
isbn = {1-59593-022-1},
doi = {http://doi.acm.org/10.1145/1064212.1064215},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SIGMETRICS\%2705\%20-\%20Coupon\%20replication\%20systems.pdf},
author = {Massouli{\'e}, Laurent and Vojnovi{\'c}, Milan}
}
@conference {Kostoulas:2005:DSS:1097873.1098292,
title = {Decentralized Schemes for Size Estimation in Large and Dynamic Groups},
- booktitle = {NCA{\textquoteright}05--Proceedings of the 4th IEEE International Symposium on Network Computing and Applications},
+ booktitle = {NCA'05--Proceedings of the 4th IEEE International Symposium on Network Computing and Applications},
year = {2005},
month = jul,
pages = {41--48},
@@ -8035,12 +8081,12 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
isbn = {0-7695-2326-9},
doi = {10.1109/NCA.2005.15},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {You05deepstore:,
title = {Deep Store: An archival storage system architecture},
- booktitle = {In Proceedings of the 21st International Conference on Data Engineering (ICDE{\textquoteright}05)},
+ booktitle = {In Proceedings of the 21st International Conference on Data Engineering (ICDE'05)},
year = {2005},
pages = {804--815},
publisher = {IEEE},
@@ -8050,7 +8096,7 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.76.5241.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.76.5241.pdf},
author = {Lawrence L. You and Kristal T. Pollack and Darrell D. E. Long}
}
@conference {Electrical04designingincentives,
@@ -8063,17 +8109,17 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Miami, FL, USA},
- abstract = {In a peer-to-peer network, nodes are typically required to route packets for each other. This leads to a problem of "free-loaders", nodes that use the network but refuse to route other nodes{\textquoteright} packets. In this paper we study ways of designing incentives to discourage free-loading. We model the interactions between nodes as a "random matching game", and describe a simple reputation system that provides incentives for good behavior. Under certain assumptions, we obtain a stable subgame-perfect equilibrium. We use simulations to investigate the robustness of this scheme in the presence of noise and malicious nodes, and we examine some of the design trade-offs. We also evaluate some possible adversarial strategies, and discuss how our results might apply to real peer-to-peer systems},
+ abstract = {In a peer-to-peer network, nodes are typically required to route packets for each other. This leads to a problem of "free-loaders", nodes that use the network but refuse to route other nodes' packets. In this paper we study ways of designing incentives to discourage free-loading. We model the interactions between nodes as a "random matching game", and describe a simple reputation system that provides incentives for good behavior. Under certain assumptions, we obtain a stable subgame-perfect equilibrium. We use simulations to investigate the robustness of this scheme in the presence of noise and malicious nodes, and we examine some of the design trade-offs. We also evaluate some possible adversarial strategies, and discuss how our results might apply to real peer-to-peer systems},
www_section = {economics, free-loader, free-loading, peer-to-peer networking, system design},
isbn = {0743-166X },
issn = {0-7803-8968-9 },
doi = {10.1109/INFCOM.2005.1497907 },
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/INFOCOM\%2705\%20-\%20Designing\%20incentives\%20for\%20peer-to-peer\%20routing.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/INFOCOM\%2705\%20-\%20Designing\%20incentives\%20for\%20peer-to-peer\%20routing.pdf},
author = {Alberto Blanc and Yi-Kai Liu and Vahdat, Amin}
}
@conference {1251207,
title = {Detecting BGP configuration faults with static analysis},
- booktitle = {NSDI{\textquoteright}05: Proceedings of the 2nd conference on Symposium on Networked Systems Design \& Implementation},
+ booktitle = {NSDI'05: Proceedings of the 2nd conference on Symposium on Networked Systems Design \& Implementation},
year = {2005},
pages = {43--56},
publisher = {USENIX Association},
@@ -8084,7 +8130,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},
www_section = {autonomous systems, border gateway protocol},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.113.5668.pdf},
author = {Nick Feamster and Hari Balakrishnan}
}
@conference {Khorshadi:2005:DPR:1090948.1091369,
@@ -8101,7 +8147,7 @@ This paper describes the design and implementation of rcc, the router configurat
isbn = {0-7695-2417-6},
doi = {10.1109/HOT-P2P.2005.9},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/HOT-P2P\%2705\%20-\%20Khorshadi\%2C\%20Liu\%20\%26\%20Ghosal.pdf},
author = {Khorshadi, Behrooz and Liu, Xin and Dipak Ghosal}
}
@book {2005_3,
@@ -8116,7 +8162,7 @@ This paper describes the design and implementation of rcc, the router configurat
abstract = {In the last few years, an increasing number of massively distributed systems with millions of participants has emerged within very short time frames. Applications, such as instant messaging, file-sharing, and content distribution have attracted countless numbers of users. For example, Skype gained more than 2.5 millions of users within twelve months, and more than 50\% of Internet traffic is originated by BitTorrent. These very large and still rapidly growing systems attest to a new era for the design and deployment of distributed systems. In particular, they reflect what the major challenges are today for designing and implementing distributed systems: scalability, flexibility, and instant deployment},
www_section = {distributed hash table},
doi = {10.1007/11530657_7},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/LNCS\%20-\%20Distributed\%20Hash\%20Tables.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/LNCS\%20-\%20Distributed\%20Hash\%20Tables.pdf},
author = {Klaus Wehrle and G{\"o}tz, Stefan and Rieche, Simon}
}
@conference {2005_4,
@@ -8130,7 +8176,7 @@ This paper describes the design and implementation of rcc, the router configurat
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/maze_freeride.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/maze_freeride.pdf},
author = {Yang, Mao and Zhang, Zheng and Li, Xiaoming and Dai, Yafei}
}
@article {Bickson05theemule,
@@ -8144,7 +8190,7 @@ This paper describes the design and implementation of rcc, the router configurat
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"},
journal = {unknown},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.60.7750_0.pdf},
author = {Yoram Kulbak and Danny Bickson}
}
@conference {Wang05erasure-codingbased,
@@ -8158,7 +8204,7 @@ This paper describes the design and implementation of rcc, the router configurat
www_section = {delay tolerant network, routing},
doi = {10.1145/1080139.1080140},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.79.364.pdf},
author = {Wang, Yong and Sushant Jain and Martonosi, Margaret and Fall, Kevin}
}
@conference {2005_5,
@@ -8174,7 +8220,7 @@ This paper describes the design and implementation of rcc, the router configurat
www_section = {exchange-based mechanism, peer-to-peer networking, sharing},
isbn = {0-7695-2086-3 },
doi = {10.1109/ICDCS.2004.1281619},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ICDCS\%2704.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ICDCS\%2704.pdf},
author = {Kostas G. Anagnostakis and Michael B. Greenwald}
}
@conference {conf/infocom/GollapudiSZ05,
@@ -8191,7 +8237,7 @@ This paper describes the design and implementation of rcc, the router configurat
isbn = {0-7803-8968-9 },
doi = {10.1109/INFCOM.2005.1498490 },
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/INFOCOM\%2705\%20-\%20Exploiting\%20anarchy\%20in\%20networks.pdf},
author = {Gollapudi, Sreenivas and Sivakumar, D. and Zhang, Aidong}
}
@article {10.1109/MOBIQUITOUS.2005.29,
@@ -8216,7 +8262,7 @@ This paper describes the design and implementation of rcc, the router configurat
address = {Los Alamitos, CA, USA},
issn = {1526-7539},
doi = {http://doi.ieeecomputersociety.org/10.1109/MASCOT.2005.73},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SBirrer-dhtBasedMulticast_0.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SBirrer-dhtBasedMulticast_0.pdf},
author = {Stefan Birrer and Fabian E. Bustamante}
}
@conference {Wang05findingcollisions,
@@ -8231,7 +8277,7 @@ This paper describes the design and implementation of rcc, the router configurat
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SHA1AttackProceedingVersion.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SHA1AttackProceedingVersion.pdf},
author = {Xiaoyun Wang and Yiqun Lisa Yin and Hongbo Yu}
}
@book {DBLP:conf/p2p/EberspacherS05a,
@@ -8253,7 +8299,7 @@ This paper describes the design and implementation of rcc, the router configurat
year = {2005},
pages = {25--30},
www_section = {distributed hash table, openDHT, peer-to-peer, PlanetLab},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/opendht-fixing.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/opendht-fixing.pdf},
author = {Rhea, S. and Chun, B.G. and Kubiatowicz, J. and S Shenker}
}
@conference {Fu::FlowMarking::2005,
@@ -8267,7 +8313,7 @@ This paper describes the design and implementation of rcc, the router configurat
www_section = {802.11, anonymity, Bluetooth, flow marking attack},
isbn = {0-7695-2331-5},
url = {http://portal.acm.org/citation.cfm?id=1069397},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Fu--FlowMarking--2005.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Fu--FlowMarking--2005.pdf},
author = {Xinwen Fu and Ye Zhu and Bryan Graham and Riccardo Bettati and Wei Zhao}
}
@conference {camlys05,
@@ -8284,7 +8330,7 @@ We provide a formal definition of onion-routing in the universally composable fr
isbn = {978-3-540-28114-6},
doi = {10.1007/11535218},
url = {http://www.springerlink.com/content/0jmg1krt9ph147ql/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/camlys05.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/camlys05.pdf},
author = {Jan Camenisch and Anna Lysyanskaya},
editor = {Victor Shoup}
}
@@ -8297,16 +8343,16 @@ We provide a formal definition of onion-routing in the universally composable fr
publisher = {IEEE Computer Society},
chapter = {1},
address = {Los Alamitos, CA, USA},
- abstract = {Individuals who use peer-to-peer (P2P) file-sharing networks such as Gnutella face a social dilemma. They must decide whether to contribute to the common good by sharing files or to maximize their personal experience by free riding, downloading files while not contributing any to the network. Individuals gain no personal benefits from uploading files (in fact, it{\textquoteright}s inconvenient), so it{\textquoteright}s "rational" for users to free ride. However, significant numbers of free riders degrade the entire system{\textquoteright}s utility, creating a "tragedy of the digital commons." In this article, a new analysis of free riding on the Gnutella network updates data from 2000 and points to an increasing downgrade in the network{\textquoteright}s overall performance and the emergence of a "metatragedy" of the commons among Gnutella developers},
+ abstract = {Individuals who use peer-to-peer (P2P) file-sharing networks such as Gnutella face a social dilemma. They must decide whether to contribute to the common good by sharing files or to maximize their personal experience by free riding, downloading files while not contributing any to the network. Individuals gain no personal benefits from uploading files (in fact, it's inconvenient), so it's "rational" for users to free ride. However, significant numbers of free riders degrade the entire system's utility, creating a "tragedy of the digital commons." In this article, a new analysis of free riding on the Gnutella network updates data from 2000 and points to an increasing downgrade in the network's overall performance and the emergence of a "metatragedy" of the commons among Gnutella developers},
www_section = {distributed systems, free riding, Gnutella, peer-to-peer networking},
issn = {1541-4922},
doi = {http://doi.ieeecomputersociety.org/10.1109/MDSO.2005.31},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IEEE\%20DSO\%20-\%20Free\%20riding\%20on\%20Gnutella\%20revisited.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IEEE\%20DSO\%20-\%20Free\%20riding\%20on\%20Gnutella\%20revisited.pdf},
author = {Daniel Hughes and Geoff Coulson and James Walkerdine}
}
@conference {2005_6,
title = {Fuzzy Identity-Based Encryption},
- booktitle = {EUROCRYPT{\textquoteright}05 Workshop on the Theory and Application of of Cryptographic Techniques},
+ booktitle = {EUROCRYPT'05 Workshop on the Theory and Application of of Cryptographic Techniques},
series = {Lecture Notes in Computer Science},
volume = {3494},
year = {2005},
@@ -8318,7 +8364,7 @@ We provide a formal definition of onion-routing in the universally composable fr
using biometric inputs as identities; the error-tolerance property of a Fuzzy IBE scheme is precisely what allows for the use of biometric identities, which inherently will have some noise each time they are sampled. Additionally, we show that Fuzzy-IBE can be used for a type of application that we term {\textquotedblleft}attribute-based encryption{\textquotedblright}.
In this paper we present two constructions of Fuzzy IBE schemes. Our constructions can be viewed as an Identity-Based Encryption of a message under several attributes that compose a (fuzzy) identity. Our IBE schemes are both error-tolerant and secure against collusion attacks. Additionally, our basic construction does not use random oracles. We prove the security of our schemes under the Selective-ID security model},
www_section = {Fuzzy IBE, IBE},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EUROCRYPT\%2705\%20-\%20Fuzzy\%20Identity-Based\%20Encryption.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/EUROCRYPT\%2705\%20-\%20Fuzzy\%20Identity-Based\%20Encryption.pdf},
author = {Amit Sahai and Waters, Brent}
}
@article {Jelasity:2005:GAL:1082469.1082470,
@@ -8335,7 +8381,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
issn = {0734-2071},
doi = {http://doi.acm.org/10.1145/1082469.1082470},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Jelasity\%2C\%20Montresor\%20\%26\%20Babaoglu\%20-\%20Gossip-based\%20aggregation.pdf},
author = {M{\'a}rk Jelasity and Alberto Montresor and Babaoglu, Ozalp}
}
@conference {Godfrey05heterogeneityand,
@@ -8345,13 +8391,13 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
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},
www_section = {Chord, distributed hash table, load balancing},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/paper.pdf},
author = {Godfrey, Brighten and Ion Stoica}
}
@conference {Feldman:2005:HMR:1064009.1064022,
title = {Hidden-action in multi-hop routing},
- booktitle = {EC{\textquoteright}05. Proceedings of the 6th ACM Conference on Electronic Commerce},
- series = {EC {\textquoteright}05},
+ booktitle = {EC'05. Proceedings of the 6th ACM Conference on Electronic Commerce},
+ series = {EC '05},
year = {2005},
month = jun,
pages = {117--126},
@@ -8363,12 +8409,12 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
isbn = {1-59593-049-3},
doi = {http://doi.acm.org/10.1145/1064009.1064022},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/EC\%2705\%20-\%20Hidden-action\%20in\%20multi-hop\%20routing.pdf},
author = {Michal Feldman and John Chuang and Ion Stoica and S Shenker}
}
@conference {IPTPS05,
title = {High Availability in DHTs: Erasure Coding vs. Replication},
- booktitle = {IPTPS{\textquoteright}05--Proceedings of the 4th International Workshop in Peer-to-Peer Systems},
+ booktitle = {IPTPS'05--Proceedings of the 4th International Workshop in Peer-to-Peer Systems},
series = {Lecture Notes in Computer Science},
volume = {3640},
year = {2005},
@@ -8379,12 +8425,12 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
abstract = {High availability in peer-to-peer DHTs requires data redundancy. This paper compares two popular redundancy schemes: replication and erasure coding. Unlike previous comparisons, we take the characteristics of the nodes that comprise the overlay into account, and conclude that in some cases the benefits from coding are limited, and may not be worth its disadvantages},
www_section = {distributed hash table, erasure coding, high availability, peer-to-peer networking, redundancy, Replication},
doi = {10.1007/11558989_21},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IPTPS\%2705\%20-\%20High\%20availability\%20in\%20DHTs\%3A\%20erasure\%20coding\%20vs.\%20replication.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IPTPS\%2705\%20-\%20High\%20availability\%20in\%20DHTs\%3A\%20erasure\%20coding\%20vs.\%20replication.pdf},
author = {Rodrigues, Rodrigo and Barbara Liskov}
}
@conference {Acedanski05howgood,
title = {How good is random linear coding based distributed networked storage?},
- booktitle = {NetCod{\textquoteright}05--First Workshop on Network Coding, Theory, and Applications},
+ booktitle = {NetCod'05--First Workshop on Network Coding, Theory, and Applications},
year = {2005},
month = apr,
publisher = {Citeseer},
@@ -8392,7 +8438,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
address = {Riva del Garda, Italy},
abstract = {We consider the problem of storing a large file or multiple large files in a distributed manner over a network. In the framework we consider, there are multiple storage locations, each of which only have very limited storage space for each file. Each storage location chooses a part (or a coded version of the parts) of the file without the knowledge of what is stored in the other locations. We want a file-downloader to connect to as few storage locations as possible and retrieve the entire file. We compare the performance of three strategies: uncoded storage, traditional erasure coding based storage, random linear coding based storage motivated by network coding. We demonstrate that, in principle, a traditional erasure coding based storage (eg: Reed-Solomon Codes) strategy can almost do as well as one can ask for with appropriate choice of parameters. However, the cost is a large amount of additional storage space required at the centralized server before distribution among multiple locations. The random linear coding based strategy performs as well without suffering from any such disadvantage. Further, with a probability close to one, the minimum number of storage location a downloader needs to connect to (for reconstructing the entire file), can be very close to the case where there is complete coordination between the storage locations and the downloader. We also argue that an uncoded strategy performs poorly},
www_section = {distributed networked storage, limited storage, linear coding, multiple storage locations},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NetCod\%2705\%20-\%20Random\%20linear\%20coding\%20based\%20distributed\%20networked\%20storage.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/NetCod\%2705\%20-\%20Random\%20linear\%20coding\%20based\%20distributed\%20networked\%20storage.pdf},
author = {Szymon Aceda{\'n}ski and Supratim Deb and Muriel M{\'e}dard and Ralf Koetter}
}
@article {Zoels05thehybrid,
@@ -8405,28 +8451,28 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
issn = {0302-9743},
doi = {10.1007/b107118},
url = {http://www.springerlink.com/content/pdn9ttp0bvk0f3e9/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.68.7579.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.68.7579.pdf},
author = {Stefan Z{\"o}ls and R{\"u}diger Schollmeier and Wolfgang Kellerer and Anthony Tarlano}
}
@conference {1103797,
title = {Hydra: a platform for survivable and secure data storage systems},
- booktitle = {StorageSS {\textquoteright}05: Proceedings of the 2005 ACM workshop on Storage security and survivability},
+ booktitle = {StorageSS '05: Proceedings of the 2005 ACM workshop on Storage security and survivability},
year = {2005},
pages = {108--114},
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
- abstract = {This paper introduces Hydra, a platform that we are developing for highly survivable and secure data storage systems that distribute information over networks and adapt timely to environment changes, enabling users to store and access critical data in a continuously available and highly trustable fashion. The Hydra platform uses MDS array codes that can be encoded and decoded efficiently for distributing and recovering user data. Novel uses of MDS array codes in Hydra are discussed, as well as Hydra{\textquoteright}s design goals, general structures and a set of basic operations on user data. We also explore Hydra{\textquoteright}s applications in survivable and secure data storage systems},
+ abstract = {This paper introduces Hydra, a platform that we are developing for highly survivable and secure data storage systems that distribute information over networks and adapt timely to environment changes, enabling users to store and access critical data in a continuously available and highly trustable fashion. The Hydra platform uses MDS array codes that can be encoded and decoded efficiently for distributing and recovering user data. Novel uses of MDS array codes in Hydra are discussed, as well as Hydra's design goals, general structures and a set of basic operations on user data. We also explore Hydra's applications in survivable and secure data storage systems},
www_section = {storage},
isbn = {1-59593-233-X},
doi = {10.1145/1103780.1103797},
url = {http://portal.acm.org/citation.cfm?id=1103797$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/w8paper13.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/w8paper13.pdf},
author = {Lihao Xu}
}
@conference {1095944,
title = {Impacts of packet scheduling and packet loss distribution on FEC Performances: observations and recommendations},
- booktitle = {CoNEXT{\textquoteright}05: Proceedings of the 2005 ACM conference on Emerging network experiment and technology},
+ booktitle = {CoNEXT'05: Proceedings of the 2005 ACM conference on Emerging network experiment and technology},
year = {2005},
pages = {166--176},
publisher = {ACM Press},
@@ -8437,7 +8483,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/RR-5578.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/RR-5578.pdf},
author = {Christoph Neumann and Aur{\'e}lien Francillon and David Furodet}
}
@article {1646697,
@@ -8449,53 +8495,53 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
pages = {1669--1679},
publisher = {Butterworth-Heinemann},
address = {Newton, MA, USA},
- abstract = {Delivering multicast data using application layer approaches offers different advantages, as group members communicate using so-called overlay networks. These consist of a multicast group{\textquoteright}s members connected by unicast tunnels. Since existing approaches for application layer delivery of multicast data in mobile ad hoc networks (short MANETs) only deal with routing but not with error recovery, this paper evaluates tailored mechanisms for handling packet losses and congested networks. Although illustrated at the example of a specific protocol, the mechanisms may be applied to arbitrary overlays. This paper also investigates how application layer functionality based on overlay networks can turn existing multicast routing protocols (like ODMRP, M-AODV,...) into (almost) reliable transport protocols},
+ abstract = {Delivering multicast data using application layer approaches offers different advantages, as group members communicate using so-called overlay networks. These consist of a multicast group's members connected by unicast tunnels. Since existing approaches for application layer delivery of multicast data in mobile ad hoc networks (short MANETs) only deal with routing but not with error recovery, this paper evaluates tailored mechanisms for handling packet losses and congested networks. Although illustrated at the example of a specific protocol, the mechanisms may be applied to arbitrary overlays. This paper also investigates how application layer functionality based on overlay networks can turn existing multicast routing protocols (like ODMRP, M-AODV,...) into (almost) reliable transport protocols},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.68.5832.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.68.5832.pdf},
author = {Baumung, Peter and Martina Zitterbart and Kendy Kutzner}
}
@conference {Jun:2005:IBI:1080192.1080199,
title = {Incentives in BitTorrent Induce Free Riding},
- booktitle = {P2PECON{\textquoteright}05. Proceedings of the 2005 ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems},
- series = {P2PECON {\textquoteright}05},
+ booktitle = {P2PECON'05. Proceedings of the 2005 ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems},
+ series = {P2PECON '05},
year = {2005},
month = aug,
pages = {116--121},
publisher = {ACM},
organization = {ACM},
address = {Philadelphia, Pennsylvania, USA},
- abstract = {We investigate the incentive mechanism of BitTorrent, which is a peer-to-peer file distribution system. As downloaders in BitTorrent are faced with the conflict between the eagerness to download and the unwillingness to upload, we relate this problem to the iterated prisoner{\textquoteright}s dilemma, which suggests guidelines to design a good incentive mechanism. Based on these guidelines, we propose a new, simple incentive mechanism. Our analysis and the experimental results using PlanetLab show that the original incentive mechanism of BitTorrent can induce free riding because it is not effective in rewarding and punishing downloaders properly. In contrast, a new mechanism proposed by us is shown to be more robust against free riders},
- www_section = {BitTorrent, data dissemination, prisoner{\textquoteright}s dilemma, strategy},
+ abstract = {We investigate the incentive mechanism of BitTorrent, which is a peer-to-peer file distribution system. As downloaders in BitTorrent are faced with the conflict between the eagerness to download and the unwillingness to upload, we relate this problem to the iterated prisoner's dilemma, which suggests guidelines to design a good incentive mechanism. Based on these guidelines, we propose a new, simple incentive mechanism. Our analysis and the experimental results using PlanetLab show that the original incentive mechanism of BitTorrent can induce free riding because it is not effective in rewarding and punishing downloaders properly. In contrast, a new mechanism proposed by us is shown to be more robust against free riders},
+ www_section = {BitTorrent, data dissemination, prisoner'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/P2PECON\%2705\%20-\%20Incentives\%20in\%20BitTorrent\%20induce\%20free\%20riding.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/P2PECON\%2705\%20-\%20Incentives\%20in\%20BitTorrent\%20induce\%20free\%20riding.pdf},
author = {Jun, Seung and Ahamad, Mustaque}
}
@conference {Andrade:2005:ICB:1080192.1080198,
title = {Influences on cooperation in BitTorrent communities},
- booktitle = {P2PEcon{\textquoteright}05. Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems},
- series = {P2PECON {\textquoteright}05},
+ booktitle = {P2PEcon'05. Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems},
+ series = {P2PECON '05},
year = {2005},
month = aug,
pages = {111--115},
publisher = {ACM},
organization = {ACM},
address = {Philadelphia, Pennsylvania, USA},
- abstract = {We collect BitTorrent usage data across multiple file-sharing communities and analyze the factors that affect users{\textquoteright} cooperative behavior. We find evidence that the design of the BitTorrent protocol results in increased cooperative behavior over other P2P protocols used to share similar content (e.g. Gnutella). We also investigate two additional community-specific mechanisms that foster even more cooperation},
+ abstract = {We collect BitTorrent usage data across multiple file-sharing communities and analyze the factors that affect users' cooperative behavior. We find evidence that the design of the BitTorrent protocol results in increased cooperative behavior over other P2P protocols used to share similar content (e.g. Gnutella). We also investigate two additional community-specific mechanisms that foster even more cooperation},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/coopbittorrentcom_0.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/coopbittorrentcom_0.pdf},
author = {Nazareno Andrade and Miranda Mowbray and Lima, Aliandro and Wagner, Gustavo and Ripeanu, Matei}
}
@proceedings {2005_7,
booktitle = {On the Interaction Between Overlay Routing and Underlay Routing },
- journal = {IEEE INFOCOM {\textquoteright}05},
+ journal = {IEEE INFOCOM '05},
year = {2005},
pages = {2543--2553},
editor = {unknown},
@@ -8508,10 +8554,10 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
pages = {365--370},
type = {publication},
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},
+ 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' 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},
www_section = {P2P},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cramer05isprp.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cramer05isprp.pdf},
author = {Cramer, Curt and Thomas Fuhrmann}
}
@article {1064217,
@@ -8528,7 +8574,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
issn = {0163-5999},
doi = {10.1145/1071690.1064217},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.83.5920.pdf},
author = {Leonard, Derek and Rai, Vivek and Loguinov, Dmitri}
}
@conference {esorics05-Klonowski,
@@ -8545,7 +8591,7 @@ Our results contradict some beliefs that the protocols mentioned guarantee anony
isbn = {978-3-540-28963-0},
doi = {10.1007/11555827},
url = {http://www.springerlink.com/content/ewblt5k80xrgqe4j/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/esorics05-Klonowski.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/esorics05-Klonowski.pdf},
author = {Marcin Gogolewski and Marek Klonowski and Miroslaw Kutylowski}
}
@article {1042380,
@@ -8575,7 +8621,7 @@ Our results contradict some beliefs that the protocols mentioned guarantee anony
www_section = {anonymity, onion routing, traffic analysis},
isbn = {0-7695-2339-0},
url = {http://portal.acm.org/citation.cfm?id=1059390},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/torta05.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/torta05.pdf},
author = {Steven J. Murdoch and George Danezis}
}
@conference {Fiat05makingchord,
@@ -8589,12 +8635,12 @@ Our results contradict some beliefs that the protocols mentioned guarantee anony
www_section = {Chord, distributed hash table, robustness},
doi = {10.1007/11561071},
url = {http://www.springerlink.com/content/422llxn7khwej72n/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/swarm.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/swarm.pdf},
author = {Amos Fiat and Jared Saia and Maxwell Young}
}
@conference { wang:market-driven,
title = {Market-driven bandwidth allocation in selfish overlay networks},
- booktitle = {INFOCOM{\textquoteright}05. Proceedings of the 24th IEEE International Conference on Computer Communications},
+ booktitle = {INFOCOM'05. Proceedings of the 24th IEEE International Conference on Computer Communications},
year = {2005},
month = mar,
pages = {2578--2589},
@@ -8605,13 +8651,13 @@ Our results contradict some beliefs that the protocols mentioned guarantee anony
www_section = {bandwidth allocation, economics, market-driven, prescribed protocol, selfish overlay network},
isbn = {0-7803-8968-9 },
doi = {http://dx.doi.org/10.1109/INFCOM.2005.1498542},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/INFOCOM\%2705\%20-\%20Market-driven\%20bandwidth\%20allocation.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/INFOCOM\%2705\%20-\%20Market-driven\%20bandwidth\%20allocation.pdf},
author = {Weihong Wang and Baochun Li}
}
@conference {Guo:2005:MAM:1251086.1251090,
title = {Measurements, analysis, and modeling of BitTorrent-like systems},
- booktitle = {IMC{\textquoteright}05. Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement},
- series = {IMC {\textquoteright}05},
+ booktitle = {IMC'05. Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement},
+ series = {IMC '05},
year = {2005},
month = oct,
pages = {4--4},
@@ -8621,7 +8667,7 @@ Our results contradict some beliefs that the protocols mentioned guarantee anony
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},
www_section = {bittorrent system, intertorrent collaboration, multi-torrent collaboration, multiple torrents},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {kutzner05overnet,
@@ -8636,7 +8682,7 @@ This paper reports the results from a two week measurement of the entire Overnet
isbn = {978-3-540-24473-8},
doi = {10.1007/b138861},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kutzner05overnet.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/kutzner05overnet.pdf},
author = {Kendy Kutzner and Thomas Fuhrmann}
}
@conference {pet05-serjantov,
@@ -8647,12 +8693,12 @@ This paper reports the results from a two week measurement of the entire Overnet
pages = {26--39},
publisher = {Springer Berlin / Heidelberg},
organization = {Springer Berlin / Heidelberg},
- abstract = {We review threat models used in the evaluation of anonymity systems{\textquoteright} vulnerability to traffic analysis. We then suggest that, under the partial adversary model, if multiple packets have to be sent through these systems, more anonymity can be achieved if senders route the packets via different paths. This is in contrast to the normal technique of using the same path for them all. We comment on the implications of this for message-based and connection-based anonymity systems. We then proceed to examine the only remaining traffic analysis attack -- one which considers the entire system as a black box. We show that it is more difficult to execute than the literature suggests, and attempt to empirically estimate the parameters of the Mixmaster and the Mixminion systems needed in order to successfully execute the attack},
+ abstract = {We review threat models used in the evaluation of anonymity systems' vulnerability to traffic analysis. We then suggest that, under the partial adversary model, if multiple packets have to be sent through these systems, more anonymity can be achieved if senders route the packets via different paths. This is in contrast to the normal technique of using the same path for them all. We comment on the implications of this for message-based and connection-based anonymity systems. We then proceed to examine the only remaining traffic analysis attack -- one which considers the entire system as a black box. We show that it is more difficult to execute than the literature suggests, and attempt to empirically estimate the parameters of the Mixmaster and the Mixminion systems needed in order to successfully execute the attack},
www_section = {anonymity, traffic analysis},
isbn = {978-3-540-34745-3},
doi = {10.1007/11767831},
url = {http://www.springerlink.com/content/375x2pv385388h86/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pet05-serjantov.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/pet05-serjantov.pdf},
author = {Andrei Serjantov and Steven J. Murdoch}
}
@conference {pet05-camenisch,
@@ -8672,7 +8718,7 @@ This paper reports the results from a two week measurement of the entire Overnet
}
@conference { gkantsidis:network,
title = {Network coding for large scale content distribution},
- booktitle = {INFOCOM{\textquoteright}05. Proceedings of the 24th IEEE International Conference on Computer Communications},
+ booktitle = {INFOCOM'05. Proceedings of the 24th IEEE International Conference on Computer Communications},
year = {2005},
month = mar,
pages = {2235--2245},
@@ -8683,13 +8729,13 @@ This paper reports the results from a two week measurement of the entire Overnet
www_section = {large scale content distribution, network coding},
isbn = {0-7803-8968-9 },
doi = {http://dx.doi.org/10.1109/INFCOM.2005.1498511},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/INFOCOM\%2705\%20-\%20Network\%20coding\%20for\%20large\%20scale\%20content\%20distribution.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/INFOCOM\%2705\%20-\%20Network\%20coding\%20for\%20large\%20scale\%20content\%20distribution.pdf},
author = {Christos Gkantsidis and Pablo Rodriguez}
}
@conference {Sanghavi:2005:NMF:1080192.1080200,
title = {A new mechanism for the free-rider problem},
- booktitle = {P2PEcon{\textquoteright}05. Proceedings of the 2005 ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems},
- series = {P2PECON {\textquoteright}05},
+ booktitle = {P2PEcon'05. Proceedings of the 2005 ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems},
+ series = {P2PECON '05},
year = {2005},
month = aug,
pages = {122--127},
@@ -8701,12 +8747,12 @@ This paper reports the results from a two week measurement of the entire Overnet
isbn = {1-59593-026-4},
doi = {http://doi.acm.org/10.1145/1080192.1080200},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/P2PEcon\%2705\%20-\%20A\%20new\%20mechanism\%20for\%20the\%20free-rider\%20problem.pdf},
author = {Sanghavi, Sujay and Hajek, Bruce}
}
@conference {1251532,
title = {Non-transitive connectivity and DHTs},
- booktitle = {WORLDS{\textquoteright}05: Proceedings of the 2nd conference on Real, Large Distributed Systems},
+ booktitle = {WORLDS'05: Proceedings of the 2nd conference on Real, Large Distributed Systems},
year = {2005},
pages = {55--60},
publisher = {USENIX Association},
@@ -8715,7 +8761,7 @@ This paper reports the results from a two week measurement of the entire Overnet
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},
www_section = {Chord, distributed hash table},
url = {http://portal.acm.org/citation.cfm?id=1251532$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ntr-worlds05.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ntr-worlds05.pdf},
author = {Michael J. Freedman and Lakshminarayanan, Karthik and Rhea, Sean C. and Ion Stoica}
}
@booklet {cryptoeprint:2005:394,
@@ -8727,12 +8773,12 @@ 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},
www_section = {obfuscated ciphertext mixing},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cryptoeprint-2005-394.pdf},
author = {Ben Adida and Douglas Wikstr{\"o}m}
}
@conference {Garcia05off-linekarma:,
title = {Off-line Karma: A Decentralized Currency for Peer-to-peer and Grid Applications},
- booktitle = {ACNS{\textquoteright}05. 3rd Applied Cryptography and Network Security Conference},
+ booktitle = {ACNS'05. 3rd Applied Cryptography and Network Security Conference},
series = {Lecture Notes in Computer Science},
volume = {3531},
year = {2005},
@@ -8744,13 +8790,13 @@ We introduce and implement Obfuscated Ciphertext Mixing, the obfuscation of a mi
abstract = {Peer-to-peer (P2P) and grid systems allow their users to exchange information and share resources, with little centralised or hierarchical control, instead relying on the fairness of the users to make roughly as much resources available as they use. To enforce this balance, some kind of currency or barter (called karma) is needed that must be exchanged for resources thus limiting abuse. We present a completely decentralised, off-line karma implementation for P2P and grid systems, that detects double-spending and other types of fraud under varying adversarial scenarios. The system is based on tracing the spending pattern of coins, and distributing the normally central role of a bank over a predetermined, but random, selection of nodes. The system is designed to allow nodes to join and leave the system at arbitrary times},
www_section = {decentralized, free-riding, GRID, micropayments, peer-to-peer networking, security},
doi = {10.1007/11496137_25},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ACNS\%2705\%20-\%20Garcia\%20\%26\%20Hoepman\%20-\%20Off-line\%20Karma.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ACNS\%2705\%20-\%20Garcia\%20\%26\%20Hoepman\%20-\%20Off-line\%20Karma.pdf},
author = {Flavio D. Garcia and Jaap-Henk Hoepman}
}
@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},
+ series = {SIGCOMM '05},
year = {2005},
pages = {73--84},
publisher = {ACM},
@@ -8761,7 +8807,7 @@ We introduce and implement Obfuscated Ciphertext Mixing, the obfuscation of a mi
doi = {10.1145/1080091.1080102},
author = {unknown},
url = {http://doi.acm.org/10.1145/1080091.1080102},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/openDHT.pdf}
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/openDHT.pdf}
}
@article {Feldman:2005:OFB:1120717.1120723,
title = {Overcoming free-riding behavior in peer-to-peer systems},
@@ -8777,7 +8823,7 @@ We introduce and implement Obfuscated Ciphertext Mixing, the obfuscation of a mi
issn = {1551-9031},
doi = {http://doi.acm.org/10.1145/1120717.1120723},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SIGecom\%20Exch.\%20\%285\%29\%20-\%20Overcoming\%20free-riding\%20behavior.pdf},
author = {Michal Feldman and John Chuang}
}
@article {2005_9,
@@ -8791,12 +8837,12 @@ We introduce and implement Obfuscated Ciphertext Mixing, the obfuscation of a mi
www_section = {contracts, framework, P2P, peer-to-peer networking, resource exchange, service exchange},
issn = {0167-739X},
doi = {10.1016/j.future.2004.04.013 },
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/FGCS\%20-\%20P2P\%20Contracts\%3A\%20a\%20Framework\%20for\%20Resource\%20and\%20Service\%20Exchange.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/FGCS\%20-\%20P2P\%20Contracts\%3A\%20a\%20Framework\%20for\%20Resource\%20and\%20Service\%20Exchange.pdf},
author = {Dipak Ghosal and Benjamin K. Poon and Keith Kong}
}
@conference { busca:pastis:,
title = {Pastis: A Highly-Scalable Multi-user Peer-to-Peer File System},
- booktitle = {Euro-Par{\textquoteright}05 Parallel Processing},
+ booktitle = {Euro-Par'05 Parallel Processing},
year = {2005},
month = sep,
pages = {1173--1182},
@@ -8804,11 +8850,11 @@ We introduce and implement Obfuscated Ciphertext Mixing, the obfuscation of a mi
organization = {Springer-Verlag},
address = {Lisboa, Portugal},
abstract = {We introduce Pastis, a completely decentralized multi-user read-write peer-to-peer file system. In Pastis every file is described by a modifiable inode-like structure which contains the addresses of the immutable blocks in which the file contents are stored. All data are stored using the Past distributed hash table (DHT), which we have modified in order to reduce the number of network messages it generates, thus optimizing replica retrieval.
-Pastis{\textquoteright} design is simple compared to other existing systems, as it does not require complex algorithms like Byzantine-fault tolerant (BFT) replication or a central administrative authority. It is also highly scalable in terms of the number of network nodes and users sharing a given file or portion of the file system. Furthermore, Pastis takes advantage of the fault tolerance and good locality properties of its underlying storage layer, the Past DHT.
+Pastis' design is simple compared to other existing systems, as it does not require complex algorithms like Byzantine-fault tolerant (BFT) replication or a central administrative authority. It is also highly scalable in terms of the number of network nodes and users sharing a given file or portion of the file system. Furthermore, Pastis takes advantage of the fault tolerance and good locality properties of its underlying storage layer, the Past DHT.
We have developed a prototype based on the FreePastry open-source implementation of the Past DHT. We have used this prototype to evaluate several characteristics of our file system design. Supporting the close-to-open consistency model, plus a variant of the read-your-writes model, our prototype shows that Pastis is between 1.4 to 1.8 times slower than NFS. In comparison, Ivy and Oceanstore are between two to three times slower than NFS},
www_section = {distributed hash table, multi-user, Pastis, peer-to-peer file system, read-write},
doi = {10.1007/11549468_128},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Euro-Par\%2705\%20-\%20Pastis.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Euro-Par\%2705\%20-\%20Pastis.pdf},
author = {Jean-Michel Busca and Fabio Picconi and Pierre Sens}
}
@conference {Massachusetts05peer-to-peercommunication,
@@ -8823,7 +8869,7 @@ We have developed a prototype based on the FreePastry open-source implementation
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},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.59.6799.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.59.6799.pdf},
author = {Pyda Srisuresh and Bryan Ford and Dan Kegel}
}
@booklet {Fuhrmann_aplatform,
@@ -8832,13 +8878,13 @@ We have developed a prototype based on the FreePastry open-source implementation
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},
www_section = {sensor networks},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.72.8036.pdf},
author = {Thomas Fuhrmann and Till Harbaum}
}
@conference {Ali:2005:PTA:1082473.1082631,
title = {Preprocessing techniques for accelerating the DCOP algorithm ADOPT},
- booktitle = {AAMAS{\textquoteright}05--Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems},
- series = {AAMAS {\textquoteright}05},
+ booktitle = {AAMAS'05--Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems},
+ series = {AAMAS '05},
year = {2005},
month = jul,
pages = {1041--1048},
@@ -8850,7 +8896,7 @@ We have developed a prototype based on the FreePastry open-source implementation
isbn = {1-59593-093-0},
doi = {10.1145/1082473.1082631},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/AAMAS\%2705\%20-\%20Accelerating\%20the\%20DCOP\%20algorithm\%20ADOPT.pdf},
author = {Ali, Syed and Koenig, Sven and Tambe, Milind}
}
@article {2005_10,
@@ -8864,7 +8910,7 @@ We have developed a prototype based on the FreePastry open-source implementation
issn = {1071-5819},
doi = {10.1016/j.ijhcs.2005.04.019},
url = {http://dx.doi.org/10.1016/j.ijhcs.2005.04.019},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PrivacyPractices2005Jensen.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PrivacyPractices2005Jensen.pdf},
author = {Jensen, Carlos and Potts, Colin and Jensen, Christian}
}
@conference {pet05-bissias,
@@ -8880,7 +8926,7 @@ We have developed a prototype based on the FreePastry open-source implementation
isbn = {978-3-540-34745-3},
doi = {10.1007/11767831},
url = {http://www.springerlink.com/content/1062w684754754h4/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pet05-bissias.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/pet05-bissias.pdf},
author = {George Dean Bissias and Marc Liberatore and Brian Neil Levine}
}
@book {2005_11,
@@ -8892,11 +8938,11 @@ We have developed a prototype based on the FreePastry open-source implementation
pages = {241--257},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
- 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},
+ abstract = {In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party'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' 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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PrivacyPreservingSetOperations2005Kissner.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PrivacyPreservingSetOperations2005Kissner.pdf},
author = {Kissner, Lea and Song, Dawn},
editor = {Shoup, Victor}
}
@@ -8914,7 +8960,7 @@ We have developed a prototype based on the FreePastry open-source implementation
isbn = {978-3-540-26226-8},
doi = {10.1007/11496618_9},
url = {http://dx.doi.org/10.1007/11496618_9},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PrivateScalarProduct2004Goethals.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PrivateScalarProduct2004Goethals.pdf},
author = {Goethals, Bart and Laur, Sven and Lipmaa, Helger and Mielik{\"a}inen, Taneli},
editor = {Park, Choon-sik and Chee, Seongtaek}
}
@@ -8929,7 +8975,7 @@ We have developed a prototype based on the FreePastry open-source implementation
isbn = {1-59593-231-3},
doi = {10.1145/1103576.1103585},
url = {http://portal.acm.org/citation.cfm?id=1103576.1103585},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/GHPvR05.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/GHPvR05.pdf},
author = {Flavio D. Garcia and Ichiro Hasuo and Wolter Pieters and Peter van Rossum}
}
@conference {ih05-Klonowski,
@@ -8945,7 +8991,7 @@ We have developed a prototype based on the FreePastry open-source implementation
isbn = {978-3-540-29039-1},
doi = {10.1007/11558859},
url = {http://www.springerlink.com/content/777769630v335773/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ih05-Klonowski.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ih05-Klonowski.pdf},
author = {Marek Klonowski and Miroslaw Kutylowski}
}
@conference {cramer05pns,
@@ -8962,7 +9008,7 @@ We have developed a prototype based on the FreePastry open-source implementation
isbn = {0-7695-2376-5},
doi = {10.1109/P2P.2005.28},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cramer05pns.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cramer05pns.pdf},
author = {Cramer, Curt and Thomas Fuhrmann}
}
@conference {sassaman:wpes2005,
@@ -8978,7 +9024,7 @@ We have developed a prototype based on the FreePastry open-source implementation
isbn = {1-59593-228-3},
doi = {10.1145/1102199.1102201},
url = {http://portal.acm.org/citation.cfm?id=1102199.1102201},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/sassaman-wpes2005.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/sassaman-wpes2005.pdf},
author = {Len Sassaman and Bram Cohen and Nick Mathewson}
}
@conference {1524297,
@@ -8988,11 +9034,11 @@ We have developed a prototype based on the FreePastry open-source implementation
year = {2005},
month = jul,
pages = {235--239},
- abstract = {Anonymity in peer-to-peer network means that it is difficult to associate a particular communication with a sender or a recipient. Recently, anonymous peer-to-peer framework, called GNUnet, was developed. A primary feature of GNUnet is resistance to traffic-analysis. However, Kugler analyzed a routing protocol in GNUnet, and pointed out traceability of initiator. In this paper, we propose an alternative routing protocol applicable in GNUnet, which is resistant to Kugler{\textquoteright}s shortcut attacks},
+ abstract = {Anonymity in peer-to-peer network means that it is difficult to associate a particular communication with a sender or a recipient. Recently, anonymous peer-to-peer framework, called GNUnet, was developed. A primary feature of GNUnet is resistance to traffic-analysis. However, Kugler analyzed a routing protocol in GNUnet, and pointed out traceability of initiator. In this paper, we propose an alternative routing protocol applicable in GNUnet, which is resistant to Kugler's shortcut attacks},
www_section = {anonymity, GNUnet, routing, shortcut},
issn = {1521-9097},
doi = {10.1109/ICPADS.2005.246},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kugler2.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/kugler2.pdf},
author = {Tatara, Kohei and Hori, Y. and Sakurai, Kouichi}
}
@article {2005_13,
@@ -9002,7 +9048,7 @@ We have developed a prototype based on the FreePastry open-source implementation
institution = {The GNUnet Project},
www_section = {Bloom filter, GNUnet},
journal = {unknown},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/bloomfilter.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/bloomfilter.pdf},
author = {Christian Grothoff}
}
@conference {HanLLHP05,
@@ -9039,7 +9085,7 @@ We have developed a prototype based on the FreePastry open-source implementation
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},
www_section = {ad-hoc networks},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Retrivability_of_data_in_ad-hoc_backup.pdf},
author = {Trond Aspelund}
}
@booklet {1698181,
@@ -9050,7 +9096,7 @@ We have developed a prototype based on the FreePastry open-source implementation
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},
www_section = {routing},
url = {http://portal.acm.org/citation.cfm?id=1698181$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/smli_tr-2005-146.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/smli_tr-2005-146.pdf},
author = {Perlman, Radia}
}
@conference {XuFZBCZ05,
@@ -9060,27 +9106,27 @@ We have developed a prototype based on the FreePastry open-source implementation
pages = {452--461},
publisher = {Springer Berlin / Heidelberg},
organization = {Springer Berlin / Heidelberg},
- abstract = {Anonymity technologies have gained more and more attention for communication privacy. In general, users obtain anonymity at a certain cost in an anonymous communication system, which uses rerouting to increase the system{\textquoteright}s robustness. However, a long rerouting path incurs large overhead and decreases the quality of service (QoS). In this paper, we propose the Scalar Anonymity System (SAS) in order to provide a tradeoff between anonymity and cost for different users with different requirements. In SAS, by selecting the level of anonymity, a user obtains the corresponding anonymity and QoS and also sustains the corresponding load of traffic rerouting for other users. Our theoretical analysis and simulation experiments verify the effectiveness of SAS},
+ abstract = {Anonymity technologies have gained more and more attention for communication privacy. In general, users obtain anonymity at a certain cost in an anonymous communication system, which uses rerouting to increase the system's robustness. However, a long rerouting path incurs large overhead and decreases the quality of service (QoS). In this paper, we propose the Scalar Anonymity System (SAS) in order to provide a tradeoff between anonymity and cost for different users with different requirements. In SAS, by selecting the level of anonymity, a user obtains the corresponding anonymity and QoS and also sustains the corresponding load of traffic rerouting for other users. Our theoretical analysis and simulation experiments verify the effectiveness of SAS},
www_section = {anonymity, privacy, QoS},
isbn = {978-3-540-28102-3},
doi = {10.1007/11534310},
url = {http://www.springerlink.com/content/9b2k6u5wval6cep1/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.66.7970.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {Fuhrmann05scalablerouting,
title = {Scalable routing for networked sensors and actuators},
booktitle = {In Proceedings of the Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks},
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},
+ 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 'digital homes ' 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},
www_section = {scalable source routing, sensor networks, wireless sensor network},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.67.6509.pdf},
author = {Thomas Fuhrmann}
}
@conference {1049775,
title = {Scalable Service Discovery for MANET},
- booktitle = {PERCOM {\textquoteright}05: Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications},
+ booktitle = {PERCOM '05: Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications},
year = {2005},
pages = {235--244},
publisher = {IEEE Computer Society},
@@ -9091,16 +9137,16 @@ We have developed a prototype based on the FreePastry open-source implementation
isbn = {0-7695-2299-8},
doi = {10.1109/PERCOM.2005.36},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.73.7247.pdf},
author = {Sailhan, Francoise and Valerie Issarny}
}
@booklet {Sandberg05searchingin,
title = {Searching in a Small World},
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},
+ abstract = {The small-world phenomenon, that the world'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's results. In the first we study the formation of networks of this type, attempting to see why the kind},
www_section = {small-world},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.101.688.pdf},
author = {Sandberg, Oskar}
}
@book {conf/p2p/GotzRW05,
@@ -9118,25 +9164,25 @@ This overview focuses on the three DHT systems that have received the most atten
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Lecture\%20Notes\%20in\%20Computer\%20Science\%20-\%20Selected\%20DHT\%20Algorithms\%20.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Lecture\%20Notes\%20in\%20Computer\%20Science\%20-\%20Selected\%20DHT\%20Algorithms\%20.pdf},
author = {G{\"o}tz, Stefan and Rieche, Simon and Klaus Wehrle}
}
@conference {Gairing:2005:SRI:1073970.1074000,
title = {Selfish Routing with Incomplete Information},
- booktitle = {SPAA{\textquoteright}05. Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures},
- series = {SPAA {\textquoteright}05},
+ booktitle = {SPAA'05. Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures},
+ series = {SPAA '05},
year = {2005},
month = jul,
pages = {203--212},
publisher = {ACM},
organization = {ACM},
address = {Las Vegas, Nevada},
- abstract = {In his seminal work Harsanyi introduced an elegant approach to study non-cooperative games with incomplete information where the players are uncertain about some parameters. To model such games he introduced the Harsanyi transformation, which converts a game with incomplete information to a strategic game where players may have different types. In the resulting Bayesian game players{\textquoteright} uncertainty about each others types is described by a probability distribution over all possible type profiles.In this work, we introduce a particular selfish routing game with incomplete information that we call Bayesian routing game. Here, n selfish users wish to assign their traffic to one of m links. Users do not know each others traffic. Following Harsanyi{\textquoteright}s approach, we introduce for each user a set of possible types.This paper presents a comprehensive collection of results for the Bayesian routing game.We prove, with help of a potential function, that every Bayesian routing game possesses a pure Bayesian Nash equilibrium. For the model of identical links and independent type distribution we give a polynomial time algorithm to compute a pure Bayesian Nash equilibrium.We study structural properties of fully mixed Bayesian Nash equilibria for the model of identical links and show that they maximize individual cost. In general there exists more than one fully mixed Bayesian Nash equilibrium. We characterize the class of fully mixed Bayesian Nash equilibria in the case of independent type distribution.We conclude with results on coordination ratio for the model of identical links for three social cost measures, that is, social cost as expected maximum congestion, sum of individual costs and maximum individual cost. For the latter two we are able to give (asymptotic) tight bounds using our results on fully mixed Bayesian Nash equilibria.To the best of our knowledge this is the first time that mixed Bayesian Nash equilibria have been studied in conjunction with social cost},
+ abstract = {In his seminal work Harsanyi introduced an elegant approach to study non-cooperative games with incomplete information where the players are uncertain about some parameters. To model such games he introduced the Harsanyi transformation, which converts a game with incomplete information to a strategic game where players may have different types. In the resulting Bayesian game players' uncertainty about each others types is described by a probability distribution over all possible type profiles.In this work, we introduce a particular selfish routing game with incomplete information that we call Bayesian routing game. Here, n selfish users wish to assign their traffic to one of m links. Users do not know each others traffic. Following Harsanyi's approach, we introduce for each user a set of possible types.This paper presents a comprehensive collection of results for the Bayesian routing game.We prove, with help of a potential function, that every Bayesian routing game possesses a pure Bayesian Nash equilibrium. For the model of identical links and independent type distribution we give a polynomial time algorithm to compute a pure Bayesian Nash equilibrium.We study structural properties of fully mixed Bayesian Nash equilibria for the model of identical links and show that they maximize individual cost. In general there exists more than one fully mixed Bayesian Nash equilibrium. We characterize the class of fully mixed Bayesian Nash equilibria in the case of independent type distribution.We conclude with results on coordination ratio for the model of identical links for three social cost measures, that is, social cost as expected maximum congestion, sum of individual costs and maximum individual cost. For the latter two we are able to give (asymptotic) tight bounds using our results on fully mixed Bayesian Nash equilibria.To the best of our knowledge this is the first time that mixed Bayesian Nash equilibria have been studied in conjunction with social cost},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SPAA\%2705\%20-\%20Selfish\%20routing\%20with\%20incomplete\%20information.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SPAA\%2705\%20-\%20Selfish\%20routing\%20with\%20incomplete\%20information.pdf},
author = {Gairing, Martin and Monien, Burkhard and Tiemann, Karsten}
}
@conference {kutzner05dvdr,
@@ -9148,7 +9194,7 @@ This overview focuses on the three DHT systems that have received the most atten
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},
www_section = {Chord, distributed hash table, proximity neighbor selection},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kutzner05dvdr.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/kutzner05dvdr.pdf},
author = {Kendy Kutzner and Cramer, Curt and Thomas Fuhrmann}
}
@conference {fuhrmann05networking,
@@ -9166,13 +9212,13 @@ In this paper, we present a fully self-organizing routing scheme that is able to
isbn = {978-3-540-25809-4},
doi = {10.1007/b136094},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann05networking.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fuhrmann05networking.pdf},
author = {Thomas Fuhrmann}
}
@conference {Irwin:2005:SVC:1080192.1080194,
title = {Self-recharging virtual currency},
- booktitle = {P2PECON{\textquoteright}05. Proceedings of the 2005 ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems},
- series = {P2PECON {\textquoteright}05},
+ booktitle = {P2PECON'05. Proceedings of the 2005 ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems},
+ series = {P2PECON '05},
year = {2005},
month = aug,
pages = {93--98},
@@ -9184,7 +9230,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
isbn = {1-59593-026-4},
doi = {http://doi.acm.org/10.1145/1080192.1080194},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/P2PECON\%2705\%20-\%20Self-recharging\%20virtual\%20currency.pdf},
author = {Irwin, David and Chase, Jeff and Grit, Laura and Yumerefendi, Aydan}
}
@conference {cramer05selfstabilizing,
@@ -9196,7 +9242,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
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},
www_section = {ad-hoc networks, P2P},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cramer05selfstabilizing.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cramer05selfstabilizing.pdf},
author = {Cramer, Curt and Thomas Fuhrmann}
}
@article {10.1109/PERSER.2005.1506410,
@@ -9210,7 +9256,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/31.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/31.pdf},
author = {Mijeom Kim and Mohan Kumar and Behrooz Shirazi}
}
@book {Bartolini:2005:SFA:2167504.2167521,
@@ -9224,18 +9270,18 @@ In this paper, we present a fully self-organizing routing scheme that is able to
organization = {Springer-Verlag},
chapter = {A software framework for automated negotiation},
address = {Berlin, Heidelberg},
- 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},
+ 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'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},
www_section = {framework, negotiation},
isbn = {3-540-24843-9},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {Bharambe:2005:OBP:1064212.1064273,
title = {Some observations on BitTorrent performance},
booktitle = {Proceedings of the 2005 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems},
- series = {SIGMETRICS {\textquoteright}05},
+ series = {SIGMETRICS '05},
year = {2005},
month = jun,
pages = {398--399},
@@ -9247,7 +9293,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
isbn = {1-59593-022-1},
doi = {http://doi.acm.org/10.1145/1064212.1064273},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SIGMETRICS\%2705\%20-\%20Bharambe\%2C\%20Herley\%20\%26\%20Padmanabhan.pdf},
author = {Bharambe, Ashwin R. and Herley, Cormac and Venkata N. Padmanabhan}
}
@conference {LuFSG05,
@@ -9272,13 +9318,13 @@ In this paper, we present a fully self-organizing routing scheme that is able to
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IEEE\%20CST\%20-\%20A\%20Survey\%20and\%20Comparison\%20of\%20Peer-to-Peer\%20Overlay.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {Cheng:2005:SRM:1080192.1080202,
title = {Sybilproof reputation mechanisms},
booktitle = {Proceedings of the 2005 ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems},
- series = {P2PECON {\textquoteright}05},
+ series = {P2PECON '05},
year = {2005},
month = aug,
pages = {128--132},
@@ -9290,7 +9336,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
isbn = {1-59593-026-4},
doi = {http://doi.acm.org/10.1145/1080192.1080202},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ACM\%20SIGCOMM\%2705\%20-\%20Cheng\%20\%26\%20Friedman\%20-\%20Sybilproof\%20reputation\%20mechanisms.pdf},
author = {Cheng, Alice and Eric Friedman}
}
@conference {Danezis05sybil-resistantdht,
@@ -9303,12 +9349,12 @@ In this paper, we present a fully self-organizing routing scheme that is able to
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},
www_section = {distributed hash table, routing},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/sybildht.pdf},
author = {George Danezis and Chris Lesniewski-laas and Frans M. Kaashoek and Ross Anderson}
}
@conference {Nielson05ataxonomy,
title = {A Taxonomy of Rational Attacks},
- booktitle = {Proceedings of the 4th International Workshop on Peer-to-Peer Systems (IPTPS {\textquoteright}05},
+ booktitle = {Proceedings of the 4th International Workshop on Peer-to-Peer Systems (IPTPS '05},
year = {2005},
pages = {36--46},
publisher = {Springer-Verlag},
@@ -9317,7 +9363,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
www_section = {attack, P2P},
doi = {10.1007/11558989},
url = {http://www.springerlink.com/content/lh21385ml723844j/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CameraReady_240.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CameraReady_240.pdf},
author = {Seth James Nielson and Scott A. Crosby}
}
@booklet {UCAM-CL-TR-637,
@@ -9326,16 +9372,16 @@ In this paper, we present a fully self-organizing routing scheme that is able to
year = {2005},
month = {July},
publisher = {University of Cambridge Computer Laboratory},
- 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},
+ abstract = {This is a short talk on topology of covert conflict, comprising joint work I'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've got a conflict and you'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'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/UCAM-CL-TR-637.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/UCAM-CL-TR-637.pdf},
author = {Shishir Nagaraja and Ross Anderson}
}
@conference {kutzner05autonomic,
title = {Towards Autonomic Networking using Overlay Routing Techniques},
- booktitle = {Proceedings of the 18th International Conference on Architecture of Computing Systems (ARCS {\textquoteright}05)--System Aspects in Organic and Pervasive Computing},
+ booktitle = {Proceedings of the 18th International Conference on Architecture of Computing Systems (ARCS '05)--System Aspects in Organic and Pervasive Computing},
year = {2005},
pages = {222--235},
publisher = {Springer Berlin / Heidelberg},
@@ -9348,7 +9394,7 @@ In this paper we present a novel routing approach that is capable of handling co
isbn = {978-3-540-25273-3},
doi = {10.1007/b106632},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kutzner05autonomic.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/kutzner05autonomic.pdf},
author = {Kendy Kutzner and Thomas Fuhrmann}
}
@conference {WangCJ05,
@@ -9359,12 +9405,12 @@ In this paper we present a novel routing approach that is capable of handling co
pages = {81--91},
publisher = {ACM New York, NY, USA},
organization = {ACM New York, NY, USA},
- abstract = {Peer-to-peer VoIP calls are becoming increasingly popular due to their advantages in cost and convenience. When these calls are encrypted from end to end and anonymized by low latency anonymizing network, they are considered by many people to be both secure and anonymous.In this paper, we present a watermark technique that could be used for effectively identifying and correlating encrypted, peer-to-peer VoIP calls even if they are anonymized by low latency anonymizing networks. This result is in contrast to many people{\textquoteright}s perception. The key idea is to embed a unique watermark into the encrypted VoIP flow by slightly adjusting the timing of selected packets. Our analysis shows that it only takes several milliseconds time adjustment to make normal VoIP flows highly unique and the embedded watermark could be preserved across the low latency anonymizing network if appropriate redundancy is applied. Our analytical results are backed up by the real-time experiments performed on leading peer-to-peer VoIP client and on a commercially deployed anonymizing network. Our results demonstrate that (1) tracking anonymous peer-to-peer VoIP calls on the Internet is feasible and (2) low latency anonymizing networks are susceptible to timing attacks},
+ abstract = {Peer-to-peer VoIP calls are becoming increasingly popular due to their advantages in cost and convenience. When these calls are encrypted from end to end and anonymized by low latency anonymizing network, they are considered by many people to be both secure and anonymous.In this paper, we present a watermark technique that could be used for effectively identifying and correlating encrypted, peer-to-peer VoIP calls even if they are anonymized by low latency anonymizing networks. This result is in contrast to many people's perception. The key idea is to embed a unique watermark into the encrypted VoIP flow by slightly adjusting the timing of selected packets. Our analysis shows that it only takes several milliseconds time adjustment to make normal VoIP flows highly unique and the embedded watermark could be preserved across the low latency anonymizing network if appropriate redundancy is applied. Our analytical results are backed up by the real-time experiments performed on leading peer-to-peer VoIP client and on a commercially deployed anonymizing network. Our results demonstrate that (1) tracking anonymous peer-to-peer VoIP calls on the Internet is feasible and (2) low latency anonymizing networks are susceptible to timing attacks},
www_section = {anonymity, P2P},
isbn = {1-59593-226-7},
doi = {10.1145/1102120.1102133},
url = {http://portal.acm.org/citation.cfm?id=1102120.1102133},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WangCJ05.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/WangCJ05.pdf},
author = {Xinyuan Wang and Shiping Chen and Sushil Jajodia}
}
@conference {pet05-zhu,
@@ -9380,7 +9426,7 @@ In this paper we present a novel routing approach that is capable of handling co
isbn = {978-3-540-34745-3},
doi = {10.1007/11767831},
url = {http://www.springerlink.com/content/l5110366246k5003/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pet05-zhu.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/pet05-zhu.pdf},
author = {Ye Zhu and Riccardo Bettati}
}
@conference {fuhrmann05emnets,
@@ -9392,11 +9438,11 @@ In this paper we present a novel routing approach that is capable of handling co
organization = {IEEE Computer Society Washington, DC, USA},
type = {publication},
address = {Sydney, Australia},
- 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},
+ 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 'random topology'. 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},
www_section = {scalable source routing, topology matching},
isbn = {0-7803-9246-9},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann05emnets.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fuhrmann05emnets.pdf},
author = {Thomas Fuhrmann}
}
@conference {DBLP:conf/sigcomm/JainDPF05,
@@ -9412,7 +9458,7 @@ In this paper we present a novel routing approach that is capable of handling co
isbn = {1-59593-009-4},
doi = {10.1145/1080091.1080106},
url = {http://portal.acm.org/citation.cfm?doid=1080091.1080106},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/paper-JaiDem.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/paper-JaiDem.pdf},
author = {Sushant Jain and Michael J. Demmer and Rabin K. Patra and Fall, Kevin}
}
@booklet {Cooley_abs:the,
@@ -9421,7 +9467,7 @@ In this paper we present a novel routing approach that is capable of handling co
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},
www_section = {apportioned backup system},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.120.6858.pdf},
author = {Joe Cooley and Chris Taylor and Alen Peacock}
}
@conference {Baset04ananalysis,
@@ -9433,7 +9479,7 @@ In this paper we present a novel routing approach that is capable of handling co
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},
www_section = {P2P, VoIP},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cucs-039-04.pdf},
author = {Salman A. Baset and Henning G. Schulzrinne}
}
@conference {newman:pet2004,
@@ -9446,12 +9492,12 @@ In this paper we present a novel routing approach that is capable of handling co
pages = {1--16},
publisher = {Springer Berlin / Heidelberg},
organization = {Springer Berlin / Heidelberg},
- abstract = {Traditional methods for evaluating the amount of anonymity afforded by various Mix configurations have depended on either measuring the size of the set of possible senders of a particular message (the anonymity set size), or by measuring the entropy associated with the probability distribution of the messages possible senders. This paper explores further an alternative way of assessing the anonymity of a Mix system by considering the capacity of a covert channel from a sender behind the Mix to an observer of the Mix{\textquoteright}s output.
-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},
+ abstract = {Traditional methods for evaluating the amount of anonymity afforded by various Mix configurations have depended on either measuring the size of the set of possible senders of a particular message (the anonymity set size), or by measuring the entropy associated with the probability distribution of the messages possible senders. This paper explores further an alternative way of assessing the anonymity of a Mix system by considering the capacity of a covert channel from a sender behind the Mix to an observer of the Mix's output.
+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'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/newman-pet2004.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/newman-pet2004.pdf},
author = {Richard E. Newman and Vipan R. Nalla and Ira S. Moskowitz}
}
@article {halpern-oneill-2003,
@@ -9460,12 +9506,12 @@ Initial work considered a simple model, with an observer (Eve) restricted to cou
volume = {13},
year = {2004},
pages = {483--514 },
- 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},
+ 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'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},
www_section = {anonymity, epistemic logic, formal methods},
issn = {0926-227X},
url = {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}
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/halpern-oneill-2003.pdf},
+ author = {Joseph Y. Halpern and Kevin R. O'Neil}
}
@mastersthesis {andrei-thesis,
title = {On the Anonymity of Anonymity Systems},
@@ -9473,7 +9519,7 @@ Initial work considered a simple model, with an observer (Eve) restricted to cou
month = {June},
school = {University of Cambridge},
type = {phd},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/andrei-thesis.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/andrei-thesis.pdf},
author = {Andrei Serjantov}
}
@conference {wisa04-Klonowski,
@@ -9487,7 +9533,7 @@ Initial work considered a simple model, with an observer (Eve) restricted to cou
In this paper we propose an {\textquotedblleft}onion-like{\textquotedblright} encoding design based on universal reencryption. The onions constructed in this way can be used in a protocol that achieves the same goals as the classical onions, however, at the same time we achieve immunity against a repetitive attack. Even if an adversary disturbs communication and prevents processing a message somewhere on the onion path, it is easy to identify the malicious server performing the attack and provide an evidence of its illegal behavior},
www_section = {onion routing, repetitive attack, universal re-encryption, unlinkability},
isbn = {978-3-540-24302-1},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/wisa04-Klonowski.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/wisa04-Klonowski.pdf},
author = {Marcin Gomulkiewicz and Marek Klonowski and Miroslaw Kutylowski}
}
@conference {Mislove04ap3:cooperative,
@@ -9495,18 +9541,18 @@ In this paper we propose an {\textquotedblleft}onion-like{\textquotedblright} en
booktitle = {IN PROC. OF SIGOPS EUROPEAN WORKSHOP},
author = {Mislove, Alan and Oberoi, Gaurav and Post, Ansley and Reis, Charles and Druschel, Peter and Wallach, Dan S},
year = {2004},
- 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},
+ 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's primitives to build novel anonymous group communication facilities (multicast and anycast), which shield the identity of both publishers and subscribers},
www_section = {anonymity, Peer-to-Peer Proxy},
doi = {10.1145/1133572.1133578},
url = {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}
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.61.6219.pdf}
}
@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},
+ abstract = {If Alice wants to know when Bob is online, and they don'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},
www_section = {anonymous presence, presence},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/apres.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/apres.pdf},
author = {Laurie, Ben}
}
@conference {Antoniadis04anasymptotically,
@@ -9518,7 +9564,7 @@ In this paper we propose an {\textquotedblleft}onion-like{\textquotedblright} en
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},
www_section = {asymptotically optimal, P2P, sharing},
url = {http://www.eecs.harvard.edu/p2pecon/confman/papers },
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/optimalscheme04.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/optimalscheme04.pdf},
author = {Panayotis Antoniadis and Costas Courcoubetis and Richard Weber}
}
@booklet {Levien04attackresistant,
@@ -9526,23 +9572,23 @@ In this paper we propose an {\textquotedblleft}onion-like{\textquotedblright} en
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/compact.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/compact.pdf},
author = {Raph Levien}
}
@conference {2004.Pang.imc.dns,
title = {Availability, Usage, and Deployment Characteristics of the Domain Name System},
- booktitle = {IMC{\textquoteright}04--Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement},
+ booktitle = {IMC'04--Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement},
year = {2004},
month = oct,
publisher = {ACM},
organization = {ACM},
address = {Taormina, Sicily, Italy},
- abstract = {The Domain Name System (DNS) is a critical part of the Internet{\textquoteright}s infrastructure, and is one of the few examples of a robust, highly-scalable, and operational distributed system. Although a few studies have been devoted to characterizing its properties, such as its workload and the stability of the top-level servers, many key components of DNS have not yet been examined. Based on large-scale measurements taken fromservers in a large content distribution network, we present a detailed study of key characteristics of the DNS infrastructure, such as load distribution, availability, and deployment patterns of DNS servers. Our analysis includes both local DNS servers and servers in the authoritative hierarchy. We find that (1) the vast majority of users use a small fraction of deployed name servers, (2) the availability of most name servers is high, and (3) there exists a larger degree of diversity in local DNS server deployment and usage than for authoritative servers. Furthermore, we use our DNS measurements to draw conclusions about federated infrastructures in general. We evaluate and discuss the impact of federated deployment models on future systems, such as Distributed Hash Tables},
+ abstract = {The Domain Name System (DNS) is a critical part of the Internet's infrastructure, and is one of the few examples of a robust, highly-scalable, and operational distributed system. Although a few studies have been devoted to characterizing its properties, such as its workload and the stability of the top-level servers, many key components of DNS have not yet been examined. Based on large-scale measurements taken fromservers in a large content distribution network, we present a detailed study of key characteristics of the DNS infrastructure, such as load distribution, availability, and deployment patterns of DNS servers. Our analysis includes both local DNS servers and servers in the authoritative hierarchy. We find that (1) the vast majority of users use a small fraction of deployed name servers, (2) the availability of most name servers is high, and (3) there exists a larger degree of diversity in local DNS server deployment and usage than for authoritative servers. Furthermore, we use our DNS measurements to draw conclusions about federated infrastructures in general. We evaluate and discuss the impact of federated deployment models on future systems, such as Distributed Hash Tables},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IMC\%2704\%20-\%20Availability\%2C\%20Usage\%2C\%20and\%20Deployment\%20Characteristics\%20of\%20the\%20DNS.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@article {1026492,
@@ -9559,7 +9605,7 @@ In this paper we propose an {\textquotedblleft}onion-like{\textquotedblright} en
issn = {1545-5971},
doi = {10.1109/TDSC.2004.2},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.88.2793.pdf},
author = {Avizienis, Algirdas and Laprie, Jean-Claude and Randell, Brian and Carl Landwehr}
}
@mastersthesis {george-thesis,
@@ -9569,7 +9615,7 @@ In this paper we propose an {\textquotedblleft}onion-like{\textquotedblright} en
school = {University of Cambridge},
type = {phd},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/george-thesis.pdf},
author = {George Danezis}
}
@conference {Cramer04Bootstrapping,
@@ -9585,7 +9631,7 @@ In this paper we propose an {\textquotedblleft}onion-like{\textquotedblright} en
isbn = {0-7803-8783-X },
doi = {10.1109/ICON.2004.1409169},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cramer04bootstrapping.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cramer04bootstrapping.pdf},
author = {Cramer, Curt and Kendy Kutzner and Thomas Fuhrmann}
}
@conference {mixmaster-reliable,
@@ -9600,7 +9646,7 @@ We identify flaws in the software in Reliable that further compromise its abilit
isbn = {978-3-540-22987-2},
doi = {10.1007/b100085},
url = {http://www.springerlink.com/content/7lvqwn445ty1c7ga/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mixmaster-reliable.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/mixmaster-reliable.pdf},
author = {Claudia Diaz and Len Sassaman and Evelyne Dewitte}
}
@article {2004_1,
@@ -9613,12 +9659,12 @@ We identify flaws in the software in Reliable that further compromise its abilit
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},
www_section = {distributed hash table, flooding attacks, overlay networks, P2P},
url = {http://kmweb.twbbs.org/drupal/node/13},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/6-914.ppt},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/6-914.ppt},
author = {Xin Yan Zhang and Qian Zhang and Zhang, Zhensheng and Gang Song and Wenwu Zhu}
}
@conference {1111777,
title = {Data durability in peer to peer storage systems},
- booktitle = {CCGRID {\textquoteright}04: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid},
+ booktitle = {CCGRID '04: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid},
year = {2004},
pages = {90--97},
publisher = {IEEE Computer Society},
@@ -9628,13 +9674,13 @@ We identify flaws in the software in Reliable that further compromise its abilit
www_section = {P2P, redundancy, storage},
isbn = {0-7803-8430-X},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.102.9992.pdf},
author = {Gil Utard and Antoine Vernois}
}
@conference {Garces-Erice2004DataIndexing,
title = {Data Indexing in Peer-to-Peer DHT Networks},
- booktitle = {Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS{\textquoteright}04)},
- series = {ICDCS {\textquoteright}04},
+ booktitle = {Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)},
+ series = {ICDCS '04},
year = {2004},
pages = {200--208},
publisher = {IEEE Computer Society},
@@ -9653,7 +9699,7 @@ We identify flaws in the software in Reliable that further compromise its abilit
school = {University of Dublin},
address = {Dublin, Ireland},
www_section = {autonomic distributed system, descentralised coordination},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Thesis\%20-\%20Autonomic\%20distributed\%20systems.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Thesis\%20-\%20Autonomic\%20distributed\%20systems.pdf},
author = {Jim Dowling}
}
@conference {1133613,
@@ -9668,12 +9714,12 @@ We identify flaws in the software in Reliable that further compromise its abilit
www_section = {attack, overlay networks},
doi = {10.1145/1133572.1133613},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.61.5727.pdf},
author = {Singh, Atul and Miguel Castro and Peter Druschel and Antony Rowstron}
}
@conference {Cramer04DemandDrivenClustering,
title = {Demand-Driven Clustering in MANETs},
- booktitle = {Proceedings of the 2004 International Conference on Wireless Networks (ICWN {\textquoteright}04)},
+ booktitle = {Proceedings of the 2004 International Conference on Wireless Networks (ICWN '04)},
volume = {1},
year = {2004},
pages = {81--87},
@@ -9682,7 +9728,7 @@ We identify flaws in the software in Reliable that further compromise its abilit
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},
www_section = {mobile Ad-hoc networks, multi-hop networks},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cramer04odgmbc.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cramer04odgmbc.pdf},
author = {Cramer, Curt and Oliver Stanze and Kilian Weniger and Martina Zitterbart}
}
@conference {Hof04SecureDistributedServiceDirectory,
@@ -9696,12 +9742,12 @@ We identify flaws in the software in Reliable that further compromise its abilit
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/scan.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/scan.pdf},
author = {Hans-Joachim Hof and Erik-Oliver Blass and Thomas Fuhrmann and Martina Zitterbart}
}
@conference {Dabek:2004:DDL:1251175.1251182,
title = {Designing a DHT for Low Latency and High Throughput},
- booktitle = {NSDI{\textquoteright}04--Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation },
+ booktitle = {NSDI'04--Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation },
year = {2004},
month = mar,
pages = {7--7},
@@ -9715,7 +9761,7 @@ 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},
www_section = {distributed hash table, high-throughput, latency},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_3,
@@ -9731,7 +9777,7 @@ Measurements with 425 server instances running on 150 PlanetLab and RON hosts sh
www_section = {incentives, P2P, peer-to-peer networking},
isbn = {0-7803-8525-X },
doi = {10.1109/GECON.2004.1317584 },
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/GECON\%2704\%20-\%20Designing\%20incentive\%20mechanisms\%20for\%20p2p\%20systems.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/GECON\%2704\%20-\%20Designing\%20incentive\%20mechanisms\%20for\%20p2p\%20systems.pdf},
author = {John Chuang}
}
@booklet {_digitalfountains:,
@@ -9740,7 +9786,7 @@ Measurements with 425 server instances running on 150 PlanetLab and RON hosts sh
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.114.2282.pdf}
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.114.2282.pdf}
}
@conference {golle:eurocrypt2004,
title = {Dining Cryptographers Revisited},
@@ -9756,12 +9802,12 @@ We present new DC-net constructions that simultaneously achieve non-interactivit
isbn = {978-3-540-21935-4},
doi = {10.1007/b97182},
url = {http://www.springerlink.com/content/ud2tb1fyk5m2ywlu/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/golle-eurocrypt2004.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/golle-eurocrypt2004.pdf},
author = {Philippe Golle and Ari Juels}
}
@conference { izal:dissecting,
- title = {Dissecting BitTorrent: Five Months in a Torrent{\textquoteright}s Lifetime},
- booktitle = {PAM {\textquoteright}04. Proceedings of Passive and Active Measurements},
+ title = {Dissecting BitTorrent: Five Months in a Torrent's Lifetime},
+ booktitle = {PAM '04. Proceedings of Passive and Active Measurements},
series = {Lecture Notes in Computer Science},
volume = {3015},
year = {2004},
@@ -9773,7 +9819,7 @@ We present new DC-net constructions that simultaneously achieve non-interactivit
abstract = {Popular content such as software updates is requested by a large number of users. Traditionally, to satisfy a large number of requests, lager server farms or mirroring are used, both of which are expensive. An inexpensive alternative are peer-to-peer based replication systems, where users who retrieve the file, act simultaneously as clients and servers. In this paper, we study BitTorrent, a new and already very popular peer-to-peer application that allows distribution of very large contents to a large set of hosts. Our analysis of BitTorrent is based on measurements collected on a five months long period that involved thousands of peers},
www_section = {BitTorrent, P2P, peer-to-peer networking, replication system},
doi = {10.1007/978-3-540-24668-8_1},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PAM\%2704\%20-\%20Dissecting\%20bittorrent.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PAM\%2704\%20-\%20Dissecting\%20bittorrent.pdf},
author = {Mikel Izal and Guillaume Urvoy-Keller and E W Biersack and Pascal Felber and Anwar Al Hamra and L Garc{\'e}s-Erice}
}
@conference {Cramer04Scheduling,
@@ -9786,7 +9832,7 @@ We present new DC-net constructions that simultaneously achieve non-interactivit
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},
www_section = {DVB, P2P},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cramer04scheduling.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cramer04scheduling.pdf},
author = {Cramer, Curt and Kendy Kutzner and Thomas Fuhrmann}
}
@conference {mmsec04-Klonowski,
@@ -9809,9 +9855,9 @@ The simplest solution to this problem would be to send many onions with the same
booktitle = {In The Third Annual Workshop on Economics and Information Security (WEIS04},
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},
+ict theory to analyse these systems. Under our assumptions, resource distribution according to nodes' 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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.4.7003\%20\%281\%29.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.4.7003\%20\%281\%29.pdf},
author = {George Danezis and Ross Anderson}
}
@book {2004_4,
@@ -9827,7 +9873,7 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/EffecitvePrivateMatching2004Freedman.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/EffecitvePrivateMatching2004Freedman.pdf},
author = {Freedman, MichaelJ. and Nissim, Kobbi and Pinkas, Benny},
editor = {Cachin, Christian and Camenisch, Jan L}
}
@@ -9837,9 +9883,9 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
year = {2004},
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}},
+ 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'},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.76.9310.pdf},
author = {Ahmed Helmy}
}
@conference {mrkoot:sirer04,
@@ -9852,12 +9898,12 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
www_section = {anonymity, file-sharing, overlay networks},
doi = {10.1145/1133572.1133611},
url = {http://dx.doi.org/10.1145/1133572.1133611},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/herbivore-esigops.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/herbivore-esigops.pdf},
author = {Emin G{\"u}n Sirer and Goel, Sharad and Mark Robson and Engin, Dogan}
}
@conference {1013317,
title = {Energy-aware demand paging on NAND flash-based embedded storages},
- booktitle = {ISLPED {\textquoteright}04: Proceedings of the 2004 international symposium on Low power electronics and design},
+ booktitle = {ISLPED '04: Proceedings of the 2004 international symposium on Low power electronics and design},
year = {2004},
pages = {338--343},
publisher = {ACM},
@@ -9867,12 +9913,12 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
isbn = {1-58113-929-2},
doi = {10.1145/1013235.1013317},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {1251279,
title = {Energy-efficiency and storage flexibility in the blue file system},
- booktitle = {OSDI{\textquoteright}04: Proceedings of the 6th conference on Symposium on Opearting Systems Design \& Implementation},
+ booktitle = {OSDI'04: Proceedings of the 6th conference on Symposium on Opearting Systems Design \& Implementation},
year = {2004},
pages = {25--25},
publisher = {USENIX Association},
@@ -9881,7 +9927,7 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
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},
www_section = {802.11, file systems},
url = {http://portal.acm.org/citation.cfm?id=1251279$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/nightingale-bluefs2004.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/nightingale-bluefs2004.pdf},
author = {Nightingale, Edmund B. and Flinn, Jason}
}
@article {2004_5,
@@ -9892,14 +9938,14 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
month = jan,
pages = {255--287},
type = {survey},
- abstract = {This paper presents a state-of-the-art review of the Web privacy and anonymity enhancing security mechanisms, tools, applications and services, with respect to their architecture, operational principles and vulnerabilities. Furthermore, to facilitate a detailed comparative analysis, the appropriate parameters have been selected and grouped in classes of comparison criteria, in the form of an integrated comparison framework. The main concern during the design of this framework was to cover the confronted security threats, applied technological issues and users{\textquoteright} demands satisfaction. GNUnet{\textquoteright}s Anonymity Protocol (GAP), Freedom, Hordes, Crowds, Onion Routing, Platform for Privacy Preferences (P3P), TRUSTe, Lucent Personalized Web Assistant (LPWA), and Anonymizer have been reviewed and compared. The comparative review has clearly highlighted that the pros and cons of each system do not coincide, mainly due to the fact that each one exhibits different design goals and thus adopts dissimilar techniques for protecting privacy and anonymity},
+ abstract = {This paper presents a state-of-the-art review of the Web privacy and anonymity enhancing security mechanisms, tools, applications and services, with respect to their architecture, operational principles and vulnerabilities. Furthermore, to facilitate a detailed comparative analysis, the appropriate parameters have been selected and grouped in classes of comparison criteria, in the form of an integrated comparison framework. The main concern during the design of this framework was to cover the confronted security threats, applied technological issues and users' demands satisfaction. GNUnet's Anonymity Protocol (GAP), Freedom, Hordes, Crowds, Onion Routing, Platform for Privacy Preferences (P3P), TRUSTe, Lucent Personalized Web Assistant (LPWA), and Anonymizer have been reviewed and compared. The comparative review has clearly highlighted that the pros and cons of each system do not coincide, mainly due to the fact that each one exhibits different design goals and thus adopts dissimilar techniques for protecting privacy and anonymity},
www_section = {anonymity, GNUnet, onion routing},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p255.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/p255.pdf},
author = {Stefanos Gritzalis}
}
@conference {1021938,
title = {Erasure Code Replication Revisited},
- booktitle = {P2P {\textquoteright}04: Proceedings of the Fourth International Conference on Peer-to-Peer Computing},
+ booktitle = {P2P '04: Proceedings of the Fourth International Conference on Peer-to-Peer Computing},
year = {2004},
pages = {90--97},
publisher = {IEEE Computer Society},
@@ -9909,7 +9955,7 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
isbn = {0-7695-2156-8},
doi = {10.1109/P2P.2004.17},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.109.2034.pdf},
author = {Lin, W. K. and Chiu, Dah Ming and Lee, Y. B.}
}
@booklet {You04evaluationof,
@@ -9918,7 +9964,7 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
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},
www_section = {compression, storage},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.11.1341.pdf},
author = {Lawrence L. You and Christos Karamanolis}
}
@conference {Karp2004/ALGO,
@@ -9950,7 +9996,7 @@ This work was supported in part by the National Science Foundation under Contrac
isbn = {978-3-540-26203-9},
doi = {10.1007/b136164},
url = {http://www.springerlink.com/content/kej7uwxee8h71p81/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/flow-correlation04.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/flow-correlation04.pdf},
author = {Ye Zhu and Xinwen Fu and Bryan Graham and Riccardo Bettati and Wei Zhao}
}
@conference {esorics04-mauw,
@@ -9964,7 +10010,7 @@ This work was supported in part by the National Science Foundation under Contrac
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},
www_section = {anonymity, onion routing, privacy},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/esorics04-mauw.pdf},
author = {Sjouke Mauw and Jan Verschuren and Erik P. de Vink}
}
@conference {reiter:ccs2004,
@@ -9980,25 +10026,25 @@ This work was supported in part by the National Science Foundation under Contrac
isbn = {1-58113-961-6},
doi = {10.1145/1030083.1030114},
url = {http://portal.acm.org/citation.cfm?id=1030114},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/reiter-ccs2004.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/reiter-ccs2004.pdf},
author = {Michael K. Reiter and XiaoFeng Wang}
}
@conference {Feldman:2004:FWP:1016527.1016539,
title = {Free-riding and whitewashing in peer-to-peer systems},
- booktitle = {PINS{\textquoteright}04. Proceedings of the ACM SIGCOMM Workshop on Practice and Theory of Incentives in Networked Systems},
- series = {PINS {\textquoteright}04},
+ booktitle = {PINS'04. Proceedings of the ACM SIGCOMM Workshop on Practice and Theory of Incentives in Networked Systems},
+ series = {PINS '04},
year = {2004},
month = aug,
pages = {228--236},
publisher = {ACM},
organization = {ACM},
address = {Portland, OR},
- abstract = {We develop a model to study the phenomenon of free-riding in peer-to-peer (P2P) systems. At the heart of our model is a user of a certain type, an intrinsic and private parameter that reflects the user{\textquoteright}s willingness to contribute resources to the system. A user decides whether to contribute or free-ride based on how the current contribution cost in the system compares to her type. When the societal generosity (i.e., the average type) is low, intervention is required in order to sustain the system. We present the effect of mechanisms that exclude low type users or, more realistic, penalize free-riders with degraded service. We also consider dynamic scenarios with arrivals and departures of users, and with whitewashers: users who leave the system and rejoin with new identities to avoid reputational penalties. We find that when penalty is imposed on all newcomers in order to avoid whitewashing, system performance degrades significantly only when the turnover rate among users is high},
+ abstract = {We develop a model to study the phenomenon of free-riding in peer-to-peer (P2P) systems. At the heart of our model is a user of a certain type, an intrinsic and private parameter that reflects the user's willingness to contribute resources to the system. A user decides whether to contribute or free-ride based on how the current contribution cost in the system compares to her type. When the societal generosity (i.e., the average type) is low, intervention is required in order to sustain the system. We present the effect of mechanisms that exclude low type users or, more realistic, penalize free-riders with degraded service. We also consider dynamic scenarios with arrivals and departures of users, and with whitewashers: users who leave the system and rejoin with new identities to avoid reputational penalties. We find that when penalty is imposed on all newcomers in order to avoid whitewashing, system performance degrades significantly only when the turnover rate among users is high},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PINS\%2704\%20-\%20\%20Free-riding\%20and\%20whitewashing\%20in\%20P2P\%20systems.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_6,
@@ -10013,7 +10059,7 @@ This work was supported in part by the National Science Foundation under Contrac
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p_icalp04_0.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@@ -10030,7 +10076,7 @@ However, the statistical hitting set attack is prone to wrong solutions with a g
www_section = {anonymity, hitting set attack, traffic analysis},
doi = {10.1007/b104759},
url = {http://www.springerlink.com/content/t6bkk4tyjvr71m55/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/hitting-set04.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/hitting-set04.pdf},
author = {Dogan Kesdogan and Lexi Pimenidis}
}
@conference {koepsell:wpes2004,
@@ -10046,7 +10092,7 @@ However, the statistical hitting set attack is prone to wrong solutions with a g
isbn = {1-58113-968-3},
doi = {10.1145/1029179.1029197},
url = {http://portal.acm.org/citation.cfm?id=1029179.1029197},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/koepsell-wpes2004_0.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/koepsell-wpes2004_0.pdf},
author = {Stefan K{\"o}psell and Ulf Hilling}
}
@conference {fairbrother:pet2004,
@@ -10060,12 +10106,12 @@ However, the statistical hitting set attack is prone to wrong solutions with a g
publisher = {Springer Berlin / Heidelberg},
organization = {Springer Berlin / Heidelberg},
abstract = {Golle et al recently introduced universal re-encryption, defining it as re-encryption by a player who does not know the key used for the original encryption, but which still allows an intended player to recover the plaintext. Universal re-encryption is potentially useful as part of many information-hiding techniques, as it allows any player to make ciphertext unidentifiable without knowing the key used.
-Golle et al{\textquoteright}s techniques for universal re-encryption are reviewed, and a hybrid universal re-encryption construction with improved work and space requirements which also permits indefinite re-encryptions is presented. Some implementational issues and optimisations are discussed},
+Golle et al's techniques for universal re-encryption are reviewed, and a hybrid universal re-encryption construction with improved work and space requirements which also permits indefinite re-encryptions is presented. Some implementational issues and optimisations are discussed},
www_section = {information hiding, re-encryption},
isbn = {978-3-540-26203-9},
doi = {10.1007/b136164},
url = {http://www.springerlink.com/content/q07439n27u1egx0w/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fairbrother-pet2004.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fairbrother-pet2004.pdf},
author = {Peter Fairbrother}
}
@article {modular-approach,
@@ -10075,18 +10121,18 @@ Golle et al{\textquoteright}s techniques for universal re-encryption are reviewe
number = {1},
year = {2004},
pages = {3--36},
- abstract = {We propose a new specification framework for information hiding properties such as anonymity and privacy. The framework is based on the concept of a function view, which is a concise representation of the attacker{\textquoteright}s partial knowledge about a function. We describe system behavior as a set of functions, and formalize different information hiding properties in terms of views of these functions. We present an extensive case study, in which we use the function view framework to systematically classify and rigorously define a rich domain of identity-related properties, and to demonstrate that privacy and anonymity are independent.
+ abstract = {We propose a new specification framework for information hiding properties such as anonymity and privacy. The framework is based on the concept of a function view, which is a concise representation of the attacker's partial knowledge about a function. We describe system behavior as a set of functions, and formalize different information hiding properties in terms of views of these functions. We present an extensive case study, in which we use the function view framework to systematically classify and rigorously define a rich domain of identity-related properties, and to demonstrate that privacy and anonymity are independent.
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},
www_section = {anonymity, information hiding, privacy},
issn = {0926-227X},
url = {http://portal.acm.org/citation.cfm?id=1297694},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/shmat_anon.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/shmat_anon.pdf},
author = {Dominic Hughes and Vitaly Shmatikov}
}
@conference {1096703,
title = {Integrating Portable and Distributed Storage},
- booktitle = {FAST {\textquoteright}04: Proceedings of the 3rd USENIX Conference on File and Storage Technologies},
+ booktitle = {FAST '04: Proceedings of the 3rd USENIX Conference on File and Storage Technologies},
year = {2004},
pages = {227--238},
publisher = {USENIX Association},
@@ -10095,7 +10141,7 @@ The key feature of our approach is its modularity. It yields precise, formal spe
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},
www_section = {caching proxies, distributed database},
url = {http://portal.acm.org/citation.cfm?id=1096703$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/integratingpds-fast04.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/integratingpds-fast04.pdf},
author = {Niraj Tolia and Harkes, Jan and Michael Kozuch and Satyanarayanan, Mahadev}
}
@article {987233,
@@ -10107,12 +10153,12 @@ The key feature of our approach is its modularity. It yields precise, formal spe
pages = {205--218},
publisher = {IEEE Press},
address = {Piscataway, NJ, USA},
- abstract = {Attempts to generalize the Internet{\textquoteright}s point-to-point communication abstraction to provide services like multicast, anycast, and mobility have faced challenging technical problems and deployment barriers. To ease the deployment of such services, this paper proposes a general, overlay-based Internet Indirection Infrastructure (i3) that offers a rendezvous-based communication abstraction. Instead of explicitly sending a packet to a destination, each packet is associated with an identifier; this identifier is then used by the receiver to obtain delivery of the packet. This level of indirection decouples the act of sending from the act of receiving, and allows i3 to efficiently support a wide variety of fundamental communication services. To demonstrate the feasibility of this approach, we have designed and built a prototype based on the Chord lookup protocol},
+ abstract = {Attempts to generalize the Internet's point-to-point communication abstraction to provide services like multicast, anycast, and mobility have faced challenging technical problems and deployment barriers. To ease the deployment of such services, this paper proposes a general, overlay-based Internet Indirection Infrastructure (i3) that offers a rendezvous-based communication abstraction. Instead of explicitly sending a packet to a destination, each packet is associated with an identifier; this identifier is then used by the receiver to obtain delivery of the packet. This level of indirection decouples the act of sending from the act of receiving, and allows i3 to efficiently support a wide variety of fundamental communication services. To demonstrate the feasibility of this approach, we have designed and built a prototype based on the Chord lookup protocol},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/i3.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/i3.pdf},
author = {Ion Stoica and Adkins, Daniel and Shelley Zhuang and S Shenker and Surana, Sonesh}
}
@book {2004_7,
@@ -10127,7 +10173,7 @@ The key feature of our approach is its modularity. It yields precise, formal spe
isbn = {9780199275984},
doi = {10.1093/019927598X.001.0001},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Menezes\%20\%26\%20Monteiro\%20-\%20An\%20Introduction\%20to\%20Auction\%20Theory.pdf},
author = {Flavio M. Menezes and Paulo K. Monteiro}
}
@mastersthesis {Amnefelt04keso-,
@@ -10136,9 +10182,9 @@ The key feature of our approach is its modularity. It yields precise, formal spe
month = may,
pages = {0--77},
school = {KTH/Royal Institute of Technology},
- type = {Master{\textquoteright}s Thesis},
+ type = {Master's Thesis},
address = {Stockholm},
- abstract = {In this thesis we present the design of Keso, a distributed and completely decentralized file system based on the peer-to-peer overlay network DKS. While designing Keso we have taken into account many of the problems that exist in today{\textquoteright}s distributed file systems.
+ abstract = {In this thesis we present the design of Keso, a distributed and completely decentralized file system based on the peer-to-peer overlay network DKS. While designing Keso we have taken into account many of the problems that exist in today's distributed file systems.
Traditionally, distributed file systems have been built around dedicated file servers which often use expensive hardware to minimize the risk of breakdown and to handle the load. System administrators are required to monitor the load and disk usage of the file servers and to manually add clients and servers to the system.
Another drawback with centralized file systems are that a lot of storage space is unused on clients. Measurements we have taken on existing computer systems has shown that a large part of the storage capacity of workstations is unused. In the system we looked at there was three times as much storage space available on workstations than was stored in the distributed file system. We have also shown that much data stored in a production use distributed file system is redundant.
@@ -10148,17 +10194,17 @@ 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},
www_section = {decentralized file system, DKS, Keso},
url = {http://mattias.amnefe.lt/keso/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Amnefelt\%20\%26\%20Svenningsson\%20-\%20Keso.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Amnefelt\%20\%26\%20Svenningsson\%20-\%20Keso.pdf},
author = {Mattias Amnefelt and Johanna Svenningsson}
}
@booklet {Yu04leopard:a,
title = {Leopard: A locality-aware peer-to-peer system with no hot spot},
year = {2004},
- publisher = {In: the 4th IFIP Networking Conference (Networking{\textquoteright}05)},
+ publisher = {In: the 4th IFIP Networking Conference (Networking'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},
www_section = {distributed hash table, P2P},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/INFOCOM05_Poster.pdf},
author = {Yinzhe Yu and Sanghwan Lee and Zhi-li Zhang}
}
@conference {feamster:wpes2004,
@@ -10173,12 +10219,12 @@ Specifically, we implement a variant of a recently proposed technique that passi
www_section = {anonymity, autonomous systems},
doi = {10.1145/1029179.1029199},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.10.6119.pdf},
author = {Nick Feamster and Roger Dingledine}
}
@conference {1251195,
title = {MACEDON: methodology for automatically creating, evaluating, and designing overlay networks},
- booktitle = {NSDI{\textquoteright}04: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation},
+ booktitle = {NSDI'04: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation},
year = {2004},
pages = {20--20},
publisher = {USENIX Association},
@@ -10186,7 +10232,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.2.8796.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.2.8796.pdf},
author = {Rodriguez, Adolfo and Killian, Charles and Bhat, Sooraj and Kosti{\'c}, Dejan and Vahdat, Amin}
}
@conference {TH04,
@@ -10199,7 +10245,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/TH04.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/TH04.pdf},
author = {Gergely T{\'o}th and Zolt{\'a}n Horn{\'a}k}
}
@conference {THV04,
@@ -10212,7 +10258,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
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},
www_section = {anonymity, anonymity measurement},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/THV04.pdf},
author = {Gergely T{\'o}th and Zolt{\'a}n Horn{\'a}k and Ferenc Vajda},
editor = {Sanna Liimatainen and Teemupekka Virtanen}
}
@@ -10225,12 +10271,12 @@ Specifically, we implement a variant of a recently proposed technique that passi
pages = {353--366},
publisher = {ACM},
address = {New York, NY, USA},
- abstract = {This paper presents the design of Mercury, a scalable protocol for supporting multi-attribute range-based searches. Mercury differs from previous range-based query systems in that it supports multiple attributes as well as performs explicit load balancing. To guarantee efficient routing and load balancing, Mercury uses novel light-weight sampling mechanisms for uniformly sampling random nodes in a highly dynamic overlay network. Our evaluation shows that Mercury is able to achieve its goals of logarithmic-hop routing and near-uniform load balancing.We also show that Mercury can be used to solve a key problem for an important class of distributed applications: distributed state maintenance for distributed games. We show that the Mercury-based solution is easy to use, and that it reduces the game{\textquoteright}s messaging overheard significantly compared to a na{\"\i}ve approach},
+ abstract = {This paper presents the design of Mercury, a scalable protocol for supporting multi-attribute range-based searches. Mercury differs from previous range-based query systems in that it supports multiple attributes as well as performs explicit load balancing. To guarantee efficient routing and load balancing, Mercury uses novel light-weight sampling mechanisms for uniformly sampling random nodes in a highly dynamic overlay network. Our evaluation shows that Mercury is able to achieve its goals of logarithmic-hop routing and near-uniform load balancing.We also show that Mercury can be used to solve a key problem for an important class of distributed applications: distributed state maintenance for distributed games. We show that the Mercury-based solution is easy to use, and that it reduces the game's messaging overheard significantly compared to a na{\"\i}ve approach},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p625-bharambe1.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/p625-bharambe1.pdf},
author = {Bharambe, Ashwin R. and Agrawal, Mukesh and Seshan, Srinivasan}
}
@conference {danezis:wpes2004,
@@ -10246,13 +10292,13 @@ Specifically, we implement a variant of a recently proposed technique that passi
isbn = {1-58113-968-3},
doi = {10.1145/1029179.1029198},
url = {http://portal.acm.org/citation.cfm?id=1029179.1029198},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/danezis-wpes2004.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/danezis-wpes2004.pdf},
author = {George Danezis and Ben Laurie}
}
@conference {Qiu:2004:MPA:1015467.1015508,
title = {Modeling and performance analysis of BitTorrent-like peer-to-peer networks},
- booktitle = {SIGCOMM{\textquoteright}04. Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications},
- series = {SIGCOMM {\textquoteright}04},
+ booktitle = {SIGCOMM'04. Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications},
+ series = {SIGCOMM '04},
year = {2004},
month = aug,
pages = {367--378},
@@ -10264,7 +10310,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
isbn = {1-58113-862-8},
doi = {http://doi.acm.org/10.1145/1015467.1015508},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SIGCOMM\%2704\%20-\%20Qui\%20\%26\%20Srikant\%20-\%20Modeling\%20and\%20performance\%20analysis.pdf},
author = {Qiu, Dongyu and Rayadurgam Srikant}
}
@conference {Aberer04multifacetedsimultaneous,
@@ -10276,7 +10322,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
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)},
www_section = {distributed hash table, P2P, storage},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/self-star-load-balance.pdf},
author = {Karl Aberer and Anwitaman Datta and Manfred Hauswirth}
}
@conference {DBLP:conf/infocom/ChandraBB04,
@@ -10285,13 +10331,13 @@ Specifically, we implement a variant of a recently proposed technique that passi
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/18_3.PDF},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/18_3.PDF},
author = {Ranveer Chandra and Victor Bahl and Pradeep Bahl}
}
@conference {Kleinberg:2004:NFD:982792.982803,
title = {Network failure detection and graph connectivity},
- booktitle = {SODA{\textquoteright}04--Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms},
- series = {SODA {\textquoteright}04},
+ booktitle = {SODA'04--Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms},
+ series = {SODA '04},
year = {2004},
month = jan,
pages = {76--85},
@@ -10302,13 +10348,13 @@ Specifically, we implement a variant of a recently proposed technique that passi
www_section = {failure detection, graph connectivity, network},
isbn = {0-89871-558-X},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SODA\%2704\%20-\%20Network\%20failure\%20detection\%20and\%20graph\%20connectivity\%250A.pdf},
author = {Kleinberg, Jon and Sandler, Mark and Slivkins, Aleksandrs}
}
@conference {Ng:2004:NPS:1247415.1247426,
title = {A Network Positioning System for the Internet},
- booktitle = {ATEC{\textquoteright}04. Proceedings of the Annual Conference on USENIX Annual Technical Conference},
- series = {ATEC {\textquoteright}04},
+ booktitle = {ATEC'04. Proceedings of the Annual Conference on USENIX Annual Technical Conference},
+ series = {ATEC '04},
year = {2004},
month = jun,
pages = {11--11},
@@ -10318,21 +10364,21 @@ Specifically, we implement a variant of a recently proposed technique that passi
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},
www_section = {Internet, network positioning algorithms, network positioning system, nps},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ATEC\%2704\%20-\%20A\%20network\%20positioning\%20system.pdf},
author = {Ng, T. S. Eugene and Zhang, Hui}
}
@conference {1251194,
title = {Operating system support for planetary-scale network services},
- booktitle = {NSDI{\textquoteright}04: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation},
+ booktitle = {NSDI'04: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation},
year = {2004},
pages = {19--19},
publisher = {USENIX Association},
organization = {USENIX Association},
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},
+ 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'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},
www_section = {overlay networks},
url = {http://portal.acm.org/citation.cfm?id=1251175.1251194$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/plos_nsdi_04.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {golle:ccs2004,
@@ -10350,16 +10396,16 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
isbn = {1-58113-961-6},
doi = {10.1145/1030083.1030113},
url = {http://portal.acm.org/citation.cfm?id=1030113},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/golle-ccs2004.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/golle-ccs2004.pdf},
author = {Philippe Golle and Ari Juels}
}
@booklet {Fakult04peerstore:better,
title = {PeerStore: Better Performance by Relaxing in Peer-to-Peer Backup},
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},
+ 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'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},
www_section = {backup, P2P},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/peerstore-better-performance-by.pdf},
author = {Martin Landers and Han Zhang and Kian-Lee Tan}
}
@conference {2004_8,
@@ -10369,7 +10415,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
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},
author = {unknown},
www_section = {ad-hoc networks, file systems, P2P},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.124.9928.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.124.9928.pdf},
editor = {Hasan S{\"o}zer and Metin Kekkalmaz and Ibrahim K{\"o}rpeoglu}
}
@article {2004_9,
@@ -10382,7 +10428,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
abstract = {Unter dem Begriff Peer-to-Peer etabliert sich ein h{\"o}chst interessantes Paradigma f{\"u}r die Kommunikation im Internet. Obwohl urspr{\"u}nglich nur f{\"u}r die sehr pragmatischen und rechtlich umstrittenen Dateitauschb{\"o}rsen entworfen, k{\"o}nnen die Peerto-Peer-Mechanismen zur verteilten Nutzung unterschiedlichster Betriebsmittel genutzt werden und neue M{\"o}glichkeiten f{\"u}r Internetbasierte Anwendungen er{\"o}ffnen},
www_section = {computing, networking, peer-to-peer networking},
doi = {10.1007/s00287-003-0362-9},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Informatik\%20Spektrum\%20-\%20Peer-to-peer\%20networking\%20\%26\%20-computing.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Informatik\%20Spektrum\%20-\%20Peer-to-peer\%20networking\%20\%26\%20-computing.pdf},
author = {Ralf Steinmetz and Klaus Wehrle}
}
@conference {Cramer04LifeScience,
@@ -10395,7 +10441,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
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},
www_section = {GRID, overlay networks, P2P},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cramer04lifescience.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cramer04lifescience.pdf},
author = {Cramer, Curt and Andrea Schafferhans and Thomas Fuhrmann}
}
@article {2004_10,
@@ -10405,11 +10451,11 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
year = {2004},
month = jan,
pages = {28--40},
- abstract = {Current Web search engines are built to serve all users, independent of the special needs of any individual user. Personalization of Web search is to carry out retrieval for each user incorporating his/her interests. We propose a novel technique to learn user profiles from users{\textquoteright} search histories. The user profiles are then used to improve retrieval effectiveness in Web search. A user profile and a general profile are learned from the user{\textquoteright}s search history and a category hierarchy, respectively. These two profiles are combined to map a user query into a set of categories which represent the user{\textquoteright}s search intention and serve as a context to disambiguate the words in the user{\textquoteright}s query. Web search is conducted based on both the user query and the set of categories. Several profile learning and category mapping algorithms and a fusion algorithm are provided and evaluated. Experimental results indicate that our technique to personalize Web search is both effective and efficient},
+ abstract = {Current Web search engines are built to serve all users, independent of the special needs of any individual user. Personalization of Web search is to carry out retrieval for each user incorporating his/her interests. We propose a novel technique to learn user profiles from users' search histories. The user profiles are then used to improve retrieval effectiveness in Web search. A user profile and a general profile are learned from the user's search history and a category hierarchy, respectively. These two profiles are combined to map a user query into a set of categories which represent the user's search intention and serve as a context to disambiguate the words in the user's query. Web search is conducted based on both the user query and the set of categories. Several profile learning and category mapping algorithms and a fusion algorithm are provided and evaluated. Experimental results indicate that our technique to personalize Web search is both effective and efficient},
www_section = {BANDWIDTH, category hierarchy, category mapping algorithms, Displays, fusion algorithm, History, human factors, information filtering, information retrieval, libraries, personalized Web search, profile learning, retrieval effectiveness, search engines, search intention, special needs, user interfaces, user profiles, user search histories, Web search, Web search engines},
issn = {1041-4347},
doi = {10.1109/TKDE.2004.1264820},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PersonalizedWebSearch2004Liu.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PersonalizedWebSearch2004Liu.pdf},
author = {Fang Liu and Yu, C. and Weiyi Meng}
}
@booklet {2004_11,
@@ -10417,13 +10463,13 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
journal = {The Open Group Technical Standard Base Specifications, Issue 6},
number = {IEEE Std 1003.n },
year = {2004},
- www_section = {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},
+ www_section = {API, asynchronous, built-in utility, CPU, file access control mechanism, input/output (I/O), job control, network, portable operating system interface (POSIX), shell, stream, synchronous},
url = {http://pubs.opengroup.org/onlinepubs/009695399/},
author = {The Open Group and IEEE}
}
@conference {morphmix-fc2004,
title = {Practical Anonymity for the Masses with MorphMix},
- booktitle = {Proceedings of Financial Cryptography (FC {\textquoteright}04)},
+ booktitle = {Proceedings of Financial Cryptography (FC '04)},
year = {2004},
month = feb,
pages = {233--250},
@@ -10434,7 +10480,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
isbn = {978-3-540-22420-4},
doi = {10.1007/b98935},
url = {http://www.springerlink.com/content/dc1qn54t9ta4u3g1/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/morphmix-fc2004.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/morphmix-fc2004.pdf},
author = {Marc Rennhard and Bernhard Plattner},
editor = {Ari Juels}
}
@@ -10447,12 +10493,12 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
pages = {113--118},
publisher = {ACM},
address = {New York, NY, USA},
- abstract = {Vivaldi is a distributed algorithm that assigns synthetic coordinates to internet hosts, so that the Euclidean distance between two hosts{\textquoteright} coordinates predicts the network latency between them. Each node in Vivaldi computes its coordinates by simulating its position in a network of physical springs. Vivaldi is both distributed and efficient: no fixed infrastructure need be deployed and a new host can compute useful coordinates after collecting latency information from only a few other hosts. Vivaldi can rely on piggy-backing latency information on application traffic instead of generating extra traffic by sending its own probe packets.This paper evaluates Vivaldi through simulations of 750 hosts, with a matrix of inter-host latencies derived from measurements between 750 real Internet hosts. Vivaldi finds synthetic coordinates that predict the measured latencies with a median relative error of 14 percent. The simulations show that a new host joining an existing Vivaldi system requires fewer than 10 probes to achieve this accuracy. Vivaldi is currently used by the Chord distributed hash table to perform proximity routing, replica selection, and retransmission timer estimation},
+ abstract = {Vivaldi is a distributed algorithm that assigns synthetic coordinates to internet hosts, so that the Euclidean distance between two hosts' coordinates predicts the network latency between them. Each node in Vivaldi computes its coordinates by simulating its position in a network of physical springs. Vivaldi is both distributed and efficient: no fixed infrastructure need be deployed and a new host can compute useful coordinates after collecting latency information from only a few other hosts. Vivaldi can rely on piggy-backing latency information on application traffic instead of generating extra traffic by sending its own probe packets.This paper evaluates Vivaldi through simulations of 750 hosts, with a matrix of inter-host latencies derived from measurements between 750 real Internet hosts. Vivaldi finds synthetic coordinates that predict the measured latencies with a median relative error of 14 percent. The simulations show that a new host joining an existing Vivaldi system requires fewer than 10 probes to achieve this accuracy. Vivaldi is currently used by the Chord distributed hash table to perform proximity routing, replica selection, and retransmission timer estimation},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGCOMM\%20Comput.\%20Commun.\%20Rev.\%20-\%20Practical\%2C\%20distributed\%20network\%20coordinates.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {e2e-traffic,
@@ -10470,7 +10516,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
isbn = {978-3-540-26203-9},
doi = {10.1007/b136164},
url = {http://www.springerlink.com/content/v6m6cat1lxvbd4yd/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/e2e-traffic.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/e2e-traffic.pdf},
author = {Nick Mathewson and Roger Dingledine}
}
@article {Wright:2004,
@@ -10486,32 +10532,32 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Wright-2004.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Wright-2004.pdf},
author = {Matthew Wright and Micah Adler and Brian Neil Levine and Clay Shields}
}
@booklet {Acquisti04privacyin,
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},
+ 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' individuals but also {\textquoteleft}sophisticated' 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},
author = {Alessandro Acquisti}
}
@conference {Atallah:2004:PCF:1029179.1029204,
title = {Private collaborative forecasting and benchmarking},
- booktitle = {WPES{\textquoteright}04--Proceedings of the 2004 ACM workshop on Privacy in the electronic society},
- series = {WPES {\textquoteright}04},
+ booktitle = {WPES'04--Proceedings of the 2004 ACM workshop on Privacy in the electronic society},
+ series = {WPES '04},
year = {2004},
month = oct,
pages = {103--114},
publisher = {ACM},
organization = {ACM},
address = {Washington, DC, USA},
- abstract = {Suppose a number of hospitals in a geographic area want to learn how their own heart-surgery unit is doing compared with the others in terms of mortality rates, subsequent complications, or any other quality metric. Similarly, a number of small businesses might want to use their recent point-of-sales data to cooperatively forecast future demand and thus make more informed decisions about inventory, capacity, employment, etc. These are simple examples of cooperative benchmarking and (respectively) forecasting that would benefit all participants as well as the public at large, as they would make it possible for participants to avail themselves of more precise and reliable data collected from many sources, to assess their own local performance in comparison to global trends, and to avoid many of the inefficiencies that currently arise because of having less information available for their decision-making. And yet, in spite of all these advantages, cooperative benchmarking and forecasting typically do not take place, because of the participants{\textquoteright} unwillingness to share their information with others. Their reluctance to share is quite rational, and is due to fears of embarrassment, lawsuits, weakening their negotiating position (e.g., in case of over-capacity), revealing corporate performance and strategies, etc. The development and deployment of <i>private</i> benchmarking and forecasting technologies would allow such collaborations to take place without revealing any participant{\textquoteright}s data to the others, reaping the benefits of collaboration while avoiding the drawbacks. Moreover, this kind of technology would empower smaller organizations who could then cooperatively base their decisions on a much broader information base, in a way that is today restricted to only the largest corporations. This paper is a step towards this goal, as it gives protocols for forecasting and benchmarking that reveal to the participants the desired answers yet do not reveal to any participant any other participant{\textquoteright}s private data. We consider several forecasting methods, including linear regression and time series techniques such as moving average and exponential smoothing. One of the novel parts of this work, that further distinguishes it from previous work in secure multi-party computation, is that it involves floating point arithmetic, in particular it provides protocols to securely and efficiently perform division},
+ abstract = {Suppose a number of hospitals in a geographic area want to learn how their own heart-surgery unit is doing compared with the others in terms of mortality rates, subsequent complications, or any other quality metric. Similarly, a number of small businesses might want to use their recent point-of-sales data to cooperatively forecast future demand and thus make more informed decisions about inventory, capacity, employment, etc. These are simple examples of cooperative benchmarking and (respectively) forecasting that would benefit all participants as well as the public at large, as they would make it possible for participants to avail themselves of more precise and reliable data collected from many sources, to assess their own local performance in comparison to global trends, and to avoid many of the inefficiencies that currently arise because of having less information available for their decision-making. And yet, in spite of all these advantages, cooperative benchmarking and forecasting typically do not take place, because of the participants' unwillingness to share their information with others. Their reluctance to share is quite rational, and is due to fears of embarrassment, lawsuits, weakening their negotiating position (e.g., in case of over-capacity), revealing corporate performance and strategies, etc. The development and deployment of <i>private</i> benchmarking and forecasting technologies would allow such collaborations to take place without revealing any participant's data to the others, reaping the benefits of collaboration while avoiding the drawbacks. Moreover, this kind of technology would empower smaller organizations who could then cooperatively base their decisions on a much broader information base, in a way that is today restricted to only the largest corporations. This paper is a step towards this goal, as it gives protocols for forecasting and benchmarking that reveal to the participants the desired answers yet do not reveal to any participant any other participant's private data. We consider several forecasting methods, including linear regression and time series techniques such as moving average and exponential smoothing. One of the novel parts of this work, that further distinguishes it from previous work in secure multi-party computation, is that it involves floating point arithmetic, in particular it provides protocols to securely and efficiently perform division},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WPES\%2704\%20-\%20Forecasting\%20and\%20benchamking.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/WPES\%2704\%20-\%20Forecasting\%20and\%20benchamking.pdf},
author = {Atallah, Mikhail and Bykova, Marina and Li, Jiangtao and Frikken, Keith and Topkara, Mercan}
}
@article {kissner04private,
@@ -10523,11 +10569,11 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
isbn = {3-540-22217-0},
issn = {0302-9743 },
url = {http://cat.inist.fr/?aModele=afficheN\&cpsidt=15852065},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kissner04private.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/kissner04private.pdf},
author = {Lea Kissner and Alina Oprea and Michael K. Reiter and Dawn Xiaodong Song and Ke Yang}
}
@conference {2004_12,
- title = {A Probabilistic Approach to Predict Peers{\textquoteright} Performance in P2P Networks},
+ title = {A Probabilistic Approach to Predict Peers' Performance in P2P Networks},
booktitle = {CIA 2004. Cooperative Information Agents VIII, 8th International Workshop},
series = {Lecture Notes in Computer Science},
volume = {3191},
@@ -10537,10 +10583,10 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
publisher = {Springer},
organization = {Springer},
address = {Erfurt, Germany},
- abstract = {The problem of encouraging trustworthy behavior in P2P online communities by managing peers{\textquoteright} reputations has drawn a lot of attention recently. However, most of the proposed solutions exhibit the following two problems: huge implementation overhead and unclear trust related model semantics. In this paper we show that a simple probabilistic technique, maximum likelihood estimation namely, can reduce these two problems substantially when employed as the feedback aggregation strategy. Thus, no complex exploration of the feedback is necessary. Instead, simple, intuitive and efficient probabilistic estimation methods suffice},
+ abstract = {The problem of encouraging trustworthy behavior in P2P online communities by managing peers' reputations has drawn a lot of attention recently. However, most of the proposed solutions exhibit the following two problems: huge implementation overhead and unclear trust related model semantics. In this paper we show that a simple probabilistic technique, maximum likelihood estimation namely, can reduce these two problems substantially when employed as the feedback aggregation strategy. Thus, no complex exploration of the feedback is necessary. Instead, simple, intuitive and efficient probabilistic estimation methods suffice},
www_section = {p2p network, peer performance},
doi = {10.1007/978-3-540-30104-2_6},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CIA\%2704\%20-\%20Despotovic\%20\%26\%20Aberer\%20-\%20Peers\%27\%20performance\%20in\%20P2P\%20networks.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CIA\%2704\%20-\%20Despotovic\%20\%26\%20Aberer\%20-\%20Peers\%27\%20performance\%20in\%20P2P\%20networks.pdf},
author = {Zoran Despotovic and Karl Aberer}
}
@article {crowds-model,
@@ -10553,12 +10599,12 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
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},
www_section = {anonymity, P2P, routing},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/shmat_crowds.pdf},
author = {Vitaly Shmatikov}
}
@conference {berman-fc2004,
title = {Provable Unlinkability Against Traffic Analysis},
- booktitle = {Proceedings of Financial Cryptography (FC {\textquoteright}04)},
+ booktitle = {Proceedings of Financial Cryptography (FC '04)},
year = {2004},
month = feb,
pages = {266--280},
@@ -10571,7 +10617,7 @@ In this paper we improve these results: we show that the same level of unlinkabi
isbn = {978-3-540-23208-7},
doi = {10.1007/b100936},
url = {http://www.springerlink.com/content/cknab9y9bpete2ha/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/berman-fc2004.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/berman-fc2004.pdf},
author = {Ron Berman and Amos Fiat and Amnon Ta-Shma},
editor = {Ari Juels}
}
@@ -10582,7 +10628,7 @@ In this paper we improve these results: we show that the same level of unlinkabi
pages = {74--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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/debs04perng.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/debs04perng.pdf},
author = {Ginger Perng and Chenxi Wang and Michael K. Reiter}
}
@conference { boneh04publickey,
@@ -10592,9 +10638,9 @@ In this paper we improve these results: we show that the same level of unlinkabi
month = jan,
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},
+ 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'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/encsearch.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/encsearch.pdf},
author = {Dan Boneh and Giovanni Di Crescenzo and Rafail Ostrovsky and Gieseppe Persiano}
}
@conference {pool-dummy04,
@@ -10606,12 +10652,12 @@ In this paper we improve these results: we show that the same level of unlinkabi
address = {Toronto},
abstract = {In this paper we study the anonymity provided by genralized mixes that insert dummy traffic. Mixes are an essential component to offer anonymous email services. We indicate how to compute the recipient and sender anonymity and we point out some problems that may arise from the intutitive extension of the metric to make into account dummies. Two possible ways of inserting dummy traffic are disussed and compared. An active attack scenario is considered, and the anonymity provided by mixes under the attack is analyzed},
www_section = {anonymity},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pool-dummy04.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/pool-dummy04.pdf},
author = {Claudia Diaz and Bart Preneel}
}
@conference {1247420,
title = {Redundancy elimination within large collections of files},
- booktitle = {ATEC {\textquoteright}04: Proceedings of the annual conference on USENIX Annual Technical Conference},
+ booktitle = {ATEC '04: Proceedings of the annual conference on USENIX Annual Technical Conference},
year = {2004},
pages = {5--5},
publisher = {USENIX Association},
@@ -10619,17 +10665,17 @@ In this paper we improve these results: we show that the same level of unlinkabi
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.91.8331.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.91.8331.pdf},
author = {Kulkarni, Purushottam and Douglis, Fred and Jason Lavoie and Tracey, John M.}
}
@conference {Barreto04areplicated,
title = {A Replicated File System for Resource Constrained Mobile Devices},
booktitle = {Proceedings of IADIS Applied Computing},
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},
+ 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'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},
www_section = {ad-hoc networks, ubiquitous computing},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.144.9141.pdf},
author = {Jo{\~a}o Barreto and Paulo Ferreira}
}
@conference {golle:pet2004,
@@ -10646,13 +10692,13 @@ We propose three very efficient protocols for reputable mixnets, all synchronous
isbn = {978-3-540-26203-9},
doi = {10.1007/b136164},
url = {http://www.springerlink.com/content/mqpu4nyljy82ca90/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/golle-pet2004.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/golle-pet2004.pdf},
author = {Philippe Golle}
}
@conference {Gupta:2004:RMF:1018440.1021942,
title = {Reputation Management Framework and Its Use as Currency in Large-Scale Peer-to-Peer Networks},
- booktitle = {P2P{\textquoteright}04. Proceedings of the 4th International Conference on Peer-to-Peer Computing},
- series = {P2P {\textquoteright}04},
+ booktitle = {P2P'04. Proceedings of the 4th International Conference on Peer-to-Peer Computing},
+ series = {P2P '04},
year = {2004},
month = aug,
pages = {124--132},
@@ -10664,7 +10710,7 @@ We propose three very efficient protocols for reputable mixnets, all synchronous
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/P2P\%2704\%20-\%20Reputation\%20management\%20framework.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/P2P\%2704\%20-\%20Reputation\%20management\%20framework.pdf},
author = {Gupta, Rohit and Somani, Arun K.}
}
@conference {Awerbuch04robustdistributed,
@@ -10673,25 +10719,25 @@ We propose three very efficient protocols for reputable mixnets, all synchronous
year = {2004},
pages = {1--8},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/awerbuch-robust.pdf},
author = {Awerbuch, Baruch}
}
@conference {Feldman:2004:RIT:988772.988788,
title = {Robust incentive techniques for peer-to-peer networks},
- booktitle = {EC{\textquoteright}04. Proceedings of the 5th ACM Conference on Electronic Commerce},
- series = {EC {\textquoteright}04},
+ booktitle = {EC'04. Proceedings of the 5th ACM Conference on Electronic Commerce},
+ series = {EC '04},
year = {2004},
month = may,
pages = {102--111},
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
- abstract = {Lack of cooperation (free riding) is one of the key problems that confronts today{\textquoteright}s P2P systems. What makes this problem particularly difficult is the unique set of challenges that P2P systems pose: large populations, high turnover, a symmetry of interest, collusion, zero-cost identities, and traitors. To tackle these challenges we model the P2P system using the Generalized Prisoner{\textquoteright}s Dilemma (GPD),and propose the Reciprocative decision function as the basis of a family of incentives techniques. These techniques are fullydistributed and include: discriminating server selection, maxflow-based subjective reputation, and adaptive stranger policies. Through simulation, we show that these techniques can drive a system of strategic users to nearly optimal levels of cooperation},
- www_section = {cheap pseudonyms, collusion, free-riding, incentives, peer-to-peer networking, prisoners dilemma, reputation, whitewash},
+ abstract = {Lack of cooperation (free riding) is one of the key problems that confronts today's P2P systems. What makes this problem particularly difficult is the unique set of challenges that P2P systems pose: large populations, high turnover, a symmetry of interest, collusion, zero-cost identities, and traitors. To tackle these challenges we model the P2P system using the Generalized Prisoner's Dilemma (GPD),and propose the Reciprocative decision function as the basis of a family of incentives techniques. These techniques are fullydistributed and include: discriminating server selection, maxflow-based subjective reputation, and adaptive stranger policies. Through simulation, we show that these techniques can drive a system of strategic users to nearly optimal levels of cooperation},
+ www_section = {cheap pseudonyms, collusion, free-riding, incentives, peer-to-peer networking, prisoners dilemma, reputation, whitewash, whitewashing},
isbn = {1-58113-771-0},
doi = {http://doi.acm.org/10.1145/988772.988788},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_13,
@@ -10700,7 +10746,7 @@ We propose three very efficient protocols for reputable mixnets, all synchronous
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]},
www_section = {byzantine agreement},
journal = {unknown},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/sba.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/sba.pdf},
author = {Lewis, Scott and Saia, Jared}
}
@conference {Goh04secureindexes,
@@ -10708,7 +10754,7 @@ We propose three very efficient protocols for reputable mixnets, all synchronous
booktitle = {In submission},
year = {2004},
url = {http://gnunet.org/papers/secureindex.pdf },
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/secureindex.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/secureindex.pdf},
author = {Eu-jin Goh}
}
@conference {Conrad04SecureServiceSignaling,
@@ -10725,7 +10771,7 @@ This paper describes the design and implementation of a secure, reliable, and sc
isbn = {978-3-540-71499-6},
doi = {10.1007/978-3-540-71500-9},
url = {http://i30www.ira.uka.de/research/publications/p2p/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/iwan2004.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/iwan2004.pdf},
author = {Michael Conrad and Thomas Fuhrmann and Marcus Schoeller and Martina Zitterbart}
}
@mastersthesis {2004_14,
@@ -10738,23 +10784,23 @@ This paper describes the design and implementation of a secure, reliable, and sc
address = {Munich, Germany},
abstract = {This work deals with the efficiency of Peer-to-Peer (P2P) networks, which are distributed and self-organizing overlay networks. We contribute to their understanding and design by using new measurement techniques, simulations and analytical methods. In this context we first present measurement methods and results of P2P networks concerning traffic and topology characteristics as well as concerning user behavior. Based on these results we develop stochastic models to describe the user behavior, the traffic and the topology of P2P networks analytically. Using the results of our measurements and analytical investigations, we develop new P2P architectures to improve the efficiency of P2P networks concerning their topology and their signaling traffic. Finally we verify our results for the new architectures by measurements as well as computer-based simulations on different levels of detail},
www_section = {application model, communication network, compression, content availability, cross layer communication, generating functions, overlay networks, random graph theory, self-organization, signaling traffic, simulation, topology measurement, traffic measurement, user model},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Schollmeier\%20-\%20Signaling\%20and\%20networking\%20in\%20unstructured\%20p2p\%20networks.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Schollmeier\%20-\%20Signaling\%20and\%20networking\%20in\%20unstructured\%20p2p\%20networks.pdf},
author = {R{\"u}diger Schollmeier}
}
@conference {1007919,
title = {Simple efficient load balancing algorithms for peer-to-peer systems},
- booktitle = {SPAA {\textquoteright}04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures},
+ booktitle = {SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures},
year = {2004},
pages = {36--43},
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
- abstract = {Load balancing is a critical issue for the efficient operation of peer-to-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a constant factor of optimal. Our protocols refine the consistent hashing data structure that underlies the Chord (and Koorde) P2P network. Both preserve Chord{\textquoteright}s logarithmic query time and near-optimal data migration cost.Consistent hashing is an instance of the distributed hash table (DHT) paradigm for assigning items to nodes in a peer-to-peer system: items and nodes are mapped to a common address space, and nodes have to store all items residing closeby in the address space.Our first protocol balances the distribution of the key address space to nodes, which yields a load-balanced system when the DHT maps items "randomly" into the address space. To our knowledge, this yields the first P2P scheme simultaneously achieving O(log n) degree, O(log n) look-up cost, and constant-factor load balance (previous schemes settled for any two of the three).Our second protocol aims to directly balance the distribution of items among the nodes. This is useful when the distribution of items in the address space cannot be randomized. We give a simple protocol that balances load by moving nodes to arbitrary locations "where they are needed." As an application, we use the last protocol to give an optimal implementation of a distributed data structure for range searches on ordered data},
+ abstract = {Load balancing is a critical issue for the efficient operation of peer-to-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a constant factor of optimal. Our protocols refine the consistent hashing data structure that underlies the Chord (and Koorde) P2P network. Both preserve Chord's logarithmic query time and near-optimal data migration cost.Consistent hashing is an instance of the distributed hash table (DHT) paradigm for assigning items to nodes in a peer-to-peer system: items and nodes are mapped to a common address space, and nodes have to store all items residing closeby in the address space.Our first protocol balances the distribution of the key address space to nodes, which yields a load-balanced system when the DHT maps items "randomly" into the address space. To our knowledge, this yields the first P2P scheme simultaneously achieving O(log n) degree, O(log n) look-up cost, and constant-factor load balance (previous schemes settled for any two of the three).Our second protocol aims to directly balance the distribution of items among the nodes. This is useful when the distribution of items in the address space cannot be randomized. We give a simple protocol that balances load by moving nodes to arbitrary locations "where they are needed." As an application, we use the last protocol to give an optimal implementation of a distributed data structure for range searches on ordered data},
www_section = {load balancing, P2P},
isbn = {1-58113-840-7},
doi = {10.1145/1007912.1007919},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.88.2405.pdf},
author = {David Karger and Ruhl, Matthias}
}
@conference {Shnayder04simulatingthe,
@@ -10766,11 +10812,11 @@ This paper describes the design and implementation of a secure, reliable, and sc
organization = {ACM Press},
abstract = {Developing sensor network applications demands a new set of tools to aid programmers. A number of simulation environments have been developed that provide varying degrees of scalability, realism, and detail for understanding the behavior of sensor networks. To date, however, none of these tools have addressed one of the most important aspects of sensor application design: that of power consumption. While simple approximations of overall power usage can be derived from estimates of node duty cycle and communication rates, these techniques often fail to capture the detailed, low-level energy requirements of the CPU, radio, sensors, and other peripherals.
-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},
+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'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},
www_section = {sensor networks, TinyOS},
doi = {10.1145/1031495.1031518},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.65.9976.pdf},
author = {Victor Shnayder and Mark Hempstead and Bor-rong Chen and Geoff Werner Allen and Matt Welsh}
}
@conference {DanSer04,
@@ -10787,7 +10833,7 @@ In this paper, we present, a scalable simulation environment for wireless sensor
isbn = {978-3-540-24207-9},
doi = {10.1007/b104759},
url = {http://www.springerlink.com/content/tqljb3hybk4rubla/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.6.2954.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.6.2954.pdf},
author = {George Danezis and Andrei Serjantov}
}
@article {Androutsellis-Theotokis:2004:SPC:1041680.1041681,
@@ -10804,18 +10850,18 @@ In this paper, we present, a scalable simulation environment for wireless sensor
issn = {0360-0300},
doi = {http://doi.acm.org/10.1145/1041680.1041681},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ACM\%20Computing\%20Surveys\%20-\%20A\%20survey\%20of\%20p2p\%20content\%20distribution\%20technologies.pdf},
author = {Androutsellis-Theotokis, Stephanos and Spinellis, Diomidis}
}
@conference {Tamilmani04swift:a,
title = {SWIFT: A System With Incentives For Trading},
- booktitle = {P2PECON{\textquoteright}04. Proceedings of the 2nd Workshop on Economics of Peer-to-Peer Systems},
+ booktitle = {P2PECON'04. Proceedings of the 2nd Workshop on Economics of Peer-to-Peer Systems},
year = {2004},
month = jun,
address = {Cambridge, Massachusetts, USA},
abstract = {In this paper, we present the design of a credit-based trading mechanism for peer-to-peer file sharing networks. We divide files into verifiable pieces; every peer interested in a file requests these pieces individually from the peers it is connected to. Our goal is to build a mechanism that supports fair large scale distribution in which downloads are fast, with low startup latency. We build a trading model in which peers use a pairwise currency to reconcile trading differences with each other and examine various trading strategies that peers can adopt. We show through analysis and simulation that peers who contribute to the network and take risks receive the most benefit in return. Our simulations demonstrate that peers who set high upload rates receive high download rates in return, but free-riders download very slowly compared to peers who upload. Finally, we propose a default trading strategy that is good for both the network as a whole and the peer employing it: deviating from that strategy yields little or no advantage for the peer},
www_section = {SWIFT, trading},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/P2PEcon\%2704\%20-\%20SWIFT.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/P2PEcon\%2704\%20-\%20SWIFT.pdf},
author = {Karthik Tamilmani and Vinay Pai and Alexander E. Mohr}
}
@conference {sync-batching,
@@ -10830,7 +10876,7 @@ In this paper, we present, a scalable simulation environment for wireless sensor
www_section = {anonymity, network topology},
doi = {10.1007/b136164},
url = {http://www.springerlink.com/content/uqvfwe97ehlldm8d/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/sync-batching.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/sync-batching.pdf},
author = {Roger Dingledine and Vitaly Shmatikov and Paul Syverson}
}
@conference {taxonomy-dummy,
@@ -10842,12 +10888,12 @@ In this paper, we present, a scalable simulation environment for wireless sensor
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},
www_section = {anonymity, dummy traffic, mix},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.5.9855.pdf},
author = {Claudia Diaz and Bart Preneel}
}
@conference {timing-fc2004,
title = {Timing Attacks in Low-Latency Mix-Based Systems},
- booktitle = {Proceedings of Financial Cryptography (FC {\textquoteright}04)},
+ booktitle = {Proceedings of Financial Cryptography (FC '04)},
year = {2004},
month = feb,
pages = {251--265},
@@ -10857,7 +10903,7 @@ In this paper, we present, a scalable simulation environment for wireless sensor
isbn = {978-3-540-22420-4},
doi = {10.1007/b98935},
url = {http://www.springerlink.com/content/n4khdtwk7dqvj0u0/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/timing-fc2004.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/timing-fc2004.pdf},
author = {Brian Neil Levine and Michael K. Reiter and Chenxi Wang and Matthew Wright},
editor = {Ari Juels}
}
@@ -10871,7 +10917,7 @@ In this paper, we present, a scalable simulation environment for wireless sensor
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},
www_section = {onion routing},
url = {http://portal.acm.org/citation.cfm?id=1251396},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tor-design.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/tor-design.pdf},
author = {Roger Dingledine and Nick Mathewson and Paul Syverson}
}
@conference {Kiran04totalrecall:,
@@ -10883,7 +10929,7 @@ In this paper, we present, a scalable simulation environment for wireless sensor
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},
www_section = {P2P},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/recall.pdf},
author = {Ranjita Bhagwan Kiran and Kiran Tati and Yu-chung Cheng and Stefan Savage and Geoffrey M. Voelker}
}
@conference {danezis:pet2004,
@@ -10901,7 +10947,7 @@ This paper describes the motivation, architecture and implementation for a new p
isbn = {978-3-540-26203-9},
doi = {10.1007/b136164},
url = {http://www.springerlink.com/content/kgenxdaxkyey4ed2/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/danezis-pet2004.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/danezis-pet2004.pdf},
author = {George Danezis}
}
@book {Jiang_trustand,
@@ -10912,14 +10958,14 @@ This paper describes the motivation, architecture and implementation for a new p
pages = {371--378},
publisher = {Springer Berlin / Heidelberg},
organization = {Springer Berlin / Heidelberg},
- abstract = {Most of the past studies on peer-to-peer systems have emphasized routing and lookup. The selfishness of users, which brings on the free riding problem, has not attracted sufficient attention from researchers. In this paper, we introduce a decentralized reputation-based trust model first, in which trust relationships could be built based on the reputation of peers. Subsequently, we use the iterated prisoner{\textquoteright}s dilemma to model the interactions in peer-to-peer systems and propose a simple incentive mechanism. By simulations, it{\textquoteright}s shown that the stable cooperation can emerge after limited rounds of interaction between peers by using the incentive mechanism},
- www_section = {cooperation, incentives, iterated prisoner{\textquoteright}s dilemma, peer-to-peer networking},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Jiang\%2C\%20Bai\%20\%26\%20Wang\%20-\%20Trust\%20and\%20Cooperation\%20in\%20Peer-to-Peer\%20Systems.pdf},
+ abstract = {Most of the past studies on peer-to-peer systems have emphasized routing and lookup. The selfishness of users, which brings on the free riding problem, has not attracted sufficient attention from researchers. In this paper, we introduce a decentralized reputation-based trust model first, in which trust relationships could be built based on the reputation of peers. Subsequently, we use the iterated prisoner's dilemma to model the interactions in peer-to-peer systems and propose a simple incentive mechanism. By simulations, it's shown that the stable cooperation can emerge after limited rounds of interaction between peers by using the incentive mechanism},
+ www_section = {cooperation, incentives, iterated prisoner's dilemma, peer-to-peer networking},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Jiang\%2C\%20Bai\%20\%26\%20Wang\%20-\%20Trust\%20and\%20Cooperation\%20in\%20Peer-to-Peer\%20Systems.pdf},
author = {Junjie Jiang and Haihuan Bai and Weinong Wang}
}
@conference {GolleJakobssonJuelsSyverson:universal04,
title = {Universal Re-Encryption for Mixnets},
- booktitle = {Proceedings of the 2004 RSA Conference, Cryptographer{\textquoteright}s track},
+ booktitle = {Proceedings of the 2004 RSA Conference, Cryptographer's track},
year = {2004},
month = feb,
publisher = {Springer Berlin / Heidelberg},
@@ -10931,18 +10977,18 @@ While technically and conceptually simple, universal re-encryption leads to new
isbn = {978-3-540-20996-6},
doi = {10.1007/b95630},
url = {http://www.springerlink.com/content/1fu5qrb1a2kfe7f9/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/GolleJakobssonJuelsSyverson-universal04.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/GolleJakobssonJuelsSyverson-universal04.pdf},
author = {Philippe Golle and Jakobsson, Markus and Ari Juels and Paul Syverson}
}
@conference {warta04-Klonowski,
title = {Universal Re-encryption of Signatures and Controlling Anonymous Information Flow},
- booktitle = {Proceedings of WARTACRYPT {\textquoteright}04},
+ booktitle = {Proceedings of WARTACRYPT '04},
year = {2004},
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},
www_section = {anonymity, information hiding, privacy, re-encryption},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.108.4976.pdf},
author = {Marek Klonowski and Miroslaw Kutylowski and Anna Lauks and Filip Zagorski}
}
@article {Dabek:2004:VDN:1030194.1015471,
@@ -10959,38 +11005,38 @@ While technically and conceptually simple, universal re-encryption leads to new
issn = {0146-4833},
doi = {http://doi.acm.org/10.1145/1030194.1015471},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SIGCOMM\%20Compt.\%20Commun.\%20Rev.\%20-\%20Vivaldi.pdf},
author = {Dabek, Frank and Russ Cox and Frans M. Kaashoek and Robert Morris}
}
@conference {1038318,
title = {Vulnerabilities and Security Threats in Structured Overlay Networks: A Quantitative Analysis},
- booktitle = {ACSAC {\textquoteright}04: Proceedings of the 20th Annual Computer Security Applications Conference},
+ booktitle = {ACSAC '04: Proceedings of the 20th Annual Computer Security Applications Conference},
year = {2004},
pages = {252--261},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Washington, DC, USA},
- abstract = {A number of recent applications have been built on distributed hash tables (DHTs) based overlay networks. Almost all DHT-based schemes employ a tight deterministic data placement and ID mapping schemes. This feature on one hand provides assurance on location of data if it exists, within a bounded number of hops, and on the other hand, opens doors for malicious nodes to lodge attacks that can potentially thwart the functionality of the overlay network. This paper studies several serious security threats in DHT-based systems through two targeted attacks at the overlay network{\textquoteright}s protocol layer. The first attack explores the routing anomalies that can be caused by malicious nodes returning incorrect lookup routes. The second attack targets the ID mapping scheme. We disclose that the malicious nodes can target any specific data item in the system; and corrupt/modify the data item to its favor. For each of these attacks, we provide quantitative analysis to estimate the extent of damage that can be caused by the attack; followed by experimental validation and defenses to guard the overlay networks from such attacks},
+ abstract = {A number of recent applications have been built on distributed hash tables (DHTs) based overlay networks. Almost all DHT-based schemes employ a tight deterministic data placement and ID mapping schemes. This feature on one hand provides assurance on location of data if it exists, within a bounded number of hops, and on the other hand, opens doors for malicious nodes to lodge attacks that can potentially thwart the functionality of the overlay network. This paper studies several serious security threats in DHT-based systems through two targeted attacks at the overlay network's protocol layer. The first attack explores the routing anomalies that can be caused by malicious nodes returning incorrect lookup routes. The second attack targets the ID mapping scheme. We disclose that the malicious nodes can target any specific data item in the system; and corrupt/modify the data item to its favor. For each of these attacks, we provide quantitative analysis to estimate the extent of damage that can be caused by the attack; followed by experimental validation and defenses to guard the overlay networks from such attacks},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.3.1198.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.3.1198.pdf},
author = {Srivatsa, Mudhakar and Liu, Ling}
}
@conference {Bustamante04wayback:a,
title = {Wayback: A User-level Versioning File System for Linux},
booktitle = {In Proceedings of USENIX 2004 (Freenix Track)},
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},
+ 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'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},
www_section = {file systems, version control},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {Andrade04whencan,
title = {When Can an Autonomous Reputation Scheme Discourage Free-riding in a Peer-to-Peer System?},
- booktitle = {in: CCGRID {\textquoteright}04: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid, IEEE Computer Society},
+ booktitle = {in: CCGRID '04: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid, IEEE Computer Society},
year = {2004},
pages = {440--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},
@@ -11005,32 +11051,32 @@ While technically and conceptually simple, universal re-encryption leads to new
pages = {31--39},
publisher = {IEEE Computer Society Washington, DC, USA},
organization = {IEEE Computer Society Washington, DC, USA},
- 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},
+ 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 ' 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},
www_section = {traffic analysis},
isbn = {0-7695-2033-2},
url = {http://portal.acm.org/citation.cfm?id=950964},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fu-active.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fu-active.pdf},
author = {Xinwen Fu and Bryan Graham and Riccardo Bettati and Wei Zhao}
}
@conference {939011,
title = {Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents},
- booktitle = {MobiCom {\textquoteright}03: Proceedings of the 9th annual international conference on Mobile computing and networking},
+ booktitle = {MobiCom '03: Proceedings of the 9th annual international conference on Mobile computing and networking},
year = {2003},
pages = {245--259},
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
- abstract = {We introduce a game-theoretic setting for routing in a mobile ad hoc network that consists of greedy, selfish agents who accept payments for forwarding data for other agents if the payments cover their individual costs incurred by forwarding data. In this setting, we propose Ad hoc-VCG, a reactive routing protocol that achieves the design objectives of truthfulness (i.e., it is in the agents{\textquoteright} best interest to reveal their true costs for forwarding data) and cost-efficiency (i.e., it guarantees that routing is done along the most cost-efficient path) in a game-theoretic sense by paying to the intermediate nodes a premium over their actual costs for forwarding data packets. We show that the total overpayment (i.e., the sum of all premiums paid) is relatively small by giving a theoretical upper bound and by providing experimental evidence. Our routing protocol implements a variation of the well-known mechanism by Vickrey, Clarke, and Groves in a mobile network setting. Finally, we analyze a very natural routing protocol that is an adaptation of the Packet Purse Model [8] with auctions in our setting and show that, unfortunately, it does not achieve cost-efficiency or truthfulness},
+ abstract = {We introduce a game-theoretic setting for routing in a mobile ad hoc network that consists of greedy, selfish agents who accept payments for forwarding data for other agents if the payments cover their individual costs incurred by forwarding data. In this setting, we propose Ad hoc-VCG, a reactive routing protocol that achieves the design objectives of truthfulness (i.e., it is in the agents' best interest to reveal their true costs for forwarding data) and cost-efficiency (i.e., it guarantees that routing is done along the most cost-efficient path) in a game-theoretic sense by paying to the intermediate nodes a premium over their actual costs for forwarding data packets. We show that the total overpayment (i.e., the sum of all premiums paid) is relatively small by giving a theoretical upper bound and by providing experimental evidence. Our routing protocol implements a variation of the well-known mechanism by Vickrey, Clarke, and Groves in a mobile network setting. Finally, we analyze a very natural routing protocol that is an adaptation of the Packet Purse Model [8] with auctions in our setting and show that, unfortunately, it does not achieve cost-efficiency or truthfulness},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.103.7483.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.103.7483.pdf},
author = {Anderegg, Luzi and Eidenbenz, Stephan}
}
@conference {1251057,
title = {An analysis of compare-by-hash},
- booktitle = {HOTOS{\textquoteright}03: Proceedings of the 9th conference on Hot Topics in Operating Systems},
+ booktitle = {HOTOS'03: Proceedings of the 9th conference on Hot Topics in Operating Systems},
year = {2003},
pages = {3--3},
publisher = {USENIX Association},
@@ -11038,7 +11084,7 @@ While technically and conceptually simple, universal re-encryption leads to new
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.100.8338.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.100.8338.pdf},
author = {Henson, Val}
}
@conference {Kuegler03ananalysis,
@@ -11050,7 +11096,7 @@ While technically and conceptually simple, universal re-encryption leads to new
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
www_section = {anonymity, GNUnet},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/GNUnet_pet.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/GNUnet_pet.pdf},
author = {Dennis K{\"u}gler}
}
@conference {fu-analytical,
@@ -11063,7 +11109,7 @@ While technically and conceptually simple, universal re-encryption leads to new
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fu-analytical.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fu-analytical.pdf},
author = {Xinwen Fu and Bryan Graham and Riccardo Bettati and Wei Zhao}
}
@conference {SN03,
@@ -11078,7 +11124,7 @@ While technically and conceptually simple, universal re-encryption leads to new
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},
www_section = {anonymity, mix},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.9.5699.pdf},
author = {Andrei Serjantov and Richard E. Newman}
}
@conference {Hildrum03asymptoticallyefficient,
@@ -11091,15 +11137,15 @@ While technically and conceptually simple, universal re-encryption leads to new
isbn = {978-3-540-20184-7},
doi = {10.1007/b13831},
url = {http://www.springerlink.com/content/7emt7u01cvbb6bu6/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.4.334.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.4.334.pdf},
author = {Hildrum, Kirsten and John Kubiatowicz}
}
@booklet {Hurler_automaticcontext,
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},
+ 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 ' 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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/hurler03context.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/hurler03context.pdf},
author = {Bernhard Hurler and Leo Petrak and Thomas Fuhrmann and Oliver Brand and Martina Zitterbart}
}
@conference {2003_0,
@@ -11109,7 +11155,7 @@ While technically and conceptually simple, universal re-encryption leads to new
month = jun,
address = {Berkeley, CA, USA},
www_section = {bartering, distributed computational economies, peer-to-peer bartering, resource discovery, resource exchange, resource peering},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Workshop\%20on\%20Economics\%20of\%20P2P\%20Systems\%2703\%20-\%20Chun\%2C\%20Fu\%20\%26\%20Vahdat.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Workshop\%20on\%20Economics\%20of\%20P2P\%20Systems\%2703\%20-\%20Chun\%2C\%20Fu\%20\%26\%20Vahdat.pdf},
author = {Chun, Brent and Yun Fu and Vahdat, Amin}
}
@conference {nguyen:pet2003,
@@ -11125,7 +11171,7 @@ While technically and conceptually simple, universal re-encryption leads to new
isbn = {978-3-540-20610-1},
doi = {10.1007/b94512},
url = {http://www.springerlink.com/content/0e0mwvgyt008wxkf/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/nguyen-pet2003.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/nguyen-pet2003.pdf},
author = {Lan Nguyen and Rei Safavi-Naini},
editor = {Roger Dingledine}
}
@@ -11138,25 +11184,25 @@ While technically and conceptually simple, universal re-encryption leads to new
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/focs01.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/focs01.pdf},
author = {Gopal Pandurangan and Prabhakar Raghavan and Eli Upfal}
}
@conference {Kostic:2003:BHB:945445.945473,
title = {Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh},
- booktitle = {SOSP{\textquoteright}03. Proceedings of the 19th ACM Symposium on Operating Systems Principles},
- series = {SOSP {\textquoteright}03},
+ booktitle = {SOSP'03. Proceedings of the 19th ACM Symposium on Operating Systems Principles},
+ series = {SOSP '03},
year = {2003},
month = oct,
pages = {282--297},
publisher = {ACM},
organization = {ACM},
address = {Bolton Landing, NY, USA},
- abstract = {In recent years, overlay networks have become an effective alternative to IP multicast for efficient point to multipoint communication across the Internet. Typically, nodes self-organize with the goal of forming an efficient overlay tree, one that meets performance targets without placing undue burden on the underlying network. In this paper, we target high-bandwidth data distribution from a single source to a large number of receivers. Applications include large-file transfers and real-time multimedia streaming. For these applications, we argue that an overlay mesh, rather than a tree, can deliver fundamentally higher bandwidth and reliability relative to typical tree structures. This paper presents Bullet, a scalable and distributed algorithm that enables nodes spread across the Internet to self-organize into a high bandwidth overlay mesh. We construct Bullet around the insight that data should be distributed in a disjoint manner to strategic points in the network. Individual Bullet receivers are then responsible for locating and retrieving the data from multiple points in parallel.Key contributions of this work include: i) an algorithm that sends data to different points in the overlay such that any data object is equally likely to appear at any node, ii) a scalable and decentralized algorithm that allows nodes to locate and recover missing data items, and iii) a complete implementation and evaluation of Bullet running across the Internet and in a large-scale emulation environment reveals up to a factor two bandwidth improvements under a variety of circumstances. In addition, we find that, relative to tree-based solutions, Bullet reduces the need to perform expensive bandwidth probing. In a tree, it is critical that a node{\textquoteright}s parent delivers a high rate of application data to each child. In Bullet however, nodes simultaneously receive data from multiple sources in parallel, making it less important to locate any single source capable of sustaining a high transmission rate},
+ abstract = {In recent years, overlay networks have become an effective alternative to IP multicast for efficient point to multipoint communication across the Internet. Typically, nodes self-organize with the goal of forming an efficient overlay tree, one that meets performance targets without placing undue burden on the underlying network. In this paper, we target high-bandwidth data distribution from a single source to a large number of receivers. Applications include large-file transfers and real-time multimedia streaming. For these applications, we argue that an overlay mesh, rather than a tree, can deliver fundamentally higher bandwidth and reliability relative to typical tree structures. This paper presents Bullet, a scalable and distributed algorithm that enables nodes spread across the Internet to self-organize into a high bandwidth overlay mesh. We construct Bullet around the insight that data should be distributed in a disjoint manner to strategic points in the network. Individual Bullet receivers are then responsible for locating and retrieving the data from multiple points in parallel.Key contributions of this work include: i) an algorithm that sends data to different points in the overlay such that any data object is equally likely to appear at any node, ii) a scalable and decentralized algorithm that allows nodes to locate and recover missing data items, and iii) a complete implementation and evaluation of Bullet running across the Internet and in a large-scale emulation environment reveals up to a factor two bandwidth improvements under a variety of circumstances. In addition, we find that, relative to tree-based solutions, Bullet reduces the need to perform expensive bandwidth probing. In a tree, it is critical that a node's parent delivers a high rate of application data to each child. In Bullet however, nodes simultaneously receive data from multiple sources in parallel, making it less important to locate any single source capable of sustaining a high transmission rate},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SOSP\%2703\%20-\%20Bullet.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SOSP\%2703\%20-\%20Bullet.pdf},
author = {Kosti{\'c}, Dejan and Rodriguez, Adolfo and Albrecht, Jeannie and Vahdat, Amin}
}
@article {buses03,
@@ -11166,17 +11212,17 @@ While technically and conceptually simple, universal re-encryption leads to new
number = {1},
year = {2003},
pages = {25--39},
- abstract = {This work develops a novel approach to hide the senders and the receivers of messages. The intuition is taken from an everyday activity that hides the {\textquoteleft}{\textquoteleft}communication pattern{\textquoteright}{\textquoteright}{\textemdash}the public transportation system. To describe our protocols, buses are used as a metaphor: Buses, i.e., messages, are traveling on the network, each piece of information is allocated a seat within the bus. Routes are chosen and buses are scheduled to traverse these routes. Deterministic and randomized protocols are presented, the protocols differ in the number of buses in the system, the worst case traveling time, and the required buffer size in a {\textquoteleft}{\textquoteleft}station.{\textquoteright}{\textquoteright} In particular, a protocol that is based on cluster partition of the network is presented; in this protocol there is one bus traversing each cluster. The clusters{\textquoteright} size in the partition gives time and communication tradeoffs. One advantage of our protocols over previous works is that they are not based on statistical properties for the communication pattern. Another advantage is that they only require the processors in the communication network to be busy periodically},
+ abstract = {This work develops a novel approach to hide the senders and the receivers of messages. The intuition is taken from an everyday activity that hides the {\textquoteleft}{\textquoteleft}communication pattern''{\textemdash}the public transportation system. To describe our protocols, buses are used as a metaphor: Buses, i.e., messages, are traveling on the network, each piece of information is allocated a seat within the bus. Routes are chosen and buses are scheduled to traverse these routes. Deterministic and randomized protocols are presented, the protocols differ in the number of buses in the system, the worst case traveling time, and the required buffer size in a {\textquoteleft}{\textquoteleft}station.'' In particular, a protocol that is based on cluster partition of the network is presented; in this protocol there is one bus traversing each cluster. The clusters' size in the partition gives time and communication tradeoffs. One advantage of our protocols over previous works is that they are not based on statistical properties for the communication pattern. Another advantage is that they only require the processors in the communication network to be busy periodically},
www_section = {privacy, traffic analysis},
issn = {0933-2790},
doi = {10.1007/s00145-002-0128-6},
url = {http://www.springerlink.com/content/eljjgl3ec01c00xa/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.80.1566.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.80.1566.pdf},
author = {Amos Beimel and Shlomi Dolev}
}
@conference {778418,
title = {A charging and rewarding scheme for packet forwarding in multi-hop cellular networks},
- booktitle = {MobiHoc {\textquoteright}03: Proceedings of the 4th ACM international symposium on Mobile ad hoc networking \& computing},
+ booktitle = {MobiHoc '03: Proceedings of the 4th ACM international symposium on Mobile ad hoc networking \& computing},
year = {2003},
pages = {13--24},
publisher = {ACM},
@@ -11187,7 +11233,7 @@ While technically and conceptually simple, universal re-encryption leads to new
isbn = {1-58113-684-6},
doi = {10.1145/778415.778418},
url = {http://portal.acm.org/citation.cfm?id=778418$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BenSalemBHJ03mobihoc.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/BenSalemBHJ03mobihoc.pdf},
author = {Salem, Naouel Ben and Levente Butty{\'a}n and Jean-Pierre Hubaux and Jakobsson, Markus}
}
@conference {kutzner03connecting,
@@ -11198,29 +11244,29 @@ While technically and conceptually simple, universal re-encryption leads to new
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kutzner03connecting.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/kutzner03connecting.pdf},
author = {Kendy Kutzner and Jean-Jacques Tchouto and Marc Bechler and Lars Wolf and Bernd Bochow and Thomas Luckenbach}
}
@conference {1247343,
title = {A cooperative internet backup scheme},
- booktitle = {ATEC {\textquoteright}03: Proceedings of the annual conference on USENIX Annual Technical Conference},
+ booktitle = {ATEC '03: Proceedings of the annual conference on USENIX Annual Technical Conference},
year = {2003},
pages = {3--3},
publisher = {USENIX Association},
organization = {USENIX Association},
address = {Berkeley, CA, USA},
- abstract = {We present a novel peer-to-peer backup technique that allows computers connected to the Internet to back up their data cooperatively: Each computer has a set of partner computers, which collectively hold its backup data. In return, it holds a part of each partner{\textquoteright}s backup data. By adding redundancy and distributing the backup data across many partners, a highly-reliable backup can be obtained in spite of the low reliability of the average Internet machine.
+ abstract = {We present a novel peer-to-peer backup technique that allows computers connected to the Internet to back up their data cooperatively: Each computer has a set of partner computers, which collectively hold its backup data. In return, it holds a part of each partner's backup data. By adding redundancy and distributing the backup data across many partners, a highly-reliable backup can be obtained in spite of the low reliability of the average Internet machine.
-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},
+Because our scheme requires cooperation, it is potentially vulnerable to several novel attacks involving free riding (e.g., holding a partner'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},
www_section = {backup, P2P, redundancy},
url = {http://portal.acm.org/citation.cfm?id=1247343$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/lillibridge.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/lillibridge.pdf},
author = {Mark Lillibridge and Sameh Elnikety and Andrew D. Birrell and Mike Burrows and Isard, Michael}
}
@conference {Leibowitz:2003:DKN:832311.837393,
title = {Deconstructing the Kazaa Network},
- booktitle = {WIAPP{\textquoteright}03--Proceedings of the The Third IEEE Workshop on Internet Applications},
- series = {WIAPP {\textquoteright}03},
+ booktitle = {WIAPP'03--Proceedings of the The Third IEEE Workshop on Internet Applications},
+ series = {WIAPP '03},
year = {2003},
month = jun,
pages = {0--112},
@@ -11231,7 +11277,7 @@ Because our scheme requires cooperation, it is potentially vulnerable to several
www_section = {file swapping traffic, kazaa, traffic},
isbn = {0-7695-1972-5},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/WIAPP\%2703\%20-\%20Deconstructing\%20the\%20Kazaa\%20network.pdf},
author = {Leibowitz, Nathaniel and Ripeanu, Matei and Wierzbicki, Adam}
}
@conference {wright03,
@@ -11242,26 +11288,26 @@ Because our scheme requires cooperation, it is potentially vulnerable to several
pages = {28--43},
publisher = {IEEE Computer Society Washington, DC, USA},
organization = {IEEE Computer Society Washington, DC, USA},
- 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},
+ 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' 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},
www_section = {attack, P2P},
isbn = {0-7695-1940-7},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/wright-passive.pdf , https://gnunet.org/git/bibliography.git/plain/docs/wright-passive2.pdf},
author = {Matthew Wright and Micah Adler and Brian Neil Levine and Clay Shields}
}
@conference {863960,
title = {A delay-tolerant network architecture for challenged internets},
- booktitle = {SIGCOMM {\textquoteright}03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications},
+ booktitle = {SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications},
year = {2003},
pages = {27--34},
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
- 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},
+ abstract = {The highly successful architecture and protocols of today'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IRB-TR-03-003.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IRB-TR-03-003.pdf},
author = {Fall, Kevin}
}
@booklet { roca03design,
@@ -11272,7 +11318,7 @@ Because our scheme requires cooperation, it is potentially vulnerable to several
isbn = {978-3-540-20051-2},
doi = {10.1007/b13249},
url = {http://www.springerlink.com/content/tdemq6m8b20320hb/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ngc03_ldpc_slides_03sep18_4s.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ngc03_ldpc_slides_03sep18_4s.pdf},
author = {Vincent Roca and Zainab Khallouf and Julien Laboure}
}
@booklet {_,
@@ -11283,7 +11329,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},
www_section = {backup, distributed hash table},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.104.8086.pdf},
author = {Emil Sit and Josh Cates and Russ Cox}
}
@conference {Acquisti03onthe,
@@ -11293,7 +11339,7 @@ This paper presents the design and implementation of a cooperative off-site back
pages = {84--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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.13.5636.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.13.5636.pdf},
author = {Alessandro Acquisti and Roger Dingledine and Paul Syverson}
}
@conference {Buchegger03theeffect,
@@ -11303,7 +11349,7 @@ This paper presents the design and implementation of a cooperative off-site back
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},
www_section = {ad-hoc networks, reputation, robustness},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.13.9006_0.pdf},
author = {Sonja Buchegger and Jean-Yves Le Boudec}
}
@conference {2003_1,
@@ -11314,13 +11360,13 @@ This paper presents the design and implementation of a cooperative off-site back
address = {Sophia-Antipolis, France},
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 adhoc networks. Several approaches have been proposed to detect noncooperative nodes. In this paper, we investigate the e$\#$ect 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},
www_section = {mobile Ad-hoc networks, reputation, reputation system, rumor},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WiOpt\%2703\%20-\%20Buchegger\%20\%26\%20Le\%20Boudec\%20-\%20Reputation\%20Systems.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/WiOpt\%2703\%20-\%20Buchegger\%20\%26\%20Le\%20Boudec\%20-\%20Reputation\%20Systems.pdf},
author = {Sonja Buchegger and Jean-Yves Le Boudec}
}
@conference {Kwon:2003:EPF:827273.829221,
title = {An Efficient Peer-to-Peer File Sharing Exploiting Hierarchy and Asymmetry},
- booktitle = {SAINT{\textquoteright}03. Proceedings of the 2003 Symposium on Applications and the Internet},
- series = {SAINT {\textquoteright}03},
+ booktitle = {SAINT'03. Proceedings of the 2003 Symposium on Applications and the Internet},
+ series = {SAINT '03},
year = {2003},
month = jan,
pages = {0--226},
@@ -11332,30 +11378,30 @@ This paper presents the design and implementation of a cooperative off-site back
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SAINT\%2703\%20-\%20Kwon\%20\%26\%20Ryu.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SAINT\%2703\%20-\%20Kwon\%20\%26\%20Ryu.pdf},
author = {Kwon, Gisik and Ryu, Kyung D.}
}
@conference {Kamvar:2003:EAR:775152.775242,
title = {The EigenTrust algorithm for reputation management in P2P networks},
- booktitle = {WWW{\textquoteright}03. Proceedings of the 12th International Conference on World Wide Web},
- series = {WWW {\textquoteright}03},
+ booktitle = {WWW'03. Proceedings of the 12th International Conference on World Wide Web},
+ series = {WWW '03},
year = {2003},
month = may,
pages = {640--651},
publisher = {ACM},
organization = {ACM},
address = {Budapest, Hungary},
- abstract = {Peer-to-peer file-sharing networks are currently receiving much attention as a means of sharing and distributing information. However, as recent experience shows, the anonymous, open nature of these networks offers an almost ideal environment for the spread of self-replicating inauthentic files.We describe an algorithm to decrease the number of downloads of inauthentic files in a peer-to-peer file-sharing network that assigns each peer a unique global trust value, based on the peer{\textquoteright}s history of uploads. We present a distributed and secure method to compute global trust values, based on Power iteration. By having peers use these global trust values to choose the peers from whom they download, the network effectively identifies malicious peers and isolates them from the network.In simulations, this reputation system, called EigenTrust, has been shown to significantly decrease the number of inauthentic files on the network, even under a variety of conditions where malicious peers cooperate in an attempt to deliberately subvert the system},
+ abstract = {Peer-to-peer file-sharing networks are currently receiving much attention as a means of sharing and distributing information. However, as recent experience shows, the anonymous, open nature of these networks offers an almost ideal environment for the spread of self-replicating inauthentic files.We describe an algorithm to decrease the number of downloads of inauthentic files in a peer-to-peer file-sharing network that assigns each peer a unique global trust value, based on the peer's history of uploads. We present a distributed and secure method to compute global trust values, based on Power iteration. By having peers use these global trust values to choose the peers from whom they download, the network effectively identifies malicious peers and isolates them from the network.In simulations, this reputation system, called EigenTrust, has been shown to significantly decrease the number of inauthentic files on the network, even under a variety of conditions where malicious peers cooperate in an attempt to deliberately subvert the system},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/WWW\%2703\%20-\%20The\%20EigenTrust\%20algorithm.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/WWW\%2703\%20-\%20The\%20EigenTrust\%20algorithm.pdf},
author = {Kamvar, Sepandar D. and Schlosser, Mario T. and Hector Garcia-Molina}
}
@conference {948119,
title = {Establishing pairwise keys in distributed sensor networks},
- booktitle = {CCS {\textquoteright}03: Proceedings of the 10th ACM conference on Computer and communications security},
+ booktitle = {CCS '03: Proceedings of the 10th ACM conference on Computer and communications security},
year = {2003},
pages = {52--61},
publisher = {ACM},
@@ -11366,7 +11412,7 @@ This paper presents the design and implementation of a cooperative off-site back
isbn = {1-58113-738-9},
doi = {10.1145/948109.948119},
url = {http://portal.acm.org/citation.cfm?id=948119$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ccs03-SNKeyMan.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ccs03-SNKeyMan.pdf},
author = {Liu, Donggang and Peng Ning}
}
@article {2003_2,
@@ -11379,7 +11425,7 @@ This paper presents the design and implementation of a cooperative off-site back
abstract = {Both laboratory and field data suggest that people punish noncooperators even in one-shot interactions. Although such {\textquotedblleft}altruistic punishment{\textquotedblright} may explain the high levels of cooperation in human societies, it creates an evolutionary puzzle: existing models suggest that altruistic cooperation among nonrelatives is evolutionarily stable only in small groups. Thus, applying such models to the evolution of altruistic punishment leads to the prediction that people will not incur costs to punish others to provide benefits to large groups of nonrelatives. However, here we show that an important asymmetry between altruistic cooperation and altruistic punishment allows altruistic punishment to evolve in populations engaged in one-time, anonymous interactions. This process allows both altruistic punishment and altruistic cooperation to be maintained even when groups are large and other parameter values approximate conditions that characterize cultural evolution in the small-scale societies in which humans lived for most of our prehistory},
www_section = {altruistic cooperation, altruistic punishment, cooperation, human society, nonrelatives},
doi = {10.1073/pnas.0630443100},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PNAS\%20\%282003\%29\%20-\%20The\%20evolution\%20of\%20altruistic\%20punishment.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PNAS\%20\%282003\%29\%20-\%20The\%20evolution\%20of\%20altruistic\%20punishment.pdf},
author = {Robert Boyd and Herbert Gintis and Samuel Bowles and Peter J. Richerson}
}
@article { ebe2003,
@@ -11397,16 +11443,16 @@ makes it hard to link a transaction to the node where it originated from. While
decisions},
www_section = {anonymity, file-sharing, GNUnet},
url = {http://grothoff.org/christian/ebe.pdf},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ebe.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ebe.pdf},
author = {Christian Grothoff}
}
@booklet {Peterson03ext3cow:the,
title = {Ext3cow: The Design, Implementation, and Analysis of Metadata for a Time-Shifting File System},
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},
+ abstract = {The ext3cow file system, built on Linux'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},
www_section = {file systems},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.10.2545.pdf},
author = {Zachary N. J. Peterson and Randal C. Burns}
}
@article {2003_3,
@@ -11420,7 +11466,7 @@ In this paper we analyze several extensions to the exponential feedback algorith
doi = {10.1007/b13249},
journal = {unknown},
url = {http://www.springerlink.com/content/bvelyaew4ukl4aau/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann03feedback.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fuhrmann03feedback.pdf},
author = {Thomas Fuhrmann and J{\"o}rg Widmer}
}
@conference {2003_4,
@@ -11432,12 +11478,12 @@ In this paper we analyze several extensions to the exponential feedback algorith
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Link{\"o}ping, Sweden},
- abstract = {Peer-to-peer (P2P) networks are self-organizing, distributed systems, with no centralized authority or infrastructure. Because of the voluntary participation, the availability of resources in a P2P system can be highly variable and unpredictable. We use ideas from game theory to study the interaction of strategic and rational peers, and propose a differential service-based incentive scheme to improve the system{\textquoteright}s performance},
+ abstract = {Peer-to-peer (P2P) networks are self-organizing, distributed systems, with no centralized authority or infrastructure. Because of the voluntary participation, the availability of resources in a P2P system can be highly variable and unpredictable. We use ideas from game theory to study the interaction of strategic and rational peers, and propose a differential service-based incentive scheme to improve the system's performance},
www_section = {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_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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference { gap,
@@ -11453,7 +11499,7 @@ The main focus of this work is gap, a simple protocol for anonymous transfer of
schemes, allowing individual nodes to balance anonymity with efficiency according to their specific needs},
www_section = {anonymity, GNUnet, installation},
url = {http://grothoff.org/christian/aff.pdf},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/aff.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/aff.pdf},
author = {Krista Bennett and Christian Grothoff}
}
@conference {diaz:pet2003,
@@ -11470,7 +11516,7 @@ We then show how to express existing mixes in the framework, and then suggest ot
isbn = {978-3-540-20610-1},
doi = {10.1007/b94512},
url = {http://www.springerlink.com/content/jvuk0exyqxvcyhvy/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.3.9155.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.3.9155.pdf},
author = {Claudia Diaz and Andrei Serjantov},
editor = {Roger Dingledine}
}
@@ -11487,7 +11533,7 @@ We then show how to express existing mixes in the framework, and then suggest ot
isbn = {1-58113-776-1},
doi = {10.1145/1005140.1005154},
url = {http://portal.acm.org/citation.cfm?id=1005154},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/danezis-wpes2003.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/danezis-wpes2003.pdf},
author = {George Danezis and Len Sassaman}
}
@booklet {herbivore:tr,
@@ -11500,7 +11546,7 @@ We then show how to express existing mixes in the framework, and then suggest ot
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},
www_section = {anonymity, P2P, privacy},
url = {http://ecommons.cornell.edu/handle/1813/5606},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/herbivore-tr.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/herbivore-tr.pdf},
author = {Goel, Sharad and Mark Robson and Milo Polte and Emin G{\"u}n Sirer}
}
@article {10.1109/ICPP.2003.1240580,
@@ -11530,29 +11576,29 @@ In this paper, we propose a new P2P routing algorithm--- HIERAS to relieve this
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},
www_section = {distributed hosts, dynamic peer network, peer-to-peer storage, redundancy},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/HotOS\%20IX\%20-\%20High\%20available\%2C\%20scalable\%20storage\%2C\%20dynamic\%20peer\%20networks.pdf},
author = {Blake, Charles and Rodrigues, Rodrigo}
}
@conference {10.1109/PTP.2003.1231513,
title = {Identity Crisis: Anonymity vs. Reputation in P2P Systems},
- booktitle = {P2P{\textquoteright}03. Proceecings of the 3rd International Conference on Peer-to-Peer Computing},
+ booktitle = {P2P'03. Proceecings of the 3rd International Conference on Peer-to-Peer Computing},
year = {2003},
month = sep,
pages = {0--134},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Link{\"o}ping, Sweden},
- abstract = {The effectiveness of reputation systems for peer-to-peer resource-sharing networks is largely dependent on the reliability of the identities used by peers in the network. Much debate has centered around how closely one{\textquoteright}s pseudoidentity in the network should be tied to their real-world identity, and how that identity is protected from malicious spoofing. In this paper we investigate the cost in efficiency of two solutions to the identity problem for peer-to-peer reputation systems. Our results show that, using some simple mechanisms, reputation systems can provide a factor of 4 to 20 improvement in performance over no reputation system, depending on the identity model used},
+ abstract = {The effectiveness of reputation systems for peer-to-peer resource-sharing networks is largely dependent on the reliability of the identities used by peers in the network. Much debate has centered around how closely one's pseudoidentity in the network should be tied to their real-world identity, and how that identity is protected from malicious spoofing. In this paper we investigate the cost in efficiency of two solutions to the identity problem for peer-to-peer reputation systems. Our results show that, using some simple mechanisms, reputation systems can provide a factor of 4 to 20 improvement in performance over no reputation system, depending on the identity model used},
www_section = {anonymity, identity, identity model, P2P, peer-to-peer networking, reliability, reputation, reputation system},
isbn = {0-7695-2023-5},
doi = {http://doi.ieeecomputersociety.org/10.1109/PTP.2003.1231513},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/P2P\%2703\%20-\%20Identity\%20crisis\%3A\%20anonymity\%20vs\%20reputation.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/P2P\%2703\%20-\%20Identity\%20crisis\%3A\%20anonymity\%20vs\%20reputation.pdf},
author = {Marti, Sergio and Hector Garcia-Molina}
}
@conference {Gummadi:2003:IDR:863955.863998,
title = {The impact of DHT routing geometry on resilience and proximity},
- booktitle = {SIGCOMM {\textquoteright}03--Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications},
- series = {SIGCOMM {\textquoteright}03},
+ booktitle = {SIGCOMM '03--Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications},
+ series = {SIGCOMM '03},
year = {2003},
month = aug,
pages = {381--394},
@@ -11564,7 +11610,7 @@ In this paper, we propose a new P2P routing algorithm--- HIERAS to relieve this
isbn = {1-58113-735-4},
doi = {http://doi.acm.org/10.1145/863955.863998},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {clayton:pet2003,
@@ -11578,19 +11624,19 @@ In this paper, we propose a new P2P routing algorithm--- HIERAS to relieve this
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},
www_section = {onion routing},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/clayton-pet2003.pdf},
author = {Richard Clayton},
editor = {Roger Dingledine}
}
@conference {2003_5,
title = {Incentives build robustness in BitTorrent},
- booktitle = {NetEcon{\textquoteright}03--Proceedings of the Workshop on Economics of Peer-to-Peer Systems },
+ booktitle = {NetEcon'03--Proceedings of the Workshop on Economics of Peer-to-Peer Systems },
year = {2003},
month = jun,
address = {Berkeley, CA, USA},
abstract = {The BitTorrent file distribution system uses tit-for-tat as a method to seeking pareto efficiency. It achieves a higher level of robustness and resource utilization than any currently known cooperative technique. We explain what BitTorrent does, and how economic methods are used to achieve that goal},
www_section = {BitTorrent, resource utilization, robustness},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NetEcon\%2703\%20-\%20Cohen\%20-\%20Incentives\%20build\%20robustness\%20in\%20BitTorrent.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/NetEcon\%2703\%20-\%20Cohen\%20-\%20Incentives\%20build\%20robustness\%20in\%20BitTorrent.pdf},
author = {Bram Cohen}
}
@conference {Lai03incentivesfor,
@@ -11599,10 +11645,10 @@ In this paper, we propose a new P2P routing algorithm--- HIERAS to relieve this
year = {2003},
month = jun,
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},
+ 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' actions) fail as the population size increases},
www_section = {P2P, privacy},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/incentives-for-cooperation-in_0.pdf},
author = {Kevin Lai and Michal Feldman and Ion Stoica and John Chuang}
}
@conference {Ahn03k-anonymousmessage,
@@ -11613,31 +11659,31 @@ In this paper, we propose a new P2P routing algorithm--- HIERAS to relieve this
publisher = {ACM New York, NY, USA},
organization = {ACM New York, NY, USA},
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},
+ 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'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/k-anonymous_ccs2003.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/k-anonymous_ccs2003.pdf},
author = {Luis von Ahn and Andrew Bortz and Nicholas J. Hopper}
}
@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},
+ booktitle = {P2PECON'05. Proceedings of the 3rd Workshop on Economics of Peer-to-Peer Systems},
year = {2003},
month = jun,
address = {Berkeley, CA, USA},
abstract = {Peer-to-peer systems are typically designed around the assumption that all peers will willingly contribute resources to a global pool. They thus suffer from freeloaders,that is, participants who consume many more resources than they contribute. In this paper, we propose a general economic framework for avoiding freeloaders in peer-to-peer systems. Our system works by keeping track of the resource consumption and resource contributionof each participant. The overall standing of each},
www_section = {economic framework, freeloader, karma, p2p resource sharing},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/P2PECON\%2705\%20-\%20KARMA.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/P2PECON\%2705\%20-\%20KARMA.pdf},
author = {Vivek Vishnumurthy and Sangeeth Chandrakumar and Emin G{\"u}n Sirer}
}
@conference {Gupta03kelips:building,
title = {Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead},
- booktitle = {Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS {\textquoteright}03)},
+ booktitle = {Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03)},
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},
www_section = {distributed hash table, P2P},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_7,
@@ -11653,16 +11699,16 @@ In this paper, we propose a new P2P routing algorithm--- HIERAS to relieve this
abstract = {Koorde is a new distributed hash table (DHT) based on Chord 15 and the de Bruijn graphs 2. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such as O(log n) hops per lookup request with only 2 neighbors per node (where n is the number of nodes in the DHT), and O(log n/log log n) hops per lookup request with O(log n) neighbors per node},
www_section = {de Bruijn graph, distributed hash table, Koorde},
doi = {10.1007/b11823},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/koorde.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/koorde.pdf},
author = {Frans M. Kaashoek and David Karger}
}
@booklet { turner03lightweight,
title = {A Lightweight Currency Paradigm for the P2P Resource Market},
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},
+ 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'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},
www_section = {P2P},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/LightweightParadigm.pdf},
author = {David A. Turner and Keith W. Ross}
}
@article {Eugster:2003:LPB:945506.945507,
@@ -11676,28 +11722,28 @@ In this paper, we propose a new P2P routing algorithm--- HIERAS to relieve this
address = {New York, NY, USA},
www_section = {Broadcast, buffering, garbage collection, gossip, noise, randomization, reliability, scalability},
issn = {0734-2071},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/lightweight_prob_broadcast.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/lightweight_prob_broadcast.pdf},
author = {Patrick Eugster and Rachid Guerraoui and Sidath B. Handurukande and Petr Kouznetsov and Anne-Marie Kermarrec}
}
@conference {864000,
title = {Making gnutella-like P2P systems scalable},
- booktitle = {SIGCOMM {\textquoteright}03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications},
+ booktitle = {SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications},
year = {2003},
pages = {407--418},
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
- abstract = {Napster pioneered the idea of peer-to-peer file sharing, and supported it with a centralized file search facility. Subsequent P2P systems like Gnutella adopted decentralized search algorithms. However, Gnutella{\textquoteright}s notoriously poor scaling led some to propose distributed hash table solutions to the wide-area file search problem. Contrary to that trend, we advocate retaining Gnutella{\textquoteright}s simplicity while proposing new mechanisms that greatly improve its scalability. Building upon prior research [1, 12, 22], we propose several modifications to Gnutella{\textquoteright}s design that dynamically adapt the overlay topology and the search algorithms in order to accommodate the natural heterogeneity present in most peer-to-peer systems. We test our design through simulations and the results show three to five orders of magnitude improvement in total system capacity. We also report on a prototype implementation and its deployment on a testbed},
+ abstract = {Napster pioneered the idea of peer-to-peer file sharing, and supported it with a centralized file search facility. Subsequent P2P systems like Gnutella adopted decentralized search algorithms. However, Gnutella's notoriously poor scaling led some to propose distributed hash table solutions to the wide-area file search problem. Contrary to that trend, we advocate retaining Gnutella's simplicity while proposing new mechanisms that greatly improve its scalability. Building upon prior research [1, 12, 22], we propose several modifications to Gnutella's design that dynamically adapt the overlay topology and the search algorithms in order to accommodate the natural heterogeneity present in most peer-to-peer systems. We test our design through simulations and the results show three to five orders of magnitude improvement in total system capacity. We also report on a prototype implementation and its deployment on a testbed},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.10.5444.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.10.5444.pdf},
author = {Chawathe, Yatin and Breslau, Lee and Lanham, Nick and S Shenker}
}
@conference {1090700,
title = {Metadata Efficiency in Versioning File Systems},
- booktitle = {FAST {\textquoteright}03: Proceedings of the 2nd USENIX Conference on File and Storage Technologies},
+ booktitle = {FAST '03: Proceedings of the 2nd USENIX Conference on File and Storage Technologies},
year = {2003},
pages = {43--58},
publisher = {USENIX Association},
@@ -11706,7 +11752,7 @@ In this paper, we propose a new P2P routing algorithm--- HIERAS to relieve this
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},
www_section = {file systems},
url = {http://portal.acm.org/citation.cfm?id=1090694.1090700$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fast03.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fast03.pdf},
author = {Soules, Craig A. N. and Goodson, Garth R. and Strunk, John D. and Ganger, Gregory R.}
}
@conference {newman:pet2003,
@@ -11719,7 +11765,7 @@ In this paper, we propose a new P2P routing algorithm--- HIERAS to relieve this
organization = {Springer-Verlag, LNCS 2760},
abstract = {This paper considers systems for Traffic Analysis Prevention (TAP) in a theoretical model. It considers TAP based on padding and rerouting of messages and describes the effects each has on the difference between the actual and the observed traffic matrix (TM). The paper introduces an entropy-based approach to the amount of uncertainty a global passive adversary has in determining the actual TM, or alternatively, the probability that the actual TM has a property of interest. Unlike previous work, the focus is on determining the overall amount of anonymity a TAP system can provide, or the amount it can provide for a given cost in padding and rerouting, rather than on the amount of protection a afforded particular communications},
www_section = {traffic analysis, traffic matrix},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/steinbrecher-pet2003_0.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/steinbrecher-pet2003_0.pdf},
author = {Richard E. Newman and Ira S. Moskowitz and Paul Syverson and Andrei Serjantov},
editor = {Roger Dingledine}
}
@@ -11730,10 +11776,10 @@ In this paper, we propose a new P2P routing algorithm--- HIERAS to relieve this
abstract = {Most e-mail security protocols only protect the message body, leaving useful information such as the the identities of the conversing parties, sizes of messages and frequency of message exchange open to adversaries. This document describes Mixmaster (version 2), a mail transfer protocol designed to protect electronic mail against traffic
analysis.
-Mixmaster is based on D. Chaum{\textquoteright}s mix-net protocol. A mix (remailer) is a service that forwards messages, using public key
+Mixmaster is based on D. Chaum's mix-net protocol. A mix (remailer) is a service that forwards messages, using public key
cryptography to hide the correlation between its inputs and outputs. Sending messages through sequences of remailers achieves anonymity and unobservability of communications against a powerful adversary},
www_section = {electronic mail, public key cryptography, traffic analysis},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/freehaven.net-anonbib-cache-mixmaster-spec.txt.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/freehaven.net-anonbib-cache-mixmaster-spec.txt.pdf},
author = {Ulf M{\"o}ller and Lance Cottrell and Peter Palfrader and Len Sassaman}
}
@conference {Danezis03mixminion:design,
@@ -11743,7 +11789,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
pages = {2--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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/minion-design.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/minion-design.pdf},
author = {George Danezis and Roger Dingledine and Nick Mathewson}
}
@conference {danezis:pet2003,
@@ -11757,7 +11803,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
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},
www_section = {anonymity, mix cascades, traffic analysis},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/danezis-pet2003.pdf},
author = {George Danezis},
editor = {Roger Dingledine}
}
@@ -11774,14 +11820,14 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
isbn = {978-3-540-20610-1},
doi = {10.1007/b94512},
url = {http://www.springerlink.com/content/dxteg659uf2jtdd7/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/steinbrecher-pet2003.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/steinbrecher-pet2003.pdf},
author = {Sandra Steinbrecher and Stefan K{\"o}psell},
editor = {Roger Dingledine}
}
@conference {Li:2003:MRQ:958491.958500,
title = {Multi-dimensional range queries in sensor networks},
booktitle = {Proceedings of the 1st international conference on Embedded networked sensor systems},
- series = {SenSys {\textquoteright}03},
+ series = {SenSys '03},
year = {2003},
pages = {63--75},
publisher = {ACM},
@@ -11791,7 +11837,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
isbn = {1-58113-707-9},
doi = {10.1145/958491.958500},
url = {http://doi.acm.org/10.1145/958491.958500},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/eScholarship\%20UC\%20item\%204x6723n2.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/eScholarship\%20UC\%20item\%204x6723n2.pdf},
author = {Li, Xin and Kim, Young Jin and Govindan, Ramesh and Hong, Wei}
}
@conference {Conrad03multiplelanguage,
@@ -11803,7 +11849,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/scholler03language.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/scholler03language.pdf},
author = {Michael Conrad and Marcus Schoeller and Thomas Fuhrmann and Gerhard Bocksch and Martina Zitterbart}
}
@conference {Gay03thenesc,
@@ -11811,11 +11857,11 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
booktitle = {In Proceedings of Programming Language Design and Implementation (PLDI)},
year = {2003},
pages = {1--11},
- 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},
+ 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'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},
www_section = {data races, nesC, TinyOS},
doi = {10.1145/781131.781133},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@booklet {Fuhrmann_networkservices,
@@ -11823,7 +11869,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ASWN2003.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ASWN2003.pdf},
author = {Thomas Fuhrmann and Till Harbaum and Martina Zitterbart}
}
@conference {Bauer03newcovert,
@@ -11850,7 +11896,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
isbn = {1-58113-776-1},
doi = {10.1145/1005140.1005152},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.4.6246.pdf},
author = {Matthias Bauer}
}
@booklet {Klinedinst_anew,
@@ -11864,7 +11910,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann03evaluation.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fuhrmann03evaluation.pdf},
author = {Thomas Fuhrmann and Marcus Schoeller and Christina Schmidt and Martina Zitterbart}
}
@conference {Tolia03opportunisticuse,
@@ -11872,15 +11918,15 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
booktitle = {In Proceedings of the 2003 USENIX Annual Technical Conference},
year = {2003},
pages = {127--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},
+ abstract = {Motivated by the prospect of readily available Content Addressable Storage (CAS), we introduce the concept of file recipes. A file'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},
www_section = {file systems, storage},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/casper-usenix2003.pdf},
author = {Niraj Tolia and Michael Kozuch and Satyanarayanan, Mahadev and Brad Karp and Thomas Bressoud and Adrian Perrig}
}
@conference {792493,
title = {An Overlay-Network Approach for Distributed Access to SRS},
- booktitle = {CCGRID {\textquoteright}03: Proceedings of the 3st International Symposium on Cluster Computing and the Grid},
+ booktitle = {CCGRID '03: Proceedings of the 3st International Symposium on Cluster Computing and the Grid},
year = {2003},
pages = {0--601},
publisher = {IEEE Computer Society},
@@ -11890,7 +11936,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
www_section = {overlay networks, P2P, SRS},
isbn = {0-7695-1919-9},
url = {http://portal.acm.org/citation.cfm?id=792493$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann03overlaySRS.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fuhrmann03overlaySRS.pdf},
author = {Thomas Fuhrmann and Andrea Schafferhans and Etzold, Thure}
}
@conference {SS03,
@@ -11906,16 +11952,16 @@ We analyse the anonymity of connection-based systems against passive adversaries
isbn = {978-3-540-20300-1},
doi = {10.1007/b13237},
url = {http://www.springerlink.com/content/8jva7vy8tkert9ur/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.5.2005.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.5.2005.pdf},
author = {Andrei Serjantov and Peter Sewell}
}
@booklet {Loo03peer-to-peerbackup,
title = {Peer-To-Peer Backup for Personal Area Networks},
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},
+ 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's performance characteristics},
www_section = {backup, P2P, personal area network},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/052820031647_102.pdf},
author = {Boon Thau Loo and Anthony LaMarca and Gaetano Borriello and Boon Thau Loo}
}
@booklet {Aberer03p-grid:a,
@@ -11924,24 +11970,24 @@ We analyse the anonymity of connection-based systems against passive adversaries
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},
www_section = {P2P},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {Cuenca-Acuna03planetp:using,
title = {PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities},
- booktitle = {12th IEEE International Symposium on High Performance Distributed Computing (HPDC-12 {\textquoteright}03),},
+ booktitle = {12th IEEE International Symposium on High Performance Distributed Computing (HPDC-12 '03),},
year = {2003},
publisher = {IEEE Press},
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/paper.dvi_.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/paper.dvi_.pdf},
author = {Francisco Matias Cuenca-Acuna and Christopher Peery and Richard P. Martin and Thu D. Nguyen}
}
@conference {DBLP:conf/ccs/YangG03,
title = {PPay: micropayments for peer-to-peer systems},
- booktitle = {CCS{\textquoteright}03. Proceedings od the 10th ACM Conference on Computer and Communications Security},
+ booktitle = {CCS'03. Proceedings od the 10th ACM Conference on Computer and Communications Security},
year = {2003},
month = oct,
pages = {300--310},
@@ -11951,7 +11997,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
www_section = {economics, payment},
isbn = {1-58113-738-9 },
doi = {http://dx.doi.org/10.1145/948109.948150},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CCS\%2703\%20-\%20Yang\%20\%26\%20Garcia-Molina\%20-\%20PPay.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CCS\%2703\%20-\%20Yang\%20\%26\%20Garcia-Molina\%20-\%20PPay.pdf},
author = {Beverly Yang and Hector Garcia-Molina}
}
@conference {RP03-1,
@@ -11966,7 +12012,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
www_section = {performance},
isbn = {0-7695-1963-6},
url = {http://portal.acm.org/citation.cfm?id=938984.939808},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/RP03-1.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/RP03-1.pdf},
author = {Marc Rennhard and Bernhard Plattner}
}
@booklet {pt:03:ldpc,
@@ -11978,7 +12024,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
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},
www_section = {distributed hash table, distributed storage, LDPC, P2P},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ut-cs-03-510.pdf},
author = {James S. Plank and Michael G. Thomason}
}
@conference {camenisch2003pve,
@@ -11993,7 +12039,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
isbn = {978-3-540-40674-7},
doi = {10.1007/b11817},
url = {http://www.springerlink.com/content/wjbh5579hdfd66ed/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/camenisch2003pve.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/camenisch2003pve.pdf},
author = {Jan Camenisch and Victor Shoup}
}
@conference {agrawal03,
@@ -12004,11 +12050,11 @@ We analyse the anonymity of connection-based systems against passive adversaries
pages = {16--27},
publisher = {IEEE Computer Society Washington, DC, USA},
organization = {IEEE Computer Society Washington, DC, USA},
- 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},
+ 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' of the MIXes and thus to protect users against a traffic analysis by the disclosure attack},
www_section = {anonymity measurement, mix, traffic analysis},
isbn = {0-7695-1940-7},
url = {http://portal.acm.org/citation.cfm?id=829515.830557},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/agrawal03.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/agrawal03.pdf},
author = {Dakshi Agrawal and Dogan Kesdogan and Stefan Penz}
}
@conference {BM:mixencrypt,
@@ -12022,7 +12068,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
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 de nition of security against chosen ciphertext attacks is not applicable to length-preserving mixes; we give an appropriate de nition and show that our construction achieves provable security},
www_section = {mix chain, public key cryptography},
url = {http://eprints.kfupm.edu.sa/59837/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BM-mixencrypt.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/BM-mixencrypt.pdf},
author = {Bodo M{\"o}ller}
}
@conference {Serjantov03puzzlesin,
@@ -12033,9 +12079,9 @@ for such length-preserving mixes, but it is not secure against active attacks. W
publisher = {Network of Excellence in Distributed and Dependable Computing Systems},
organization = {Network of Excellence in Distributed and Dependable Computing Systems},
address = {Ajaccio, Corsica},
- abstract = {In this paper we consider using client puzzles to provide incentives for users in a peer-to-peer system to behave in a uniform way. The techniques developed can be used to encourage users of a system to share content (combating the free riding problem) or perform {\textquoteleft}community{\textquoteright} tasks},
+ abstract = {In this paper we consider using client puzzles to provide incentives for users in a peer-to-peer system to behave in a uniform way. The techniques developed can be used to encourage users of a system to share content (combating the free riding problem) or perform {\textquoteleft}community' tasks},
www_section = {p2p network, puzzle},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CaberNet\%20Radicals\%20Workshop\%20-\%20Puzzles\%20in\%20P2P\%20Systems.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CaberNet\%20Radicals\%20Workshop\%20-\%20Puzzles\%20in\%20P2P\%20Systems.pdf},
author = {Andrei Serjantov and Stephen Lewis}
}
@conference {Feldman03quantifyingdisincentives,
@@ -12046,13 +12092,13 @@ for such length-preserving mixes, but it is not secure against active attacks. W
address = {Berkeley, CA},
abstract = {In this paper, we use modeling and simulation to better understand the effects of cooperation on user performance and to quantify the performance-based disincentives in a peer-to-peer file sharing system. This is the first step towards building an incentive system. For the models developed in this paper, we have the following results: Although performance improves significantly when cooperation increases from low to moderate levels, the improvement diminishes thereafter. In particular, the mean delay to download a file when 5\% of the nodes share files is 8x more than when 40\% of the nodes share files, while the mean download delay when 40\% of the nodes share is only 1.75x more than when 100\% share},
www_section = {incentives, peer-to-peer networking},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Feldman\%2C\%20Lai\%2C\%20Chuang\%20\%26\%20Stoica\%20-\%20Quantifying\%20disincentives\%20in\%20peer-to-peer\%20networks.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Feldman\%2C\%20Lai\%2C\%20Chuang\%20\%26\%20Stoica\%20-\%20Quantifying\%20disincentives\%20in\%20peer-to-peer\%20networks.pdf},
author = {Michal Feldman and Kevin Lai and John Chuang and Ion Stoica}
}
@conference {Huebsch:2003:QIP:1315451.1315480,
title = {Querying the internet with PIER},
booktitle = {Proceedings of the 29th international conference on Very large data bases--Volume 29},
- series = {VLDB {\textquoteright}03},
+ series = {VLDB '03},
year = {2003},
pages = {321--332},
publisher = {VLDB Endowment},
@@ -12060,7 +12106,7 @@ for such length-preserving mixes, but it is not secure against active attacks. W
www_section = {distributed hash table, PIER, range queries},
isbn = {0-12-722442-4},
url = {http://dl.acm.org/citation.cfm?id=1315451.1315480},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/vldb03-pier.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/vldb03-pier.pdf},
author = {Huebsch, Ryan and Hellerstein, Joseph M. and Lanham, Nick and Boon Thau Loo and S Shenker and Ion Stoica}
}
@booklet {RatnasamyHellersteinShenker2003RangeQueries,
@@ -12072,7 +12118,7 @@ for such length-preserving mixes, but it is not secure against active attacks. W
author = {Ratnasamy, Sylvia and Hellerstein, Joseph M. and S Shenker}
}
@conference {GKK03,
- title = {Rapid Mixing and Security of Chaum{\textquoteright}s Visual Electronic Voting},
+ title = {Rapid Mixing and Security of Chaum's Visual Electronic Voting},
booktitle = {Proceedings of ESORICS 2003},
year = {2003},
month = {October},
@@ -12085,12 +12131,12 @@ We provide a rigorous stochastic analysis of how much information is revealed by
isbn = {978-3-540-20300-1},
doi = {10.1007/b13237},
url = {http://www.springerlink.com/content/5gmj68nn4x1xc4j1/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/GKK03.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/GKK03.pdf},
author = {Marcin Gomulkiewicz and Marek Klonowski and Miroslaw Kutylowski}
}
@conference { maymounkov:rateless,
title = {Rateless Codes and Big Downloads},
- booktitle = {IPTPS{\textquoteright}03--Proceedings in the 2th International Workshop on Peer-to-Peer Systems},
+ booktitle = {IPTPS'03--Proceedings in the 2th International Workshop on Peer-to-Peer Systems},
series = {Lecture Notes in Computer Science},
volume = {2735},
year = {2003},
@@ -12099,10 +12145,10 @@ We provide a rigorous stochastic analysis of how much information is revealed by
publisher = {Springer},
organization = {Springer},
address = {Berkeley, CA, USA},
- abstract = {This paper presents a novel algorithm for downloading big files from multiple sources in peer-to-peer networks. The algorithm is simple, but offers several compelling properties. It ensures low hand-shaking overhead between peers that download files (or parts of files) from each other. It is computationally efficient, with cost linear in the amount of data transfered. Most importantly, when nodes leave the network in the middle of uploads, the algorithm minimizes the duplicate information shared by nodes with truncated downloads. Thus, any two peers with partial knowledge of a given file can almost always fully benefit from each other{\textquoteright}s knowledge. Our algorithm is made possible by the recent introduction of linear-time, rateless erasure codes},
+ abstract = {This paper presents a novel algorithm for downloading big files from multiple sources in peer-to-peer networks. The algorithm is simple, but offers several compelling properties. It ensures low hand-shaking overhead between peers that download files (or parts of files) from each other. It is computationally efficient, with cost linear in the amount of data transfered. Most importantly, when nodes leave the network in the middle of uploads, the algorithm minimizes the duplicate information shared by nodes with truncated downloads. Thus, any two peers with partial knowledge of a given file can almost always fully benefit from each other's knowledge. Our algorithm is made possible by the recent introduction of linear-time, rateless erasure codes},
www_section = {algorithms, big files, download, multiple sources, rateless code},
doi = {10.1007/978-3-540-45172-3_23},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IPTPS\%2703\%20-\%20Rateless\%20codes\%20and\%20big\%20downloads.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IPTPS\%2703\%20-\%20Rateless\%20codes\%20and\%20big\%20downloads.pdf},
author = {Petar Maymounkov and David Mazi{\`e}res}
}
@conference {incomparable-pkeys,
@@ -12113,12 +12159,12 @@ We provide a rigorous stochastic analysis of how much information is revealed by
pages = {112--121},
publisher = {ACM Press},
organization = {ACM Press},
- abstract = {We describe a new method for protecting the anonymity of message receivers in an untrusted network. Surprisingly, existing methods fail to provide the required level of anonymity for receivers (although those methods do protect sender anonymity). Our method relies on the use of multicast, along with a novel cryptographic primitive that we call an Incomparable Public Key cryptosystem, which allows a receiver to efficiently create many anonymous "identities" for itself without divulging that these separate "identities" actually refer to the same receiver, and without increasing the receiver{\textquoteright}s workload as the number of identities increases. We describe the details of our method, along with a prototype implementation},
+ abstract = {We describe a new method for protecting the anonymity of message receivers in an untrusted network. Surprisingly, existing methods fail to provide the required level of anonymity for receivers (although those methods do protect sender anonymity). Our method relies on the use of multicast, along with a novel cryptographic primitive that we call an Incomparable Public Key cryptosystem, which allows a receiver to efficiently create many anonymous "identities" for itself without divulging that these separate "identities" actually refer to the same receiver, and without increasing the receiver's workload as the number of identities increases. We describe the details of our method, along with a prototype implementation},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/incomparable-pkeys.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/incomparable-pkeys.pdf},
author = {Waters, Brent and Edward W. Felten and Amit Sahai},
editor = {Vijay Atluri and Peng Liu}
}
@@ -12130,7 +12176,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
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},
www_section = {anonymity, anonymous publishing, remailer, reputation},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/rep-anon.pdf},
author = {Roger Dingledine and Nick Mathewson and Paul Syverson}
}
@conference {Dingledine03reputationin,
@@ -12140,13 +12186,13 @@ We provide a rigorous stochastic analysis of how much information is revealed by
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},
www_section = {anonymity, P2P, redundancy, remailer},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.14.4740.pdf},
author = {Roger Dingledine and Nick Mathewson and Paul Syverson}
}
@conference {Padmanabhan:2003:RPS:951950.952204,
title = {Resilient Peer-to-Peer Streaming},
- booktitle = {ICNP{\textquoteright}03. Proceedings of the 11th IEEE International Conference on Network Protocols},
- series = {ICNP {\textquoteright}03},
+ booktitle = {ICNP'03. Proceedings of the 11th IEEE International Conference on Network Protocols},
+ series = {ICNP '03},
year = {2003},
month = nov,
pages = {0--16},
@@ -12157,7 +12203,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ICNP\%2703\%20-\%20Resilient\%20peer-to-peer\%20streaming.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ICNP\%2703\%20-\%20Resilient\%20peer-to-peer\%20streaming.pdf},
author = {Venkata N. Padmanabhan and Wang, Helen J. and Chou, Philip A.}
}
@conference {Fuhrmann03resultson,
@@ -12167,7 +12213,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
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},
www_section = {programmable networks},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fuhrmann03performance.pdf},
author = {Thomas Fuhrmann and Till Harbaum and Panos Kassianidis and Marcus Schoeller and Martina Zitterbart}
}
@conference {reusable-channels:wpes2003,
@@ -12183,7 +12229,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
isbn = {1-58113-776-1},
doi = {10.1145/1005140.1005155},
url = {http://portal.acm.org/citation.cfm?id=1005155},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/reusable-channels-wpes2003.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/reusable-channels-wpes2003.pdf},
author = {Philippe Golle and Jakobsson, Markus}
}
@conference {2003_8,
@@ -12198,12 +12244,12 @@ We provide a rigorous stochastic analysis of how much information is revealed by
isbn = {1-58113-670-6},
doi = {10.1145/773153.773173},
url = {http://doi.acm.org/10.1145/773153.773173},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/RevelaingInformation2003Dinur.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/RevelaingInformation2003Dinur.pdf},
author = {Dinur, Irit and Nissim, Kobbi}
}
@conference {Lpcox03samsara:honor,
title = {Samsara: Honor Among Thieves in Peer-to-Peer Storage},
- booktitle = {SOSP{\textquoteright}03--Proceedings of the Nineteenth ACM Symposium on Operating Systems Principles},
+ booktitle = {SOSP'03--Proceedings of the Nineteenth ACM Symposium on Operating Systems Principles},
year = {2003},
month = oct,
pages = {120--132},
@@ -12213,12 +12259,12 @@ We provide a rigorous stochastic analysis of how much information is revealed by
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},
www_section = {P2P, reputation},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/p135-cox.pdf},
author = {Landon P. Cox and Brian D. Noble}
}
@conference {2003_9,
title = {Scalable Application-level Anycast for Highly Dynamic Groups},
- booktitle = {NGC{\textquoteright}03 Networked Group Communication, Fifth International COST264 Workshop},
+ booktitle = {NGC'03 Networked Group Communication, Fifth International COST264 Workshop},
series = {Lecture Notes in Computer Science, 2003},
volume = {2816},
year = {2003},
@@ -12230,7 +12276,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
abstract = {We present an application-level implementation of anycast for highly dynamic groups. The implementation can handle group sizes varying from one to the whole Internet, and membership maintenance is efficient enough to allow members to join for the purpose of receiving a single message. Key to this efficiency is the use of a proximity-aware peer-to-peer overlay network for decentralized, lightweight group maintenance; nodes join the overlay once and can join and leave many groups many times to amortize the cost of maintaining the overlay. An anycast implementation with these properties provides a key building block for distributed applications. In particular, it enables management and location of dynamic resources in large scale peer-to-peer systems. We present several resource management applications that are enabled by our implementation},
www_section = {anycast, application-level, highly dynamic groups, peer-to-peer networking},
doi = {10.1007/978-3-540-39405-1_5},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NGC\%2703\%20-\%20Scalable\%20Application-level\%20Anycast\%20.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/NGC\%2703\%20-\%20Scalable\%20Application-level\%20Anycast\%20.pdf},
author = {Miguel Castro and Peter Druschel and Anne-Marie Kermarrec and Antony Rowstron}
}
@article {776703,
@@ -12247,13 +12293,13 @@ We provide a rigorous stochastic analysis of how much information is revealed by
issn = {1089-7801},
doi = {10.1109/MIC.2003.1200305},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IEEE-IC-SecurityPerformance-May-2003.pdf},
author = {Menasc{\'e}, Daniel}
}
@conference {Qiu:2003:SRI:863955.863974,
title = {On selfish routing in internet-like environments},
- booktitle = {SIGCOMM{\textquoteright}03. Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications},
- series = {SIGCOMM {\textquoteright}03},
+ booktitle = {SIGCOMM'03. Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications},
+ series = {SIGCOMM '03},
year = {2003},
month = aug,
pages = {151--162},
@@ -12265,7 +12311,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
isbn = {1-58113-735-4},
doi = {http://doi.acm.org/10.1145/863955.863974},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@article {766661,
@@ -12283,7 +12329,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
issn = {1536-1233},
doi = {10.1109/TMC.2003.1195151},
url = {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}
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.6.1545.pdf}
}
@conference {Naor03asimple,
title = {A Simple Fault Tolerant Distributed Hash Table},
@@ -12294,13 +12340,13 @@ We provide a rigorous stochastic analysis of how much information is revealed by
www_section = {distributed hash table, fault-tolerance},
doi = {10.1007/b11823},
url = {http://www.springerlink.com/content/4e756fgyq4ff4kay/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.12.3388.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.12.3388.pdf},
author = {Moni Naor and Udi Wieder}
}
@conference {Harvey:2003:SSO:1251460.1251469,
title = {SkipNet: a scalable overlay network with practical locality properties},
booktitle = {Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems--Volume 4},
- series = {USITS{\textquoteright}03},
+ series = {USITS'03},
year = {2003},
pages = {9--9},
publisher = {USENIX Association},
@@ -12308,7 +12354,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
address = {Berkeley, CA, USA},
www_section = {distributed hash table, range queries, SkipNet},
url = {http://dl.acm.org/citation.cfm?id=1251460.1251469},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/harvey.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/harvey.pdf},
author = {Harvey, Nicholas J. A. and Michael B. Jones and Stefan Saroiu and Marvin Theimer and Wolman, Alec}
}
@booklet {Freedman03sloppyhashing,
@@ -12318,10 +12364,10 @@ We provide a rigorous stochastic analysis of how much information is revealed by
year = {2003},
pages = {45--55},
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},
+ 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' 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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/coral-iptps03.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/coral-iptps03.pdf},
author = {Michael J. Freedman and David Mazi{\`e}res}
}
@conference {Klemm03aspecial-purpose,
@@ -12331,12 +12377,12 @@ We provide a rigorous stochastic analysis of how much information is revealed by
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},
www_section = {ad-hoc networks, file-sharing, P2P},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/VTC03.pdf},
author = {Alexander Klemm and Er Klemm and Christoph Lindemann and Oliver Waldhorst}
}
@article {Castro:2003:SHM:1165389.945474,
title = {SplitStream: high-bandwidth multicast in cooperative environments},
- journal = {SIGOPS{\textquoteright}03 Operating Systems Review},
+ journal = {SIGOPS'03 Operating Systems Review},
volume = {37},
year = {2003},
month = oct,
@@ -12348,7 +12394,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
issn = {0163-5980},
doi = {http://doi.acm.org/10.1145/1165389.945474},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {statistical-disclosure,
@@ -12363,7 +12409,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
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},
www_section = {anonymity, statistical analysis, traffic analysis},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/statistical-disclosure.pdf},
author = {George Danezis}
}
@article {942421,
@@ -12380,21 +12426,21 @@ We provide a rigorous stochastic analysis of how much information is revealed by
issn = {1383-469X},
doi = {10.1023/A:1025146013151 },
url = {http://portal.acm.org/citation.cfm?id=942421$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ButtyanH03monet.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ButtyanH03monet.pdf},
author = {Levente Butty{\'a}n and Jean-Pierre Hubaux}
}
@booklet {_onthe,
title = {On the Strategic Importance of Programmable Middleboxes },
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},
+ abstract = {Network protocols suffer from a lock dictated by the need for standardization and Metcalf'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},
www_section = {programmable networks},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fuhrmann03strategy.pdf},
author = {Thomas Fuhrmann}
}
@conference {792432,
title = {Supporting Peer-to-Peer Computing with FlexiNet},
- booktitle = {CCGRID {\textquoteright}03: Proceedings of the 3st International Symposium on Cluster Computing and the Grid},
+ booktitle = {CCGRID '03: Proceedings of the 3st International Symposium on Cluster Computing and the Grid},
year = {2003},
pages = {0--390},
publisher = {IEEE Computer Society},
@@ -12404,12 +12450,12 @@ We provide a rigorous stochastic analysis of how much information is revealed by
www_section = {overlay networks, programmable networks, topology matching},
isbn = {0-7695-1919-9},
url = {http://portal.acm.org/citation.cfm?id=791231.792432$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann03supportingP2P.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fuhrmann03supportingP2P.pdf},
author = {Thomas Fuhrmann}
}
@conference {1251470,
title = {Symphony: distributed hashing in a small world},
- booktitle = {USITS{\textquoteright}03: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems},
+ booktitle = {USITS'03: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems},
year = {2003},
pages = {10--10},
publisher = {USENIX Association},
@@ -12418,12 +12464,12 @@ We provide a rigorous stochastic analysis of how much information is revealed by
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},
www_section = {small-world},
url = {http://portal.acm.org/citation.cfm?id=1251460.1251470$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/manku03symphony.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/manku03symphony.pdf},
author = {Manku, Gurmeet Singh and Bawa, Mayank and Prabhakar Raghavan}
}
@conference {958494,
title = {Taming the underlying challenges of reliable multihop routing in sensor networks},
- booktitle = {SenSys {\textquoteright}03: Proceedings of the 1st international conference on Embedded networked sensor systems},
+ booktitle = {SenSys '03: Proceedings of the 1st international conference on Embedded networked sensor systems},
year = {2003},
pages = {14--27},
publisher = {ACM},
@@ -12434,7 +12480,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
isbn = {1-58113-707-9},
doi = {10.1145/958491.958494},
url = {http://portal.acm.org/citation.cfm?id=958494$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p14-woo.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/p14-woo.pdf},
author = {Woo, Alec and Tong, Terence and Culler, David}
}
@conference {feamster:pet2003,
@@ -12446,8 +12492,8 @@ We provide a rigorous stochastic analysis of how much information is revealed by
publisher = {Springer-Verlag, LNCS 2760},
organization = {Springer-Verlag, LNCS 2760},
abstract = {All existing anti-censorship systems for theWeb rely on proxies to grant clients access to censored information. Therefore, they face the proxy discovery problem: how can clients discover the proxies without having the censor discover and block these proxies? To avoid widespread discovery and blocking, proxies must not be widely published and should be discovered in-band. In this paper, we present a proxy discovery mechanism called keyspace hopping that meets this goal. Similar in spirit to frequency hopping in wireless networks, keyspace hopping ensures that each client discovers only a small fraction of the total number of proxies.However, requiring clients to independently discover proxies from a large set makes it practically impossible to verify the trustworthiness of every proxy and creates the possibility of having untrusted proxies. To address
-this, we propose separating the proxy into two distinct components|the messenger, which the client discovers using keyspace hopping and which simply acts as a gateway to the Internet; and the portal, whose identity is widely-published and whose responsibility it is to interpret and serve the client{\textquoteright}s requests for censored content. We show how this separation, as well as in-band proxy discovery, can be applied to a variety of anti-censorship systems},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/feamster-pet2003.pdf},
+this, we propose separating the proxy into two distinct components|the messenger, which the client discovers using keyspace hopping and which simply acts as a gateway to the Internet; and the portal, whose identity is widely-published and whose responsibility it is to interpret and serve the client's requests for censored content. We show how this separation, as well as in-band proxy discovery, can be applied to a variety of anti-censorship systems},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/feamster-pet2003.pdf},
author = {Nick Feamster and Magdalena Balazinska and Winston Wang and Hari Balakrishnan and David Karger},
editor = {Roger Dingledine}
}
@@ -12456,12 +12502,12 @@ this, we propose separating the proxy into two distinct components|the messenger
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},
journal = {unknown},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann03topology.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fuhrmann03topology.pdf},
author = {Thomas Fuhrmann}
}
@conference {DBLP:conf/iptps/DabekZDKS03,
title = {Towards a Common API for Structured Peer-to-Peer Overlays},
- booktitle = {IPTPS{\textquoteright}03. Proccedings of the Second International Workshop on Peer-to-Peer Systems},
+ booktitle = {IPTPS'03. Proccedings of the Second International Workshop on Peer-to-Peer Systems},
series = {Lecture Notes in Computer Science},
volume = {2735},
year = {2003},
@@ -12474,7 +12520,7 @@ this, we propose separating the proxy into two distinct components|the messenger
www_section = {API, key abstraction},
isbn = {3-540-40724-3},
doi = {http://dx.doi.org/10.1007/978-3-540-45172-3_3},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IPTPS\%2703\%20-\%20Towards\%20a\%20common\%20API.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IPTPS\%2703\%20-\%20Towards\%20a\%20common\%20API.pdf},
author = {Dabek, Frank and Ben Y. Zhao and Peter Druschel and John Kubiatowicz and Ion Stoica}
}
@conference { gnunettransport,
@@ -12487,12 +12533,12 @@ this, we propose separating the proxy into two distinct components|the messenger
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},
www_section = {GNUnet, P2P},
url = {http://grothoff.org/christian/transport.pdf},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/transport.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/transport.pdf},
author = {Ronaldo A. Ferreira and Christian Grothoff and Paul Ruth}
}
@conference {642636,
title = {Usability and privacy: a study of Kazaa P2P file-sharing},
- booktitle = {CHI {\textquoteright}03: Proceedings of the SIGCHI conference on Human factors in computing systems},
+ booktitle = {CHI '03: Proceedings of the SIGCHI conference on Human factors in computing systems},
year = {2003},
pages = {137--144},
publisher = {ACM},
@@ -12503,7 +12549,7 @@ this, we propose separating the proxy into two distinct components|the messenger
isbn = {1-58113-630-7},
doi = {10.1145/642611.642636},
url = {http://portal.acm.org/citation.cfm?id=642611.642636$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/HPL-2002-163.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/HPL-2002-163.pdf},
author = {Good, Nathaniel S. and Krekelberg, Aaron}
}
@booklet {Fuhrmann_usingbluetooth,
@@ -12526,7 +12572,7 @@ this, we propose separating the proxy into two distinct components|the messenger
www_section = {anonymity, caching proxies, privacy},
doi = {10.1145/1120709.1120713},
url = {http://portal.acm.org/citation.cfm?id=1120713},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/shsm03.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/shsm03.pdf},
author = {Anna Shubina and Sean Smith}
}
@article {939859,
@@ -12546,11 +12592,11 @@ this, we propose separating the proxy into two distinct components|the messenger
@booklet {Boulkenafed02adhocfs:sharing,
title = {AdHocFS: Sharing Files in WLANs},
year = {2002},
- 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},
+ abstract = {This paper presents the ADHOCFS file system for mobileusers, which realizes transparent, adaptive file accessaccording to the users' 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},
www_section = {ad-hoc networks},
isbn = {0-7695-1938-5},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.13.9956.pdf},
author = {Malika Boulkenafed and Valerie Issarny}
}
@conference {BonehGolle:psp2002,
@@ -12567,13 +12613,13 @@ this, we propose separating the proxy into two distinct components|the messenger
isbn = {1-58113-612-9},
doi = {10.1145/586110.586121},
url = {http://portal.acm.org/citation.cfm?id=586121},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BonehGolle-psp2002.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/BonehGolle-psp2002.pdf},
author = {Dan Boneh and Philippe Golle},
editor = {Vijay Atluri}
}
@conference {664025,
title = {AMnet 2.0: An Improved Architecture for Programmable Networks},
- booktitle = {IWAN {\textquoteright}02: Proceedings of the IFIP-TC6 4th International Working Conference on Active Networks},
+ booktitle = {IWAN '02: Proceedings of the IFIP-TC6 4th International Working Conference on Active Networks},
year = {2002},
pages = {162--176},
publisher = {Springer-Verlag},
@@ -12584,7 +12630,7 @@ this, we propose separating the proxy into two distinct components|the messenger
isbn = {3-540-00223-5},
doi = {10.1007/3-540-36199-5},
url = {http://portal.acm.org/citation.cfm?id=664025$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fuhrmann02architecture_0.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fuhrmann02architecture_0.pdf},
author = {Thomas Fuhrmann and Till Harbaum and Marcus Schoeller and Martina Zitterbart}
}
@conference {RRMPH02-1,
@@ -12600,12 +12646,12 @@ this, we propose separating the proxy into two distinct components|the messenger
www_section = {anonymity, anonymous web browsing},
isbn = {0-7695-1748-X},
url = {http://portal.acm.org/citation.cfm?id=759973},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/RRMPH02-1.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/RRMPH02-1.pdf},
author = {Marc Rennhard and Sandro Rafaeli and Laurent Mathy and Bernhard Plattner and David Hutchison}
}
@conference {wright02,
title = {An Analysis of the Degradation of Anonymous Protocols},
- booktitle = {Proceedings of the Network and Distributed Security Symposium--NDSS {\textquoteright}02},
+ booktitle = {Proceedings of the Network and Distributed Security Symposium--NDSS '02},
year = {2002},
month = feb,
publisher = {IEEE},
@@ -12613,7 +12659,7 @@ this, we propose separating the proxy into two distinct components|the messenger
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},
www_section = {anonymity, Crowds, dining cryptographers, Hordes, onion routing},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/wright-degrade.pdf},
author = {Matthew Wright and Micah Adler and Brian Neil Levine and Clay Shields}
}
@booklet {Serjantov02anonymizingcensorship,
@@ -12625,7 +12671,7 @@ this, we propose separating the proxy into two distinct components|the messenger
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.13.5048.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.13.5048.pdf},
author = {Andrei Serjantov}
}
@conference {Serj02-iptps,
@@ -12641,12 +12687,12 @@ Indeed, if one server has been pressured into removal, the other server administ
isbn = {978-3-540-44179-3},
doi = {10.1007/3-540-45748-8},
url = {http://portal.acm.org/citation.cfm?id=687808},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Serj02-iptps.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Serj02-iptps.pdf},
author = {Andrei Serjantov}
}
@conference {714768,
title = {Aspects of AMnet Signaling},
- booktitle = {NETWORKING {\textquoteright}02: Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications},
+ booktitle = {NETWORKING '02: Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications},
year = {2002},
pages = {1214--1220},
publisher = {Springer-Verlag},
@@ -12658,7 +12704,7 @@ Placing application-dedicated functionality within the network requires a flexib
isbn = {3-540-43709-6},
doi = {10.1007/3-540-47906-6},
url = {http://www.springerlink.com/content/4j371710765jg14q/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/speer02networking.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/speer02networking.pdf},
author = {Speer, Anke and Marcus Schoeller and Thomas Fuhrmann and Martina Zitterbart}
}
@conference {beimel-barrier,
@@ -12669,25 +12715,25 @@ Placing application-dedicated functionality within the network requires a flexib
www_section = {private information retrieval},
isbn = {0-7695-1822-2},
url = {http://portal.acm.org/citation.cfm?id=652187},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/beimel-barrier.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/beimel-barrier.pdf},
author = {Amos Beimel and Yuval Ishai and Eyal Kushilevitz and Jean-Fran{\c c}ois Raymond}
}
@conference {Mazieres:2002:BSF:571825.571840,
title = {Building secure file systems out of Byzantine storage},
- booktitle = {PODC{\textquoteright}02--Proceedings of the 21st Annual Symposium on Principles of Distributed Computing},
- series = {PODC {\textquoteright}02},
+ booktitle = {PODC'02--Proceedings of the 21st Annual Symposium on Principles of Distributed Computing},
+ series = {PODC '02},
year = {2002},
month = jul,
pages = {108--117},
publisher = {ACM},
organization = {ACM},
address = {Monterey, CA, USA},
- abstract = {This paper shows how to implement a trusted network file system on an untrusted server. While cryptographic storage techniques exist that allow users to keep data secret from untrusted servers, this work concentrates on the detection of tampering attacks and stale data. Ideally, users of an untrusted storage server would immediately and unconditionally notice any misbehavior on the part of the server. This ideal is unfortunately not achievable. However, we define a notion of data integrity called fork consistency in which, if the server delays just one user from seeing even a single change by another, the two users will never again see one another{\textquoteright}s changes---a failure easily detectable with on-line communication. We give a practical protocol for a multi-user network file system called SUNDR, and prove that SUNDR offers fork consistency whether or not the server obeys the protocol},
+ abstract = {This paper shows how to implement a trusted network file system on an untrusted server. While cryptographic storage techniques exist that allow users to keep data secret from untrusted servers, this work concentrates on the detection of tampering attacks and stale data. Ideally, users of an untrusted storage server would immediately and unconditionally notice any misbehavior on the part of the server. This ideal is unfortunately not achievable. However, we define a notion of data integrity called fork consistency in which, if the server delays just one user from seeing even a single change by another, the two users will never again see one another's changes---a failure easily detectable with on-line communication. We give a practical protocol for a multi-user network file system called SUNDR, and prove that SUNDR offers fork consistency whether or not the server obeys the protocol},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PODC\%2702\%20-\%20Building\%20secure\%20file\%20systems\%20out\%20of\%20Byzantine\%20storage.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PODC\%2702\%20-\%20Building\%20secure\%20file\%20systems\%20out\%20of\%20Byzantine\%20storage.pdf},
author = {David Mazi{\`e}res and Shasha, Dennis}
}
@article {Oswald02capacity-achievingsequences,
@@ -12702,7 +12748,7 @@ Placing application-dedicated functionality within the network requires a flexib
issn = { 0018-9448 },
doi = {10.1109/TIT.2002.805067 },
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.92.7281.pdf},
author = {Peter Oswald and M. Amin Shokrollahi}
}
@conference {cebolla,
@@ -12713,7 +12759,7 @@ Placing application-dedicated functionality within the network requires a flexib
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},
www_section = {anonymity, cryptography},
url = {http://www.linuxinsight.com/ols2002_cebolla_pragmatic_ip_anonymity.html},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cebolla.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cebolla.pdf},
author = {Zach Brown}
}
@booklet {Fiat02censorshipresistant,
@@ -12721,7 +12767,7 @@ Placing application-dedicated functionality within the network requires a flexib
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.16.4761.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.16.4761.pdf},
author = {Amos Fiat and Jared Saia}
}
@conference {chaffinch,
@@ -12731,17 +12777,17 @@ Placing application-dedicated functionality within the network requires a flexib
month = {October},
publisher = {Springer-Verlag, LNCS 2578},
organization = {Springer-Verlag, LNCS 2578},
- 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},
+ abstract = {We present the design and rationale of a practical system for passing confidential messages. The mechanism is an adaptation of Rivest's {\textquotedblleft}chaffing and winnowing{\textquotedblright}, which has the legal advantage of using authentication keys to provide privacy.We identify a weakness in Rivest'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's Regulation of Investigatory Powers (RIP) Act},
www_section = {legal attack, RIP},
doi = {10.1007/3-540-36415-3},
url = {http://portal.acm.org/citation.cfm?id=647598.732024},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Chaffinch.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Chaffinch.pdf},
author = {Richard Clayton and George Danezis},
editor = {Fabien Petitcolas}
}
@conference {511496,
title = {Choosing reputable servents in a P2P network},
- booktitle = {WWW {\textquoteright}02: Proceedings of the 11th international conference on World Wide Web},
+ booktitle = {WWW '02: Proceedings of the 11th international conference on World Wide Web},
year = {2002},
pages = {376--386},
publisher = {ACM},
@@ -12751,7 +12797,7 @@ Placing application-dedicated functionality within the network requires a flexib
isbn = {1-58113-449-5},
doi = {10.1145/511446.511496},
url = {http://portal.acm.org/citation.cfm?id=511496$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/samarati.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/samarati.pdf},
author = {Cornelli, Fabrizio and Ernesto Damiani and Sabrina De Capitani di Vimercati and Stefano Paraboschi and Pierangela Samarati}
}
@article {571638,
@@ -12763,19 +12809,19 @@ Placing application-dedicated functionality within the network requires a flexib
pages = {329--368},
publisher = {ACM},
address = {New York, NY, USA},
- abstract = {COCA is a fault-tolerant and secure online certification authority that has been built and deployed both in a local area network and in the Internet. Extremely weak assumptions characterize environments in which COCA{\textquoteright}s protocols execute correctly: no assumption is made about execution speed and message delivery delays; channels are expected to exhibit only intermittent reliability; and with 3t + 1 COCA servers up to t may be faulty or compromised. COCA is the first system to integrate a Byzantine quorum system (used to achieve availability) with proactive recovery (used to defend against mobile adversaries which attack, compromise, and control one replica for a limited period of time before moving on to another). In addition to tackling problems associated with combining fault-tolerance and security, new proactive recovery protocols had to be developed. Experimental results give a quantitative evaluation for the cost and effectiveness of the protocols},
+ abstract = {COCA is a fault-tolerant and secure online certification authority that has been built and deployed both in a local area network and in the Internet. Extremely weak assumptions characterize environments in which COCA's protocols execute correctly: no assumption is made about execution speed and message delivery delays; channels are expected to exhibit only intermittent reliability; and with 3t + 1 COCA servers up to t may be faulty or compromised. COCA is the first system to integrate a Byzantine quorum system (used to achieve availability) with proactive recovery (used to defend against mobile adversaries which attack, compromise, and control one replica for a limited period of time before moving on to another). In addition to tackling problems associated with combining fault-tolerance and security, new proactive recovery protocols had to be developed. Experimental results give a quantitative evaluation for the cost and effectiveness of the protocols},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cocaTOCS.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cocaTOCS.pdf},
author = {Zhou, Lidong and Schneider, Fred B. and Robbert Van Renesse}
}
@conference {Harren:2002:CQD:646334.687945,
title = {Complex Queries in DHT-based Peer-to-Peer Networks},
author={Harren, Matthew and Hellerstein, Joseph M and Huebsch, Ryan and Loo, Boon Thau and Shenker, Scott and Stoica, Ion},
- booktitle = {IPTPS{\textquoteright}01--Revised Papers from the First International Workshop on Peer-to-Peer Systems},
- series = {IPTPS {\textquoteright}01},
+ booktitle = {IPTPS'01--Revised Papers from the First International Workshop on Peer-to-Peer Systems},
+ series = {IPTPS '01},
year = {2002},
month = mar,
pages = {242--259},
@@ -12786,25 +12832,25 @@ Placing application-dedicated functionality within the network requires a flexib
www_section = {distributed hash table},
isbn = {3-540-44179-4},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {Mui:2002:CMT:820745.821158,
title = {A Computational Model of Trust and Reputation},
- booktitle = {HICSS{\textquoteright}02. Proceedings of the 35th Annual Hawaii International Conference on System Sciences},
- series = {HICSS {\textquoteright}02},
+ booktitle = {HICSS'02. Proceedings of the 35th Annual Hawaii International Conference on System Sciences},
+ series = {HICSS '02},
year = {2002},
month = jan,
pages = {2431--2439 },
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Big Island, Hawaii, USA},
- abstract = {Despite their many advantages, e-businesses lag behind brick and mortar businesses in several fundamental respects. This paper concerns one of these: relationships based on trust and reputation. Recent studies on simple reputation systems for e-Businesses such as eBay have pointed to the importance of such rating systems for deterring moral hazard and encouraging trusting interactions. However, despite numerous studies on trust and reputation systems, few have taken studies across disciplines to provide an integrated account of these concepts and their relationships. This paper first surveys existing literatures on trust, reputation and a related concept: reciprocity. Based on sociological and biological understandings of these concepts, a computational model is proposed. This model can be implemented in a real system to consistently calculate agents{\textquoteright} trust and reputation scores},
+ abstract = {Despite their many advantages, e-businesses lag behind brick and mortar businesses in several fundamental respects. This paper concerns one of these: relationships based on trust and reputation. Recent studies on simple reputation systems for e-Businesses such as eBay have pointed to the importance of such rating systems for deterring moral hazard and encouraging trusting interactions. However, despite numerous studies on trust and reputation systems, few have taken studies across disciplines to provide an integrated account of these concepts and their relationships. This paper first surveys existing literatures on trust, reputation and a related concept: reciprocity. Based on sociological and biological understandings of these concepts, a computational model is proposed. This model can be implemented in a real system to consistently calculate agents' trust and reputation scores},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/HICSS\%2702\%20-\%20A\%20computational\%20model\%20of\%20trust\%20and\%20reputation.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/HICSS\%2702\%20-\%20A\%20computational\%20model\%20of\%20trust\%20and\%20reputation.pdf},
author = {Lik Mui and Mojdeh Mohtashemi and Ari Halberstadt}
}
@conference {2002_0,
@@ -12812,7 +12858,7 @@ Placing application-dedicated functionality within the network requires a flexib
booktitle = {In The USENIX Conf. on File and Storage Technologies},
year = {2002},
abstract = {This paper presents the design of a novel backup system built on top of a peer-to-peer architecture with minimal supporting infrastructure. The system can be deployed for both large-scale and small-scale peer-to-peer overlay networks. It allows computers connected to the Internet to back up their data cooperatively. Each computer has a set of partner computers and stores its backup data distributively among those partners. In return, such a way as to achieve both fault-tolerance and high reliability. This form of cooperation poses several interesting technical challenges because these computers have independent failure modes, do not trust each other, and are subject to third party attacks},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/elnikety.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/elnikety.pdf},
author = {Sameh Elnikety and Mark Lillibridge and Mike Burrows and Willy Zwaenepoel}
}
@conference {715916,
@@ -12826,7 +12872,7 @@ Placing application-dedicated functionality within the network requires a flexib
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.61.3184.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.61.3184.pdf},
author = {Shapiro, Jonathan S. and Vanderburgh, John}
}
@conference {idemix,
@@ -12837,17 +12883,17 @@ Placing application-dedicated functionality within the network requires a flexib
publisher = {ACM Press},
organization = {ACM Press},
address = {New York, NY, USA},
- abstract = {Anonymous credential systems [8, 9, 12, 24] allow anonymous yet authenticated and accountable transactions between users and service providers. As such, they represent a powerful technique for protecting users{\textquoteright} privacy when conducting Internet transactions. In this paper, we describe the design and implementation of an anonymous credential system based on the protocols developed by [6]. The system is based on new high-level primitives and interfaces allowing for easy integration into access control systems. The prototype was realized in Java. We demonstrate its use and some deployment issues with the description of an operational demonstration scenario},
+ abstract = {Anonymous credential systems [8, 9, 12, 24] allow anonymous yet authenticated and accountable transactions between users and service providers. As such, they represent a powerful technique for protecting users' privacy when conducting Internet transactions. In this paper, we describe the design and implementation of an anonymous credential system based on the protocols developed by [6]. The system is based on new high-level primitives and interfaces allowing for easy integration into access control systems. The prototype was realized in Java. We demonstrate its use and some deployment issues with the description of an operational demonstration scenario},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/idemix.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/idemix.pdf},
author = {Jan Camenisch and Els Van Herreweghen}
}
@conference {713855,
title = {Design Evolution of the EROS Single-Level Store},
- booktitle = {ATEC {\textquoteright}02: Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference},
+ booktitle = {ATEC '02: Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference},
year = {2002},
pages = {59--72},
publisher = {USENIX Association},
@@ -12857,7 +12903,7 @@ Placing application-dedicated functionality within the network requires a flexib
www_section = {file systems},
isbn = {1-880446-00-6},
url = {http://portal.acm.org/citation.cfm?id=713855$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/storedesign2002.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/storedesign2002.pdf},
author = {Shapiro, Jonathan S. and Adams, Jonathan}
}
@article {Rubenstein:2000:DSC:345063.339410,
@@ -12874,25 +12920,25 @@ Placing application-dedicated functionality within the network requires a flexib
issn = {1063-6692 },
doi = {http://dx.doi.org/10.1109/TNET.2002.1012369},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IEEE\%E2\%81\%84ACM\%20Transactions\%20on\%20Networking\%20-\%20Detecting\%20shared\%20congestion\%20of\%20flows.pdf},
author = {Rubenstein, Dan and Kurose, Jim and Don Towsley}
}
@conference {Feigenbaum:2002:DAM:570810.570812,
title = {Distributed algorithmic mechanism design: recent results and future directions},
- booktitle = {DIALM{\textquoteright}06. Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications},
- series = {DIALM {\textquoteright}02},
+ booktitle = {DIALM'06. Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications},
+ series = {DIALM '02},
year = {2002},
month = sep,
pages = {1--13},
publisher = {ACM},
organization = {ACM},
address = {Atlanta, Georgia},
- abstract = {Distributed Algorithmic Mechanism Design (DAMD) combines theoretical computer science{\textquoteright}s traditional focus on computational tractability with its more recent interest in incentive compatibility and distributed computing. The Internet{\textquoteright}s decentralized nature, in which distributed computation and autonomous agents prevail, makes DAMD a very natural approach for many Internet problems. This paper first outlines the basics of DAMD and then reviews previous DAMD results on multicast cost sharing and interdomain routing. The remainder of the paper describes several promising research directions and poses some specific open problems},
+ abstract = {Distributed Algorithmic Mechanism Design (DAMD) combines theoretical computer science's traditional focus on computational tractability with its more recent interest in incentive compatibility and distributed computing. The Internet's decentralized nature, in which distributed computation and autonomous agents prevail, makes DAMD a very natural approach for many Internet problems. This paper first outlines the basics of DAMD and then reviews previous DAMD results on multicast cost sharing and interdomain routing. The remainder of the paper describes several promising research directions and poses some specific open problems},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DIALM\%2702\%20-\%20Feigenbaum\%20\%26\%20Shenker\%20-\%20Distributed\%20algorithmic\%20mechanism\%20design.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/DIALM\%2702\%20-\%20Feigenbaum\%20\%26\%20Shenker\%20-\%20Distributed\%20algorithmic\%20mechanism\%20design.pdf},
author = {Feigenbaum, Joan and S Shenker}
}
@booklet {Hildrum:CSD-02-1178,
@@ -12901,13 +12947,13 @@ Placing application-dedicated functionality within the network requires a flexib
year = {2002},
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 -- 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},
+ abstract = {Modern networking applications replicate data and services widely, leading to a need for location-independent routing -- the ability to route queries directly to objects using names that are independent of the objects' 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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CSD-02-1178.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CSD-02-1178.pdf},
author = {Hildrum, Kirsten and John Kubiatowicz and Rao, Satish and Ben Y. Zhao}
}
@article {wagner,
- title = {Don{\textquoteright}t Shoot the Messenger: Limiting the Liability of Anonymous Remailers},
+ title = {Don't Shoot the Messenger: Limiting the Liability of Anonymous Remailers},
journal = {New Mexico Law Review},
volume = {32},
number = {Winter},
@@ -12926,13 +12972,13 @@ Placing application-dedicated functionality within the network requires a flexib
publisher = {Springer-Verlag, LNCS 2482},
organization = {Springer-Verlag, LNCS 2482},
abstract = {In this paper we propose a method to prevent so called {\textquotedblleft}intersection attacks{\textquotedblright} on anonymity services. Intersection attacks are possible if not all users of such a service are active all the time and part of the transfered messages are linkable. Especially in real systems, the group of users (anonymity set) will change over time due to online and off-line periods.
-Our proposed solution is to send pregenerated dummy messages to the communication partner (e.g. the web server), during the user{\textquoteright}s off-line periods.
+Our proposed solution is to send pregenerated dummy messages to the communication partner (e.g. the web server), during the user's off-line periods.
For a detailed description of our method we assume a cascade of Chaumian MIXes as anonymity service and respect and fulfill the MIX attacker model},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/langos02.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/langos02.pdf},
author = {Oliver Berthold and Heinrich Langos},
editor = {Roger Dingledine and Paul Syverson}
}
@@ -12948,7 +12994,7 @@ For a detailed description of our method we assume a cascade of Chaumian MIXes a
isbn = {978-3-540-44050-5},
doi = {10.1007/3-540-45708-9},
url = {http://portal.acm.org/citation.cfm?id=704437},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/camenisch2002da.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/camenisch2002da.pdf},
author = {Jan Camenisch and Anna Lysyanskaya}
}
@booklet {Saia02dynamicallyfault-tolerant,
@@ -12958,7 +13004,7 @@ For a detailed description of our method we assume a cascade of Chaumian MIXes a
www_section = {fault-tolerance, robustness},
doi = {10.1007/3-540-45748-8},
url = {http://www.springerlink.com/content/r7fumjuwmgnd4md1/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/180.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/180.pdf},
author = {Jared Saia and Amos Fiat and Steven D. Gribble and Anna R. Karlin and Stefan Saroiu}
}
@conference {esed,
@@ -12971,7 +13017,7 @@ For a detailed description of our method we assume a cascade of Chaumian MIXes a
address = {Melbourne, Australia},
www_section = {censorship resistance, ECRS, encoding, file-sharing, GNUnet},
url = {http://grothoff.org/christian/esed.pdf},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/esed.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/esed.pdf},
author = {Krista Bennett and Christian Grothoff and Tzvetan Horozov and Ioana Patrascu}
}
@article {605408,
@@ -12983,16 +13029,16 @@ For a detailed description of our method we assume a cascade of Chaumian MIXes a
pages = {96--107},
publisher = {ACM},
address = {New York, NY, USA},
- 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},
+ 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' 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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/asplos-x_annot.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/asplos-x_annot.pdf},
author = {Juang, Philo and Oki, Hidekazu and Wang, Yong and Martonosi, Margaret and Peh, Li Shiuan and Rubenstein, Daniel}
}
@conference {687814,
title = {Erasure Coding Vs. Replication: A Quantitative Comparison},
- booktitle = {IPTPS {\textquoteright}01: Revised Papers from the First International Workshop on Peer-to-Peer Systems},
+ booktitle = {IPTPS '01: Revised Papers from the First International Workshop on Peer-to-Peer Systems},
year = {2002},
pages = {328--338},
publisher = {Springer-Verlag},
@@ -13003,7 +13049,7 @@ For a detailed description of our method we assume a cascade of Chaumian MIXes a
isbn = {3-540-44179-4},
doi = {10.1007/3-540-45748-8},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IPTPS\%2701\%20-\%20Erasure\%20coding\%20vs.\%20replication.pdf},
author = {Weatherspoon, Hakim and John Kubiatowicz}
}
@booklet {citeulike:1360149,
@@ -13012,8 +13058,8 @@ For a detailed description of our method we assume a cascade of Chaumian MIXes a
abstract = {Mojo Nation\"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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Experiences_Deploying_a_Large-Scale_Emergent_Network.pdf},
- author = {O{\textquoteright}Hearn, Bryce W.}
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Experiences_Deploying_a_Large-Scale_Emergent_Network.pdf},
+ author = {O'Hearn, Bryce W.}
}
@conference {Castro02exploitingnetwork_0,
title = {Exploiting network proximity in distributed hash tables},
@@ -13024,7 +13070,7 @@ For a detailed description of our method we assume a cascade of Chaumian MIXes a
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},
www_section = {CAN, distributed hash table, P2P},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fudico.pdf},
author = {Miguel Castro and Peter Druschel and Y. Charlie Hu}
}
@booklet {Castro02exploitingnetwork,
@@ -13032,7 +13078,7 @@ in the different DHT routing protocols. We conclude that proximity neighbor sele
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/location.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/location.pdf},
author = {Miguel Castro and Peter Druschel and Y. Charlie Hu and Antony Rowstron}
}
@article {Adya:2002:FFA:844128.844130,
@@ -13049,7 +13095,7 @@ in the different DHT routing protocols. We conclude that proximity neighbor sele
issn = {0163-5980},
doi = {http://doi.acm.org/10.1145/844128.844130},
url = {http://doi.acm.org/10.1145/844128.844130},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SIGOPS\%20-\%20FARSITE.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {Fu:2002:FSD:505452.505453,
@@ -13064,12 +13110,12 @@ in the different DHT routing protocols. We conclude that proximity neighbor sele
address = {San Diego, CA, USA},
abstract = {Internet users increasingly rely on publicly available data for everything from software installation to investment decisions. Unfortunately, the vast majority of public content on the Internet comes with no integrity or authenticity guarantees. This paper presents the self-certifying read-only file system, a content distribution system providing secure, scalable access to public, read-only data.
-The read-only file system makes the security of published content independent from that of the distribution infrastructure. In a secure area (perhaps off-line), a publisher creates a digitally-signed database out of a file system{\textquoteright}s contents. The publisher then replicates the database on untrusted content-distribution servers, allowing for high availability. The read-only file system protocol furthermore pushes the cryptographic cost of content verification entirely onto clients, allowing servers to scale to a large number of clients. Measurements of an implementation show that an individual server running on a 550 Mhz Pentium III with FreeBSD can support 1,012 connections per second and 300 concurrent clients compiling a large software package},
+The read-only file system makes the security of published content independent from that of the distribution infrastructure. In a secure area (perhaps off-line), a publisher creates a digitally-signed database out of a file system's contents. The publisher then replicates the database on untrusted content-distribution servers, allowing for high availability. The read-only file system protocol furthermore pushes the cryptographic cost of content verification entirely onto clients, allowing servers to scale to a large number of clients. Measurements of an implementation show that an individual server running on a 550 Mhz Pentium III with FreeBSD can support 1,012 connections per second and 300 concurrent clients compiling a large software package},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/OSDI\%2700\%20-\%20Fast\%20and\%20Secure\%20Distributed\%20Read-Only\%20File\%20System.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {hintz02,
@@ -13084,7 +13130,7 @@ The read-only file system makes the security of published content independent fr
isbn = {978-3-540-00565-0},
doi = {10.1007/3-540-36467-6},
url = {http://www.springerlink.com/content/c4qwe6d608p2cjyv/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/hintz02.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/hintz02.pdf},
author = {Andrew Hintz},
editor = {Roger Dingledine and Paul Syverson}
}
@@ -13097,7 +13143,7 @@ The read-only file system makes the security of published content independent fr
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Finite-length\%20analysis\%20of\%20low-density\%20parity-check\%20codes\%20on.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {Dan:SFMix03,
@@ -13110,7 +13156,7 @@ The read-only file system makes the security of published content independent fr
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},
www_section = {anonymity, forward security, mix, traffic analysis},
url = {http://citeseer.ist.psu.edu/533725.html},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Dan-SFMix03.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Dan-SFMix03.pdf},
author = {George Danezis},
editor = {Fisher-Hubner, Jonsson}
}
@@ -13126,7 +13172,7 @@ The read-only file system makes the security of published content independent fr
isbn = {978-3-540-00421-9},
doi = {10.1007/3-540-36415-3},
url = {http://www.springerlink.com/content/um0kf3dp88b0eg5v/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/trickle02.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/trickle02.pdf},
author = {Andrei Serjantov and Roger Dingledine and Paul Syverson},
editor = {Fabien Petitcolas}
}
@@ -13138,7 +13184,7 @@ The read-only file system makes the security of published content independent fr
type = {Technical report},
www_section = {anonymity, economics, encoding, GNUnet, obsolete database},
journal = {unknown},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/main.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/main.pdf},
author = {Krista Bennett and Tiberius Stef and Christian Grothoff and Tzvetan Horozov and Ioana Patrascu}
}
@article {Levine:2002,
@@ -13152,7 +13198,7 @@ The read-only file system makes the security of published content independent fr
www_section = {anonymity, Hordes, multicast, routing},
issn = {0926-227X},
url = {http://portal.acm.org/citation.cfm?id=603406},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Levine-2002.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Levine-2002.pdf},
author = {Brian Neil Levine and Clay Shields}
}
@conference {DBLP:conf/eurocrypt/RussellW02,
@@ -13164,7 +13210,7 @@ The read-only file system makes the security of published content independent fr
}
@conference {873217,
title = {Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities},
- booktitle = {CCGRID {\textquoteright}02: Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid},
+ booktitle = {CCGRID '02: Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid},
year = {2002},
pages = {0--376},
publisher = {IEEE Computer Society},
@@ -13174,7 +13220,7 @@ The read-only file system makes the security of published content independent fr
www_section = {data sharing, model-driven, P2P},
isbn = {0-7695-1582-7},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.16.909.pdf},
author = {Ranganathan, Kavitha and Iamnitchi, Adriana and Foster, Ian}
}
@conference {Feamster02infranet:circumventing,
@@ -13199,7 +13245,7 @@ The read-only file system makes the security of published content independent fr
www_section = {censorship resistance, infranet},
isbn = {1-931971-00-5},
url = {http://portal.acm.org/citation.cfm?id=720281},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/infranet.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/infranet.pdf},
author = {Nick Feamster and Magdalena Balazinska and Greg Harfst and Hari Balakrishnan and David Karger}
}
@article {Cao:2002:IPG:508325.508330,
@@ -13215,7 +13261,7 @@ The read-only file system makes the security of published content independent fr
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IEEE\%E2\%81\%84ACM\%20Trans.\%20Netw.\%2702\%20\%2810\%29-\%20Internet\%20pricing.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {stepping-stones,
@@ -13231,7 +13277,7 @@ The read-only file system makes the security of published content independent fr
isbn = {978-3-540-44345-2},
doi = {10.1007/3-540-45853-0},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/2002-08-esorics02-ipd-correlation.pdf},
author = {Xinyuan Wang and Douglas S. Reeves and S. Felix Wu}
}
@conference {morphmix:wpes2002,
@@ -13247,7 +13293,7 @@ The read-only file system makes the security of published content independent fr
isbn = {1-58113-633-1},
doi = {10.1145/644527.644537},
url = {http://portal.acm.org/citation.cfm?id=644537},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/morphmix-wpes2002.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/morphmix-wpes2002.pdf},
author = {Marc Rennhard and Bernhard Plattner}
}
@booklet {Freedman02introducingtarzan,
@@ -13259,11 +13305,11 @@ The read-only file system makes the security of published content independent fr
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tarzan.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/tarzan.pdf},
author = {Michael J. Freedman and Emil Sit and Josh Cates and Robert Morris}
}
@booklet {646334,
- title = {IPTPS {\textquoteright}01: Revised Papers from the First International Workshop on Peer-to-Peer Systems},
+ title = {IPTPS '01: Revised Papers from the First International Workshop on Peer-to-Peer Systems},
author = {TODO},
year = {2002},
publisher = {Springer-Verlag},
@@ -13280,12 +13326,12 @@ The read-only file system makes the security of published content independent fr
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},
www_section = {distributed storage, P2P},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.20.2147.pdf},
author = {Muthitacharoen, Athicha and Robert Morris and Thomer M. Gil and Bengie Chen}
}
@conference {Maymounkov02kademlia:a,
title = {Kademlia: A Peer-to-peer Information System Based on the XOR Metric},
- booktitle = {IPTPS {\textquoteright}01--Revised Papers from the First International Workshop on Peer-to-Peer System},
+ booktitle = {IPTPS '01--Revised Papers from the First International Workshop on Peer-to-Peer System},
series = {Lecture Notes in Computer Science},
volume = {2429},
year = {2002},
@@ -13299,7 +13345,7 @@ The read-only file system makes the security of published content independent fr
isbn = {3-540-44179-4},
doi = {10.1007/3-540-45748-8_5},
url = {http://www.springerlink.com/content/2ekx2a76ptwd24qt/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/kpos_0.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/kpos_0.pdf},
author = {Petar Maymounkov and David Mazi{\`e}res}
}
@article {DBLP:journals/ijufks/Sweene02,
@@ -13321,7 +13367,7 @@ The read-only file system makes the security of published content independent fr
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},
www_section = {DNS, mobile Ad-hoc networks},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.19.9193.pdf},
author = {Laurent Eschenauer and Virgil D. Gligor}
}
@conference {limits-open,
@@ -13331,16 +13377,16 @@ The read-only file system makes the security of published content independent fr
month = {October},
publisher = {Springer-Verlag, LNCS 2578},
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},
+ 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'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},
www_section = {anonymity measurement, attack, mix},
url = {http://portal.acm.org/citation.cfm?id=731881},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/limits-open.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/limits-open.pdf},
author = {Dogan Kesdogan and Dakshi Agrawal and Stefan Penz},
editor = {Fabien Petitcolas}
}
@conference {Halevy:2002:LBE:646767.704291,
title = {The LSD Broadcast Encryption Scheme},
- booktitle = {CRYPTO{\textquoteright}02--Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology},
+ booktitle = {CRYPTO'02--Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology},
series = {Lecture Notes in Computer Science},
year = {2002},
month = aug,
@@ -13352,7 +13398,7 @@ The read-only file system makes the security of published content independent fr
www_section = {broadcast encryption scheme, encryption, LSD},
isbn = {3-540-44050-X},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CRYPTO\%2702\%20-\%20The\%20LSD\%20broadcast\%20encryption\%20scheme.pdf},
author = {Halevy, Dani and Shamir, Adi}
}
@article {10.1109/SFCS.2002.1181950,
@@ -13378,12 +13424,12 @@ The read-only file system makes the security of published content independent fr
publisher = {USENIX Association Berkeley, CA, USA},
organization = {USENIX Association Berkeley, CA, USA},
abstract = { We propose a new technique for making mix nets robust, called randomized partial checking (RPC). The basic idea is that rather than providing a proof of completely correct operation, each server provides strong evidence of its correct operation by revealing a pseudo-randomly selected subset of its input/output relations.
-Randomized partial checking is exceptionally efficient compared to previous proposals for providing robustness; the evidence provided at each layer is shorter than the output of that layer, and producing the evidence is easier than doing the mixing. It works with mix nets based on any encryption scheme (i.e., on public-key alone, and on hybrid schemes using public-key/symmetric-key combinations). It also works both with Chaumian mix nets where the messages are successively encrypted with each server{\textquoteright}s key, and with mix nets based on a single public key with randomized re-encryption at each layer.
+Randomized partial checking is exceptionally efficient compared to previous proposals for providing robustness; the evidence provided at each layer is shorter than the output of that layer, and producing the evidence is easier than doing the mixing. It works with mix nets based on any encryption scheme (i.e., on public-key alone, and on hybrid schemes using public-key/symmetric-key combinations). It also works both with Chaumian mix nets where the messages are successively encrypted with each server's key, and with mix nets based on a single public key with randomized re-encryption at each layer.
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},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/randomized-checking.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/randomized-checking.pdf},
author = {Jakobsson, Markus and Ari Juels and Ron Rivest}
}
@article {Thomas:2002:MAO:767821.769444,
@@ -13396,12 +13442,12 @@ Randomized partial checking is particularly well suited for voting systems, as i
pages = {603--616},
publisher = {INFORMS},
address = {Institute for Operations Research and the Management Sciences (INFORMS), Linthicum, Maryland, USA},
- abstract = {We present an approach to the admission control and resource allocation problem in connection-oriented networks that offer multiple services to users. Users{\textquoteright} preferences are summarized by means of their utility functions, and each user is allowed to request more than one type of service. Multiple types of resources are allocated at each link along the path of a connection. We assume that the relation between Quality of Service (QoS) and resource allocation is given, and we incorporate it as a constraint into a static optimization problem. The objective of the optimization problem is to determine the amount of and required resources for each type of service to maximize the sum of the users{\textquoteright} utilities. We prove the existence of a solution of the optimization problem and describe a competitive market economy that implements the solution and satisfies the informational constraints imposed by the nature of the decentralized resource allocation problem. The economy consists of four different types of agents: resource providers, service providers, users, and an auctioneer that regulates the prices based on the observed aggregate excess demand. The goods that are sold are: (i) the resources at each link of the network, and (ii) services constructed from these resources and then delivered to users. We specify an iterative procedure that is used by the auctioneer to update the prices, and we show that it leads to an allocation that is arbitrarily close to a solution of the optimization problem in a finite number of iterations},
+ abstract = {We present an approach to the admission control and resource allocation problem in connection-oriented networks that offer multiple services to users. Users' preferences are summarized by means of their utility functions, and each user is allowed to request more than one type of service. Multiple types of resources are allocated at each link along the path of a connection. We assume that the relation between Quality of Service (QoS) and resource allocation is given, and we incorporate it as a constraint into a static optimization problem. The objective of the optimization problem is to determine the amount of and required resources for each type of service to maximize the sum of the users' utilities. We prove the existence of a solution of the optimization problem and describe a competitive market economy that implements the solution and satisfies the informational constraints imposed by the nature of the decentralized resource allocation problem. The economy consists of four different types of agents: resource providers, service providers, users, and an auctioneer that regulates the prices based on the observed aggregate excess demand. The goods that are sold are: (i) the resources at each link of the network, and (ii) services constructed from these resources and then delivered to users. We specify an iterative procedure that is used by the auctioneer to update the prices, and we show that it leads to an allocation that is arbitrarily close to a solution of the optimization problem in a finite number of iterations},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Oper.\%20Res.\%20-\%20Optimal\%20Resource\%20Allocation.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Oper.\%20Res.\%20-\%20Optimal\%20Resource\%20Allocation.pdf},
author = {Thomas, Panagiotis and Teneketzis, Demosthenis and MacKie-Mason, Jeffrey K.}
}
@conference {Saroiu02ameasurement,
@@ -13411,7 +13457,7 @@ Randomized partial checking is particularly well suited for voting systems, as i
month = jan,
address = {San Jose},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/mmcn.pdf},
author = {Stefan Saroiu and P. Krishna Gummadi and Steven D. Gribble}
}
@booklet { dwork02memorybound,
@@ -13426,7 +13472,7 @@ We further investigate this intriguing proposal. Specifically, we
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/memory-bound-crypto.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/memory-bound-crypto.pdf},
author = {Cynthia Dwork and Andrew Goldberg and Moni Naor}
}
@book {2002_3,
@@ -13441,7 +13487,7 @@ We further investigate this intriguing proposal. Specifically, we
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/107.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/107.pdf},
author = {Hand, Steven and Roscoe, Timothy},
editor = {Druschel, Peter and Kaashoek, Frans and Rowstron, Antony}
}
@@ -13451,7 +13497,7 @@ We further investigate this intriguing proposal. Specifically, we
abstract = {We introduce online codes -- 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},
www_section = {coding theory, local encodability, rateless-ness, sparse bipartite graphs},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.112.1333.pdf},
author = {Petar Maymounkov}
}
@article {Sherwood_p5:a,
@@ -13464,7 +13510,7 @@ We further investigate this intriguing proposal. Specifically, we
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p5.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/p5.pdf},
author = {Rob Sherwood and Bobby Bhattacharjee and Aravind Srinivasan}
}
@booklet {Cox02pastiche:making,
@@ -13473,12 +13519,12 @@ We further investigate this intriguing proposal. Specifically, we
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},
www_section = {backup, P2P},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.15.3254.pdf},
author = {Landon P. Cox and Christopher D. Murray and Brian D. Noble}
}
@conference {513828,
title = {Performance analysis of the CONFIDANT protocol},
- booktitle = {MobiHoc {\textquoteright}02: Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking \& computing},
+ booktitle = {MobiHoc '02: Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking \& computing},
year = {2002},
pages = {226--236},
publisher = {ACM},
@@ -13489,14 +13535,14 @@ We further investigate this intriguing proposal. Specifically, we
isbn = {1-58113-501-7},
doi = {10.1145/513800.513828},
url = {http://portal.acm.org/citation.cfm?id=513828$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BucheggerL02.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/BucheggerL02.pdf},
author = {Sonja Buchegger and Jean-Yves Le Boudec}
}
@booklet {Minsky02practicalset,
title = {Practical Set Reconciliation},
year = {2002},
www_section = {set reconciliation},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/practical.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/practical.pdf},
author = {Yaron Minsky and Ari Trachtenberg}
}
@conference {fiveyearslater,
@@ -13511,13 +13557,13 @@ We further investigate this intriguing proposal. Specifically, we
isbn = {978-3-540-00565-0},
doi = {10.1007/3-540-36467-6},
url = {http://www.springerlink.com/content/740p21gl5a9f640m/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/petfive.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/petfive.pdf},
author = {Ian Goldberg},
editor = {Roger Dingledine and Paul Syverson}
}
@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},
+ booktitle = {INFOCOM'02. Proceedings of the 21th Annual Joint Conference of the IEEE Computer and Communications Societies},
year = {2002},
month = jun,
pages = {-1--1},
@@ -13528,12 +13574,12 @@ We further investigate this intriguing proposal. Specifically, we
www_section = {Bloom filter, document location, document motion, probabilistic location},
isbn = {0-7803-7476-2 },
doi = {http://dx.doi.org/10.1109/INFCOM.2002.1019375},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/INFOCOM\%2702\%20-\%20Probabilistic\%20location\%20and\%20routing.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/INFOCOM\%2702\%20-\%20Probabilistic\%20location\%20and\%20routing.pdf},
author = {Rhea, Sean C. and John Kubiatowicz}
}
@conference {586136,
title = {Query-flood DoS attacks in gnutella},
- booktitle = {CCS {\textquoteright}02: Proceedings of the 9th ACM conference on Computer and communications security},
+ booktitle = {CCS '02: Proceedings of the 9th ACM conference on Computer and communications security},
year = {2002},
pages = {181--192},
publisher = {ACM},
@@ -13544,25 +13590,25 @@ We further investigate this intriguing proposal. Specifically, we
isbn = {1-58113-612-9},
doi = {10.1145/586110.586136},
url = {http://portal.acm.org/citation.cfm?id=586110.586136$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p115-daswani_0.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/p115-daswani_0.pdf},
author = {Daswani, Neil and Hector Garcia-Molina}
}
@conference {Douceur:2002:RSD:850928.851884,
title = {Reclaiming Space from Duplicate Files in a Serverless Distributed File System},
- booktitle = {ICDCS{\textquoteright}02--Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS{\textquoteright}02)},
- series = {ICDCS {\textquoteright}02},
+ booktitle = {ICDCS'02--Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS'02)},
+ series = {ICDCS '02},
year = {2002},
month = jul,
pages = {0--617},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Vienna, Austria},
- abstract = {The Farsite distributed file system provides availability by replicating each file onto multiple desktop computers. Since this replication consumes significant storage space, it is important to reclaim used space where possible. Measurement of over 500 desktop file systems shows that nearly half of all consumed space is occupied by duplicate files. We present a mechanism to reclaim space from this incidental duplication to make it available for controlled file replication. Our mechanism includes: (1) convergent encryption, which enables duplicate files to be coalesced into the space of a single file, even if the files are encrypted with different users{\textquoteright} keys; and (2) SALAD, a Self-Arranging Lossy Associative Database for aggregating file content and location information in a decentralized, scalable, fault-tolerant manner. Large-scale simulation experiments show that the duplicate-file coalescing system is scalable, highly effective, and fault-tolerant},
+ abstract = {The Farsite distributed file system provides availability by replicating each file onto multiple desktop computers. Since this replication consumes significant storage space, it is important to reclaim used space where possible. Measurement of over 500 desktop file systems shows that nearly half of all consumed space is occupied by duplicate files. We present a mechanism to reclaim space from this incidental duplication to make it available for controlled file replication. Our mechanism includes: (1) convergent encryption, which enables duplicate files to be coalesced into the space of a single file, even if the files are encrypted with different users' keys; and (2) SALAD, a Self-Arranging Lossy Associative Database for aggregating file content and location information in a decentralized, scalable, fault-tolerant manner. Large-scale simulation experiments show that the duplicate-file coalescing system is scalable, highly effective, and fault-tolerant},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ICDCS\%2702\%20-\%20Reclaiming\%20space\%20for\%20duplicate\%20files.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {Dingledine02reliablemix,
@@ -13573,12 +13619,12 @@ We further investigate this intriguing proposal. Specifically, we
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.19.9316.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.19.9316.pdf},
author = {Roger Dingledine and Paul Syverson}
}
@conference {casc-rep,
title = {Reliable MIX Cascade Networks through Reputation},
- booktitle = {Proceedings of Financial Cryptography (FC {\textquoteright}02)},
+ booktitle = {Proceedings of Financial Cryptography (FC '02)},
year = {2002},
month = mar,
publisher = {Springer-Verlag, LNCS 2357},
@@ -13588,7 +13634,7 @@ We further investigate this intriguing proposal. Specifically, we
isbn = {978-3-540-00646-6},
doi = {10.1007/3-540-36504-4},
url = {http://www.springerlink.com/content/g67u25lm80234qj4/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/casc-rep.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/casc-rep.pdf},
author = {Roger Dingledine and Paul Syverson},
editor = {Matt Blaze}
}
@@ -13602,9 +13648,9 @@ We further investigate this intriguing proposal. Specifically, we
publisher = {ACM New York, NY, USA},
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},
+ abstract = {The Peer-to-Peer (P2P) architectures that are most prevalent in today'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/replication.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/replication.pdf},
author = {Edith Cohen and S Shenker}
}
@conference {Damiani02areputation-based_0,
@@ -13638,17 +13684,17 @@ We further investigate this intriguing proposal. Specifically, we
pages = {326--341},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
- abstract = {A Private Information Retrieval (PIR) protocol allows a user to retrieve a data item of its choice from a database, such that the servers storing the database do not gain information on the identity of the item being retrieved. PIR protocols were studied in depth since the subject was introduced in Chor, Goldreich, Kushilevitz, and Sudan 1995. The standard definition of PIR protocols raises a simple question--what happens if some of the servers crash during the operation? How can we devise a protocol which still works in the presence of crashing servers? Current systems do not guarantee availability of servers at all times for many reasons, e.g., crash of server or communication problems. Our purpose is to design robust PIR protocols, i.e., protocols which still work correctly even if only k out of l servers are available during the protocols{\textquoteright} operation (the user does not know in advance which servers are available). We present various robust PIR protocols giving different tradeofis between the different parameters. These protocols are incomparable, i.e., for different values of n and k we will get better results using different protocols. We first present a generic transformation from regular PIR protocols to robust PIR protocols, this transformation is important since any improvement in the communication complexity of regular PIR protocol will immediately implicate improvement in the robust PIR protocol communication. We also present two specific robust PIR protocols. Finally, we present robust PIR protocols which can tolerate Byzantine servers, i.e., robust PIR protocols which still work in the presence of malicious servers or servers with corrupted or obsolete databases},
+ abstract = {A Private Information Retrieval (PIR) protocol allows a user to retrieve a data item of its choice from a database, such that the servers storing the database do not gain information on the identity of the item being retrieved. PIR protocols were studied in depth since the subject was introduced in Chor, Goldreich, Kushilevitz, and Sudan 1995. The standard definition of PIR protocols raises a simple question--what happens if some of the servers crash during the operation? How can we devise a protocol which still works in the presence of crashing servers? Current systems do not guarantee availability of servers at all times for many reasons, e.g., crash of server or communication problems. Our purpose is to design robust PIR protocols, i.e., protocols which still work correctly even if only k out of l servers are available during the protocols' operation (the user does not know in advance which servers are available). We present various robust PIR protocols giving different tradeofis between the different parameters. These protocols are incomparable, i.e., for different values of n and k we will get better results using different protocols. We first present a generic transformation from regular PIR protocols to robust PIR protocols, this transformation is important since any improvement in the communication complexity of regular PIR protocol will immediately implicate improvement in the robust PIR protocol communication. We also present two specific robust PIR protocols. Finally, we present robust PIR protocols which can tolerate Byzantine servers, i.e., robust PIR protocols which still work in the presence of malicious servers or servers with corrupted or obsolete databases},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BS.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/BS.pdf},
author = {Amos Beimel and Yoav Stahl}
}
@conference {633045,
title = {Scalable application layer multicast},
- booktitle = {SIGCOMM {\textquoteright}02: Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications},
+ booktitle = {SIGCOMM '02: Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications},
year = {2002},
pages = {205--217},
publisher = {ACM},
@@ -13659,7 +13705,7 @@ We further investigate this intriguing proposal. Specifically, we
isbn = {1-58113-570-X},
doi = {10.1145/633025.633045},
url = {http://portal.acm.org/citation.cfm?id=633045$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/sigcomm02.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/sigcomm02.pdf},
author = {Banerjee, Suman and Bobby Bhattacharjee and Kommareddy, Christopher}
}
@mastersthesis {937250,
@@ -13670,7 +13716,7 @@ We further investigate this intriguing proposal. Specifically, we
type = {phd},
www_section = {CAN, distributed hash table},
url = {www.icir.org/sylvia/thesis.ps},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/can.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/can.pdf},
author = {Sylvia Paul Ratnasamy}
}
@article {Castro02scribe:a,
@@ -13679,28 +13725,28 @@ We further investigate this intriguing proposal. Specifically, we
volume = {20},
year = {2002},
pages = {0--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},
+ 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'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},
www_section = {distributed hash table, multicast, Scribe},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/jsac.pdf},
author = {Miguel Castro and Peter Druschel and Anne-Marie Kermarrec and Antony Rowstron}
}
@conference {Douceur:2002:SDS:784592.784803,
title = {A Secure Directory Service based on Exclusive Encryption},
- booktitle = {ACSAC{\textquoteright}02--Proceedings of the 18th Annual Computer Security Applications Conference},
- series = {ACSAC {\textquoteright}02},
+ booktitle = {ACSAC'02--Proceedings of the 18th Annual Computer Security Applications Conference},
+ series = {ACSAC '02},
year = {2002},
month = dec,
pages = {0--172},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {San Diego, CA, USA},
- abstract = {We describe the design of a Windows file-system directory service that ensures the persistence, integrity, privacy, syntactic legality, and case-insensitive uniqueness of the names it indexes. Byzantine state replication provides persistence and integrity, and encryption imparts privacy. To enforce Windows{\textquoteright} baroque name syntax--including restrictions on allowable characters, on the terminal character, and on several specific names--we develop a cryptographic process, called "exclusive encryption," that inherently excludes syntactically illegal names and that enables the exclusion of case-insensitively duplicate names without access to their plaintext. This process excludes entire names by mapping the set of allowed strings to the set of all strings, excludes certain characters through an amended prefix encoding, excludes terminal characters through varying the prefix coding by character index, and supports case-insensitive comparison of names by extracting and encrypting case information separately. We also address the issues of hiding name-length information and access-authorization information, and we report a newly discovered problem with enforcing case-insensitive uniqueness for Unicode names},
+ abstract = {We describe the design of a Windows file-system directory service that ensures the persistence, integrity, privacy, syntactic legality, and case-insensitive uniqueness of the names it indexes. Byzantine state replication provides persistence and integrity, and encryption imparts privacy. To enforce Windows' baroque name syntax--including restrictions on allowable characters, on the terminal character, and on several specific names--we develop a cryptographic process, called "exclusive encryption," that inherently excludes syntactically illegal names and that enables the exclusion of case-insensitively duplicate names without access to their plaintext. This process excludes entire names by mapping the set of allowed strings to the set of all strings, excludes certain characters through an amended prefix encoding, excludes terminal characters through varying the prefix coding by character index, and supports case-insensitive comparison of names by extracting and encrypting case information separately. We also address the issues of hiding name-length information and access-authorization information, and we report a newly discovered problem with enforcing case-insensitive uniqueness for Unicode names},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ACSAC\%2702\%20-\%20A\%20secure\%20directory\%20service\%20based\%20on\%20exclusive\%20encryption.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@article {844156,
@@ -13717,7 +13763,7 @@ We further investigate this intriguing proposal. Specifically, we
issn = {0163-5980},
doi = {10.1145/844128.844156},
url = {http://portal.acm.org/citation.cfm?id=844156$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/osdi2002.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/osdi2002.pdf},
author = {Miguel Castro and Peter Druschel and Ganesh, Ayalvadi and Antony Rowstron and Dan S. Wallach}
}
@conference {Karlof02securerouting,
@@ -13728,12 +13774,12 @@ We further investigate this intriguing proposal. Specifically, we
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},
www_section = {ad-hoc networks, P2P, sensor networks},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/sensor-route-security_0.pdf},
author = {Chris Karlof and David Wagner}
}
@conference {687810,
title = {Security Considerations for Peer-to-Peer Distributed Hash Tables},
- booktitle = {IPTPS {\textquoteright}01: Revised Papers from the First International Workshop on Peer-to-Peer Systems},
+ booktitle = {IPTPS '01: Revised Papers from the First International Workshop on Peer-to-Peer Systems},
year = {2002},
pages = {261--269},
publisher = {Springer-Verlag},
@@ -13743,12 +13789,12 @@ We further investigate this intriguing proposal. Specifically, we
www_section = {distributed hash table, P2P},
isbn = {3-540-44179-4},
url = {http://portal.acm.org/citation.cfm?id=687810$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/173.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/173.pdf},
author = {Emil Sit and Robert Morris}
}
@conference {camenisch2002ssep,
title = {A Signature Scheme with Efficient Protocols},
- booktitle = {Proceedings of SCN {\textquoteright}02, Third Conference on Security in Communication Networks},
+ booktitle = {Proceedings of SCN '02, Third Conference on Security in Communication Networks},
year = {2002},
pages = {268--289},
publisher = {Springer Verlag, LNCS 2576},
@@ -13758,7 +13804,7 @@ We further investigate this intriguing proposal. Specifically, we
isbn = {978-3-540-00420-2},
doi = {10.1007/3-540-36413-7},
url = {http://www.springerlink.com/content/r66ywt172y06g5qr/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/camenisch2002ssep.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/camenisch2002ssep.pdf},
author = {Jan Camenisch and Anna Lysyanskaya}
}
@conference {Byers02simpleload,
@@ -13770,7 +13816,7 @@ We further investigate this intriguing proposal. Specifically, we
www_section = {distributed hash table, load balancing},
doi = {10.1007/b11823},
url = {http://www.springerlink.com/content/r9r4qcqxc2bmfqmr/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.12.277.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.12.277.pdf},
author = {Byers, John W. and Jeffrey Considine and Michael Mitzenmacher}
}
@conference {Capkun02smallworlds,
@@ -13785,7 +13831,7 @@ We further investigate this intriguing proposal. Specifically, we
isbn = {1-58113-598-X},
doi = {10.1145/844102.844108},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.12.5408.pdf},
author = {Srdan Capkun and Levente Butty{\'a}n and Jean-Pierre Hubaux}
}
@article {567178,
@@ -13816,7 +13862,7 @@ We further investigate this intriguing proposal. Specifically, we
www_section = {encryption, privacy},
isbn = {0-7695-1543-6},
url = {http://portal.acm.org/citation.cfm?id=830535},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tr-2002-23.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@booklet {Montenegro02statisticallyunique,
@@ -13824,7 +13870,7 @@ We further investigate this intriguing proposal. Specifically, we
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.16.1456.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.16.1456.pdf},
author = {Gabriel Montenegro}
}
@conference {wallach02p2psecurity,
@@ -13835,7 +13881,7 @@ We further investigate this intriguing proposal. Specifically, we
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},
www_section = {cryptography, P2P, routing, security policy},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.84.9197.pdf},
author = {Dan S. Wallach}
}
@article {568525,
@@ -13852,12 +13898,12 @@ We further investigate this intriguing proposal. Specifically, we
issn = {0360-0300},
doi = {10.1145/568522.568525},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CMU-CS-99-148.pdf},
author = {Mootaz Elnozahy and Lorenzo Alvisi and Yi-Min Wang and Johnson, David B.}
}
@conference {Douceur:2002:SA:646334.687813,
title = {The Sybil Attack},
- booktitle = {IPTPS{\textquoteright}01--Revised Papers from the First International Workshop on Peer-to-Peer Systems},
+ booktitle = {IPTPS'01--Revised Papers from the First International Workshop on Peer-to-Peer Systems},
series = {Revised Papers from the First International Workshop on Peer-to-Peer Systems},
year = {2002},
month = mar,
@@ -13869,7 +13915,7 @@ We further investigate this intriguing proposal. Specifically, we
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IPTPS\%2702\%20-\%20Douceur\%20-\%20The\%20Sybil\%20Attack.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IPTPS\%2702\%20-\%20Douceur\%20-\%20The\%20Sybil\%20Attack.pdf},
author = {John R. Douceur}
}
@conference {tarzan:ccs02,
@@ -13885,7 +13931,7 @@ We further investigate this intriguing proposal. Specifically, we
isbn = {1-58113-612-9},
doi = {10.1145/586110.586137},
url = {http://portal.acm.org/citation.cfm?id=586137},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tarzan-ccs02.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/tarzan-ccs02.pdf},
author = {Michael J. Freedman and Robert Morris}
}
@article {Clifton:2002:TPP:772862.772867,
@@ -13903,7 +13949,7 @@ We further investigate this intriguing proposal. Specifically, we
issn = {1931-0145},
doi = {10.1145/772862.772867},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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.}
}
@booklet {Serjantov02towardsan,
@@ -13916,7 +13962,7 @@ We further investigate this intriguing proposal. Specifically, we
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/set.dvi_.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/set.dvi_.pdf},
author = {Andrei Serjantov and George Danezis}
}
@conference {Serj02,
@@ -13931,7 +13977,7 @@ We further investigate this intriguing proposal. Specifically, we
isbn = {978-3-540-00565-0},
doi = {10.1007/3-540-36467-6},
url = {http://www.springerlink.com/content/wwe2c7g3hmwn0klf/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.12.5992.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.12.5992.pdf},
author = {Andrei Serjantov and George Danezis},
editor = {Roger Dingledine and Paul Syverson}
}
@@ -13941,7 +13987,7 @@ We further investigate this intriguing proposal. Specifically, we
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/anonimity.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/anonimity.pdf},
author = {Claudia Diaz and Stefaan Seys and Joris Claessens and Bart Preneel}
}
@conference {Diaz02,
@@ -13956,13 +14002,13 @@ We further investigate this intriguing proposal. Specifically, we
isbn = {978-3-540-00565-0},
doi = {10.1007/3-540-36467-6},
url = {http://www.springerlink.com/content/3qb837jkpgukc6b5/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/article-89.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/article-89.pdf},
author = {Claudia Diaz and Stefaan Seys and Joris Claessens and Bart Preneel},
editor = {Roger Dingledine and Paul Syverson}
}
@conference {633027,
title = {Understanding BGP misconfiguration},
- booktitle = {SIGCOMM {\textquoteright}02: Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications},
+ booktitle = {SIGCOMM '02: Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications},
year = {2002},
pages = {3--16},
publisher = {ACM},
@@ -13973,7 +14019,7 @@ We further investigate this intriguing proposal. Specifically, we
isbn = {1-58113-570-X},
doi = {10.1145/633025.633027},
url = {http://portal.acm.org/citation.cfm?id=633027$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/bgpmisconfig.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/bgpmisconfig.pdf},
author = {Mahajan, Ratul and Wetherall, David and Anderson, Thomas}
}
@conference {kesdogan:pet2002,
@@ -13983,31 +14029,31 @@ We further investigate this intriguing proposal. Specifically, we
month = {April},
publisher = {Springer-Verlag, LNCS 2482},
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},
+ abstract = {The technique Private Information Retrieval (PIR) perfectly protects a user'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},
www_section = {private information retrieval},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PIR_Kesdogan.pdf},
author = {Dogan Kesdogan and Mark Borning and Michael Schmeink},
editor = {Roger Dingledine and Paul Syverson}
}
@conference {651321,
title = {Venti: A New Approach to Archival Storage},
- booktitle = {FAST {\textquoteright}02: Proceedings of the Conference on File and Storage Technologies},
+ booktitle = {FAST '02: Proceedings of the Conference on File and Storage Technologies},
year = {2002},
pages = {89--101},
publisher = {USENIX Association},
organization = {USENIX Association},
address = {Berkeley, CA, USA},
- 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},
+ abstract = {This paper describes a network storage system, called Venti, intended for archival data. In this system, a unique hash of a block'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},
www_section = {backup, file systems, network storage},
isbn = {1-880446-03-0},
url = {http://portal.acm.org/citation.cfm?id=651321$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/venti-fast.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/venti-fast.pdf},
author = {Quinlan, Sean and Dorward, Sean}
}
@conference {571857,
title = {Viceroy: a scalable and dynamic emulation of the butterfly},
- booktitle = {PODC {\textquoteright}02: Proceedings of the twenty-first annual symposium on Principles of distributed computing},
+ booktitle = {PODC '02: Proceedings of the twenty-first annual symposium on Principles of distributed computing},
year = {2002},
pages = {183--192},
publisher = {ACM},
@@ -14018,7 +14064,7 @@ We further investigate this intriguing proposal. Specifically, we
isbn = {1-58113-485-1},
doi = {10.1145/571825.571857},
url = {http://portal.acm.org/citation.cfm?id=571857$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/viceroy.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/viceroy.pdf},
author = {Malkhi, Dahlia and Moni Naor and Ratajczak, David}
}
@booklet {Hall01onalgorithms,
@@ -14026,7 +14072,7 @@ We further investigate this intriguing proposal. Specifically, we
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.26.1365.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.26.1365.pdf},
author = {Joseph Hall and Jason D. Hartline and Anna R. Karlin and Jared Saia and John Wilkes}
}
@conference {Wright01ananalysis,
@@ -14036,12 +14082,12 @@ We further investigate this intriguing proposal. Specifically, we
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/wright02.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/wright02.pdf},
author = {Matthew Wright and Micah Adler and Brian Neil Levine and Clay Shields}
}
@conference {747491,
title = {Application-Level Multicast Using Content-Addressable Networks},
- booktitle = {NGC {\textquoteright}01: Proceedings of the Third International COST264 Workshop on Networked Group Communication},
+ booktitle = {NGC '01: Proceedings of the Third International COST264 Workshop on Networked Group Communication},
year = {2001},
pages = {14--29},
publisher = {Springer-Verlag},
@@ -14052,7 +14098,7 @@ We further investigate this intriguing proposal. Specifically, we
isbn = {3-540-42824-0},
doi = {10.1007/3-540-45546-9},
url = {http://www.springerlink.com/content/ahdgfj8yj9exqe03/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/can-mcast.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/can-mcast.pdf},
author = {Sylvia Paul Ratnasamy and Handley, Mark and Richard Karp and S Shenker}
}
@conference {gup,
@@ -14062,13 +14108,13 @@ We further investigate this intriguing proposal. Specifically, we
pages = {276--294},
publisher = {Springer-Verlag, LNCS 1962},
organization = {Springer-Verlag, LNCS 1962},
- abstract = {Collecting accurate profile information and protecting an individual{\textquoteright}s privacy are ordinarily viewed as being at odds. This paper presents mechanisms that protect individual privacy while presenting accurate-indeed authenticated-profile information to servers and merchants. In particular, we give a pseudonym registration scheme and system that enforces unique user registration while separating trust required of registrars, issuers, and validators. This scheme enables the issuance of global unique pseudonyms (GUPs) and attributes enabling practical applications such as authentication of accurate attributes and enforcement of {\textquotedblleft}one-to-a-customer{\textquotedblright} properties.
+ abstract = {Collecting accurate profile information and protecting an individual's privacy are ordinarily viewed as being at odds. This paper presents mechanisms that protect individual privacy while presenting accurate-indeed authenticated-profile information to servers and merchants. In particular, we give a pseudonym registration scheme and system that enforces unique user registration while separating trust required of registrars, issuers, and validators. This scheme enables the issuance of global unique pseudonyms (GUPs) and attributes enabling practical applications such as authentication of accurate attributes and enforcement of {\textquotedblleft}one-to-a-customer{\textquotedblright} properties.
We also present a scheme resilient to even pseudonymous profiling yet preserving the ability of merchants to authenticate the accuracy of information. It is the first mechanism of which the authors are aware to guarantee recent validity for group signatures, and more generally multi-group signatures, thus effectively enabling revocation of all or some of the multi-group certificates held by a principal},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/gup.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/gup.pdf},
author = {Stuart Stubblebine and Paul Syverson},
editor = {Yair Frankel}
}
@@ -14082,12 +14128,12 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
abstract = {This paper is to examine the space of negotiation opportunities for autonomous agents, to identify and evaluate some of the key techniques, and to highlight some of the major challenges for future automated negotiation research. This paper is not meant as a survey of the field of automated negotiation. Rather, the descriptions and assessments of the various approaches are generally undertaken with particular reference to work in which the authors have been involved. However, the specific issues raised should be viewed as being broadly applicable},
www_section = {automated negociation autonomous agent, negociation},
doi = {10.1023},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Group\%20Decision\%20and\%20Negociation\%20-\%20Automated\%20Negociation.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Group\%20Decision\%20and\%20Negociation\%20-\%20Automated\%20Negociation.pdf},
author = {Nicholas R Jennings and Peyman Faratin and Alessio R. Lomuscio and Simon Parsons and Carles Sierra and Michael Wooldridge}
}
@conference {378347,
title = {Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination},
- booktitle = {NOSSDAV {\textquoteright}01: Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video},
+ booktitle = {NOSSDAV '01: Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video},
year = {2001},
pages = {11--20},
publisher = {ACM},
@@ -14098,7 +14144,7 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
isbn = {1-58113-370-7},
doi = {10.1145/378344.378347},
url = {http://portal.acm.org/citation.cfm?id=378347$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/bayeux.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/bayeux.pdf},
author = {Shelley Zhuang and Ben Y. Zhao and Anthony D. Joseph and Katz, Randy H. and John Kubiatowicz}
}
@article {Beimel01busesfor,
@@ -14109,7 +14155,7 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
pages = {0--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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BD.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/BD.pdf},
author = {Amos Beimel and Shlomi Dolev}
}
@conference {Stoica01chord:a,
@@ -14121,10 +14167,10 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
publisher = { ACM New York, NY, USA},
organization = { ACM New York, NY, USA},
address = {San Diego, California, United States },
- abstract = {Efficiently determining the node that stores a data item in a distributed network is an important and challenging problem. This paper describes the motivation and design of the Chord system, a decentralized lookup service that stores key/value pairs for such networks. The Chord protocol takes as input an m-bit identifier (derived by hashing a higher-level application specific key), and returns the node that stores the value corresponding to that key. Each Chord node is identified by an m-bit identifier and each node stores the key identifiers in the system closest to the node{\textquoteright}s identifier. Each node maintains an m-entry routing table that allows it to look up keys efficiently. Results from theoretical analysis, simulations, and experiments show that Chord is incrementally scalable, with insertion and lookup costs scaling logarithmically with the number of Chord nodes},
+ abstract = {Efficiently determining the node that stores a data item in a distributed network is an important and challenging problem. This paper describes the motivation and design of the Chord system, a decentralized lookup service that stores key/value pairs for such networks. The Chord protocol takes as input an m-bit identifier (derived by hashing a higher-level application specific key), and returns the node that stores the value corresponding to that key. Each Chord node is identified by an m-bit identifier and each node stores the key identifiers in the system closest to the node's identifier. Each node maintains an m-entry routing table that allows it to look up keys efficiently. Results from theoretical analysis, simulations, and experiments show that Chord is incrementally scalable, with insertion and lookup costs scaling logarithmically with the number of Chord nodes},
www_section = {Chord, distributed hash table},
isbn = {1-58113-411-8},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/chord_sigcomm.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/chord_sigcomm.pdf},
author = {Ion Stoica and Robert Morris and David Karger and Frans M. Kaashoek and Hari Balakrishnan}
}
@article {Sirer_cliquenet:a,
@@ -14137,7 +14183,7 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
journal = {unknown},
issn = {TR2001},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cliquenet-iptp.pdf},
author = {Emin G{\"u}n Sirer and Milo Polte and Mark Robson}
}
@conference {Douceur01competitivehill-climbing,
@@ -14147,7 +14193,7 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
pages = {48--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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/hill\%20climbing.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/hill\%20climbing.pdf},
author = {John R. Douceur and Roger Wattenhofer}
}
@conference {Michiardi01core:a,
@@ -14155,10 +14201,10 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
booktitle = {CORE: A Collaborative Reputation Mechanism to enforce node cooperation in Mobile Ad hoc Networks},
year = {2001},
pages = {107--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},
+ 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' collaboration using a technique called reputation. The reputation is calculated based on various types of information on each entity'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},
www_section = {ad-hoc networks},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/michpi-020801.pdf},
author = {Pietro Michiardi and Refik Molva}
}
@conference {Cattaneo:2001:DIT:647054.715628,
@@ -14171,13 +14217,13 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
organization = {USENIX Association},
address = {Boston, Massachusetts, USA},
abstract = {
-Recent advances in hardware and communication technologies have made possible and cost e ective to share a file system among several machines over a local (but possibly also a wide) area network. One of the most successful and widely used such applications is Sun{\textquoteright}s Network File System (NFS). NFS is very simple in structure but assumes a very strong trust model: the user trusts the remote le system server (which might be running on a machine in di erent country) and a network with his/her data. It is easy to see that neither assumption is a very realistic one. The server (or anybody with superuser privileges) might very well read the data on its local lesytem and it is well known that the Internet or any local area network (e.g, Ethernet) is very easy to tap (see for example, Berkeley{\textquoteright}s tcpdump 7, 5] application program). Impersoni cation of users is also another security drawback of NFS. In fact, most of the permission checking over NFS are performed in the kernel of the client. In such a context a pirate can temporarely assign to his own workstation the Internet address of victim. Without secure RPC 9] no further authentication procedure is requested. From here on, the pirate can issue NFS requests presenting himself with any (false) uid and therefore accessing for reading and writing any private data on the server, even protected data.
+Recent advances in hardware and communication technologies have made possible and cost e ective to share a file system among several machines over a local (but possibly also a wide) area network. One of the most successful and widely used such applications is Sun's Network File System (NFS). NFS is very simple in structure but assumes a very strong trust model: the user trusts the remote le system server (which might be running on a machine in di erent country) and a network with his/her data. It is easy to see that neither assumption is a very realistic one. The server (or anybody with superuser privileges) might very well read the data on its local lesytem and it is well known that the Internet or any local area network (e.g, Ethernet) is very easy to tap (see for example, Berkeley's tcpdump 7, 5] application program). Impersoni cation of users is also another security drawback of NFS. In fact, most of the permission checking over NFS are performed in the kernel of the client. In such a context a pirate can temporarely assign to his own workstation the Internet address of victim. Without secure RPC 9] no further authentication procedure is requested. From here on, the pirate can issue NFS requests presenting himself with any (false) uid and therefore accessing for reading and writing any private data on the server, even protected data.
Given the above, a user seeking a certain level of security should take some measures. Possible solutions are to use either user-level cryptography or application level cryptography. A discussion of the drawbacks of these approaches is found in 4]. A better approach is to push encryption services into the operating system as done by M. Blaze in the design of his CFS 4].
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},
www_section = {crytographic file system, UNIX},
isbn = {1-880446-10-3},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_1,
@@ -14195,7 +14241,7 @@ In this paper, we propose a new cryptographic le system, which we call TCFS , as
pages = {569--584},
abstract = {We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discrete-time random process. As a result, we obtain a simple criterion involving the fractions of nodes of different degrees on both sides of the graph which is necessary and sufficient for the decoding process to finish successfully with high probability. By carefully designing these graphs we can construct for any given rate R and any given real number {\epsilon} a family of linear codes of rate R which can be encoded in time proportional to ln(1/{\epsilon}) times their block length n. Furthermore, a codeword can be recovered with high probability from a portion of its entries of length (1+{\epsilon})Rn or more. The recovery algorithm also runs in time proportional to n ln(1/{\epsilon}). Our algorithms have been implemented and work well in practice; various implementation issues are discussed},
www_section = {coding theory, recovery algorithm},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.107.244.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.107.244.pdf},
author = {Luby, Michael and Michael Mitzenmacher and M. Amin Shokrollahi and Daniel A. Spielman}
}
@conference {PShuffle,
@@ -14208,13 +14254,13 @@ In this paper, we propose a new cryptographic le system, which we call TCFS , as
isbn = {978-3-540-42456-7},
doi = {10.1007/3-540-44647-8},
url = {http://portal.acm.org/citation.cfm?id=704279},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PShuffle.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PShuffle.pdf},
author = {Jun Furukawa and Kazue Sako},
editor = {Joe Kilian}
}
@conference {cl01a,
title = {An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation},
- booktitle = {Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT {\textquoteright}01)},
+ booktitle = {Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT '01)},
year = {2001},
pages = {93--118},
publisher = {Springer-Verlag},
@@ -14223,12 +14269,12 @@ In this paper, we propose a new cryptographic le system, which we call TCFS , as
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cl01a.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cl01a.pdf},
author = {Jan Camenisch and Anna Lysyanskaya}
}
@conference {747489,
title = {Extremum Feedback for Very Large Multicast Groups},
- booktitle = {NGC {\textquoteright}01: Proceedings of the Third International COST264 Workshop on Networked Group Communication},
+ booktitle = {NGC '01: Proceedings of the Third International COST264 Workshop on Networked Group Communication},
year = {2001},
pages = {56--75},
publisher = {Springer-Verlag},
@@ -14238,7 +14284,7 @@ In this paper, we propose a new cryptographic le system, which we call TCFS , as
www_section = {multicast},
isbn = {3-540-42824-0},
url = {http://portal.acm.org/citation.cfm?id=648089.747489$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Widmer2001g.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Widmer2001g.pdf},
author = {J{\"o}rg Widmer and Thomas Fuhrmann}
}
@booklet {freedom21-security,
@@ -14247,26 +14293,26 @@ In this paper, we propose a new cryptographic le system, which we call TCFS , as
month = {May},
publisher = {Zero Knowledge Systems, {Inc.}},
type = {White Paper},
- abstract = {We describe attacks to which Freedom, or Freedom users, may be vulnerable. These attacks are those that reduce the privacy of a Freedom user, through exploiting cryptographic, design or implementation issues. We include issues which may not be Freedom security issues which arise when the system is not properly used. This disclosure includes all known design or implementation flaws, as well as places where various trade-offs made while creating the system have privacy implications. We also discuss cryptographic points that are needed for a complete understanding of how Freedom works, including ones we don{\textquoteright}t believe can be used to reduce anyone{\textquoteright}s privacy},
+ abstract = {We describe attacks to which Freedom, or Freedom users, may be vulnerable. These attacks are those that reduce the privacy of a Freedom user, through exploiting cryptographic, design or implementation issues. We include issues which may not be Freedom security issues which arise when the system is not properly used. This disclosure includes all known design or implementation flaws, as well as places where various trade-offs made while creating the system have privacy implications. We also discuss cryptographic points that are needed for a complete understanding of how Freedom works, including ones we don't believe can be used to reduce anyone's privacy},
www_section = {Freedom, privacy},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Freedom_Security2-1.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Freedom_Security2-1.pdf},
author = {Adam Back and Ian Goldberg and Adam Shostack}
}
@conference {2001_2,
- title = {A Generalisation, a Simplification and Some Applications of Paillier{\textquoteright}s Probabilistic Public-Key System},
+ title = {A Generalisation, a Simplification and Some Applications of Paillier'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},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
address = {London, UK, UK},
- abstract = {We propose a generalisation of Paillier{\textquoteright}s probabilistic public key system, in which the expansion factor is reduced and which allows to adjust the block length of the scheme even after the public key has been fixed, without loosing the homomorphic property. We show that the generalisation is as secure as Paillier{\textquoteright}s original system.
+ abstract = {We propose a generalisation of Paillier's probabilistic public key system, in which the expansion factor is reduced and which allows to adjust the block length of the scheme even after the public key has been fixed, without loosing the homomorphic property. We show that the generalisation is as secure as Paillier's original system.
We construct a threshold variant of the generalised scheme as well as zero-knowledge protocols to show that a given ciphertext encrypts one of a set of given plaintexts, and protocols to verify multiplicative relations on plaintexts.
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Generalisation2001Damgard.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Generalisation2001Damgard.pdf},
author = {Damg\aard, Ivan and Jurik, Mats}
}
@article {9999,
@@ -14293,17 +14339,17 @@ We then show how these building blocks can be used for applying the scheme to ef
volume = {47},
year = {2001},
pages = {585--598},
- abstract = {We construct new families of error-correcting codes based on Gallager{\textquoteright}s low-density parity-check codes. We improve on Gallager{\textquoteright}s results by introducing irregular parity-check matrices and a new rigorous analysis of hard-decision decoding of these codes. We also provide efficient methods for finding good irregular structures for such decoding algorithms. Our rigorous analysis based on martingales, our methodology for constructing good irregular codes, and the demonstration that irregular structure improves performance constitute key points of our contribution. We also consider irregular codes under belief propagation. We report the results of experiments testing the efficacy of irregular codes on both binary-symmetric and Gaussian channels. For example, using belief propagation, for rate I R codes on 16 000 bits over a binary-symmetric channel, previous low-density parity-check codes can correct up to approximately 16 \% errors, while our codes correct over 17\%. In some cases our results come very close to reported results for turbo codes, suggesting that variations of irregular low density parity-check codes may be able to match or beat turbo code performance. Index Terms{\textemdash}Belief propagation, concentration theorem, Gallager codes, irregular codes, low-density parity-check codes},
+ abstract = {We construct new families of error-correcting codes based on Gallager's low-density parity-check codes. We improve on Gallager's results by introducing irregular parity-check matrices and a new rigorous analysis of hard-decision decoding of these codes. We also provide efficient methods for finding good irregular structures for such decoding algorithms. Our rigorous analysis based on martingales, our methodology for constructing good irregular codes, and the demonstration that irregular structure improves performance constitute key points of our contribution. We also consider irregular codes under belief propagation. We report the results of experiments testing the efficacy of irregular codes on both binary-symmetric and Gaussian channels. For example, using belief propagation, for rate I R codes on 16 000 bits over a binary-symmetric channel, previous low-density parity-check codes can correct up to approximately 16 \% errors, while our codes correct over 17\%. In some cases our results come very close to reported results for turbo codes, suggesting that variations of irregular low density parity-check codes may be able to match or beat turbo code performance. Index Terms{\textemdash}Belief propagation, concentration theorem, Gallager codes, irregular codes, low-density parity-check codes},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/errorsIT.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/errorsIT.pdf},
author = {Luby, Michael and Michael Mitzenmacher and M. Amin Shokrollahi and Daniel A. Spielman}
}
@conference {Golle01incentivesfor,
title = {Incentives for Sharing in Peer-to-Peer Networks},
- booktitle = {EC{\textquoteright}01: Proceedings of the Second International Workshop on Electronic Commerce},
+ booktitle = {EC'01: Proceedings of the Second International Workshop on Electronic Commerce},
year = {2001},
pages = {75--87},
publisher = {Springer-Verlag},
@@ -14312,7 +14358,7 @@ We then show how these building blocks can be used for applying the scheme to ef
abstract = {We consider the free-rider problem in peer-to-peer file sharing networks such as Napster: that individual users are provided with no incentive for adding value to the network. We examine the design implications of the assumption that users will selfishly act to maximize their own rewards, by constructing a formal game theoretic model of the system and analyzing equilibria of user strategies under several novel payment mechanisms. We support and extend this work with results from experiments with a multi-agent reinforcement learning model},
www_section = {free-riding, incentives},
isbn = {3-540-42878-X},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.23.9004.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.23.9004.pdf},
author = {Philippe Golle and Kevin Leyton-Brown and Ilya Mironov and Mark Lillibridge}
}
@article {beimel01informationtheoretic,
@@ -14321,15 +14367,15 @@ We then show how these building blocks can be used for applying the scheme to ef
volume = {2076},
year = {2001},
pages = {89--98},
- abstract = {A Private Information Retrieval (PIR) protocol enables a user to retrieve a data item from a database while hiding the identity of the item being retrieved. In a t-private, k-server PIR protocol the database is replicated among k servers, and the user{\textquoteright}s privacy is protected from any collusion of up to t servers. The main cost-measure of such protocols is the communication complexity of retrieving a single bit of data.
-This work addresses the information-theoretic setting for PIR, in which the user{\textquoteright}s privacy should be unconditionally protected from collusions of servers. We present a unified general construction, whose abstract components can be instantiated to yield both old and new families of PIR protocols. A main ingredient in the new protocols is a generalization of a solution by Babai, Kimmel, and Lokam to a communication complexity problem in the so-called simultaneous messages model.
+ abstract = {A Private Information Retrieval (PIR) protocol enables a user to retrieve a data item from a database while hiding the identity of the item being retrieved. In a t-private, k-server PIR protocol the database is replicated among k servers, and the user's privacy is protected from any collusion of up to t servers. The main cost-measure of such protocols is the communication complexity of retrieving a single bit of data.
+This work addresses the information-theoretic setting for PIR, in which the user's privacy should be unconditionally protected from collusions of servers. We present a unified general construction, whose abstract components can be instantiated to yield both old and new families of PIR protocols. A main ingredient in the new protocols is a generalization of a solution by Babai, Kimmel, and Lokam to a communication complexity problem in the so-called simultaneous messages model.
Our construction strictly improves upon previous constructions and resolves some previous anomalies. In particular, we obtain: (1) t-private k-server PIR protocols with O(n 1/{\lfllor} (2k-1)/tc{\rfloor}) communication bits, where n is the database size. For t > 1, this is a substantial asymptotic improvement over the previous state of the art; (2) a constant-factor improvement in the communication complexity of 1-private PIR, providing the first improvement to the 2-server case since PIR protocols were introduced; (3) efficient PIR protocols with logarithmic query length. The latter protocols have applications to the construction of efficient families of locally decodable codes over large alphabets and to PIR protocols with reduced work by the servers},
www_section = {communication complexity, privacy, private information retrieval},
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/beimel01informationtheoretic.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/beimel01informationtheoretic.pdf},
author = {Amos Beimel and Yuval Ishai}
}
@conference {Department01instrumentingthe,
@@ -14340,7 +14386,7 @@ Our construction strictly improves upon previous constructions and resolves some
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},
www_section = {wireless sensor network},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.3.3027.pdf},
author = {Deborah Estrin and Gregory J. Pottie and L. Girod and Mani Srivastava}
}
@conference {2001_3,
@@ -14354,23 +14400,23 @@ Our construction strictly improves upon previous constructions and resolves some
isbn = {0-7803-7016-3 },
doi = {10.1109/INFCOM.2001.916651 },
url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=916651},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/infocom01investigating.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/infocom01investigating.pdf},
author = {Feeney, Laura Marie and Nilsson, Martin}
}
@conference {502052,
title = {A low-bandwidth network file system},
- booktitle = {SOSP {\textquoteright}01: Proceedings of the eighteenth ACM symposium on Operating systems principles},
+ booktitle = {SOSP '01: Proceedings of the eighteenth ACM symposium on Operating systems principles},
year = {2001},
pages = {174--187},
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
- abstract = {Users rarely consider running network file systems over slow or wide-area networks, as the performance would be unacceptable and the bandwidth consumption too high. Nonetheless, efficient remote file access would often be desirable over such networks---particularly when high latency makes remote login sessions unresponsive. Rather than run interactive programs such as editors remotely, users could run the programs locally and manipulate remote files through the file system. To do so, however, would require a network file system that consumes less bandwidth than most current file systems.This paper presents LBFS, a network file system designed for low-bandwidth networks. LBFS exploits similarities between files or versions of the same file to save bandwidth. It avoids sending data over the network when the same data can already be found in the server{\textquoteright}s file system or the client{\textquoteright}s cache. Using this technique in conjunction with conventional compression and caching, LBFS consumes over an order of magnitude less bandwidth than traditional network file systems on common workloads},
+ abstract = {Users rarely consider running network file systems over slow or wide-area networks, as the performance would be unacceptable and the bandwidth consumption too high. Nonetheless, efficient remote file access would often be desirable over such networks---particularly when high latency makes remote login sessions unresponsive. Rather than run interactive programs such as editors remotely, users could run the programs locally and manipulate remote files through the file system. To do so, however, would require a network file system that consumes less bandwidth than most current file systems.This paper presents LBFS, a network file system designed for low-bandwidth networks. LBFS exploits similarities between files or versions of the same file to save bandwidth. It avoids sending data over the network when the same data can already be found in the server's file system or the client's cache. Using this technique in conjunction with conventional compression and caching, LBFS consumes over an order of magnitude less bandwidth than traditional network file systems on common workloads},
www_section = {file systems, workload characterization},
isbn = {1-58113-389-8},
doi = {10.1145/502034.502052},
url = {http://portal.acm.org/citation.cfm?id=502052$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/lbfs.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/lbfs.pdf},
author = {Muthitacharoen, Athicha and Chen, Benjie and David Mazi{\`e}res}
}
@book {2001_4,
@@ -14386,13 +14432,13 @@ Our construction strictly improves upon previous constructions and resolves some
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/MultiPartyComputation2001Cramer.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/MultiPartyComputation2001Cramer.pdf},
author = {Cramer, Ronald and Damg{\'a}rd, Ivan and Nielsen, JesperB},
editor = {Pfitzmann, Birgit}
}
@conference {jakobsson-optimally,
title = {An Optimally Robust Hybrid Mix Network (Extended Abstract)},
- booktitle = {Proceedings of Principles of Distributed Computing--{PODC} {\textquoteright}01},
+ booktitle = {Proceedings of Principles of Distributed Computing--{PODC} '01},
year = {2001},
publisher = {ACM Press},
organization = {ACM Press},
@@ -14400,7 +14446,7 @@ Our construction strictly improves upon previous constructions and resolves some
www_section = {mix, public key cryptography, robustness},
isbn = {1-58113-383-9},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.24.8205.pdf},
author = {Jakobsson, Markus and Ari Juels}
}
@conference {Druschel01past:a,
@@ -14411,12 +14457,12 @@ Our construction strictly improves upon previous constructions and resolves some
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},
www_section = {peer-to-peer storage},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.1.1674.pdf},
author = {Peter Druschel and Antony Rowstron}
}
@conference {697650,
title = {Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems},
- booktitle = {Middleware {\textquoteright}01: Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg},
+ booktitle = {Middleware '01: Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg},
year = {2001},
pages = {329--350},
publisher = {Springer-Verlag},
@@ -14424,16 +14470,16 @@ Our construction strictly improves upon previous constructions and resolves some
address = {London, UK},
abstract = {This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer applications.Pastry performs application-level routing and object location in a potentially very large overlay network of nodes connected via the Internet. It can be used to support a variety of peer-to-peer applications, including global data
storage, data sharing, group communication and naming. Each node in the Pastry network has a unique identifier (nodeId). When presented with a message and a key, a Pastry node efficiently routes the message to the node with a nodeId that is numerically closest to the key, among all currently live Pastry nodes. Each Pastry node keeps track of its immediate neighbors in the nodeId space, and notifies applications of new node arrivals, node failures and recoveries. Pastry takes into account network locality; it seeks to minimize the distance messages travel, according to a to scalar proximity metric like the number of IP routing hops.
-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},
+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's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties},
www_section = {overlay networks, P2P},
isbn = {3-540-42800-3},
url = {http://portal.acm.org/citation.cfm?id=697650$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pastry.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/pastry.pdf},
author = {Antony Rowstron and Peter Druschel}
}
@conference {Rowstron01pastry:scalable,
title = {Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems},
- booktitle = {Middleware{\textquoteright}01--Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms},
+ booktitle = {Middleware'01--Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms},
series = {Lecture Notes in Computer Science},
volume = {2218},
year = {2001},
@@ -14444,28 +14490,28 @@ Pastry is completely decentralized, scalable, and self-organizing; it automatica
address = {Heidelberg, Germany},
abstract = {This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer applications. Pastry performs application-level routing and object location in a potentially very large overlay network of nodes connected via the Internet. It can be used to support a variety of peer-to-peer applications, including global data storage, data sharing, group communication and naming.
Each node in the Pastry network has a unique identifier (nodeId). When presented with a message and a key, a Pastry node efficiently routes the message to the node with a nodeId that is numerically closest to the key, among all currently live Pastry nodes. Each Pastry node keeps track of its immediate neighbors in the nodeId space, and notifies applications of new node arrivals, node failures and recoveries. Pastry takes into account network locality; it seeks to minimize the distance messages travel, according to a to scalar proximity metric like the number of IP routing hops
-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
+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's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties
Work done in part while visiting Microsoft Research, Cambridge, UK},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Pastry.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Pastry.pdf},
author = {Antony Rowstron and Peter Druschel}
}
@book {558412,
title = {Peer-to-Peer: Harnessing the Power of Disruptive Technologies},
author={Oram, Andy},
year = {2001},
- publisher = {O{\textquoteright}Reilly \& Associates, Inc},
- organization = {O{\textquoteright}Reilly \& Associates, Inc},
+ publisher = {O'Reilly \& Associates, Inc},
+ organization = {O'Reilly \& Associates, Inc},
address = {Sebastopol, CA, USA},
- abstract = {Upstart software projects Napster, Gnutella, and Freenet have dominated newspaper headlines, challenging traditional approaches to content distribution with their revolutionary use of peer-to-peer file-sharing technologies. Reporters try to sort out the ramifications of seemingly ungoverned peer-to-peer networks. Lawyers, business leaders, and social commentators debate the virtues and evils of these bold new distributed systems. But what{\textquoteright}s really behind such disruptive technologies -- the breakthrough innovations that have rocked the music and media worlds? And what lies ahead?
-In this book, key peer-to-peer pioneers take us beyond the headlines and hype and show how the technology is changing the way we communicate and exchange information. Those working to advance peer-to-peer as a technology, a business opportunity, and an investment offer their insights into how the technology has evolved and where it{\textquoteright}s going. They explore the problems they{\textquoteright}ve faced, the solutions they{\textquoteright}ve discovered, the lessons they{\textquoteright}ve learned, and their goals for the future of computer networking.
+ abstract = {Upstart software projects Napster, Gnutella, and Freenet have dominated newspaper headlines, challenging traditional approaches to content distribution with their revolutionary use of peer-to-peer file-sharing technologies. Reporters try to sort out the ramifications of seemingly ungoverned peer-to-peer networks. Lawyers, business leaders, and social commentators debate the virtues and evils of these bold new distributed systems. But what's really behind such disruptive technologies -- the breakthrough innovations that have rocked the music and media worlds? And what lies ahead?
+In this book, key peer-to-peer pioneers take us beyond the headlines and hype and show how the technology is changing the way we communicate and exchange information. Those working to advance peer-to-peer as a technology, a business opportunity, and an investment offer their insights into how the technology has evolved and where it's going. They explore the problems they've faced, the solutions they've discovered, the lessons they've learned, and their goals for the future of computer networking.
-Until now, Internet communities have been limited by the flat interactive qualities of email and network newsgroups, where people can exchange recommendations and ideas but have great difficulty commenting on one another{\textquoteright}s postings, structuring information, performing searches, and creating summaries. Peer-to-peer challenges the traditional authority of the client/server model, allowing shared information to reside instead with producers and users. Peer-to-peer networks empower users to collaborate on producing and consuming information, adding to it, commenting on it, and building communities around it.
+Until now, Internet communities have been limited by the flat interactive qualities of email and network newsgroups, where people can exchange recommendations and ideas but have great difficulty commenting on one another's postings, structuring information, performing searches, and creating summaries. Peer-to-peer challenges the traditional authority of the client/server model, allowing shared information to reside instead with producers and users. Peer-to-peer networks empower users to collaborate on producing and consuming information, adding to it, commenting on it, and building communities around it.
-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},
+This compilation represents the collected wisdom of today's peer-to-peer luminaries. It includes contributions from Gnutella's Gene Kan, Freenet's Brandon Wiley, Jabber'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's center stage for years to come},
isbn = {059600110X},
url = {http://portal.acm.org/citation.cfm?id=558412$\#$},
editor = {Andy oram}
@@ -14473,8 +14519,8 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
@book {2001_5,
title = {Peer-To-Peer: Harnessing the Power of Disruptive Technologies -- Chapter 12: Free Haven},
year = {2001},
- publisher = {O{\textquoteright}Reilly Media},
- organization = {O{\textquoteright}Reilly Media},
+ publisher = {O'Reilly Media},
+ organization = {O'Reilly Media},
abstract = {Description of the problems that arise when one tries to combine anonymity and accountability. Note that the Free Haven design described here charges for storing data in the network (downloads are free), whereas in GNUnet adding data is free and only the downloads are considered as utilization },
author = {Roger Dingledine and Michael J. Freedman and David Molnar},
editor = {Andy oram}
@@ -14483,7 +14529,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.106.7489.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.106.7489.pdf},
author = {Rita Chen and William Yeager}
}
@booklet {Batten01pstore:a,
@@ -14492,19 +14538,19 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
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},
www_section = {P2P, robustness},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.130.6088.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.130.6088.pdf},
author = {Jean-Pierre Hubaux and Levente Butty{\'a}n and Srdan Capkun}
}
@conference {501437,
title = {The quest for security in mobile ad hoc networks},
- booktitle = {MobiHoc {\textquoteright}01: Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking \& computing},
+ booktitle = {MobiHoc '01: Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking \& computing},
year = {2001},
pages = {146--155},
publisher = {ACM},
@@ -14515,7 +14561,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
isbn = {1-58113-428-2},
doi = {10.1145/501436.501437},
url = {http://portal.acm.org/citation.cfm?id=501437$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Quest01.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Quest01.pdf},
author = {Jean-Pierre Hubaux and Levente Butty{\'a}n and Srdan Capkun}
}
@conference {patterns-failure,
@@ -14530,7 +14576,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
www_section = {pseudonym, security policy},
isbn = {3-540-42733-3},
url = {http://portal.acm.org/citation.cfm?id=731864},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Patterns_of_Failure.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Patterns_of_Failure.pdf},
author = {Richard Clayton and George Danezis and Markus G. Kuhn},
editor = {Ira S. Moskowitz}
}
@@ -14554,7 +14600,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
isbn = {978-3-540-42733-9},
doi = {10.1007/3-540-45496-9},
url = {http://www.springerlink.com/content/ej8qv86wdkeukjc5/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mix-acc.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/mix-acc.pdf},
author = {Roger Dingledine and Michael J. Freedman and David Hopwood and David Molnar},
editor = {Ira S. Moskowitz}
}
@@ -14567,12 +14613,12 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
pages = {131--145},
publisher = {ACM},
address = {New York, NY, USA},
- abstract = {A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds, improving over today{\textquoteright}s wide-area routing protocols that take at least several minutes to recover. A RON is an application-layer overlay on top of the existing Internet routing substrate. The RON nodes monitor the functioning and quality of the Internet paths among themselves, and use this information to decide whether to route packets directly over the Internet or by way of other RON nodes, optimizing application-specific routing metrics.Results from two sets of measurements of a working RON deployed at sites scattered across the Internet demonstrate the benefits of our architecture. For instance, over a 64-hour sampling period in March 2001 across a twelve-node RON, there were 32 significant outages, each lasting over thirty minutes, over the 132 measured paths. RON{\textquoteright}s routing mechanism was able to detect, recover, and route around all of them, in less than twenty seconds on average, showing that its methods for fault detection and recovery work well at discovering alternate paths in the Internet. Furthermore, RON was able to improve the loss rate, latency, or throughput perceived by data transfers; for example, about 5\% of the transfers doubled their TCP throughput and 5\% of our transfers saw their loss probability reduced by 0.05. We found that forwarding packets via at most one intermediate RON node is sufficient to overcome faults and improve performance in most cases. These improvements, particularly in the area of fault detection and recovery, demonstrate the benefits of moving some of the control over routing into the hands of end-systems},
+ abstract = {A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds, improving over today's wide-area routing protocols that take at least several minutes to recover. A RON is an application-layer overlay on top of the existing Internet routing substrate. The RON nodes monitor the functioning and quality of the Internet paths among themselves, and use this information to decide whether to route packets directly over the Internet or by way of other RON nodes, optimizing application-specific routing metrics.Results from two sets of measurements of a working RON deployed at sites scattered across the Internet demonstrate the benefits of our architecture. For instance, over a 64-hour sampling period in March 2001 across a twelve-node RON, there were 32 significant outages, each lasting over thirty minutes, over the 132 measured paths. RON's routing mechanism was able to detect, recover, and route around all of them, in less than twenty seconds on average, showing that its methods for fault detection and recovery work well at discovering alternate paths in the Internet. Furthermore, RON was able to improve the loss rate, latency, or throughput perceived by data transfers; for example, about 5\% of the transfers doubled their TCP throughput and 5\% of our transfers saw their loss probability reduced by 0.05. We found that forwarding packets via at most one intermediate RON node is sufficient to overcome faults and improve performance in most cases. These improvements, particularly in the area of fault detection and recovery, demonstrate the benefits of moving some of the control over routing into the hands of end-systems},
www_section = {resilient overlay network},
issn = {0163-5980},
doi = {10.1145/502059.502048},
url = {http://portal.acm.org/citation.cfm?id=502059.502048$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ron-sosp2001.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ron-sosp2001.pdf},
author = {Andersen, David and Hari Balakrishnan and Frans M. Kaashoek and Robert Morris}
}
@conference {Scarlata01responderanonymity,
@@ -14584,12 +14630,12 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/APFS.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/APFS.pdf},
author = {Vincent Scarlata and Brian Neil Levine and Clay Shields}
}
@conference {383072,
title = {A scalable content-addressable network},
- booktitle = {SIGCOMM {\textquoteright}01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications},
+ booktitle = {SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications},
year = {2001},
pages = {161--172},
publisher = {ACM},
@@ -14600,7 +14646,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
isbn = {1-58113-411-8},
doi = {10.1145/383059.383072},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.19.8434.pdf},
author = {Sylvia Paul Ratnasamy and Paul Francis and Handley, Mark and Richard Karp and S Shenker}
}
@article { 10.1109/P2P.2001.990421,
@@ -14626,7 +14672,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
www_section = {pseudonym},
doi = {10.1111/j.1430-9134.2001.00173.x},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/081199.pdf},
author = {Eric Friedman and Paul Resnick}
}
@conference {strong-eternity,
@@ -14641,7 +14687,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
isbn = {978-3-540-42733-9},
doi = {10.1007/3-540-45496-9},
url = {http://portal.acm.org/citation.cfm?id=731726},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/strong-eternity.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/strong-eternity.pdf},
author = {Tonda Benes},
editor = {Ira S. Moskowitz}
}
@@ -14652,7 +14698,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
pages = {126--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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/tangler.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/tangler.pdf},
author = {Marc Waldman and David Mazi{\`e}res}
}
@conference {waldman01tangler,
@@ -14666,15 +14712,15 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.24.3781.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.24.3781.pdf},
author = {Marc Waldman and David Mazi{\`e}res}
}
@booklet {Zhao01tapestry:an,
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},
+ abstract = {In today's chaotic network, data and services are mobile and replicated widely for availability, durability, and locality. Components' 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' infrastructure is purely soft state and easily repaired. Tapestry is self-administering, fault-tolerant, and resilient under load. This paper presents' 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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CSD-01-1141.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_6,
@@ -14690,7 +14736,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
www_section = {economics, principal-agent model},
isbn = {9780691091846},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Laffont\%20\%26\%20Martimort\%20-\%20The\%20Theory\%20of\%20Incentives.pdf},
author = {Jean-Jacques Laffont and David Martimort}
}
@conference {back01,
@@ -14706,7 +14752,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
isbn = {978-3-540-42733-9},
doi = {10.1007/3-540-45496-9},
url = {http://www.springerlink.com/content/4gpwtejkkvadcdcm/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/traffic_0.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/traffic_0.pdf},
author = {Adam Back and Ulf M{\"o}ller and Anton Stiglic},
editor = {Ira S. Moskowitz}
}
@@ -14723,21 +14769,21 @@ This book focuses on the principal-agent model, the "simple" situation where a p
isbn = {1-58113-385-5},
doi = {10.1145/501983.502000},
url = {http://portal.acm.org/citation.cfm?id=502000},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/shuffle-ccs01.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/shuffle-ccs01.pdf},
author = {Andrew C. Neff},
editor = {Pierangela Samarati}
}
@booklet {Heydon01thevesta,
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},
+ 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'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'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's advantages over traditional tools, how those benefits are achieved, and the system's overall performance},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SRC-RR-168.pdf},
author = {Allan Heydon and Roy Levin and Timothy Mann and Yuan Yu}
}
@conference {502054,
title = {Wide-area cooperative storage with CFS},
- booktitle = {SOSP {\textquoteright}01: Proceedings of the eighteenth ACM symposium on Operating systems principles},
+ booktitle = {SOSP '01: Proceedings of the eighteenth ACM symposium on Operating systems principles},
year = {2001},
pages = {202--215},
publisher = {ACM},
@@ -14748,7 +14794,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
isbn = {1-58113-389-8},
doi = {10.1145/502034.502054},
url = {http://portal.acm.org/citation.cfm?id=502054$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cfs_sosp.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cfs_sosp.pdf},
author = {Dabek, Frank and Frans M. Kaashoek and David Karger and Robert Morris and Ion Stoica}
}
@conference {Heimbigner00adaptingpublish/subscribe,
@@ -14756,9 +14802,9 @@ This book focuses on the principal-agent model, the "simple" situation where a p
booktitle = {In Proc. of SAC},
year = {2000},
pages = {176--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},
+ 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'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CU-CS-909-00.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CU-CS-909-00.pdf},
author = {Dennis Heimbigner}
}
@booklet {terminology,
@@ -14767,7 +14813,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/terminology.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/terminology.pdf},
author = {Andreas Pfitzmann and Marit Hansen}
}
@conference {DBLP:conf/diau/PfitzmannK00,
@@ -14784,11 +14830,11 @@ This book focuses on the principal-agent model, the "simple" situation where a p
year = {2000},
publisher = {Springer-Verlag, LNCS 1976},
organization = {Springer-Verlag, LNCS 1976},
- 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},
+ 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's flash MIX of PODC'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.20.6972.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.20.6972.pdf},
author = {Masashi Mitomo and Kaoru Kurosawa}
}
@conference {rao-pseudonymity,
@@ -14802,12 +14848,12 @@ This book focuses on the principal-agent model, the "simple" situation where a p
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},
www_section = {anonymity, pseudonym},
url = {http://portal.acm.org/citation.cfm?id=1251313},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/rao.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/rao.pdf},
author = {Josyula R. Rao and Pankaj Rohatgi}
}
@conference {339337,
title = {A case for end system multicast (keynote address)},
- booktitle = {SIGMETRICS {\textquoteright}00: Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems},
+ booktitle = {SIGMETRICS '00: Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems},
year = {2000},
month = jun,
pages = {1--12},
@@ -14819,7 +14865,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
isbn = {1-58113-194-1},
doi = {10.1145/339331.339337},
url = {http://portal.acm.org/citation.cfm?id=339337$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/jsac-2001.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/jsac-2001.pdf},
author = {Chu, Yang-hua and Rao, Sanjay G. and Zhang, Hui}
}
@conference {disad-free-routes,
@@ -14830,16 +14876,16 @@ This book focuses on the principal-agent model, the "simple" situation where a p
pages = {30--45},
publisher = {Springer-Verlag, LNCS 2009},
organization = {Springer-Verlag, LNCS 2009},
- 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},
+ 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'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},
www_section = {anonymity, attack},
isbn = {3-540-41724-9},
url = {http://portal.acm.org/citation.cfm?id=371975},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/disad-free-routes.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/disad-free-routes.pdf},
author = {Oliver Berthold and Andreas Pfitzmann and Ronny Standtke}
}
@conference {820485,
title = {Energy-Efficient Communication Protocol for Wireless Microsensor Networks},
- booktitle = {HICSS {\textquoteright}00: Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8},
+ booktitle = {HICSS '00: Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8},
year = {2000},
pages = {0--8020},
publisher = {IEEE Computer Society},
@@ -14849,12 +14895,12 @@ This book focuses on the principal-agent model, the "simple" situation where a p
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.90.8499.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.90.8499.pdf},
author = {Heinzelman, Wendi Rabiner and Chandrakasan, Anantha and Hari Balakrishnan}
}
@conference {514164,
title = {Enforcing service availability in mobile ad-hoc WANs},
- booktitle = {MobiHoc {\textquoteright}00: Proceedings of the 1st ACM international symposium on Mobile ad hoc networking \& computing},
+ booktitle = {MobiHoc '00: Proceedings of the 1st ACM international symposium on Mobile ad hoc networking \& computing},
year = {2000},
pages = {87--96},
publisher = {IEEE Press},
@@ -14864,7 +14910,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
www_section = {ad-hoc networks, cryptography},
isbn = {0-7803-6534-8},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.84.5715.pdf},
author = {Levente Butty{\'a}n and Jean-Pierre Hubaux}
}
@article {339345,
@@ -14881,7 +14927,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
issn = {0163-5999},
doi = {10.1145/345063.339345},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.65.4280_0.pdf},
author = {Bolosky, William J. and John R. Douceur and Ely, David and Marvin Theimer}
}
@conference {Pei00fisheyestate,
@@ -14892,7 +14938,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
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},
www_section = {mobile Ad-hoc networks},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/05_75_fisheye-state-routing-in_0.pdf},
author = {Guangyu Pei and Mario Gerla and Tsu-Wei Chen}
}
@conference {freehaven-berk,
@@ -14907,7 +14953,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
isbn = {978-3-540-41724-8},
doi = {10.1007/3-540-44702-4},
url = {http://www.springerlink.com/content/uh3mbw5m6u6xt24v/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/freehaven_pres.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/freehaven_pres.pdf},
author = {Roger Dingledine and Michael J. Freedman and David Molnar}
}
@booklet {freedom2-arch,
@@ -14917,7 +14963,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
publisher = {Zero Knowledge Systems, {Inc.}},
type = {White Paper},
abstract = {This white paper, targeted at the technically savvy reader, offers a detailed look at the Freedom 2.0 System architecture. It is intended to give the reader a good understanding of the components that make up this system and the relationships between them, as well as to encourage analysis of the system},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/freedom2-arch.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/freedom2-arch.pdf},
url = {https://bibliography.gnunet.org},
author = {Philippe Boucher and Adam Shostack and Ian Goldberg}
}
@@ -14930,7 +14976,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/freenet.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/freenet.pdf},
author = {Ian Clarke and Sandberg, Oskar and Brandon Wiley and Theodore W. Hong}
}
@conference {freenet,
@@ -14942,7 +14988,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
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},
www_section = {anonymity, Freenet, P2P},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.10.4919_0.pdf},
author = {Ian Clarke and Sandberg, Oskar and Brandon Wiley and Theodore W. Hong}
}
@conference {Clarke00freenet:a,
@@ -14953,7 +14999,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
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},
www_section = {Freenet, P2P},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.10.4919.pdf},
author = {Ian Clarke and Sandberg, Oskar and Brandon Wiley and Theodore W. Hong}
}
@conference {desmedt,
@@ -14962,13 +15008,13 @@ This book focuses on the principal-agent model, the "simple" situation where a p
year = {2000},
publisher = {Springer-Verlag, LNCS 1803},
organization = {Springer-Verlag, LNCS 1803},
- abstract = {A MIX 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 first shows that the Jakobsson{\textquoteright}s MIX net of Eurocrypt{\textquoteright}98, which was believed to be resilient and very efficient, is broken. We next propose an efficient t-resilient MIX net with O(t 2) servers in which the cost of each MIX server is O(N). Two new concepts are introduced, existential-honesty and limited-open-verification. They will be useful for distributed computation in general.
+ abstract = {A MIX 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 first shows that the Jakobsson's MIX net of Eurocrypt'98, which was believed to be resilient and very efficient, is broken. We next propose an efficient t-resilient MIX net with O(t 2) servers in which the cost of each MIX server is O(N). Two new concepts are introduced, existential-honesty and limited-open-verification. They will be useful for distributed computation in general.
A part of this research was done while the author visited the Tokyo Institute of Technology, March 4--19, 1999. He was then at the University of Wisconsin {\textemdash} Milwaukee},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.29.1814.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.29.1814.pdf},
author = {Yvo Desmedt and Kaoru Kurosawa}
}
@conference {hybrid-mix,
@@ -14982,7 +15028,7 @@ A part of this research was done while the author visited the Tokyo Institute of
isbn = {3-540-41404-5},
doi = {10.1007/3-540-44448-3_14},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.87.7718.pdf},
author = {Miyako Ohkubo and Masayuki Abe}
}
@conference {379239,
@@ -14997,7 +15043,7 @@ A part of this research was done while the author visited the Tokyo Institute of
isbn = {1-58113-317-0},
doi = {10.1145/378993.379239},
url = {http://doi.acm.org/10.1145/378993.379239},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p190-kubi.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {onion-discex00,
@@ -15008,31 +15054,31 @@ A part of this research was done while the author visited the Tokyo Institute of
pages = {34--40},
publisher = {IEEE CS Press},
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},
+ 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'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},
www_section = {anonymity, privacy, traffic analysis},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/onion-discex00.pdf},
author = {Paul Syverson and Michael Reed and David Goldschlag}
}
@conference {Jannotti:2000:ORM:1251229.1251243,
title = {Overcast: reliable multicasting with on overlay network},
- booktitle = {OSDI{\textquoteright}00. Proceedings of the 4th conference on Symposium on Operating System Design \& Implementation},
- series = {OSDI{\textquoteright}00},
+ booktitle = {OSDI'00. Proceedings of the 4th conference on Symposium on Operating System Design \& Implementation},
+ series = {OSDI'00},
year = {2000},
month = oct,
pages = {14--14},
publisher = {USENIX Association},
organization = {USENIX Association},
address = {San Diego, California, USA},
- abstract = {Overcast is an application-level multicasting system that can be incrementally deployed using today{\textquoteright}s Internet infrastructure. These properties stem from Overcast{\textquoteright}s implementation as an overlay network. An overlay network consists of a collection of nodes placed at strategic locations in an existing network fabric. These nodes implement a network abstraction on top of the network provided by the underlying substrate network.
+ abstract = {Overcast is an application-level multicasting system that can be incrementally deployed using today's Internet infrastructure. These properties stem from Overcast's implementation as an overlay network. An overlay network consists of a collection of nodes placed at strategic locations in an existing network fabric. These nodes implement a network abstraction on top of the network provided by the underlying substrate network.
Overcast provides scalable and reliable single-source multicast using a simple protocol for building efficient data distribution trees that adapt to changing network conditions. To support fast joins, Overcast implements a new protocol for efficiently tracking the global status of a changing distribution tree.
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},
www_section = {overcast, overlay network},
url = {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.}
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/OSDI\%2700\%20-\%20Overcast.pdf},
+ author = {Jannotti, John and Gifford, David K. and Johnson, Kirk L. and Frans M. Kaashoek and O'Toole Jr., James W.}
}
@conference {Song00practicaltechniques,
title = {Practical Techniques for Searches on Encrypted Data},
@@ -15042,7 +15088,7 @@ Results based on simulations confirm that Overcast provides its added functional
address = { Berkeley, CA, USA},
abstract = {It is desirable to store data on data storage servers such as mail servers and file servers in encrypted form to reduce security and privacy risks. But this usually implies that one has to sacrifice functionality for security. For example, if a client wishes to retrieve only documents containing certain words, it was not previously known how to let the data storage server perform the search and answer the query without loss of data confidentiality},
isbn = {0-7695-0665-8},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/encrypteddata.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/encrypteddata.pdf},
url = {https://bibliography.gnunet.org},
author = {Dawn Xiaodong Song and David Wagner and Adrian Perrig}
}
@@ -15056,7 +15102,7 @@ Results based on simulations confirm that Overcast provides its added functional
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},
www_section = {Hordes, multicast},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/hordes-final-all.dvi_.pdf},
author = {Clay Shields and Brian Neil Levine}
}
@mastersthesis {ian-thesis,
@@ -15065,11 +15111,11 @@ Results based on simulations confirm that Overcast provides its added functional
month = {December},
school = {UC Berkeley},
type = {phd},
- 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},
+ 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'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},
www_section = {pseudonym},
isbn = {0-493-10500-X},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.5.3353.pdf},
author = {Ian Goldberg}
}
@conference {publius,
@@ -15080,7 +15126,7 @@ Results based on simulations confirm that Overcast provides its added functional
pages = {59--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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/publius.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/publius.pdf},
author = {Marc Waldman and Aviel D. Rubin and Lorrie Cranor}
}
@article {Resnick:2000:RS:355112.355122,
@@ -15096,16 +15142,16 @@ Results based on simulations confirm that Overcast provides its added functional
issn = {0001-0782},
doi = {http://doi.acm.org/10.1145/355112.355122},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Communications\%20of\%20the\%20ACM\%20-\%20Reputation\%20Systems.pdf},
author = {Paul Resnick and Kuwabara, Ko and Zeckhauser, Richard and Eric Friedman}
}
@booklet {896561,
title = {On the Scaling of Feedback Algorithms for Very Large Multicast Groups},
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},
+ 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'' 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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Fuhrmann2001a.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Fuhrmann2001a.pdf},
author = {Thomas Fuhrmann}
}
@conference {Minsky00setreconciliation,
@@ -15114,7 +15160,7 @@ Results based on simulations confirm that Overcast provides its added functional
year = {2000},
pages = {0--232},
www_section = {set reconciliation},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/reconcile.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/reconcile.pdf},
url = {https://bibliography.gnunet.org},
author = {Yaron Minsky and Ari Trachtenberg and Richard Zippel}
}
@@ -15126,23 +15172,23 @@ Results based on simulations confirm that Overcast provides its added functional
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},
www_section = {802.11, file-sharing},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/globecom00.pdf},
author = {Maria Papadopouli and Henning G. Schulzrinne}
}
@conference {335325,
title = {The small-world phenomenon: an algorithm perspective},
- booktitle = {STOC {\textquoteright}00: Proceedings of the thirty-second annual ACM symposium on Theory of computing},
+ booktitle = {STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing},
year = {2000},
pages = {163--170},
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
- abstract = {Long a matter of folklore, the {\textquotedblleft}small-world phenomenon {\textquotedblright} {\textemdash} the principle that we are all linked by short chains of acquaintances {\textemdash} was inaugurated as an area of experimental study in the social sciences through the pioneering work of Stanley Milgram in the 1960{\textquoteright}s. This work was among the first to make the phenomenon quantitative, allowing people to speak of the {\textquotedblleft}six degrees of separation {\textquotedblright} between any two people in the United States. Since then, a number of network models have been proposed as frameworks in which to study the problem analytically. One of the most refined of these models was formulated in recent work of Watts and Strogatz; their framework provided compelling evidence that the small-world phenomenon is pervasive in a range of networks arising in nature and technology, and a fundamental ingredient in the evolution of the World Wide Web. But existing models are insufficient to explain the striking algorithmic component of Milgram{\textquoteright}s original findings: that individuals using local information are collectively very effective at actually constructing short paths between two points in a social network. Although recently proposed network models are rich in short paths, we prove that no decentralized algorithm, operating with local information only, can construct short paths in these networks with non-negligible probability. We then define an infinite family of network models that naturally generalizes the Watts-Strogatz model, and show that for one of these models, there is a decentralized algorithm capable of finding short paths with high probability. More generally, we provide a strong characterization of this family of network models, showing that there is in fact a unique model within the family for which decentralized algorithms are effective},
+ abstract = {Long a matter of folklore, the {\textquotedblleft}small-world phenomenon {\textquotedblright} {\textemdash} the principle that we are all linked by short chains of acquaintances {\textemdash} was inaugurated as an area of experimental study in the social sciences through the pioneering work of Stanley Milgram in the 1960's. This work was among the first to make the phenomenon quantitative, allowing people to speak of the {\textquotedblleft}six degrees of separation {\textquotedblright} between any two people in the United States. Since then, a number of network models have been proposed as frameworks in which to study the problem analytically. One of the most refined of these models was formulated in recent work of Watts and Strogatz; their framework provided compelling evidence that the small-world phenomenon is pervasive in a range of networks arising in nature and technology, and a fundamental ingredient in the evolution of the World Wide Web. But existing models are insufficient to explain the striking algorithmic component of Milgram's original findings: that individuals using local information are collectively very effective at actually constructing short paths between two points in a social network. Although recently proposed network models are rich in short paths, we prove that no decentralized algorithm, operating with local information only, can construct short paths in these networks with non-negligible probability. We then define an infinite family of network models that naturally generalizes the Watts-Strogatz model, and show that for one of these models, there is a decentralized algorithm capable of finding short paths with high probability. More generally, we provide a strong characterization of this family of network models, showing that there is in fact a unique model within the family for which decentralized algorithms are effective},
www_section = {small-world},
isbn = {1-58113-184-4},
doi = {10.1145/335305.335325},
url = {http://portal.acm.org/citation.cfm?id=335325$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/swn.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/swn.pdf},
author = {Kleinberg, Jon}
}
@conference {onion-routing:pet2000,
@@ -15158,7 +15204,7 @@ Results based on simulations confirm that Overcast provides its added functional
isbn = {978-3-540-41724-8},
doi = {10.1007/3-540-44702-4},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.34.5547.pdf},
author = {Paul Syverson and Gene Tsudik and Michael Reed and Carl Landwehr}
}
@conference {raymond00,
@@ -15174,7 +15220,7 @@ Results based on simulations confirm that Overcast provides its added functional
isbn = {3-540-41724-9},
doi = {10.1007/3-540-44702-4},
url = {http://portal.acm.org/citation.cfm?id=371972},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/raymond00.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/raymond00.pdf},
author = {Jean-Fran{\c c}ois Raymond}
}
@booklet {Rivest00trusteconomies,
@@ -15182,7 +15228,7 @@ Results based on simulations confirm that Overcast provides its added functional
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.27.1639\%20\%282\%29.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.27.1639\%20\%282\%29.pdf},
author = {Ron Rivest and Arthur C. Smith and Brian T. Sniffen}
}
@book {2000,
@@ -15210,7 +15256,7 @@ Results based on simulations confirm that Overcast provides its added functional
isbn = {978-3-540-41724-8},
doi = {10.1007/3-540-44702-4},
url = {http://portal.acm.org/citation.cfm?id=371983},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/web-mix-pet2000.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/web-mix-pet2000.pdf},
author = {Oliver Berthold and Hannes Federrath and Stefan K{\"o}psell}
}
@article {335405,
@@ -15227,7 +15273,7 @@ Results based on simulations confirm that Overcast provides its added functional
issn = {0163-5808},
doi = {10.1145/335191.335405},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.33.2632.pdf},
author = {Liefke, Hartmut and Suciu, Dan}
}
@article {xor-trees,
@@ -15245,44 +15291,44 @@ Results based on simulations confirm that Overcast provides its added functional
issn = {1094-9224},
doi = {10.1145/354876.354877},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.73.6464.pdf},
author = {Shlomi Dolev and Rafail Ostrovsky}
}
@conference {Nisan:1999:AMD:301250.301287,
title = {Algorithmic Mechanism Design},
- booktitle = {STOC{\textquoteright}99. Proceedings of the thirty-first Annual ACM Symposium On Theory of Computing},
- series = {STOC {\textquoteright}99},
+ booktitle = {STOC'99. Proceedings of the thirty-first Annual ACM Symposium On Theory of Computing},
+ series = {STOC '99},
year = {1999},
month = may,
pages = {129--140},
publisher = {ACM},
organization = {ACM},
address = {Atlanta, Georgia, USA},
- abstract = {We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own self-interest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agents {\textquoteright} interests are best served by behaving correctly. Following notions from the field of mechanism design, we suggest a framework for studying such algorithms. Our main technical contribution concerns the study of a representative task scheduling problem for which the standard mechanism design tools do not suffice },
+ abstract = {We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own self-interest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agents ' interests are best served by behaving correctly. Following notions from the field of mechanism design, we suggest a framework for studying such algorithms. Our main technical contribution concerns the study of a representative task scheduling problem for which the standard mechanism design tools do not suffice },
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/STOC\%2799\%20-\%20Nisan\%20\%26\%20Ronen\%20-\%20Algorithmic\%20mechanism\%20design.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/STOC\%2799\%20-\%20Nisan\%20\%26\%20Ronen\%20-\%20Algorithmic\%20mechanism\%20design.pdf},
author = {Nisan, Noam and Ronen, Amir}
}
@conference {Nisan:1999:ASA:1764891.1764893,
title = {Algorithms for Selfish Agents},
- booktitle = {STAC{\textquoteright}99. Symposium on Theoretical Aspects of Computer Science},
- series = {STACS{\textquoteright}99},
+ booktitle = {STAC'99. Symposium on Theoretical Aspects of Computer Science},
+ series = {STACS'99},
year = {1999},
month = mar,
pages = {1--15},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
address = {Trier, Germany},
- abstract = {This paper considers algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own self-interest. Such scenarios arise, in particular, when computers or users aim to cooperate or trade over the Internet. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agents{\textquoteright} interests are best served by behaving correctly.
+ abstract = {This paper considers algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own self-interest. Such scenarios arise, in particular, when computers or users aim to cooperate or trade over the Internet. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agents' interests are best served by behaving correctly.
-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},
+This exposition presents a model to formally study such algorithms. This model, based on the field of mechanism design, is taken from the author'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},
www_section = {algorithms, mechanism design, selfish agent},
isbn = {3-540-65691-X},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/STACS\%2799\%20-\%20Nisan\%20-\%20Algorithms\%20for\%20selfish\%20agents.pdf},
author = {Nisan, Noam}
}
@article {338955,
@@ -15294,17 +15340,17 @@ This exposition presents a model to formally study such algorithms. This model,
pages = {137--172},
publisher = {MIT Press},
address = {Cambridge, MA, USA},
- abstract = {This article presents an overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies{\textquoteright} foraging behavior, and introduces the ant colony optimization (ACO) metaheuristic. In the first part of the article the basic biological findings on real ants are reviewed and their artificial counterparts as well as the ACO metaheuristic are defined. In the second part of the article a number of applications of ACO algorithms to combinatorial optimization and routing in communications networks are described. We conclude with a discussion of related work and of some of the most important aspects of the ACO metaheuristic},
+ abstract = {This article presents an overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies' foraging behavior, and introduces the ant colony optimization (ACO) metaheuristic. In the first part of the article the basic biological findings on real ants are reviewed and their artificial counterparts as well as the ACO metaheuristic are defined. In the second part of the article a number of applications of ACO algorithms to combinatorial optimization and routing in communications networks are described. We conclude with a discussion of related work and of some of the most important aspects of the ACO metaheuristic},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ij_23-alife99.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ij_23-alife99.pdf},
author = {Dorigo, Marco and Di Caro, Gianni and Gambardella, Luca M.}
}
@conference {1039861,
title = {Burt: The Backup and Recovery Tool},
- booktitle = {LISA {\textquoteright}99: Proceedings of the 13th USENIX conference on System administration},
+ booktitle = {LISA '99: Proceedings of the 13th USENIX conference on System administration},
year = {1999},
pages = {207--218},
publisher = {USENIX Association},
@@ -15313,7 +15359,7 @@ This exposition presents a model to formally study such algorithms. This model,
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},
www_section = {backup},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.112.7612.pdf},
author = {Melski, Eric}
}
@article {319159,
@@ -15330,7 +15376,7 @@ This exposition presents a model to formally study such algorithms. This model,
issn = {0163-5980},
doi = {10.1145/319344.319159},
url = {http://portal.acm.org/citation.cfm?id=319159$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p110-santry.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_0,
@@ -15338,14 +15384,14 @@ This exposition presents a model to formally study such algorithms. This model,
volume = {PhD},
year = {1999},
school = {University of Edinburgh},
- abstract = {This report describes an algorithm which if executed by a group of interconnected nodes will provide a robust key-indexed information storage and retrieval system with no element of central control or administration. It allows information to be made available to a large group of people in a similar manner to the "World Wide Web". Improvements over this existing system include:--No central control or administration required--Anonymous information publication and retrieval--Dynamic duplication of popular information--Transfer of information location depending upon demand There is also potential for this system to be used in a modified form as an information publication system within a large organisation which may wish to utilise unused storage space which is distributed across the organisation. The system{\textquoteright}s reliability is not guaranteed, nor is its efficiency, however the intention is that the efficiency and reliability will be sufficient to make the system useful, and demonstrate that},
+ abstract = {This report describes an algorithm which if executed by a group of interconnected nodes will provide a robust key-indexed information storage and retrieval system with no element of central control or administration. It allows information to be made available to a large group of people in a similar manner to the "World Wide Web". Improvements over this existing system include:--No central control or administration required--Anonymous information publication and retrieval--Dynamic duplication of popular information--Transfer of information location depending upon demand There is also potential for this system to be used in a modified form as an information publication system within a large organisation which may wish to utilise unused storage space which is distributed across the organisation. The system's reliability is not guaranteed, nor is its efficiency, however the intention is that the efficiency and reliability will be sufficient to make the system useful, and demonstrate that},
url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.32.3665\&rep=rep1\&type=pdf},
url = {https://bibliography.gnunet.org},
author = {Ian Clarke}
}
@conference {301333,
title = {Flash mixing},
- booktitle = {PODC {\textquoteright}99: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing},
+ booktitle = {PODC '99: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing},
year = {1999},
pages = {83--89},
publisher = {ACM},
@@ -15353,7 +15399,7 @@ This exposition presents a model to formally study such algorithms. This model,
address = {New York, NY, USA},
isbn = {1-58113-099-6},
doi = {http://doi.acm.org/10.1145/301308.301333},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/flash-mix.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/flash-mix.pdf},
url = {https://bibliography.gnunet.org},
author = {Jakobsson, Markus}
}
@@ -15363,12 +15409,12 @@ This exposition presents a model to formally study such algorithms. This model,
year = {1999},
month = jan,
pages = {814--833},
- abstract = {We introduce the concept of a group principal and present a number of different classes of group principals, including threshold-group-principals. These appear to naturally useful concepts for looking at security. We provide an associated epistemic language and logic and use it to reason about anonymity protocols and anonymity services, where protection properties are formulated from the intruder{\textquoteright}s knowledge of group principals. Using our language, we give an epistemic characterization of anonymity properties. We also present a specification of a simple anonymizing system using our theory},
+ abstract = {We introduce the concept of a group principal and present a number of different classes of group principals, including threshold-group-principals. These appear to naturally useful concepts for looking at security. We provide an associated epistemic language and logic and use it to reason about anonymity protocols and anonymity services, where protection properties are formulated from the intruder's knowledge of group principals. Using our language, we give an epistemic characterization of anonymity properties. We also present a specification of a simple anonymizing system using our theory},
www_section = {anonymity service},
isbn = {3-540-66587-0},
doi = {10.1007/3-540-48119-2},
url = {http://portal.acm.org/citation.cfm?id=730472},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/1999syverson-fm99.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/1999syverson-fm99.pdf},
author = {Paul Syverson and Stuart Stubblebine}
}
@conference {758535,
@@ -15383,12 +15429,12 @@ This exposition presents a model to formally study such algorithms. This model,
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/new_sequences_of_linear_time_erasure_cod_64778.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/new_sequences_of_linear_time_erasure_cod_64778.pdf},
author = {M. Amin Shokrollahi}
}
@conference {313556,
title = {Next century challenges: scalable coordination in sensor networks},
- booktitle = {MobiCom {\textquoteright}99: Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking},
+ booktitle = {MobiCom '99: Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking},
year = {1999},
pages = {263--270},
publisher = {ACM},
@@ -15399,7 +15445,7 @@ This exposition presents a model to formally study such algorithms. This model,
isbn = {1-58113-142-9},
doi = {10.1145/313451.313556},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.88.2867.pdf},
author = {Deborah Estrin and Govindan, Ramesh and Heidemann, John and Kumar, Satish}
}
@article {Goldschlag99onionrouting,
@@ -15408,14 +15454,14 @@ This exposition presents a model to formally study such algorithms. This model,
volume = {42},
year = {1999},
pages = {39--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},
+ abstract = {this article'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'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's privacy, and cooperation between compromised onion-routers is thereby confounded},
url = { http://www.onion-router.net/Publications/CACM-1999 },
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/onionrouting.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/onionrouting.pdf},
author = {David Goldschlag and Michael Reed and Paul Syverson}
}
@conference {1268712,
title = {Operation-based update propagation in a mobile file system},
- booktitle = {ATEC {\textquoteright}99: Proceedings of the annual conference on USENIX Annual Technical Conference},
+ booktitle = {ATEC '99: Proceedings of the annual conference on USENIX Annual Technical Conference},
year = {1999},
pages = {4--4},
publisher = {USENIX Association},
@@ -15423,7 +15469,7 @@ This exposition presents a model to formally study such algorithms. This model,
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/lee.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/lee.pdf},
author = {Lee, Yui-Wah and Leung, Kwong-Sak and Satyanarayanan, Mahadev}
}
@conference {1999_1,
@@ -15436,7 +15482,7 @@ This exposition presents a model to formally study such algorithms. This model,
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PublicKeyCryptoSystems1999Paillier.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PublicKeyCryptoSystems1999Paillier.pdf},
author = {Paillier, Pascal}
}
@article {RePEc:bla:restud:v:66:y:1999:i:1:p:3-21,
@@ -15447,14 +15493,14 @@ This exposition presents a model to formally study such algorithms. This model,
year = {1999},
month = jan,
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},
+ abstract = {This article presents information on principal-agent models in which outcomes conditional on the agent's action are uncertain, and the agent's behavior therefore unobservable. For a model with bounded agent'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's first-order conditions as constraint. General conditions of Lagrangean type are given for problems in which contracts are finite-dimensional},
www_section = {contracts, Lagrangean conditions, unobservability},
url = {http://econpapers.repec.org/RePEc:bla:restud:v:66:y:1999:i:1:p:3-21},
author = {Mirrlees, James A.}
}
@conference {314722,
title = {Analysis of random processes via And-Or tree evaluation},
- booktitle = {SODA {\textquoteright}98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms},
+ booktitle = {SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms},
year = {1998},
pages = {364--373},
publisher = {Society for Industrial and Applied Mathematics},
@@ -15464,7 +15510,7 @@ This exposition presents a model to formally study such algorithms. This model,
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.63.2427.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.63.2427.pdf},
author = {Luby, Michael and Michael Mitzenmacher and M. Amin Shokrollahi}
}
@article {Reed98anonymousconnections,
@@ -15473,10 +15519,10 @@ This exposition presents a model to formally study such algorithms. This model,
volume = {16},
year = {1998},
pages = {482--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},
+ 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'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},
www_section = {anonymity, onion routing},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.65.8267.pdf},
author = {Michael Reed and Paul Syverson and David Goldschlag}
}
@article {Reiter98crowds:anonymity,
@@ -15488,7 +15534,7 @@ This exposition presents a model to formally study such algorithms. This model,
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},
www_section = {anonymous web browsing, Crowds},
url = {http://avirubin.com/crowds.pdf},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/crowds.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/crowds.pdf},
author = {Michael K. Reiter and Aviel D. Rubin}
}
@conference {nym-alias-net,
@@ -15502,12 +15548,12 @@ This exposition presents a model to formally study such algorithms. This model,
isbn = {1-58113-007-4},
doi = {10.1145/288090.288098},
url = {http://portal.acm.org/citation.cfm?id=288098},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/nym-alias-net.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/nym-alias-net.pdf},
author = {David Mazi{\`e}res and Frans M. Kaashoek}
}
@conference {285258,
title = {A digital fountain approach to reliable distribution of bulk data},
- booktitle = {SIGCOMM{\textquoteright}98: Proceedings of SIGCOMM{\textquoteright}98 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication},
+ booktitle = {SIGCOMM'98: Proceedings of SIGCOMM'98 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication},
year = {1998},
month = sep,
pages = {56--67},
@@ -15519,7 +15565,7 @@ This exposition presents a model to formally study such algorithms. This model,
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.72.3011.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.72.3011.pdf},
author = {Byers, John W. and Luby, Michael and Michael Mitzenmacher and Rege, Ashutosh}
}
@article {Xu98lowdensity,
@@ -15531,7 +15577,7 @@ This exposition presents a model to formally study such algorithms. This model,
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},
www_section = {array codes, low density, MDS Codes, update complexity},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.42.8899.pdf},
author = {Lihao Xu and Vasken Bohossian and Jehoshua Bruck and David Wagner}
}
@article {581193,
@@ -15546,7 +15592,7 @@ This exposition presents a model to formally study such algorithms. This model,
issn = {0163-5999},
doi = {10.1145/288197.581193},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.83.6433.pdf},
author = {Marco Ajmone Marsan and Gianfranco Balbo and Gianni Conte and Susanna Donatelli and Giuliana Franceschinis}
}
@booklet {pipenet10,
@@ -15554,7 +15600,7 @@ This exposition presents a model to formally study such algorithms. This model,
year = {1998},
month = jan,
url = {http://weidai.com/pipenet.txt},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/http___freehaven.net_anonbib_cache_pipenet10.html_.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/http___freehaven.net_anonbib_cache_pipenet10.html_.pdf},
author = {Dai, Wei}
}
@booklet {citeulike:2549551,
@@ -15565,7 +15611,7 @@ This exposition presents a model to formally study such algorithms. This model,
}
@conference {tau-indy,
title = {A Random Server Model for Private Information Retrieval or How to Achieve Information Theoretic PIR Avoiding Database Replication},
- booktitle = {Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM {\textquoteright}98)},
+ booktitle = {Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM '98)},
year = {1998},
pages = {200--217},
publisher = {Springer-Verlag},
@@ -15575,7 +15621,7 @@ This exposition presents a model to formally study such algorithms. This model,
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.18.6742.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.18.6742.pdf},
author = {Yael Gertner and Shafi Goldwasser and Tal Malkin}
}
@article {realtime-mix,
@@ -15614,7 +15660,7 @@ This exposition presents a model to formally study such algorithms. This model,
isbn = {978-3-540-65386-8},
doi = {10.1007/3-540-49380-8_7},
url = {http://www.springerlink.com/content/hmfv2mgy1xqbn852/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/stop-and-go.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/stop-and-go.pdf},
author = {Dogan Kesdogan and Jan Egner and Roland B{\"u}schkes}
}
@conference {abe,
@@ -15632,7 +15678,7 @@ This exposition presents a model to formally study such algorithms. This model,
}
@conference {CPIR,
title = {Computationally private information retrieval (extended abstract)},
- booktitle = {Proceedings of the twenty-ninth annual ACM symposium on Theory of Computing (STOC {\textquoteright}97)},
+ booktitle = {Proceedings of the twenty-ninth annual ACM symposium on Theory of Computing (STOC '97)},
year = {1997},
pages = {304--313},
publisher = {ACM Press},
@@ -15643,7 +15689,7 @@ This exposition presents a model to formally study such algorithms. This model,
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/chor97computationally.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/chor97computationally.pdf},
author = {Benny Chor and Niv Gilboa}
}
@book {Ogata97faulttolerant,
@@ -15657,14 +15703,14 @@ This exposition presents a model to formally study such algorithms. This model,
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fault.dvi_.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/fault.dvi_.pdf},
www_section = unsorted,
author = {Wakaha Ogata and Kaoru Kurosawa and Kazue Sako and Kazunori Takatani}
}
@conference {Luby:1997:PLC:258533.258573,
title = {Practical Loss-Resilient Codes},
booktitle = {STOC 1997--Proceedings of the 29th annual ACM symposium on Theory of computing},
- series = {STOC {\textquoteright}97},
+ series = {STOC '97},
year = {1997},
month = may,
pages = {150--159},
@@ -15676,12 +15722,12 @@ This exposition presents a model to formally study such algorithms. This model,
isbn = {0-89791-888-6},
doi = {http://doi.acm.org/10.1145/258533.258573},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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_0,
title = {Privacy-enhancing Technologies for the Internet},
- booktitle = {Compcon {\textquoteright}97. Proceedings, IEEE},
+ booktitle = {Compcon '97. Proceedings, IEEE},
year = {1997},
month = feb,
publisher = {IEEE Computer Society},
@@ -15691,7 +15737,7 @@ This exposition presents a model to formally study such algorithms. This model,
www_section = {Internet, privacy, privacy-enhancing technology},
isbn = {0818678046},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Compcon\%20\%2797\%20-\%20Privacy-enhancing\%20Technologies\%20for\%20the\%20Internet.pdf},
author = {Ian Goldberg and David Wagner and Eric Brewer}
}
@article {1997_1,
@@ -15706,7 +15752,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
issn = {1063-6692},
doi = {10.1109/90.650139},
url = {http://dx.doi.org/10.1109/90.650139},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Reliable_MultiCast1997Flyod.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Reliable_MultiCast1997Flyod.pdf},
author = {Floyd, Sally and Jacobson, Van and Liu, Ching-Gung and McCanne, Steven and Zhang, Lixia}
}
@article {rewebber,
@@ -15720,12 +15766,12 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
www_section = {anonymous publishing},
doi = {10.1.1.41.4031},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.41.4031.pdf},
author = {Ian Goldberg and David Wagner}
}
@conference {716407,
title = {An Empirical Study of Delta Algorithms},
- booktitle = {ICSE {\textquoteright}96: Proceedings of the SCM-6 Workshop on System Configuration Management},
+ booktitle = {ICSE '96: Proceedings of the SCM-6 Workshop on System Configuration Management},
year = {1996},
pages = {49--66},
publisher = {Springer-Verlag},
@@ -15740,7 +15786,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
}
@conference {1267576,
title = {Establishing identity without certification authorities},
- booktitle = {SSYM{\textquoteright}96: Proceedings of the 6th conference on USENIX Security Symposium, Focusing on Applications of Cryptography},
+ booktitle = {SSYM'96: Proceedings of the 6th conference on USENIX Security Symposium, Focusing on Applications of Cryptography},
year = {1996},
pages = {7--7},
publisher = {USENIX Association},
@@ -15749,19 +15795,19 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
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},
www_section = {certificate revocation, public key cryptography},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.31.7263.pdf},
author = {Ellison, Carl M.}
}
@conference {Anderson96theeternity,
title = {The Eternity Service},
- booktitle = {Pragocrypt{\textquoteright}96--Proceedings of the 1st International Conference on the Theory and Applications of Crytology},
+ booktitle = {Pragocrypt'96--Proceedings of the 1st International Conference on the Theory and Applications of Crytology},
year = {1996},
month = sep,
pages = {242--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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/eternity.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/eternity.pdf},
www_section = unsorted,
author = {Ross Anderson}
}
@@ -15773,18 +15819,18 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
pages = {137--150},
publisher = {Springer-Verlag, LNCS 1174},
organization = {Springer-Verlag, LNCS 1174},
- abstract = {Abstract. This paper describes an architecture, Onion Routing, that limits a network's vulnerability to trac analysis. The architecture provides anonymous socket connections by means of proxy servers. It provides real-time, bi-directional, nonymous communication for any protocol that can be adapted to use a proxy service. Speci cally, the architecture provides for bi-directional communication even though no-one but the initiator{\textquoteright}s proxy server knows anything but previous and next hops 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},
+ abstract = {Abstract. This paper describes an architecture, Onion Routing, that limits a network's vulnerability to trac analysis. The architecture provides anonymous socket connections by means of proxy servers. It provides real-time, bi-directional, nonymous communication for any protocol that can be adapted to use a proxy service. Speci cally, the architecture provides for bi-directional communication even though no-one but the initiator's proxy server knows anything but previous and next hops 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},
www_section = {communication chain, onion routing, traffic analysis},
isbn = {3-540-61996-8},
url = {http://portal.acm.org/citation.cfm?id=731526},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IH-1996.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IH-1996.pdf},
author = {David Goldschlag and Michael Reed and Paul Syverson},
editor = {Ross Anderson}
}
@conference {Fargier:1996:MCS:1892875.1892901,
title = {Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge},
- booktitle = {AAAI{\textquoteright}96--Proceedings of the 13th National Conference on Artificial Intelligence},
- series = {AAAI{\textquoteright}96},
+ booktitle = {AAAI'96--Proceedings of the 13th National Conference on Artificial Intelligence},
+ series = {AAAI'96},
year = {1996},
month = aug,
pages = {175--180},
@@ -15795,7 +15841,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/AAAI\%2796\%20-\%20Mixed\%20constraint\%20satisfaction.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {Gulcu96mixingemail,
@@ -15805,7 +15851,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
pages = {2--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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/babel.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/babel.pdf},
www_section = unsorted,
author = {Ceki Gulcu and Gene Tsudik}
}
@@ -15818,7 +15864,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Prospects\%20for\%20Remailers.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Prospects\%20for\%20Remailers.pdf},
www_section = unsorted,
author = {Sameer Parekh}
}
@@ -15827,14 +15873,14 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
year = {1996},
abstract = {An important issue to be addressed for the next generation of wirelessly-connected hand-held devices is battery longevity. In this paper we examine this issue from the point of view of the Network Interface (NI). In particular, we measure the power usage of two PDAs, the Apple Newton Messagepad and Sony Magic Link, and four NIs, the Metricom Ricochet Wireless Modem, the AT\&T Wavelan operating at 915 MHz and 2.4 GHz, and the IBM Infrared Wireless LAN Adapter. These measurements clearly indicate that the power drained by the network interface constitutes a large fraction of the total power used by the PDA. We also conduct trace-driven simulation experiments and show that by using applicationspecific policies it is possible to },
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8384},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.39.8384.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.39.8384.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Mark Stemm and Paul Gauthier and Daishi Harada and Katz, Randy H.}
}
@conference {672869,
title = {Balanced Distributed Search Trees Do Not Exist},
- booktitle = {WADS {\textquoteright}95: Proceedings of the 4th International Workshop on Algorithms and Data Structures},
+ booktitle = {WADS '95: Proceedings of the 4th International Workshop on Algorithms and Data Structures},
year = {1995},
pages = {50--61},
publisher = {Springer-Verlag},
@@ -15843,7 +15889,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.34.4081.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.34.4081.pdf},
www_section = unsorted,
author = {Kr{\"o}ll, Brigitte and Widmayer, Peter}
}
@@ -15859,7 +15905,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
issn = {0163-5980},
doi = {10.1145/224057.224068},
url = {http://portal.acm.org/citation.cfm?id=224068$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/s15.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/s15.pdf},
www_section = unsorted,
author = {Lily B. Mummert and Maria Ebling and Satyanarayanan, Mahadev}
}
@@ -15870,7 +15916,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
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 },
www_section = {sensor networks, wireless sensor network},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@conference {cooper,
@@ -15880,9 +15926,9 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
month = may,
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},
+ 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's location if the protocols for sending and retrieving messages are carefully designed. We have developed a replicated memory service which allows users to read from memory without revealing which memory locations they are reading. Unlike previous protocols, our protocol is efficient in its use of computation and bandwidth. We show how this protocol can be used in conjunction with existing privacy preserving protocols to allow a user of a mobile computer to maintain privacy despite active attacks},
url = {http://portal.acm.org/citation.cfm?id=882491.884247},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cooper.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/cooper.pdf},
www_section = unsorted,
author = {David A. Cooper and Kenneth P. Birman}
}
@@ -15893,10 +15939,10 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
pages = {41--50},
publisher = {ACM New York, NY, USA},
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)},
+ 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's queries and infer what the user is after. Indeed, in cases where the users' 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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pir.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/pir.pdf},
www_section = unsorted,
author = {Benny Chor and Oded Goldreich and Eyal Kushilevitz and Madhu Sudan}
}
@@ -15910,7 +15956,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
isbn = {978-3-540-59409-3},
doi = {10.1007/3-540-49264-X},
url = {http://www.springerlink.com/content/jhf7ccxn2fj2gfum/},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/SK.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SK.pdf},
www_section = unsorted,
author = {Joe Kilian and Kazue Sako}
}
@@ -15921,13 +15967,13 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
www_section = {reliability, reputation},
doi = {10.1109/WMCSA.1994.37},
url = {http://portal.acm.org/citation.cfm?id=1440028},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.40.8955.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.40.8955.pdf},
www_section = unsorted,
author = {Alan Demers and Karin Petersen and Mike Spreitzer and Douglas Terry and Marvin Theimer and Brent Welch}
}
@conference {1267093,
title = {File system design for an NFS file server appliance},
- booktitle = {WTEC{\textquoteright}94: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference},
+ booktitle = {WTEC'94: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference},
year = {1994},
pages = {19--19},
publisher = {USENIX Association},
@@ -15937,7 +15983,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
This paper describes WAFL (Write Anywhere File Layout), which is a file system designed specifically to work in an NFS appliance. The primary focus is on the algorithms and data structures that WAFL uses to implement Snapshotst, which are read-only clones of the active file system. WAFL uses a copy-on-write technique to minimize the disk space that Snapshots consume. This paper also describes how WAFL uses Snapshots to eliminate the need for file system consistency checking after an unclean shutdown},
url = {http://portal.acm.org/citation.cfm?id=1267093$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.40.3691.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.40.3691.pdf},
www_section = unsorted,
author = {Hitz, Dave and Lau, James and Malcolm, Michael}
}
@@ -15948,7 +15994,7 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
pages = {1--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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.12.3222.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.12.3222.pdf},
www_section = unsorted,
author = {Udi Manber}
}
@@ -15960,7 +16006,7 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
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},
www_section = {checkpointing, performance analysis},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.55.257.pdf},
author = {James S. Plank and Beck, Micah and Kingsley, Gerry and Li, Kai}
}
@article {1993_0,
@@ -15970,10 +16016,10 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
year = {1993},
month = feb,
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},
+ 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' motivation, intelligence, or learning. Adam Smith'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},
www_section = {allocative efficiency, double auction, market, zero-intelligence trader},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/JPE\%20\%281993\%29\%20-\%20Gode\%20\%26\%20Sunder\%20-\%20Allocative\%20Efficiency.pdf},
author = {Dhananjay K. Gode and Shyam Sunder}
}
@conference {rackoff93cryptographic,
@@ -15987,7 +16033,7 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/rackoff93cryptographic.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/rackoff93cryptographic.pdf},
www_section = unsorted,
author = {Charles Rackoff and Daniel R. Simon}
}
@@ -15999,10 +16045,10 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
publisher = {Springer-Verlag, LNCS 765},
organization = {Springer-Verlag, LNCS 765},
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},
+ 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'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mix.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/mix.pdf},
www_section = unsorted,
author = {Choonsik Park and Kazutomo Itoh and Kaoru Kurosawa}
}
@@ -16027,7 +16073,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.53.7112.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.53.7112.pdf},
www_section = unsorted,
author = {Jochen Liedtke}
}
@@ -16040,7 +16086,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
number = {},
pages = {668--673},
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},
- www_section = {software reliability;system behaviour;SURF-2;dependability evaluation;complex hardware and software systems;software tool;system dependability;evaluation-based system design approach;multiple design solutions;Markov chains;generalized stochastic Petri nets;measures of dependability;pointwise measures;asymptotic measures;mean sojourn times;reward structure;reward measures;performance;Hardware;Software systems;Stochastic systems;Petri nets;Software tools;Process design;Stochastic processes;Humans;Costs;Performance evaluation},
+ www_section = {software reliability, system behaviour, SURF-2, dependability evaluation, complex hardware and software systems, software tool, system dependability, evaluation-based system design approach, multiple design solutions, Markov chains, generalized stochastic Petri nets, measures of dependability, pointwise measures, asymptotic measures, mean sojourn times, reward structure, reward measures, performance, Hardware, Software systems, Stochastic systems, Petri nets, Software tools, Process design, Stochastic processes, Humans, Costs, Performance evaluation},
doi = {10.1109/FTCS.1993.627372},
ISSN = {0731-3071},
isbn = {0-8186-3680-7},
@@ -16048,7 +16094,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
month={June},}
@conference {DBLP:conf/eurocrypt/ChaumP92,
title = {Transferred Cash Grows in Size},
- booktitle = {EUROCRYPT{\textquoteright}92 Workshop on the Theory and Application of of Cryptographic Techniques},
+ booktitle = {EUROCRYPT'92 Workshop on the Theory and Application of of Cryptographic Techniques},
series = {Lecture Notes in Computer Science},
volume = {658},
year = {1992},
@@ -16062,7 +16108,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
isbn = {3-540-56413-6},
doi = {10.1007/3-540-47555-9_32},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/EUROCRYPT\%2792_-_Chaun_\%26_Pedersen_-_Transferred_cash_grows_in_size.pdf},
author = {David Chaum and Torben P. Pedersen}
}
@article {Yokoo91distributedconstraint,
@@ -16075,7 +16121,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
abstract = {In this paper, we argue that partially adversarial and partially cooperative (PARC) problems in distributed arti cial intelligence can be mapped into a formalism called distributed constraint optimization problems (DCOPs), which generalize distributed constraint satisfaction problems [Yokoo, et al. 90] by introducing weak constraints (preferences). We discuss several solution criteria for DCOP and clarify the relation between these criteria and di erent levels of agent rationality [Rosenschein and Genesereth 85], and show the algorithms for solving DCOPs in which agents incrementally exchange only necessary information to converge on a mutually satis able bsolution},
www_section = {artificial intelligence, DCOP, PARC, partially adversial cooperation},
journal = {unknown},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Tech\%20report\%20-\%20DCOP\%20as\%20a\%20formal\%20model\%20of\%20PARC.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Tech\%20report\%20-\%20DCOP\%20as\%20a\%20formal\%20model\%20of\%20PARC.pdf},
url = {https://bibliography.gnunet.org},
author = {Makoto Yokoo and Edmund H. Durfee}
}
@@ -16086,7 +16132,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
pages = {110--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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.56.9968.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.56.9968.pdf},
www_section = unsorted,
author = {Yves Deswarte and Laurent Blain and Jean-charles Fabre}
}
@@ -16098,17 +16144,17 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
pages = {451--463},
publisher = {Springer-Verlag London, UK},
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},
+ 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'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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.43.4892.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.43.4892.pdf},
www_section = unsorted,
author = {Andreas Pfitzmann and Birgit Pfitzmann and Michael Waidner}
}
@conference {Waidner:1990:DCD:111563.111630,
title = {The dining cryptographers in the disco: unconditional sender and recipient untraceability with computationally secure serviceability},
- booktitle = {EUROCRYPT{\textquoteright}89--Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology},
- series = {EUROCRYPT {\textquoteright}89},
+ booktitle = {EUROCRYPT'89--Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology},
+ series = {EUROCRYPT '89},
year = {1990},
month = apr,
pages = {0--690},
@@ -16124,7 +16170,7 @@ We also sketch applications of these signatures to a payment system, solving dis
www_section = {anonymity, arbitrary network, cryptology, DC-net},
isbn = {3-540-53433-4},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/EUROCRYPT\%2789\%20-\%20Waidner\%26Pfitzmann\%20-\%20The\%20dining\%20cryptographers\%20in\%20the\%20disco\%20.pdf},
author = {Michael Waidner and Birgit Pfitzmann}
}
@article {78977,
@@ -16141,7 +16187,7 @@ We also sketch applications of these signatures to a payment system, solving dis
issn = {0001-0782},
doi = {10.1145/78973.78977},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.85.9211.pdf},
author = {Pugh, William}
}
@conference {1988_0,
@@ -16155,7 +16201,7 @@ We also sketch applications of these signatures to a payment system, solving dis
isbn = {0-89791-264-0},
doi = {10.1145/62212.62213},
url = {http://doi.acm.org/10.1145/62212.62213},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CompletelenessTheorems1988Ben-Or.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CompletelenessTheorems1988Ben-Or.pdf},
www_section = unsorted,
author = {Ben-Or, Michael and Goldwasser, Shafi and Wigderson, Avi}
}
@@ -16169,7 +16215,7 @@ We also sketch applications of these signatures to a payment system, solving dis
www_section = {pseudonym, unconditional security, untraceability},
issn = {0933-2790},
url = {http://portal.acm.org/citation.cfm?id=54239},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/dcnet-jcrypt88.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/dcnet-jcrypt88.pdf},
author = {David Chaum}
}
@conference {1988_1,
@@ -16184,7 +16230,7 @@ We also sketch applications of these signatures to a payment system, solving dis
isbn = {0-89791-264-0},
doi = {10.1145/62212.62215},
url = {http://doi.acm.org/10.1145/62212.62215},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/oblivious_transfer.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/oblivious_transfer.pdf},
author = {Kilian, Joe}
}
@conference {1987,
@@ -16198,7 +16244,7 @@ We also sketch applications of these signatures to a payment system, solving dis
isbn = {0-89791-221-7},
doi = {10.1145/28395.28420},
url = {http://doi.acm.org/10.1145/28395.28420},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PlayMentalGame1987Goldreich.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PlayMentalGame1987Goldreich.pdf},
www_section = unsorted,
author = {Goldreich, O. and Micali, S. and Wigderson, A.}
}
@@ -16215,14 +16261,14 @@ We also sketch applications of these signatures to a payment system, solving dis
issn = {0163-5980},
doi = {10.1145/37499.37517},
url = {http://portal.acm.org/citation.cfm?id=37499.37517$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/024-DatabasesPaper.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/024-DatabasesPaper.pdf},
www_section = unsorted,
author = {Andrew D. Birrell and Michael B. Jones and Edward P. Wobber}
}
@conference {Stumm:1987:SDR:55482.55508,
title = {Strategies for decentralized resource management},
- booktitle = {SIGCOMM{\textquoteright}87. Proceedings of the ACM Workshop on Frontiers in Computer Communications Technology},
- series = {SIGCOMM {\textquoteright}87},
+ booktitle = {SIGCOMM'87. Proceedings of the ACM Workshop on Frontiers in Computer Communications Technology},
+ series = {SIGCOMM '87},
year = {1987},
month = aug,
pages = {245--253},
@@ -16234,12 +16280,12 @@ We also sketch applications of these signatures to a payment system, solving dis
isbn = {0-89791-245-4},
doi = {http://doi.acm.org/10.1145/55482.55508},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/SIGCOMM\%2787\%20-\%20Strategies\%20for\%20decentralized\%20resource\%20management.pdf},
author = {Stumm, Michael}
}
@book {1986,
title = {Networks Without User Observability {\textemdash} Design Options},
- booktitle = {Advances in Cryptology {\textemdash} EUROCRYPT{\textquoteright} 85},
+ booktitle = {Advances in Cryptology {\textemdash} EUROCRYPT' 85},
series = {Lecture Notes in Computer Science},
volume = {219},
year = {1986},
@@ -16250,7 +16296,7 @@ We also sketch applications of these signatures to a payment system, solving dis
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NetworkWithoutUserObservabiliy1985Pfitzmann.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/NetworkWithoutUserObservabiliy1985Pfitzmann.pdf},
www_section = unsorted,
author = {Pfitzmann, Andreas and Waidner, Michael},
editor = {Pichler, Franz}
@@ -16268,7 +16314,7 @@ We also sketch applications of these signatures to a payment system, solving dis
issn = {0362-1340},
doi = {10.1145/15042.15043},
url = {http://en.scientificcommons.org/42347723},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/r5rs.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/r5rs.pdf},
www_section = unsorted,
author = {Rees, Jonathan and Clinger, William and Richard Kelsey}
}
@@ -16279,7 +16325,7 @@ We also sketch applications of these signatures to a payment system, solving dis
pages = {558--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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.56.3350.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.56.3350.pdf},
www_section = unsorted,
author = {Andrew Tanenbaum and Sape J. Mullender and Robbert Van Renesse}
}
@@ -16296,7 +16342,7 @@ We also sketch applications of these signatures to a payment system, solving dis
issn = {0004-5411},
doi = {10.1145/3149.214121},
url = {http://portal.acm.org/citation.cfm?id=214121$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/pods06_paper01.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/pods06_paper01.pdf},
www_section = unsorted,
author = {Fischer, Michael J. and Lynch, Nancy A. and Paterson, Michael S.}
}
@@ -16328,7 +16374,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
www_section = {cryptosystem, discrete logarithms, public key, signature scheme},
isbn = {0-387-15658-5},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/CRYPTO\%2784\%20-\%20El\%20Gamal\%20-\%20Public\%20Key\%20Cryptosystem.pdf},
author = {El Gamal, Taher}
}
@article {4202,
@@ -16340,12 +16386,12 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
pages = {637--654},
publisher = {John Wiley & Sons, Inc},
address = {New York, NY, USA},
- abstract = {An important problem in program development and maintenance is version control, i.e., the task of keeping a software system consisting of many versions and configurations well organized. The Revision Control System (RCS) is a software tool that assists with that task. RCS manages revisions of text documents, in particular source programs, documentation, and test data. It automates the storing, retrieval, logging and identification of revisions, and it provides selection mechanisms for composing configurations. This paper introduces basic version control concepts and discusses the practice of version control using RCS. For conserving space, RCS stores deltas, i.e., differences between successive revisions. Several delta storage methods are discussed. Usage statistics show that RCS{\textquoteright}s delta storage method is space and time efficient. The paper concludes with a detailed survey of version control tools},
+ abstract = {An important problem in program development and maintenance is version control, i.e., the task of keeping a software system consisting of many versions and configurations well organized. The Revision Control System (RCS) is a software tool that assists with that task. RCS manages revisions of text documents, in particular source programs, documentation, and test data. It automates the storing, retrieval, logging and identification of revisions, and it provides selection mechanisms for composing configurations. This paper introduces basic version control concepts and discusses the practice of version control using RCS. For conserving space, RCS stores deltas, i.e., differences between successive revisions. Several delta storage methods are discussed. Usage statistics show that RCS's delta storage method is space and time efficient. The paper concludes with a detailed survey of version control tools},
www_section = {version control},
issn = {0038-0644},
doi = {10.1002/spe.4380150703},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.56.3350_0.pdf},
author = {Tichy, Walter F.}
}
@article {chaum85,
@@ -16360,7 +16406,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
issn = {0001-0782},
doi = {http://doi.acm.org/10.1145/4372.4373},
url = {http://portal.acm.org/citation.cfm?id=4373},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.48.4680.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/10.1.1.48.4680.pdf},
www_section = unsorted,
author = {David Chaum}
}
@@ -16372,7 +16418,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
address = {Newton, MA, USA},
isbn = {0932376223},
url = {http://portal.acm.org/citation.cfm?id=538134$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Preface.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Preface.pdf},
www_section = unsorted,
author = {Levy, Henry M.}
}
@@ -16388,7 +16434,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
issn = {0164-0925},
doi = {10.1145/357172.357176},
url = {http://portal.acm.org/citation.cfm?id=357176$\#$},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/byz.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/byz.pdf},
www_section = unsorted,
author = {Lamport, Leslie and Shostak, Robert and Pease, Marshall}
}
@@ -16401,7 +16447,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
address = {Washington, DC, USA},
doi = {10.1109/SFCS.1982.88},
url = {http://dx.doi.org/10.1109/SFCS.1982.88},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ProtocolSecurecomputations1982Yao.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ProtocolSecurecomputations1982Yao.pdf},
www_section = unsorted,
author = {Yao, Andrew C.}
}
@@ -16418,7 +16464,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
www_section = {digital signature, electronic mail, privacy, pseudonym, public key cryptography, traffic analysis},
issn = {0001-0782 },
doi = {http://doi.acm.org/10.1145/358549.358563},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/chaum-mix_0.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/chaum-mix_0.pdf},
url = {https://bibliography.gnunet.org},
author = {David Chaum}
}
@@ -16469,7 +16515,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
type = {S. M. \& E. E. thesis},
address = {Cambridge, MA},
abstract = {This thesis examines the issues relating to non-discretionary access controls for decentralized computing systems. Decentralization changes the basic character of a computing system from a set of processes referencing a data base to a set of processes sending and receiving messages. Because messages must be acknowledged, operations that were read-only in a centralized system become read-write operations. As a result, the lattice model of non-discretionary access control, which mediates operations based on read versus read-write considerations, does not allow direct transfer of algorithms from centralized systems to decentralized systems. This thesis develops new mechanisms that comply with the lattice model and provide the necessary functions for effective decentralized computation. Secure protocols at several different levels are presented in the thesis. At the lowest level, a host or host protocol is shown that allows communication between hosts with effective internal security controls. Above this level, a host independent naming scheme is presented that allows generic naming of services in a manner consistent with the lattice model. The use of decentralized processing to aid in the downgrading of information is shown in the design of a secure intelligent terminal. Schemes are presented to deal with the decentralized administration of the lattice model, and with the proliferation of access classes as the user community of a decentralized system become more diverse. Limitations in the use of end-to-end encryption when used with the lattice model are identified, and a scheme is presented to relax these limitations for broadcast networks. Finally, a scheme is presented for forwarding authentication information between hosts on a network, without transmitting passwords (or their equivalent) over a network},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/MIT-LCS-TR-179.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/MIT-LCS-TR-179.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Paul A. Karger}
@@ -16495,7 +16541,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
www_section = {cryptographic systems, cryptography},
issn = {0018-9448},
doi = {10.1109/TIT.1976.1055638},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IEEE\%20Trans.\%20on\%20Info.\%20-\%20New\%20directions\%20in\%20cryptography.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/IEEE\%20Trans.\%20on\%20Info.\%20-\%20New\%20directions\%20in\%20cryptography.pdf},
url = {https://bibliography.gnunet.org},
author = {Whitfield Diffie and Martin E. Hellman}
}
@@ -16509,7 +16555,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
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},
www_section = {behavior, evolution, reciprocal altruism},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Trivers\%20-\%20The\%20evolution\%20of\%20reciprocal\%20altruism.pdf},
author = {Robert L. Trivers}
}
@article {1970_0,
@@ -16521,7 +16567,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
pages = {291--307},
abstract = {We consider the problem of partitioning the nodes of a graph with costs on its edges into subsets of given sizes so as to minimize the sum of the costs on all edges cut. This problem arises in several physical situations- for example, in assigning the components of electronic circuits to circuit boards to minimize the number of connections between boards. This paper presents a heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems},
www_section = {heuristic method, partitioning graphs},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Kernighan\%20\%26\%20Lin\%20-\%20An\%20Efficient\%20Heuristic\%20Procedure\%20for\%20Partitioning\%20Graphs\%250A.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Kernighan\%20\%26\%20Lin\%20-\%20An\%20Efficient\%20Heuristic\%20Procedure\%20for\%20Partitioning\%20Graphs\%250A.pdf},
url = {https://bibliography.gnunet.org},
author = {Brian W. Kernighan and S. Lin}
}
@@ -16534,7 +16580,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/akerlof.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/akerlof.pdf},
www_section = unsorted,
author = {George A. Akerlof}
}
@@ -16555,7 +16601,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
volume = {162},
year = {1968},
pages = {1243--1248},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Science\%20-\%20Hardin\%20-\%20The\%20Tragedy\%20of\%20the\%20Commons.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Science\%20-\%20Hardin\%20-\%20The\%20Tragedy\%20of\%20the\%20Commons.pdf},
www_section = unsorted,
url = {https://bibliography.gnunet.org},
author = {Garrett Hardin}
@@ -16567,12 +16613,12 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
year = {1962},
pages = {21--28 },
chapter = {21},
- abstract = {A low-density parity-check code is a code specified by a parity-check matrix with the following properties: each column contains a small fixed numberj geq 3of l{\textquoteright}s and each row contains a small fixed numberk > jof l{\textquoteright}s. The typical minimum distance of these codes increases linearly with block length for a fixed rate and fixedj. When used with maximum likelihood decoding on a sufficiently quiet binary-input symmetric channel, the typical probability of decoding error decreases exponentially with block length for a fixed rate and fixedj. A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described. Both the equipment complexity and the data-handling capacity in bits per second of this decoder increase approximately linearly with block length. Forj > 3and a sufficiently low rate, the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length. Some experimental results show that the actual probability of decoding error is much smaller than this theoretical bound},
+ abstract = {A low-density parity-check code is a code specified by a parity-check matrix with the following properties: each column contains a small fixed numberj geq 3of l's and each row contains a small fixed numberk > jof l's. The typical minimum distance of these codes increases linearly with block length for a fixed rate and fixedj. When used with maximum likelihood decoding on a sufficiently quiet binary-input symmetric channel, the typical probability of decoding error decreases exponentially with block length for a fixed rate and fixedj. A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described. Both the equipment complexity and the data-handling capacity in bits per second of this decoder increase approximately linearly with block length. Forj > 3and a sufficiently low rate, the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length. Some experimental results show that the actual probability of decoding error is much smaller than this theoretical bound},
www_section = {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_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ldpc.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/ldpc.pdf},
author = {Robert G. Gallager}
}
@article {reed60polynomial,
@@ -16585,7 +16631,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
pages = {300--304},
www_section = {filing-erasure-coding},
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Reed\%20\%26\%20Solomon\%20-\%20Polynomial\%20Codes\%20Over\%20Certain\%20Finite\%20Fields.pdf},
author = {Irving Reed and Golomb Solomon}
}
@article {1959,
@@ -16597,7 +16643,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
pages = {290--297},
www_section = {graphs, random, random graphs},
url = {https://bibliography.gnunet.org},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Erd\%C5\%91s\%20\%26\%20R\%C3\%A9nyi\%20-\%20On\%20Random\%20Graphs.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/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}
}
@article {368907,
@@ -16626,7 +16672,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
www_section = {n-persona game, strategy},
doi = {10.1073/pnas.36.1.48},
url = {https://bibliography.gnunet.org},
- www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PNAS\%20-\%20Nash\%20-\%20Equilibrium\%20points\%20in\%20n-person\%20games.pdf},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/PNAS\%20-\%20Nash\%20-\%20Equilibrium\%20points\%20in\%20n-person\%20games.pdf},
author = {John F. Nash Jr.}
}
@book {1944,
@@ -16640,6 +16686,6 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
www_section = {economic behavior, games, theory},
isbn = {978-0-691-13061-3 },
url = {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},
+ www_pdf_url = {https://gnunet.org/git/bibliography.git/plain/docs/Neumann\%20\%26\%20Morgenstern\%20-\%20Theory\%20of\%20Games\%20and\%20Economic\%20Behavior.pdf},
author = {John von Neumann and Oskar Morgenstern}
}
