commit 53b335a217b8d7ac599d2c60283755a77292fbc2
parent 3e0f76a41300992676b0988d0ed2b7a5c3819cb9
Author: Nils Gillmann <ng0@n0.is>
Date: Thu, 4 Oct 2018 23:09:16 +0000
fix most of the month related errors.
Signed-off-by: Nils Gillmann <ng0@n0.is>
Diffstat:
| M | gnunetbib.bib | | | 689 | ++++++++++++++++++++++++++++++++++++++++--------------------------------------- |
1 file changed, 345 insertions(+), 344 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -23,6 +23,7 @@
@string{credentials = "E-Cash / Anonymous Credentials"}
@string{misc = "Misc"}
@string{torperf = "Tor Performance"}
+@string{conference = "Conference"}
#
# Proposed new sections: application privacy, data anonymization, ...
@@ -35,7 +36,7 @@
title = {Implementing Privacy Preserving Auction Protocols},
volume = {Master of Science},
year = {2017},
- month = {February},
+ month = feb,
pages = {100},
school = {TUM},
address = {Munich},
@@ -70,7 +71,7 @@
title = {Byzantine Set-Union Consensus using Efficient Set Reconciliation},
booktitle = {International Conference on Availability, Reliability and Security (ARES)},
year = {2016},
- month = {6/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},
keywords = {byzantine fault tolerance, consensus, GNUnet},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/consensus2016.pdf},
@@ -80,7 +81,7 @@
title = {Enabling Secure Web Payments with GNU Taler},
booktitle = {6th International Conference on Security, Privacy and Applied Cryptographic Engineering},
year = {2016},
- month = {12/2016},
+ month = dec,
publisher = {Springer},
organization = {Springer},
address = {Hyderabad},
@@ -93,7 +94,7 @@
title = {GNUnet und Informationsmacht: Analyse einer P2P-Technologie und ihrer sozialen Wirkung},
volume = {Diplominformatiker},
year = {2016},
- month = {04/2016},
+ month = apr,
pages = {103},
school = {Humboldt-Universitaet zu Berlin},
type = {Diplomarbeit},
@@ -107,7 +108,7 @@
title = {Managing and Presenting User Attributes over a Decentralized Secure Name System},
booktitle = {Data Privacy Management and Security Assurance - 11th International Workshop, {DPM} 2016 and 5th International Workshop, {QASA} 2016, Heraklion, Crete, Greece, September 26-27, 2016, Proceedings},
year = {2016},
- month = {09/2016},
+ month = sep,
publisher = {Springer},
organization = {Springer},
address = {Crete, Greece},
@@ -119,7 +120,7 @@
title = {Privacy-Preserving Abuse Detection in Future Decentralised Online Social Networks},
booktitle = {Data Privacy Management (DPM)},
year = {2016},
- month = {09/2016},
+ month = sep,
publisher = {Springer},
organization = {Springer},
address = {Heraklion, Greece},
@@ -141,7 +142,7 @@
title = {Byzantine Fault Tolerant Set Consensus with Efficient Set Reconciliation},
volume = {M.S},
year = {2015},
- month = {12/2015},
+ month = dec,
pages = {69},
school = {Technische Universitaet Muenchen},
type = {Master{\textquoteright}s},
@@ -154,7 +155,7 @@
@article {mcb-es2015,
title = {El programa MORECOWBELL de la NSA: Doblan las campanas para el DNS},
year = {2015},
- month = {01/2015},
+ month = jan,
institution = {GNUnet e.V},
address = {Muenchen},
keywords = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
@@ -164,7 +165,7 @@
@article {mcb-it2015,
title = {Il programma MORECOWBELL della NSA: Campane a morto per il DNS},
year = {2015},
- month = {01/2015},
+ month = jan,
institution = {GNUnet e.V},
address = {Muenchen},
keywords = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
@@ -174,7 +175,7 @@
@article {mcb-fr2015,
title = {Le programme MORECOWBELL de la NSA Sonne le glas du NSA},
year = {2015},
- month = {01/2015},
+ month = jan,
institution = {GNUnet e.V},
address = {Muenchen},
keywords = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
@@ -184,7 +185,7 @@
@article {mcb-en2015,
title = {NSA{\textquoteright}s MORECOWBELL: Knell for DNS},
year = {2015},
- month = {01/2015},
+ month = jan,
institution = {GNUnet e.V},
address = {Muenchen},
keywords = {DNS, DNSSEC, MORECOWBELL, NAMECOIN, TLS},
@@ -195,7 +196,7 @@
title = {A Secure and Resilient Communication Infrastructure for Decentralized Networking Applications},
volume = {PhD},
year = {2015},
- month = {02/2015},
+ month = feb,
pages = {250},
school = {Technische Universit{\"a}t M{\"u}nchen},
type = {PhD},
@@ -212,7 +213,7 @@
title = {An Approach for Home Routers to Securely Erase Sensitive Data},
volume = {Bachelor},
year = {2014},
- month = {10/2014},
+ month = oct,
pages = {64},
school = {Technische Universit{\"a}t M{\"u}nchen},
type = {Bachelor Thesis},
@@ -228,7 +229,7 @@
title = {Automatic Transport Selection and Resource Allocation for Resilient Communication in Decentralised Networks},
booktitle = {14-th IEEE International Conference on Peer-to-Peer Computing},
year = {2014},
- month = {10/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.
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.
@@ -288,7 +289,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
title = {Control Flow Analysis for Event-Driven Programs},
volume = {B.Sc},
year = {2014},
- month = {07/2014},
+ month = jul,
pages = {71},
school = {Technical University of Munich},
type = {Bachelors},
@@ -302,7 +303,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
title = {Cryogenic: Enabling Power-Aware Applications on Linux},
volume = {M. Sc},
year = {2014},
- month = {02/2014},
+ month = feb,
pages = {106},
school = {Technische Universitaet Muenchen},
type = {Masters},
@@ -319,7 +320,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
title = {Cryptographically Secure, Distributed Electronic Voting},
volume = {B.S},
year = {2014},
- month = {08/2014},
+ month = aug,
pages = {49},
school = {Technische Universitaet Muenchen},
type = {Bachelor{\textquoteright}s},
@@ -335,7 +336,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
title = {A Decentralized and Autonomous Anomaly Detection Infrastructure for Decentralized Peer-to-Peer Networks},
volume = {Master},
year = {2014},
- month = {10/2014},
+ month = oct,
pages = {63},
type = {Master},
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.
@@ -367,7 +368,7 @@ communication systems enable the reconstruction of user behavioral profiles. Pro
title = {DP5: A Private Presence Service},
journal = { Centre for Applied Cryptographic Research (CACR), University of Waterloo},
year = {2014},
- month = {May 2014},
+ month = may,
type = {Technical Report},
abstract = {The recent NSA revelations have shown that {\textquotedblleft}address book{\textquotedblright} and {\textquotedblleft}buddy list{\textquotedblright} information are routinely targeted for mass interception. As a response to this threat, we present DP5, a cryptographic
service that provides privacy-friendly indication of presence to support real-time communications. DP5 allows clients to register and query the online presence of their list of friends while keeping this
@@ -398,7 +399,7 @@ as an evaluation of its performance},
title = {Experimental comparison of Byzantine fault tolerant distributed hash tables},
volume = {M.S},
year = {2014},
- month = {09/2014},
+ month = sep,
pages = {42},
school = {Saarland University},
type = {Masters},
@@ -433,7 +434,7 @@ distributed encryption scheme that is much more efficient for small plaintext do
title = {Improved Kernel-Based Port-Knocking in Linux},
volume = {M.S},
year = {2014},
- month = {08/2014},
+ month = aug,
type = {Master{\textquoteright}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.
@@ -448,7 +449,7 @@ This thesis also describes Knock, a free software implementation of TCP Stealth
title = {The Internet is Broken: Idealistic Ideas for Building a GNU Network},
booktitle = {W3C/IAB Workshop on Strengthening the Internet Against Pervasive Monitoring (STRINT)},
year = {2014},
- month = {February},
+ month = feb,
publisher = {W3C/IAB},
organization = {W3C/IAB},
address = {London, UK},
@@ -460,7 +461,7 @@ This thesis also describes Knock, a free software implementation of TCP Stealth
title = {Machine Learning for Bandwidth Management in Decentralized Networks},
volume = {M. Sc},
year = {2014},
- month = {02/2014},
+ month = feb,
pages = {91},
school = {Technische Universitaet Muenchen},
type = {Masters},
@@ -483,7 +484,7 @@ The design is evaluated with the help of simulation and a realistic implementati
title = {Numerical Stability and Scalability of Secure Private Linear Programming},
volume = {B. Sc},
year = {2014},
- month = {02/2014},
+ month = feb,
pages = {65},
school = {Technische Universitaet Muenchen},
type = {Bachelor{\textquoteright}s},
@@ -498,7 +499,7 @@ obtained with different parameter sets and different test cases are presented an
author = {Raphael Arias}
}
@conference {DBLP:conf/stoc/Ullman13,
- title = {Answering $n^{2+o(1)}$ Counting Queries with Differential Privacy is Hard},
+ booktitle = {Answering $n^{2+o(1)}$ Counting Queries with Differential Privacy is Hard},
year = {2013},
pages = {361{\textendash}370},
author = {Jonathan Ullman}
@@ -539,7 +540,7 @@ In this paper we explore the implications of differential privacy when the indis
title = {On the Feasibility of a Censorship Resistant Decentralized Name System},
booktitle = {6th International Symposium on Foundations \& Practice of Security (FPS 2013)},
year = {2013},
- month = {10/2013},
+ month = oct,
publisher = {Springer Verlag},
organization = {Springer Verlag},
address = {La Rochelle, France},
@@ -561,7 +562,7 @@ This paper maps the design space and gives design requirements for censorship re
title = {Large Scale Distributed Evaluation of Peer-to-Peer Protocols},
volume = {Master of Science},
year = {2013},
- month = {06/2013},
+ month = jun,
pages = {76},
school = {Technische Universitaet Muenchen},
type = {Masters },
@@ -581,7 +582,7 @@ We specifically target HPC systems like compute clusters and supercomputers and
title = {Monkey - Generating Useful Bug Reports Automatically},
volume = {Bachelor},
year = {2013},
- month = {07/2013},
+ month = jul,
pages = {50},
school = {Technische Universit{\"a}t M{\"u}nchen},
type = {Bachelor Thesis},
@@ -629,7 +630,7 @@ In this paper we describe the problems that occur when debugging widely distribu
title = {Speeding Up Tor with SPDY},
volume = {Master{\textquoteright}s in Computer Science},
year = {2013},
- month = {11/2013},
+ month = nov,
pages = {124},
school = {Technische Universitaet Muenchen},
type = {Master{\textquoteright}s},
@@ -652,7 +653,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
volume = {371},
number = {1987},
year = {2013},
- month = {March},
+ 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},
issn = {1364-503X},
doi = {10.1098/rsta.2012.0380},
@@ -714,7 +715,7 @@ This thesis includes extensive measurement data highlighting the possible benefi
title = {Congestion-aware Path Selection for Tor},
booktitle = {FC{\textquoteright}12 - Proceedings of the 16th International Conference in Financial Cryptography and Data Security },
year = {2012},
- month = {02/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 ob-
serve 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.
@@ -742,7 +743,7 @@ serve that some nodes persist in being under-utilized or congested. This can deg
journal = {CoRR},
volume = {abs/1202.4503},
year = {2012},
- month = {02/2012},
+ month = feb,
abstract = {While the Internet was conceived as a decentralized network, the most widely used web applications today tend toward centralization. Control increasingly rests with centralized service providers who, as a consequence, have also amassed unprecedented amounts of data about the behaviors and personalities of individuals.
Developers, regulators, and consumer advocates have looked to alternative decentralized architectures as the natural response to threats posed by these centralized services. The result has been a great variety of solutions that include personal data stores (PDS), infomediaries, Vendor Relationship Management (VRM) systems, and federated and distributed social networks. And yet, for all these efforts, decentralized personal data architectures have seen little adoption.
This position paper attempts to account for these failures, challenging the accepted wisdom in the web community on the feasibility and desirability of these approaches. We start with a historical discussion of the development of various categories of decentralized personal data architectures. Then we survey the main ideas to illustrate the common themes among these efforts. We tease apart the design characteristics of these systems from the social values that they (are intended to) promote. We use this understanding to point out numerous drawbacks of the decentralization paradigm, some inherent and others incidental. We end with recommendations for designers of these systems for working towards goals that are achievable, but perhaps more limited in scope and ambition},
@@ -754,7 +755,7 @@ This position paper attempts to account for these failures, challenging the acce
title = {Decentralized Evaluation of Regular Expressions for Capability Discovery in Peer-to-Peer Networks},
volume = {M.S},
year = {2012},
- month = {11/2012},
+ month = nov,
pages = {100},
school = {Technische Universitaet Muenchen},
type = {Masters},
@@ -775,7 +776,7 @@ We have implemented the system for our proposed approach and conducted a simulat
title = {Design and Implementation of a Censorship Resistant and Fully Decentralized Name System},
volume = {M.Sc},
year = {2012},
- month = {09/2012},
+ month = sep,
pages = {116},
school = {TU Munich},
type = {Master{\textquoteright}s},
@@ -811,7 +812,7 @@ Interestingly, the design of our mechanism is quite different from the tradition
@article {2012,
title = {Efficient and Secure Decentralized Network Size Estimation},
year = {2012},
- month = {05/2012},
+ month = may,
institution = {Technische Universitaet Muenchen},
address = {Garching bei Muenchen},
abstract = {The size of a Peer-to-Peer (P2P) network is an important parameter for
@@ -837,7 +838,7 @@ accuracy of the protocol.
title = {Efficient and Secure Decentralized Network Size Estimation},
booktitle = {IFIP International Conferences on Networking (Networking 2012)},
year = {2012},
- month = {05/2012},
+ month = may,
pages = {304--317},
publisher = {Springer Verlag},
organization = {Springer Verlag},
@@ -853,7 +854,7 @@ accuracy of the protocol.
title = {Gossip-based counting in dynamic networks},
booktitle = {IFIP International Conferences on Networking (Networking 2012)},
year = {2012},
- month = {05/2012},
+ month = may,
pages = {404{\textendash}419},
publisher = {Springer Verlag},
organization = {Springer Verlag},
@@ -875,7 +876,7 @@ accuracy of the protocol.
title = {Koi: A Location-Privacy Platform for Smartphone Apps},
booktitle = {Proceedings of the 9th Symposium on Networked Systems Design and Implementation (NSDI)},
year = {2012},
- month = {Apr},
+ month = april,
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},
@@ -887,7 +888,7 @@ In this paper, we propose privacy-preserving location-based matching as a fundam
title = {LAP: Lightweight Anonymity and Privacy},
booktitle = {Proceedings of the 2012 IEEE Symposium on Security and Privacy},
year = {2012},
- month = {05/2012},
+ month = may,
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {San Francisco, CA, USA},
@@ -903,7 +904,7 @@ remote tracking. To show practicality, we demonstrate that LAP can work on top o
title = {LASTor: A Low-Latency AS-Aware Tor Client},
booktitle = {Proceedings of the 2012 IEEE Symposium on Security and Privacy},
year = {2012},
- month = {05/2012},
+ month = may,
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {San Francisco, CA, USA},
@@ -980,7 +981,7 @@ We also simplify the lower bounds on noise for counting queries in [11] and also
title = {Monkey: Automated debugging of deployed distributed systems},
volume = {M.S},
year = {2012},
- month = {07/2012},
+ month = jul,
pages = {78},
school = {Technische Universitaet Muenchen},
type = {Masters},
@@ -1019,7 +1020,7 @@ a small test setup with laptop computers and home NAT routers.
title = {Peek-a-Boo, I Still See You: Why Efficient Traffic Analysis Countermeasures Fail},
booktitle = {Proceedings of the 2012 IEEE Symposium on Security and Privacy},
year = {2012},
- month = {05/2012},
+ month = may,
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {San Francisco, CA, USA},
@@ -1074,7 +1075,7 @@ purpose TA countermeasures can ever provide the type of security targeted in pri
journal = {IEEE Transactions on Knowledge and Data Engineering},
volume = {24},
year = {2012},
- month = {07/2012},
+ month = jul,
chapter = {1313},
abstract = {In this paper, we present Saturn, an overlay architecture for large-scale data networks maintained over Distributed Hash
Tables (DHTs) that efficiently processes range queries and ensures access load balancing and fault-tolerance. Placing consecutive
@@ -1112,7 +1113,7 @@ handle replication and, thus, to trade off replication costs for fair load distr
journal = {IEEE Transactions on Computational Intelligence and AI in Games},
volume = {4},
year = {2012},
- month = {03/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},
keywords = {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},
@@ -1154,7 +1155,7 @@ handle replication and, thus, to trade off replication costs for fair load distr
title = {An Accurate System-Wide Anonymity Metric for Probabilistic Attacks},
booktitle = {PETS{\textquoteright}11 - Proceedings of the 11th Privacy Enhancing Technologies Symposium},
year = {2011},
- month = {07/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.
@@ -1180,7 +1181,7 @@ generalization properties. Finally, we present a new anonymity metric that does
title = {BNymble: More anonymous blacklisting at almost no cost},
booktitle = {FC{\textquoteright}11 - Proceedings of Financial Cryptography and Data Security },
year = {2011},
- month = {02/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.
@@ -1193,7 +1194,7 @@ BNymble is that we can achieve the anonymity goals of these more recent schemes
title = {BridgeSPA: Improving Tor Bridges with Single Packet Authorization},
booktitle = {WPES{\textquoteright}11 - Proceedings of the Workshop on Privacy in the Electronic Society },
year = {2011},
- month = {10/2011},
+ month = oct,
publisher = {ACM},
organization = {ACM},
address = {Chicago, IL, United States},
@@ -1206,7 +1207,7 @@ BNymble is that we can achieve the anonymity goals of these more recent schemes
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},
year = {2011},
- month = {10/2011},
+ month = oct,
publisher = {ACM},
organization = {ACM},
address = {Chicago, IL, United States},
@@ -1236,7 +1237,7 @@ Cirripede is designed to work scalably with routers that handle large volumes of
title = {A comprehensive study of Convergent and Commutative Replicated Data Types},
number = {7506},
year = {2011},
- month = {01/2011},
+ month = jan,
institution = {INRIA Rocquencourt},
address = {Le Chensay Cedex},
abstract = {Eventual consistency aims to ensure that replicas of some mutable shared
@@ -1259,7 +1260,7 @@ and sequences. It discusses some properties needed to implement non-trivial CRDT
title = {Considering Complex Search Techniques in DHTs under Churn},
booktitle = {CCNC 2011 - IEEE Consumer Communications and Networking Conference},
year = {2011},
- month = {01/2011},
+ month = jan,
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Las Vegas, NV, USA},
@@ -1273,7 +1274,7 @@ and sequences. It discusses some properties needed to implement non-trivial CRDT
title = {Decoy Routing: Toward Unblockable Internet Communication},
booktitle = {FOCI{\textquoteright}11 - Proceedings of the USENIX Workshop on Free and Open Communications on the Internet},
year = {2011},
- month = {08/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 {\textendash} where a single device could proxy traffic between a significant fraction of hosts {\textendash} instead of at the edge.
@@ -1286,7 +1287,7 @@ is easily blocked) in order to provide circumvention. We show that if it is poss
title = {DefenestraTor: Throwing out Windows in Tor},
booktitle = {PETS{\textquoteright}11 - Proceedings of the 11th Privacy Enhancing Technologies Symposium },
year = {2011},
- month = {07/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.
},
@@ -1311,7 +1312,7 @@ Our results also yield new separations between the local and global models of co
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},
year = {2011},
- month = {08/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
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.
@@ -1324,7 +1325,7 @@ conducting Tor research in a way that ensures safety and realism, we present the
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},
year = {2011},
- month = {12/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.
@@ -1337,7 +1338,7 @@ This paper argues the very counterintuitive notion that slowing down traffic on
title = {Exposing Invisible Timing-based Traffic Watermarks with BACKLIT},
booktitle = {ACSAC{\textquoteright}11 - Proceedings of 2011 Annual Computer Security Applications Conference },
year = {2011},
- month = {12/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
with high accuracy and few false positives.
@@ -1350,7 +1351,7 @@ with high accuracy and few false positives.
title = {FAUST: Efficient, TTP-Free Abuse Prevention by Anonymous Whitelisting},
booktitle = {WPES{\textquoteright}11 - Proceedings of the Workshop on Privacy in the Electronic Society},
year = {2011},
- month = {10/2011},
+ month = oct,
publisher = {ACM},
organization = {ACM},
address = {Chicago, IL, United States},
@@ -1381,7 +1382,7 @@ authenticate in future sessions. Faust uses no trusted third parties and is one
title = {Formalizing Anonymous Blacklisting Systems},
booktitle = {Proceedings of the 2011 IEEE Symposium on Security and Privacy},
year = {2011},
- month = {05/2011},
+ month = may,
address = {San Francisco, CA, USA},
abstract = {Anonymous communications networks, such as Tor, help to solve the real and important problem of enabling users to communicate privately over the Internet. However, in doing so, anonymous communications networks introduce an entirely new problem for the service providers{\textemdash}such as websites, IRC networks or mail servers{\textemdash}with which these users interact; in particular, since all anonymous users look alike, there is no way for the service providers to hold individual misbehaving anonymous users accountable for their actions. Recent
research efforts have focused on using anonymous blacklisting systems (which are sometimes called anonymous revocation systems) to empower service providers with the ability to revoke access from abusive anonymous users. In contrast to revocable anonymity systems, which enable some trusted third party to deanonymize users, anonymous blacklisting systems provide users with a way to authenticate anonymously with a service provider, while enabling the service provider to revoke access from any users that misbehave, without revealing their identities. In this paper, we introduce the anonymous blacklisting
@@ -1408,7 +1409,7 @@ outline a set of new performance requirements that anonymous blacklisting system
journal = {Journal of Cryptographic Engineering},
volume = {2},
year = {2011},
- month = {09/2011},
+ month = sep,
pages = {77--89},
chapter = {77},
keywords = {ECC, Ed25519, EdDSA, GNUnet},
@@ -1437,7 +1438,7 @@ outline a set of new performance requirements that anonymous blacklisting system
@mastersthesis {kevin-thesis,
title = {Improving Security and Performance in Low Latency Anonymity Networks},
year = {2011},
- month = {05/2011},
+ month = may,
pages = {240},
school = {University of Colorado},
type = {PhD},
@@ -1452,7 +1453,7 @@ To better understand the security and performance properties of a popular low la
title = {Malice versus AN.ON: Possible Risks of Missing Replay and Integrity Protection},
booktitle = {FC{\textquoteright}11 - Proceedings of Financial Cryptography and Data Security },
year = {2011},
- month = {02/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.
},
@@ -1480,7 +1481,7 @@ To better understand the security and performance properties of a popular low la
title = {Methods for Secure Decentralized Routing in Open Networks},
volume = {Dr. rer. nat},
year = {2011},
- month = {08/2011},
+ month = aug,
pages = {234},
school = {Technische Universit{\"a}t M{\"u}nchen},
address = {Garching bei M{\"u}nchen},
@@ -1521,7 +1522,7 @@ emulation framework capable of running a large number of nodes using our full co
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)},
year = {2011},
- month = {03},
+ month = mar,
publisher = {USENIX},
organization = {USENIX},
address = {Boston, United States},
@@ -1536,7 +1537,7 @@ emulation framework capable of running a large number of nodes using our full co
journal = {ACM Transactions on Information and System Security ({ACM TISSEC})},
volume = {14},
year = {2011},
- month = {12/2011},
+ month = dec,
pages = {29:1{\textendash}29:34},
publisher = {ACM},
address = {New York, NY, USA},
@@ -1568,7 +1569,7 @@ We call our extension PEREA-Naughtiness. We prove the security of our constructi
title = {PIR-Tor: Scalable Anonymous Communication Using Private Information Retrieval},
booktitle = {Proceedings of the 20th USENIX Security Symposium},
year = {2011},
- month = {08/2011},
+ month = aug,
address = {San Francisco, CA, USA},
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.
@@ -1581,7 +1582,7 @@ well understood and relatively easy to analyze, as opposed to peer-to-peer desig
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},
year = {2011},
- month = {10/2011},
+ month = oct,
pages = {916-924},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -1595,7 +1596,7 @@ well understood and relatively easy to analyze, as opposed to peer-to-peer desig
title = {Privacy-Implications of Performance-Based Peer Selection by Onion-Routers: A Real-World Case Study using I2P},
volume = {M.S},
year = {2011},
- month = {03/2011},
+ month = mar,
pages = {59},
school = {Technische Universit{\"a}t M{\"u}nchen},
type = {M.S},
@@ -1632,7 +1633,7 @@ actual I2P network --- and discusses possible solutions.
title = {Privacy-Implications of Performance-Based Peer Selection by Onion-Routers: A Real-World Case Study using I2P},
booktitle = {Privacy Enhancing Technologies Symposium (PETS 2011)},
year = {2011},
- month = {04/2011},
+ month = apr,
publisher = {Springer Verlag},
organization = {Springer Verlag},
address = {Waterloo, Canada},
@@ -1673,7 +1674,7 @@ private mechanism, will only gain a negligible advantage (up to a privacy parame
title = {Proximax: Fighting Censorship With an Adaptive System for Distribution of Open Proxies},
booktitle = {FC{\textquoteright}11 - Proceedings of Financial Cryptography and Data Security },
year = {2011},
- month = {02/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.
},
@@ -1691,7 +1692,7 @@ private mechanism, will only gain a negligible advantage (up to a privacy parame
title = {R5N : Randomized Recursive Routing for Restricted-Route Networks},
booktitle = {5th International Conference on Network and System Security (NSS 2011)},
year = {2011},
- month = {09/2011},
+ month = sep,
publisher = {IEEE},
organization = {IEEE},
address = {Milan, Italy},
@@ -1722,7 +1723,7 @@ privacy and leakage, due to the graph symmetries induced by the adjacency relati
title = {Remote Timing Attacks are Still Practical},
year = {2011},
note = {\url{http://eprint.iacr.org/}},
- month = {04/2011},
+ 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},
keywords = {elliptic curve cryptography, lattice attacks, public-key cryptography, side-channel attacks, timing attacks},
@@ -1735,7 +1736,7 @@ privacy and leakage, due to the graph symmetries induced by the adjacency relati
title = {Scalability \& Paranoia in a Decentralized Social Network},
booktitle = {Federated Social Web},
year = {2011},
- month = {06/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. },
keywords = {GNUnet, privacy, social networks},
@@ -1749,7 +1750,7 @@ privacy and leakage, due to the graph symmetries induced by the adjacency relati
volume = {34},
number = {1},
year = {2011},
- month = {04/2009},
+ month = apr,
pages = {47{\textendash}63},
publisher = {Kluwer Academic Publishers},
address = {Hingham, MA, USA},
@@ -1766,7 +1767,7 @@ privacy and leakage, due to the graph symmetries induced by the adjacency relati
journal = {European Journal of Operations Research},
volume = {208},
year = {2011},
- month = {01/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},
keywords = {collaboration, information sharing, secure multi-party computation, SMC, supplychain management},
@@ -1778,7 +1779,7 @@ privacy and leakage, due to the graph symmetries induced by the adjacency relati
title = {A Security API for Distributed Social Networks},
booktitle = {NDSS{\textquoteright}11 - Proceedings of the Network and Distributed Security Symposium},
year = {2011},
- month = {02/2011},
+ month = feb,
publisher = {The Internet Society},
organization = {The Internet Society},
address = {San Diego, CA, USA},
@@ -1819,7 +1820,7 @@ In this paper, we embrace the social aspects of the Web 2.0 by considering a nov
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},
year = {2011},
- month = {10/2011},
+ month = oct,
publisher = {ACM},
organization = {ACM},
address = {Chicago, IL, United States},
@@ -1836,7 +1837,7 @@ than 1.5\% in under 5 minutes. Our attacks are also more accurate and require fe
title = {SWIRL: A Scalable Watermark to Detect Correlated Network Flows},
booktitle = {NDSS{\textquoteright}11 - Proceedings of the Network and Distributed Security Symposium},
year = {2011},
- month = {02/2011},
+ month = feb,
address = {San Diego, CA, USA},
abstract = {Flow watermarks are active traffic analysis techniques that help establish a causal connection between two network flows by content-independent manipulations, e.g., altering packet timings. Watermarks provide a much more
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
@@ -1850,7 +1851,7 @@ attacks, marking each flow with a different pattern. SWIRL is robust to packet l
title = {Telex: Anticensorship in the Network Infrastructure},
booktitle = {Proceedings of the 20th USENIX Security Symposium},
year = {2011},
- month = {08/2005},
+ 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
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.
@@ -1863,7 +1864,7 @@ station but not to a censor. In addition, we use our tagging scheme to build a p
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},
year = {2011},
- month = {10/2011},
+ month = oct,
publisher = {ACM},
organization = {ACM},
address = {Chicago, IL, United States},
@@ -1878,7 +1879,7 @@ station but not to a censor. In addition, we use our tagging scheme to build a p
booktitle = {Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference},
series = {IMC {\textquoteright}11},
year = {2011},
- month = {11/2011},
+ month = nov,
pages = {259{\textendash}268},
publisher = {ACM},
organization = {ACM},
@@ -1895,7 +1896,7 @@ station but not to a censor. In addition, we use our tagging scheme to build a p
title = {Website Fingerprinting in Onion Routing Based Anonymization Networks},
booktitle = {WPES{\textquoteright}11 - Proceedings of the Workshop on Privacy in the Electronic Society},
year = {2011},
- month = {10/2011},
+ month = oct,
publisher = {ACM},
organization = {ACM},
address = {Chicago, IL, United States},
@@ -1929,7 +1930,7 @@ JAP, the detection rate decreases from 80\% to 4\% and for Tor it drops from 55\
journal = {Computer Research Repository},
volume = {abs/1109.0971},
year = {2011},
- month = {9/2011},
+ month = sep,
abstract = {Distributed hash tables suffer from several security and privacy vulnerabilities, including the problem of Sybil attacks. Existing social network-based solutions to mitigate the Sybil attacks in DHT routing have a high state requirement and do not provide an adequate level of privacy. For instance, such techniques require a user to reveal their social network contacts. We design X-Vine, a protection mechanism for distributed hash tables that operates entirely by communicating over social network links. As with traditional peer-to-peer systems, X-Vine provides robustness, scalability, and a platform for innovation. The use of social network links for communication helps protect participant privacy and adds a new dimension of trust absent from previous designs. X-Vine is resilient to denial of service via Sybil attacks, and in fact is the first Sybil defense that requires only a logarithmic amount of state per node, making it suitable for large-scale and dynamic settings. X-Vine also helps protect the privacy of users social network contacts and keeps their IP addresses hidden from those outside of their social circle, providing a basis for pseudonymous communication. We first evaluate our design with analysis and simulations, using several real world large-scale social networking topologies. We show that the constraints of X-Vine allow the insertion of only a logarithmic number of Sybil identities per attack edge; we show this mitigates the impact of malicious attacks while not affecting the performance of honest nodes. Moreover, our algorithms are efficient, maintain low stretch, and avoid hot spots in the network. We validate our design with a PlanetLab implementation and a Facebook plugin},
keywords = {anonymity, cryptography, dblp, distributed hash table, for:isp, routing, security, social-network-routing},
url = {http://dblp.uni-trier.de/db/journals/corr/corr1109.html$\#$abs-1109-0971},
@@ -1963,7 +1964,7 @@ In this paper, we develop algorithms which take a moderate amount of auxiliary i
title = {Application of Random Walks to Decentralized Recommender Systems},
booktitle = {14th International Conference on Principles of Distributed Systems},
year = {2010},
- month = {09/2010},
+ month = sep,
keywords = {random walks, recommender system},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/opodis10_HAL.pdf},
author = {Anne-Marie Kermarrec and Vincent Leroy and Afshin Moin and Christopher Thraves}
@@ -2015,7 +2016,7 @@ method for establishing connections to peers behind NAT. The proposed method fo
title = {Building Incentives into Tor},
booktitle = {Proceedings of Financial Cryptography (FC {\textquoteright}10)},
year = {2010},
- month = {January},
+ 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},
keywords = {Tor},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/incentives-fc10.pdf},
@@ -2055,7 +2056,7 @@ Beyond the theoretical interest in modeling KDFs, this work is intended to addre
title = {Developing Peer-to-Peer Web Applications},
volume = {M.S},
year = {2010},
- month = {09/2010},
+ month = sep,
pages = {66},
school = {University of Helsinki},
type = {Master{\textquoteright}s Thesis},
@@ -2112,7 +2113,7 @@ To evaluate the platform{\textquoteright}s suitability for application developme
@mastersthesis {vleroythesis,
title = {Distributing social applications},
year = {2010},
- month = {Decemter},
+ month = dec,
school = {IRISA},
type = {phd},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DistributingSocialApp2010Leroy.pdf},
@@ -2139,7 +2140,7 @@ To evaluate the platform{\textquoteright}s suitability for application developme
title = {Efficient DHT attack mitigation through peers{\textquoteright} ID distribution },
booktitle = {HOTP2P{\textquoteright}10 - International Workshop on Hot Topics in Peer-to-Peer Systems},
year = {2010},
- month = {04/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
@@ -2182,7 +2183,7 @@ method detects the most efficient attacks with a very small false-negative rate,
journal = {Peer-to-Peer Networking and Applications},
volume = {3},
year = {2010},
- month = {03/2009},
+ month = mar,
pages = {52-66},
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},
keywords = {dependability, erasure codes, peer-to-peer networking, reliability, storage},
@@ -2235,7 +2236,7 @@ outperforms methods that use only one type of social content. Second, we present
title = {Incentive-driven QoS in peer-to-peer overlays},
volume = {PhD},
year = {2010},
- month = {05/2010},
+ month = may,
pages = {209},
school = {University College London},
address = {London},
@@ -2278,7 +2279,7 @@ outperforms methods that use only one type of social content. Second, we present
booktitle = {ICDCN{\textquoteright}10 - Proceedings of the 11th International Conference on Distributed Computing and Networking},
series = {ICDCN{\textquoteright}10},
year = {2010},
- month = {01/2010},
+ month = jan,
pages = {195{\textendash}206},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
@@ -2406,7 +2407,7 @@ outperforms methods that use only one type of social content. Second, we present
booktitle = {Proceedings of the 19th USENIX conference on Security},
series = {USENIX Security{\textquoteright}10},
year = {2010},
- month = {08/2010},
+ month = aug,
pages = {15{\textendash}15},
publisher = {USENIX Association},
organization = {USENIX Association},
@@ -2473,7 +2474,7 @@ Five years ago a previous study examined the AS-level threat against client and
booktitle = {Proceedings of the 12th IMA International Conference on Cryptography and Coding},
series = {Cryptography and Coding {\textquoteright}09},
year = {2009},
- month = {12/2009},
+ month = dec,
pages = {278{\textendash}300},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
@@ -2521,7 +2522,7 @@ Five years ago a previous study examined the AS-level threat against client and
booktitle = {WETICE{\textquoteright}09 - Proceedings of the 18th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises},
series = {WETICE {\textquoteright}09},
year = {2009},
- month = {06/2009},
+ month = jun,
pages = {122{\textendash}127},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -2597,7 +2598,7 @@ Our de-anonymization algorithm is based purely on the network topology, does not
journal = {Journal of Parallel and Distributed Computing},
volume = {69},
year = {2009},
- month = {07/2009},
+ month = jul,
pages = {613{\textendash}622},
publisher = {Academic Press, Inc},
address = {Orlando, FL, USA},
@@ -2655,7 +2656,7 @@ We measure the empirical trade-off between accuracy and privacy in these adaptat
series = {Lecture Notes in Computer Science},
volume = {5637},
year = {2009},
- month = {06/2009},
+ month = jun,
pages = {70{\textendash}82},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
@@ -2725,7 +2726,7 @@ This paper presents HEAP, HEterogeneity-Aware gossip Protocol, where nodes dynam
journal = {IEEE/ACM Transactions on Networking},
volume = {17},
year = {2009},
- month = { 05/2009},
+ month = may,
chapter = {1371},
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},
keywords = {churn, distributed hash table, KAD, Kademlia},
@@ -2752,7 +2753,7 @@ This paper presents HEAP, HEterogeneity-Aware gossip Protocol, where nodes dynam
title = {On Mechanism Design without Payments for Throughput Maximization},
booktitle = {INFOCOM{\textquoteright}09. Proceedings of the 28th IEEE International Conference on Computer Communications},
year = {2009},
- month = {04/2009},
+ month = apr,
pages = {972-980},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -2783,7 +2784,7 @@ This paper presents HEAP, HEterogeneity-Aware gossip Protocol, where nodes dynam
title = {Monte-Carlo Search Techniques in the Modern Board Game Thurn and Taxis},
volume = {Master Science of Artificial Intelligence},
year = {2009},
- month = {12/2009},
+ month = dec,
pages = {93},
school = {Maastricht University},
type = {Master Thesis},
@@ -2863,7 +2864,7 @@ In this paper we establish the optimal trade-off between the round complexity an
title = {Peer Profiling and Selection in the I2P Anonymous Network},
booktitle = {PET-CON 2009.1},
year = {2009},
- month = {03/2009},
+ month = mar,
address = {TU Dresden, Germany },
keywords = {I2P},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/I2P-PET-CON-2009.1.pdf},
@@ -2873,7 +2874,7 @@ In this paper we establish the optimal trade-off between the round complexity an
title = {PeerSim: A Scalable P2P Simulator},
booktitle = {P2P{\textquoteright}09 - Proceedings of the 9th International Conference on Peer-to-Peer},
year = {2009},
- month = {09/2009},
+ month = sep,
pages = {99-100},
address = {Seattle, WA},
abstract = {The key features of peer-to-peer (P2P) systems are scalability and dynamism. The evaluation of a P2P protocol in realistic environments is very expensive and difficult to reproduce, so simulation is crucial in P2P research. PeerSim is an extremely scalable simulation environment that supports dynamic scenarios such as churn and other failure models. Protocols need to be specifically implemented for the PeerSim Java API, but with a reasonable effort they can be evolved into a real implementation. Testing in specified parameter-spaces is supported as well. PeerSim started out as a tool for our own research},
@@ -2888,7 +2889,7 @@ In this paper we establish the optimal trade-off between the round complexity an
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},
year = {2009},
- month = {02/2009},
+ month = feb,
pages = {253{\textendash}265},
publisher = {USENIX Association},
organization = {USENIX Association},
@@ -2903,7 +2904,7 @@ In this paper we establish the optimal trade-off between the round complexity an
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},
year = {2009},
- month = {Oct},
+ month = october,
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},
keywords = {ad-hoc networks, AOMDV, distance vector, multi-path, performance},
@@ -2935,7 +2936,7 @@ We then strengthen the original congestion attack by combining it with a novel b
booktitle = {ICDCS{\textquoteright}09 - Proceedings of the 29th IEEE International Conference on Distributed Computing Systems},
series = {ICDCS {\textquoteright}09},
year = {2009},
- month = {06/2009},
+ month = jun,
pages = {376{\textendash}384},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -2982,7 +2983,7 @@ We then strengthen the original congestion attack by combining it with a novel b
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},
year = {2009},
- month = {04/2009},
+ month = apr,
pages = {73-81},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -3137,7 +3138,7 @@ mous communication.
title = {Solving very large distributed constraint satisfaction problems},
volume = {Doctor of Philosophy},
year = {2009},
- month = {12/2009},
+ month = dec,
pages = {211},
school = {University of Wollongog, New South Wales, Australia},
type = {PhD},
@@ -3191,7 +3192,7 @@ Finally, it is argued that any future development in distributed constraint sati
title = {A Sybilproof Indirect Reciprocity Mechanism for Peer-to-Peer Networks},
booktitle = {INFOCOM 2009. The 28th IEEE International Conference on Computer Communications},
year = {2009},
- month = {04/2009},
+ month = apr,
pages = {343-351},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -3207,7 +3208,7 @@ Finally, it is argued that any future development in distributed constraint sati
booktitle = {EC{\textquoteright}09. Proceedings of the 10th ACM Conference on Electronic commerce},
series = {EC {\textquoteright}09},
year = {2009},
- month = {07/2009},
+ month = jul,
pages = {345{\textendash}354},
publisher = {ACM},
organization = {ACM},
@@ -3223,7 +3224,7 @@ Finally, it is argued that any future development in distributed constraint sati
@mastersthesis {Douglas-thesis,
title = {A taxonomy for and analysis of anonymous communications networks},
year = {2009},
- month = {March},
+ 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},
@@ -3246,7 +3247,7 @@ Finally, it is argued that any future development in distributed constraint sati
title = {Traffic Engineering vs. Content Distribution: A Game Theoretic Perspective},
booktitle = {INFOCOM 2009. The 28th IEEE International Conference on Computer Communications},
year = {2009},
- month = {04/2009},
+ month = apr,
pages = {540-548},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -3262,7 +3263,7 @@ Finally, it is argued that any future development in distributed constraint sati
title = {Traffic Morphing: An efficient defense against statistical traffic analysis},
booktitle = {Proceedings of the Network and Distributed Security Symposium - {NDSS} {\textquoteright}09},
year = {2009},
- month = {February},
+ 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
@@ -3402,7 +3403,7 @@ exible rmware including a Java Virtual Machine, and an Eclipse-based integrated
booktitle = {AAMAS{\textquoteright}08 - Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems },
series = {AAMAS {\textquoteright}08},
year = {2008},
- month = {05/2008},
+ month = may,
pages = {1449{\textendash}1452},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
organization = {International Foundation for Autonomous Agents and Multiagent Systems},
@@ -3429,7 +3430,7 @@ A general framework for implementing distributed local search algorithms for Dis
booktitle = {NetEcon{\textquoteright}08. Proceedings of the 3rd International Workshop on Economics of Networked Systems},
series = {NetEcon {\textquoteright}08},
year = {2008},
- month = {08/2008},
+ month = aug,
pages = {19{\textendash}24},
publisher = {ACM},
organization = {ACM},
@@ -3480,7 +3481,7 @@ We use the simulator to compare representative protocols under identical conditi
journal = {SIGCOMM Computer Communication Review},
volume = {38},
year = {2008},
- month = {08/2008},
+ month = aug,
pages = {243{\textendash}254},
publisher = {ACM},
address = {New York, NY, USA},
@@ -3583,7 +3584,7 @@ To evaluate our novel attack, we used a real-world anonymizing system, TOR. We s
title = {A Concept of an Anonymous Direct P2P Distribution Overlay System},
booktitle = {Proceedings of IEEE 22nd International Conference on Advanced Information Networking and Applications (AINA)},
year = {2008},
- month = {March},
+ month = mar,
pages = {590{\textendash}597},
publisher = {IEEE Computer Society Press},
organization = {IEEE Computer Society Press},
@@ -3609,7 +3610,7 @@ To evaluate our novel attack, we used a real-world anonymizing system, TOR. We s
title = {The Decentralized File System Igor-FS as an Application for Overlay-Networks},
volume = {Engineering},
year = {2008},
- month = {02/2008},
+ month = feb,
pages = {193},
school = {Universit{\"a}t Fridericiana (TH) },
type = {Doctoral},
@@ -3624,7 +3625,7 @@ Often, part of the problem is to access large files in a share way. Until now, t
journal = {IEEE Transactions on Systems, Man, and Cybernetics, Part B},
volume = {38},
year = {2008},
- month = {08/2008},
+ month = aug,
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},
keywords = {algorithms, descentralized learning, LA, learning automata},
@@ -3654,7 +3655,7 @@ Often, part of the problem is to access large files in a share way. Until now, t
booktitle = {IMC{\textquoteright}08. Proceedings of the 8th ACM SIGCOMM conference on Internet measurement},
series = {IMC {\textquoteright}08},
year = {2008},
- month = {10/2008},
+ month = oct,
pages = {3{\textendash}8},
publisher = {ACM},
organization = {ACM},
@@ -3671,7 +3672,7 @@ Often, part of the problem is to access large files in a share way. Until now, t
title = {Don{\textquoteright}t Clog the Queue: Circuit Clogging and Mitigation in P2P anonymity schemes},
booktitle = {Proceedings of Financial Cryptography (FC {\textquoteright}08)},
year = {2008},
- month = {January},
+ month = jan,
publisher = {Springer-Verlag Berlin, Heidelberg},
organization = {Springer-Verlag Berlin, Heidelberg},
abstract = {At Oakland 2005, Murdoch and Danezis described an attack on the Tor anonymity service that recovers the nodes in a Tor circuit, but not the client. We observe that in a peer-to-peer anonymity scheme, the client is part of the circuit and thus the technique can be of greater significance in this setting. We experimentally validate this conclusion by showing that "circuit clogging" can identify client nodes using the MorphMix peer-to-peer anonymity protocol. We also propose and empirically validate the use of the Stochastic Fair Queueing discipline on outgoing connections as an efficient and low-cost mitigation technique},
@@ -3765,7 +3766,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
booktitle = {AAMAS8 - Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems},
series = {AAMAS {\textquoteright}08},
year = {2008},
- month = {05/2008},
+ month = may,
pages = {599{\textendash}606},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
organization = {International Foundation for Autonomous Agents and Multiagent Systems},
@@ -3781,7 +3782,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
title = {Experimental Analysis of Super-Seeding in BitTorrent},
booktitle = {ICC{\textquoteright}08 - Proceedings of the 2008 IEEE International Conference on Communications},
year = {2008},
- month = {05/2008},
+ month = may,
pages = {65-69},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -3798,7 +3799,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
booktitle = {CCS{\textquoteright}08 - Proceedings of the 15th ACM conference on Computer and communications security},
series = {CCS {\textquoteright}08},
year = {2008},
- month = {10/2008},
+ month = oct,
pages = {257{\textendash}266},
publisher = {ACM},
organization = {ACM},
@@ -3830,7 +3831,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
journal = {Computer Networks},
volume = {52},
year = {2008},
- month = {10/2008},
+ month = oct,
pages = {2961{\textendash}2974},
publisher = {Elsevier North-Holland, Inc},
address = {New York, NY, USA},
@@ -3894,7 +3895,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
booktitle = {CCS{\textquoteright}08 - Proceedings of the 15th ACM Conference on Computer and Communications Security},
series = {CCS {\textquoteright}08},
year = {2008},
- month = {10/2008},
+ month = oct,
pages = {417{\textendash}426},
publisher = {ACM},
organization = {ACM},
@@ -3970,7 +3971,7 @@ Additionally, the open-source software projects latency proxy and libspe, which
title = {Improving User and ISP Experience through ISP-aided P2P Locality},
booktitle = {GI{\textquoteright}08. Proceedings of 11th IEEE Global Internet Symposium 2008},
year = {2008},
- month = {04/2008},
+ month = apr,
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Phoenix, AZ},
@@ -4005,7 +4006,7 @@ We study this trade-off in two P2P anonymous systems, Salsa and AP3. In both cas
journal = {Journal of Supercomputing},
volume = {43},
year = {2008},
- month = {02/2008},
+ month = feb,
pages = {183{\textendash}198},
publisher = {Kluwer Academic Publishers},
address = {Hingham, MA, USA},
@@ -4126,7 +4127,7 @@ Experiments on data sets from bioinformatics, text processing and computer secur
booktitle = {STOC{\textquoteright}08. Proceedings of the 40th annual ACM Symposium on Theory of Computing},
series = {STOC {\textquoteright}08},
year = {2008},
- month = {05/2008},
+ month = may,
pages = {75{\textendash}84},
publisher = {ACM},
organization = {ACM},
@@ -4144,7 +4145,7 @@ Experiments on data sets from bioinformatics, text processing and computer secur
journal = {SIGCOMM Computer Communication Review},
volume = {38},
year = {2008},
- month = {08/2008},
+ month = aug,
pages = {351{\textendash}362},
publisher = {ACM},
address = {New York, NY, USA},
@@ -4229,7 +4230,7 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
series = {Lecture Notes in Computer Science},
volume = {5343},
year = {2008},
- month = {12/2008},
+ month = dec,
pages = {71{\textendash}83},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
@@ -4246,7 +4247,7 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
title = {Privacy guarantees through distributed constraint satisfaction},
number = {12},
year = {2008},
- month = {04/2008},
+ month = apr,
institution = {Swiss Federal Institute of Technology (EPFL)},
type = {Tech report},
address = {Lausanne, Switzerland},
@@ -4311,7 +4312,7 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
booktitle = {SIGCOMM{\textquoteright}08. Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication},
series = {SIGCOMM Computer Communication Review},
year = {2008},
- month = {10/2008},
+ month = oct,
pages = {267{\textendash}278},
publisher = {ACM},
organization = {ACM},
@@ -4405,7 +4406,7 @@ To sample the results, we show that web traffic makes up the majority of the con
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},
year = {2008},
- month = {04/2008},
+ month = apr,
pages = {1364{\textendash}1372},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -4421,7 +4422,7 @@ To sample the results, we show that web traffic makes up the majority of the con
title = {A Survey of Anonymous Communication Channels},
number = {MSR-TR-2008-35},
year = {2008},
- month = {January},
+ month = jan,
publisher = {Microsoft Research},
abstract = {We present an overview of the field of anonymous communications, from its establishment in 1981 from David Chaum to today. Key systems are presented categorized according to their underlying principles: semi-trusted relays, mix systems, remailers, onion routing, and systems to provide robust mixing. We include extended discussions of the threat models and usage models that different schemes provide, and the trade-offs between the security properties offered and the communication characteristics different systems support},
keywords = {onion routing, robustness},
@@ -4433,7 +4434,7 @@ To sample the results, we show that web traffic makes up the majority of the con
title = {Swarming on Optimized Graphs for n-way Broadcast},
booktitle = {Proceedings of IEEE INFOCOM 2008},
year = {2008},
- month = {April/2008},
+ month = apr,
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},
keywords = {EGOIST, game theory, routing},
@@ -4460,7 +4461,7 @@ To sample the results, we show that web traffic makes up the majority of the con
title = {Towards Comparable Network Simulations},
number = {2008-9},
year = {2008},
- month = {aug},
+ month = aug,
publisher = {Dept. of Computer Science, Universit{\"a}t Karlsruhe (TH)},
type = {Interner Bericht},
abstract = {Simulations have been a valuable and much used tool in networking research for decades. New protocols are evaluated by simulations. Often, competing designs are judged by their respective performance in simulations. Despite this great importance the state-of-the-art in network simulations is nevertheless still low. A recent survey showed that most publications in a top conference did not even give enough details to repeat the simulations. In this paper we go beyond repeatability and ask: Are different simulations comparable? We study various implementations of the IEEE 802.11 media access layer in ns-2 and OMNeT++ and report some dramatic differences. These findings indicate that two protocols cannot be compared meaningfully unless they are compared in the very same simulation environment. We claim that this problem limits the value of the respective publications because readers are forced to re-implement the work that is described in the paper rather than building on its results. Facing the additional problem that not all authors will agree on one simulator, we address ways of making different simulators comparable},
@@ -4484,7 +4485,7 @@ To sample the results, we show that web traffic makes up the majority of the con
journal = {Concurrency and Computation: Practice \& Experience},
volume = {20},
year = {2008},
- month = {02/2008},
+ month = feb,
pages = {127{\textendash}138},
publisher = {John Wiley and Sons Ltd},
address = {Chichester, UK},
@@ -4516,7 +4517,7 @@ To sample the results, we show that web traffic makes up the majority of the con
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},
year = {2008},
- month = {February},
+ month = feb,
publisher = {Internet Society},
organization = {Internet Society},
abstract = {The Tor anonymous communication network uses selfreported bandwidth values to select routers for building tunnels. Since tunnels are allocated in proportion to this bandwidth, this allows a malicious router operator to attract tunnels for compromise. Since the metric used is insensitive to relative load, it does not adequately respond to changing conditions and hence produces unreliable performance, driving many users away. We propose an opportunistic bandwidth measurement algorithm to replace selfreported values and address both of these problems. We also propose a mechanisms to let users tune Tor performance to achieve higher performance or higher anonymity. Our mechanism effectively blends the traffic from users of different preferences, making partitioning attacks difficult. We implemented the opportunistic measurement and tunable performance extensions and examined their performance both analytically and in the real Tor network. Our results show that users can get dramatic increases in either performance or anonymity with little to no sacrifice in the other metric, or a more modest improvement in both. Our mechanisms are also invulnerable to the previously published low-resource attacks on Tor. },
@@ -4560,7 +4561,7 @@ To sample the results, we show that web traffic makes up the majority of the con
booktitle = {EC{\textquoteright}08. Proceedings of the 10th International Conference on Electronic Commerce},
series = {ICEC {\textquoteright}08},
year = {2008},
- month = {08/2008},
+ month = aug,
pages = {4:1{\textendash}4:8},
publisher = {ACM},
organization = {ACM},
@@ -4578,7 +4579,7 @@ To sample the results, we show that web traffic makes up the majority of the con
booktitle = {SASO 2007. Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems},
series = {SASO {\textquoteright}07},
year = {2007},
- month = {07/2007},
+ month = jul,
pages = {119{\textendash}128},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -4596,7 +4597,7 @@ To sample the results, we show that web traffic makes up the majority of the con
booktitle = {SASO 2007. Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems},
series = {SASO {\textquoteright}07},
year = {2007},
- month = {07/2007},
+ month = jul,
pages = {119{\textendash}128},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -4612,7 +4613,7 @@ To sample the results, we show that web traffic makes up the majority of the con
title = {Analyzing Peer Behavior in KAD},
number = {RR-07-205},
year = {2007},
- month = {10/2007},
+ month = oct,
institution = {Institut Eurecom},
type = {Tech report},
address = {Sophia Antipolis},
@@ -4652,7 +4653,7 @@ To sample the results, we show that web traffic makes up the majority of the con
booktitle = {CCS{\textquoteright}07 - Proceedings of the 14th ACM Conference on Computer and Communications Security},
series = {CCS {\textquoteright}07},
year = {2007},
- month = {10/2007},
+ month = oct,
pages = {195{\textendash}203},
publisher = {ACM},
organization = {ACM},
@@ -4694,7 +4695,7 @@ We present the first anonymous credential system in which services can "blacklis
journal = {SIGCOMM Computer Communication Review},
volume = {37},
year = {2007},
- month = {08/2007},
+ month = aug,
pages = {49{\textendash}60},
publisher = {ACM},
address = {New York, NY, USA},
@@ -4714,7 +4715,7 @@ For validation, we simulate a network with one million low-end peers and show Bu
title = {The Byzantine Postman Problem: A Trivial Attack Against PIR-based Nym Servers},
number = {ESAT-COSIC 2007-001},
year = {2007},
- month = {February},
+ month = feb,
publisher = {Katholieke Universiteit Leuven},
abstract = {Over the last several decades, there have been numerous proposals for systems which can preserve the anonymity of the recipient of some data. Some have involved trusted third-parties or trusted hardware; others have been constructed on top of link-layer anonymity systems or mix-nets. In this paper, we evaluate a pseudonymous message system which takes the different approach of using Private Information Retrieval (PIR) as its basis. We expose a flaw in the system as presented: it fails to identify Byzantine servers. We provide suggestions on correcting the flaw, while observing the security and performance trade-offs our suggestions require},
keywords = {anonymity, private information retrieval, pseudonym},
@@ -4822,7 +4823,7 @@ In this paper, we demonstrate that in view of recent results in compact routing
title = {Cooperative Data Backup for Mobile Devices},
volume = {Ph.D},
year = {2007},
- month = {03/2008},
+ month = mar,
abstract = {Mobile devices such as laptops, PDAs and cell phones are increasingly relied on but are used in contexts that put them at risk of physical damage, loss or theft. However, few mechanisms are available to reduce the risk of losing the data stored on these devices. In this dissertation, we try to address this concern by designing a cooperative backup service for mobile devices. The service leverages encounters and spontaneous interactions among participating devices, such that each device stores data on behalf of other devices. We first provide an analytical evaluation of the dependability gains of the proposed service. Distributed storage mechanisms are explored and evaluated. Security concerns arising from thecooperation among mutually suspicious principals are identified, and core mechanisms are proposed to allow them to be addressed. Finally, we present our prototype implementation of the cooperative backup service},
keywords = {backup, dependability, P2P, ubiquitous computing},
url = {http://ethesis.inp-toulouse.fr/archive/00000544/},
@@ -4928,7 +4929,7 @@ In this paper, we investigate this claim against other low latency anonymous net
booktitle = {NSDI{\textquoteright}07. Proceedings of the 4th USENIX Conference on Networked Systems Design Implementation},
series = {NSDI{\textquoteright}07},
year = {2007},
- month = {04/2007},
+ month = apr,
pages = {1{\textendash}1},
publisher = {USENIX Association},
organization = {USENIX Association},
@@ -4944,7 +4945,7 @@ In this paper, we investigate this claim against other low latency anonymous net
booktitle = {NSDI{\textquoteright}07. Proceedings of the 4th USENIX Conference on Networked Systems Design Implementation},
series = {NSDI{\textquoteright}07},
year = {2007},
- month = {04/2007},
+ month = apr,
pages = {1{\textendash}1},
publisher = {USENIX Association},
organization = {USENIX Association},
@@ -5009,7 +5010,7 @@ In this paper, we investigate this claim against other low latency anonymous net
title = {Empirical Study on the Evolution of PlanetLab},
booktitle = {ICN{\textquoteright}07 - Proceedings of the 6th International Conference on Networking},
year = {2007},
- month = {04/2007},
+ month = apr,
pages = {64{\textendash}},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -5051,7 +5052,7 @@ In this paper, we investigate this claim against other low latency anonymous net
booktitle = {ITC-20{\textquoteright}07 - Proceedings of the 20th International Teletraffic Conference on Managing Traffic Performance in Converged Networks},
series = {ITC20{\textquoteright}07},
year = {2007},
- month = {06/2007},
+ month = jun,
pages = {630{\textendash}641},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
@@ -5097,7 +5098,7 @@ In this paper, we investigate this claim against other low latency anonymous net
booktitle = {IMC{\textquoteright}07 - Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement},
series = {IMC {\textquoteright}07},
year = {2007},
- month = {10/2007},
+ month = oct,
pages = {117{\textendash}122},
publisher = {ACM},
organization = {ACM},
@@ -5143,7 +5144,7 @@ Peers are identified by the so called KAD ID, which was up to now assumed to rem
journal = {IEEE Journal on Selected Areas in Communications},
volume = {25},
year = {2007},
- month = {08/2007},
+ month = aug,
pages = {1161-1172},
abstract = {In communication networks, such as the Internet or mobile ad-hoc networks, the actions taken by intermediate nodes or links are typically hidden from the communicating endpoints; all the endpoints can observe is whether or not the end-to-end transmission was successful. Therefore, in the absence of incentives to the contrary, rational (i.e., selfish) intermediaries may choose to forward messages at a low priority or simply not forward messages at all. Using a principal-agent model, we show how the hidden-action problem can be overcome through appropriate design of contracts in both the direct (the endpoints contract with each individual router directly) and the recursive (each router contracts with the next downstream router) cases. We further show that, depending on the network topology, per-hop or per-path monitoring may not necessarily improve the utility of the principal or the social welfare of the system},
keywords = {action, communication network, hidden action, network routing},
@@ -5173,7 +5174,7 @@ Peers are identified by the so called KAD ID, which was up to now assumed to rem
title = {How to Shuffle in Public},
booktitle = {Proceedings of the Theory of Cryptography 2007},
year = {2007},
- month = {February},
+ month = feb,
publisher = {Springer Berlin / Heidelberg},
organization = {Springer Berlin / Heidelberg},
abstract = {We show how to obfuscate a secret shuffle of ciphertexts: shuffling becomes a public operation. Given a trusted party that samples and obfuscates a shuffle before any ciphertexts are received, this reduces the problem of constructing a mix-net to verifiable joint decryption.
@@ -5191,7 +5192,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
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},
year = {2007},
- month = {12/2007},
+ month = dec,
pages = {200{\textendash}215},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
@@ -5224,7 +5225,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
title = {Implications of Selfish Neighbor Selection in Overlay Networks},
booktitle = {Proceedings of IEEE INFOCOM 2007},
year = {2007},
- month = {May/2007},
+ month = may,
address = {Anchorage, AK},
keywords = {EGOIST, game theory, routing},
url = {www.cs.bu.edu/techreports/pdf/2006-019-selfish-neighbor-selection.pdf},
@@ -5317,7 +5318,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
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},
year = {2007},
- month = {01/2007},
+ month = jan,
pages = {58},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -5354,7 +5355,7 @@ We investigate how Tor{\^a}€™s routing optimizations impact its ability to pro
journal = {International Journal of Network Security},
volume = {8},
year = {2007},
- month = {03/2009},
+ month = mar,
pages = {169--176},
chapter = {169},
abstract = {The use of elliptic curve cryptography (ECC) when used
@@ -5379,7 +5380,7 @@ message to an elliptic curve.
title = {MARCH: A Distributed Incentive Scheme for Peer-to-Peer Networks},
booktitle = {INFOCOM 2007. 26th IEEE International Conference on Computer Communications},
year = {2007},
- month = {05/2007},
+ month = may,
pages = {1091-1099},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -5395,7 +5396,7 @@ message to an elliptic curve.
title = {Mesh or Multiple-Tree: A Comparative Study of Live P2P Streaming Approaches},
booktitle = {INFOCOM 2007. 26th IEEE International Conference on Computer Communications},
year = {2007},
- month = {05/2007},
+ month = may,
pages = {1424{\textendash}1432},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -5432,7 +5433,7 @@ The realized protocols as well as the original protocol are constant-round and r
journal = {IEEE/ACM Trans. Netw},
volume = {15},
year = {2007},
- month = {04/2007},
+ month = apr,
pages = {413{\textendash}424},
publisher = {IEEE Press},
address = {Piscataway, NJ, USA},
@@ -5449,7 +5450,7 @@ The realized protocols as well as the original protocol are constant-round and r
booktitle = {INFOCOM 2007. 26th IEEE International Conference on Computer Communications},
volume = {56},
year = {2007},
- month = {05/2007},
+ month = may,
pages = {4539{\textendash}4551},
publisher = {IEEE Press},
organization = {IEEE Press},
@@ -5495,7 +5496,7 @@ Although several solutions exist in the relevant literature for this problem, th
booktitle = {IJCAI{\textquoteright}07 - Proceedings of the 20th international joint conference on Artifical intelligence},
series = {IJCAI{\textquoteright}07},
year = {2007},
- month = {01/2007},
+ month = jan,
pages = {167{\textendash}172},
publisher = {Morgan Kaufmann Publishers Inc},
organization = {Morgan Kaufmann Publishers Inc},
@@ -5556,7 +5557,7 @@ In this paper, our focus is on the two-party case, although most of our results
booktitle = {INFOCOM 2007. 26th IEEE International Conference on Computer Communications},
volume = {17},
year = {2007},
- month = {05/2007},
+ month = may,
pages = {1052{\textendash}1065},
publisher = {IEEE Press},
organization = {IEEE Press},
@@ -5653,7 +5654,7 @@ Finally we study a problem that arises when we combine probabilities with nondet
title = {Proximity Neighbor Selection and Proximity Route Selection for the Overlay-Network IGOR},
volume = {Computer Science},
year = {2007},
- month = {06/2007},
+ month = jun,
pages = {79},
school = {Technische Universit{\"a}t M{\"u}nchen},
type = {Diplomarbeit},
@@ -5716,7 +5717,7 @@ We also discuss various proposed countermeasures designed to detect, thwart or l
title = {Secure asynchronous change notifications for a distributed file system},
volume = {Computer Science},
year = {2007},
- month = {11/2007},
+ month = nov,
pages = {74},
school = {Technische Universit{\"a}t M{\"u}nchen},
address = {Munich, Germany},
@@ -5734,7 +5735,7 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
title = {Secure Group Communication in Ad-Hoc Networks using Tree Parity Machines},
booktitle = {KiVS 2007},
year = {2007},
- month = {2},
+ month = feb,
pages = {457-468},
publisher = {VDE Verlag},
organization = {VDE Verlag},
@@ -5751,7 +5752,7 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
journal = {SIGCOMM Computer Communication Review},
volume = {37},
year = {2007},
- month = {08/2007},
+ month = aug,
pages = {61{\textendash}72},
publisher = {ACM},
address = {New York, NY, USA},
@@ -5769,7 +5770,7 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
series = {MDS {\textquoteright}07},
volume = {13},
year = {2007},
- month = {11/2007},
+ month = nov,
pages = {1{\textendash}6},
publisher = {ACM},
organization = {ACM},
@@ -6020,7 +6021,7 @@ In this paper we describe Valgrind, a DBI framework designed for building heavyw
title = {2Fast: Collaborative Downloads in P2P Networks},
booktitle = {P2P 2006. 6th IEEE International Conference on Peer-to-Peer Computing},
year = {2006},
- month = {09/2006},
+ month = sep,
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Cambridge, UK},
@@ -6036,7 +6037,7 @@ In this paper we describe Valgrind, a DBI framework designed for building heavyw
title = {Access Control in Peer-to-Peer Storage Systems},
volume = {Communication Systems},
year = {2006},
- month = {10/2006},
+ month = oct,
pages = {159},
school = {Eidgen{\"o}ssische Technische Hochschule Z{\"u}rich (ETH)},
type = {Master{\textquoteright}s Thesis},
@@ -6110,7 +6111,7 @@ This work has been partially supported by the INRIA DREI {\'E}quipe Associ{\'e}e
booktitle = {CCS{\textquoteright}06 - Proceedings of the 13th ACM Conference on Computer and Communications Security},
series = {CCS {\textquoteright}06},
year = {2006},
- month = {10/2006},
+ month = oct,
pages = {89{\textendash}98},
publisher = {ACM},
organization = {ACM},
@@ -6232,7 +6233,7 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
title = {Combating Hidden Action in Unstructured Peer-to-Peer Systems},
booktitle = {ChinaCom {\textquoteright}06. First International Conference on Communications and Networking in China},
year = {2006},
- month = {10/2006},
+ month = oct,
pages = {1-5},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -6327,7 +6328,7 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
title = {Cryptree: A Folder Tree Structure for Cryptographic File Systems},
booktitle = {SRDS{\textquoteright}06 - Proceedings of the 25th IEEE Symposium on Reliable Distributed Systems},
year = {2006},
- month = {10/2006},
+ month = oct,
pages = {189{\textendash}198},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -6344,7 +6345,7 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
title = {Curve25519: new Diffie-Hellman speed records},
booktitle = {PKC},
year = {2006},
- month = {02/2006},
+ month = feb,
keywords = {Curve25519, ECC, ECDH, GNUnet},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/curve25519-20060209.pdf},
author = {Daniel J. Bernstein}
@@ -6425,7 +6426,7 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
@mastersthesis {2006,
title = {Distributed k-ary System: Algorithms for Distributed Hash Tables},
year = {2006},
- month = {12/2006},
+ month = dec,
pages = {209},
school = {KTH/Royal Institute of Technology},
type = {Doctoral},
@@ -6565,7 +6566,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
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 },
year = {2006},
- month = {02/2006},
+ month = feb,
pages = {1{\textendash}6},
address = {Santa Barbara, CA, USA},
abstract = {Despite its popularity, relatively little is known about the traf- fic characteristics of the Skype VoIP system and how they differ from other P2P systems. We describe an experimental study of Skype VoIP traffic conducted over a one month period, where over 30 million datapoints were collected regarding the population of online clients, the number of supernodes, and their traffic characteristics. The results indicate that although the structure of the Skype system appears to be similar to other P2P systems, particularly KaZaA, there are several significant differences in traffic. The number of active clients shows diurnal and work-week behavior, correlating with normal working hours regardless of geography. The population of supernodes in the system tends to be relatively stable; thus node churn, a significant concern in other systems, seems less problematic in Skype. The typical bandwidth load on a supernode is relatively low, even if the supernode is relaying VoIP traffic. The paper aims to aid further understanding of a signifi- cant, successful P2P VoIP system, as well as provide experimental data that may be useful for design and modeling of such systems. These results also imply that the nature of a VoIP P2P system like Skype differs fundamentally from earlier P2P systems that are oriented toward file-sharing, and music and video download applications, and deserves more attention from the research community},
@@ -6578,7 +6579,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
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},
year = {2006},
- month = {04/2006},
+ month = apr,
pages = {764{\textendash}771},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -6595,7 +6596,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
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},
year = {2006},
- month = {04/2006},
+ month = apr,
pages = {764{\textendash}771},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -6637,7 +6638,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
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},
year = {2006},
- month = {06/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)},
keywords = {free-riding, harvelaar, P2P, peer-to-peer networking, performance degradation, reputation system},
@@ -6739,7 +6740,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
title = {Improving Robustness of Peer-to-Peer Streaming with Incentives},
booktitle = {NetEcon{\textquoteright}06. 1st Workshop on the Economics of Networked Systems},
year = {2006},
- month = {06/2006},
+ month = jun,
publisher = {ACM},
organization = {ACM},
address = {Ann Arbor, Michigan, USA},
@@ -6788,7 +6789,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
booktitle = {EC{\textquoteright}06. Proceedings of the 7th ACM Conference on Electronic Commerce},
series = {EC {\textquoteright}06},
year = {2006},
- month = {06/2006},
+ month = jun,
pages = {130{\textendash}139},
publisher = {ACM},
organization = {ACM},
@@ -6846,7 +6847,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
title = {i-WAT: The Internet WAT System - An Architecture for Maintaining Trust and Facilitating Peer-to-Peer Barter Relationships},
volume = {Philosophy (Media and Governance)},
year = {2006},
- month = {01/2006},
+ month = jan,
pages = {231},
school = {Keio University,},
address = {Washington, DC, USA},
@@ -6952,7 +6953,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
journal = {SIGCOMM Computer Communication Review},
volume = {36},
year = {2006},
- month = {08/2006},
+ month = aug,
pages = {147{\textendash}158},
publisher = {ACM},
address = {New York, NY, USA},
@@ -6978,7 +6979,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
journal = {SIGCOMM Computer Communication Review},
volume = {36},
year = {2006},
- month = {01/2006},
+ month = jan,
pages = {63{\textendash}68},
publisher = {ACM},
address = {New York, NY, USA},
@@ -7010,7 +7011,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
title = {On Object Maintenance in Peer-to-Peer Systems},
booktitle = {IPTPS{\textquoteright}06 - Proceedings of the 5th International Workshop on Peer-to-Peer Systems},
year = {2006},
- month = {02/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)},
keywords = {churn, P2P, peer-to-peer networking},
@@ -7080,7 +7081,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
journal = {Theoretical Computer Science},
volume = {351},
year = {2006},
- month = {02/2006},
+ month = feb,
pages = {394{\textendash}406},
publisher = {Elsevier Science Publishers Ltd},
address = {Essex, UK},
@@ -7111,7 +7112,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
booktitle = {PODC {\textquoteright}06 - Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing},
series = {PODC {\textquoteright}06},
year = {2006},
- month = {07/2006},
+ month = jul,
pages = {123{\textendash}132},
publisher = {ACM},
organization = {ACM},
@@ -7128,7 +7129,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
title = {Peer to peer size estimation in large and dynamic networks: A comparative study},
booktitle = {HPDC{\textquoteright}06 - 15th IEEE International Symposium on High Performance Distributed Computing},
year = {2006},
- month = {06/2006},
+ month = jun,
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Paris, France},
@@ -7200,7 +7201,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
title = {PULSE, a Flexible P2P Live Streaming System},
booktitle = {INFOCOM{\textquoteright}06. Proceedings of the 25th IEEE International Conference on Computer Communications},
year = {2006},
- month = {04/2006},
+ month = apr,
pages = {-1{\textendash}1},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -7321,7 +7322,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
title = {Scalable Routing in Sensor Actuator Networks with Churn},
booktitle = {Sensor and Ad Hoc Communications and Networks, 2006. SECON {\textquoteright}06. 2006 3rd Annual IEEE Communications Society on },
year = {2006},
- month = {09/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},
keywords = {ad-hoc networks, scalable source routing},
isbn = {1-4244-0626-9 },
@@ -7439,7 +7440,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
title = {A Survey of Solutions to the Sybil Attack},
number = {2006-052},
year = {2006},
- month = {10/2006},
+ month = oct,
institution = {University of Massachusetts Amherst},
type = {Tech report},
address = {Amherst, MA},
@@ -7454,7 +7455,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
journal = {Computers \& Operations Research},
volume = {33},
year = {2006},
- month = {02/2006},
+ month = feb,
pages = {286-311},
publisher = {Elsevier},
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},
@@ -7468,7 +7469,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
booktitle = {SIGCOMM{\textquoteright}06. Proceedings of the 2006 conference on Applications, Technologies, Architectures, and Protocols for Computer Communications},
series = {SIGCOMM {\textquoteright}06},
year = {2006},
- month = {09/2006},
+ month = sep,
pages = {267{\textendash}278},
publisher = {ACM},
organization = {ACM},
@@ -7487,7 +7488,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
volume = {50},
number = {4},
year = {2006},
- month = {March},
+ month = mar,
pages = {472{\textendash}484},
abstract = {The field of peer-to-peer reputation systems has exploded in the last few years. Our goal is to organize existing ideas and work to facilitate system design. We present a taxonomy of reputation system components, their properties, and discuss how user behavior and technical constraints can conflict. In our discussion, we describe research that exemplifies compromises made to deliver a useable, implementable system},
keywords = {P2P, trust},
@@ -7548,7 +7549,7 @@ This result immediately implies solutions to other long-standing open problems s
booktitle = {IMC{\textquoteright}06. Proceedings of the 6th ACM SIGCOMM Conference on Internet Measurement},
series = {IMC {\textquoteright}06},
year = {2006},
- month = {10/2006},
+ month = oct,
pages = {189{\textendash}202},
publisher = {ACM},
organization = {ACM},
@@ -7648,7 +7649,7 @@ This result immediately implies solutions to other long-standing open problems s
title = {Anonymous Communication with On-line and Off-line Onion Encoding},
booktitle = {Proceedings of Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2005)},
year = {2005},
- month = {January},
+ month = jan,
publisher = {Springer Berlin / Heidelberg},
organization = {Springer Berlin / Heidelberg},
abstract = {Anonymous communication with onions requires that a user application determines the whole routing path of an onion. This scenario has certain disadvantages, it might be dangerous in some situations, and it does not fit well to the current layered architecture of dynamic communication networks.
@@ -7700,7 +7701,7 @@ We show that applying encoding based on universal re-encryption can solve many o
series = {Lecture Notes in Computer Science},
volume = {3640},
year = {2005},
- month = {02/2005},
+ month = feb,
pages = {205-216},
publisher = {Springer},
organization = {Springer},
@@ -7789,7 +7790,7 @@ We show that applying encoding based on universal re-encryption can solve many o
series = {Lecture Notes in Computer Science (Peer-to-peer Systems IV)},
volume = {3640},
year = {2005},
- month = {11/2005},
+ month = nov,
pages = {127-140},
publisher = {Springer Berlin / Heidelberg},
organization = {Springer Berlin / Heidelberg},
@@ -7853,7 +7854,7 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
journal = {Journal of Public Economics},
volume = {89},
year = {2005},
- month = {08/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},
keywords = {cooperation, experimental economics, reputation},
@@ -7875,7 +7876,7 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
title = {Countering Hidden-action Attacks on Networked Systems},
booktitle = {WEIS{\textquoteright}05. Fourth Workshop on the Economics of Information Security},
year = {2005},
- month = {06/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},
keywords = {asymmetric information, computer security, decentralized, economics, information security, moral hazard, social capital},
@@ -7888,7 +7889,7 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
booktitle = {SIGMETRICS{\textquoteright}05. Proceedings of the 2005 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems},
series = {SIGMETRICS {\textquoteright}05},
year = {2005},
- month = {06/2005},
+ month = jun,
pages = {2{\textendash}13},
publisher = {ACM},
organization = {ACM},
@@ -7905,7 +7906,7 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
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},
year = {2005},
- month = {07/2005},
+ month = jul,
pages = {41{\textendash}48},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -7938,7 +7939,7 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
booktitle = {INFOCOM 2005, 24th Annual Joint Conference of the IEEE Computer and Communications Societies},
volume = {1},
year = {2005},
- month = {03/2005},
+ month = mar,
pages = {374-385},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -7971,7 +7972,7 @@ This paper describes the design and implementation of rcc, the router configurat
title = {Determining the Peer Resource Contributions in a P2P Contract},
booktitle = {HOT-P2P 2005. Proceedings of the Second International Workshop on Hot Topics in Peer-to-Peer Systems},
year = {2005},
- month = {07/2005},
+ month = jul,
pages = {2{\textendash}9},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -8017,7 +8018,7 @@ This paper describes the design and implementation of rcc, the router configurat
title = {The eMule Protocol Specification},
number = {TR-2005-03},
year = {2005},
- month = {01/2005},
+ month = jan,
institution = {Leibniz Center, School of Computer Science and Engineering, The Hebrew University},
type = {Tech report},
address = {Jerusalem, Israel},
@@ -8043,7 +8044,7 @@ This paper describes the design and implementation of rcc, the router configurat
title = {Exchange-based incentive mechanisms for peer-to-peer file sharing},
booktitle = {Proceedings of International Conference on Distributed Computing Systems 2004},
year = {2005},
- month = {03/2004},
+ month = mar,
pages = {524-533},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -8059,7 +8060,7 @@ This paper describes the design and implementation of rcc, the router configurat
title = {Exploiting anarchy in networks: a game-theoretic approach to combining fairness and throughput},
booktitle = {INFOCOM 2005. Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies},
year = {2005},
- month = {03/2005},
+ month = mar,
pages = {2147-2158},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -8171,7 +8172,7 @@ We provide a formal definition of onion-routing in the universally composable fr
journal = {IEEE Distributed Systems Online},
volume = {6},
year = {2005},
- month = {06/2005},
+ month = jun,
publisher = {IEEE Computer Society},
chapter = {1},
address = {Los Alamitos, CA, USA},
@@ -8188,7 +8189,7 @@ We provide a formal definition of onion-routing in the universally composable fr
series = {Lecture Notes in Computer Science},
volume = {3494},
year = {2005},
- month = {05/2005},
+ month = may,
publisher = {Springer},
organization = {Springer},
address = {Aarhus, Denmark },
@@ -8232,7 +8233,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
booktitle = {EC{\textquoteright}05. Proceedings of the 6th ACM Conference on Electronic Commerce},
series = {EC {\textquoteright}05},
year = {2005},
- month = {06/2005},
+ month = jun,
pages = {117{\textendash}126},
publisher = {ACM},
organization = {ACM},
@@ -8251,7 +8252,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
series = {Lecture Notes in Computer Science},
volume = {3640},
year = {2005},
- month = {02/2005},
+ month = feb,
publisher = {Springer},
organization = {Springer},
address = {Ithaca, New York},
@@ -8265,7 +8266,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
title = {How good is random linear coding based distributed networked storage?},
booktitle = {NetCod{\textquoteright}05 - First Workshop on Network Coding, Theory, and Applications},
year = {2005},
- month = {04/2005},
+ month = apr,
publisher = {Citeseer},
organization = {Citeseer},
address = {Riva del Garda, Italy},
@@ -8342,7 +8343,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
booktitle = {P2PECON{\textquoteright}05. Proceedings of the 2005 ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems},
series = {P2PECON {\textquoteright}05},
year = {2005},
- month = {08/2005},
+ month = aug,
pages = {116{\textendash}121},
publisher = {ACM},
organization = {ACM},
@@ -8360,7 +8361,7 @@ In this paper we present two constructions of Fuzzy IBE schemes. Our constructio
booktitle = {P2PEcon{\textquoteright}05. Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems},
series = {P2PECON {\textquoteright}05},
year = {2005},
- month = {08/2005},
+ month = aug,
pages = {111{\textendash}115},
publisher = {ACM},
organization = {ACM},
@@ -8475,7 +8476,7 @@ Our results contradict some beliefs that the protocols mentioned guarantee anony
title = {Market-driven bandwidth allocation in selfish overlay networks},
booktitle = {INFOCOM{\textquoteright}05. Proceedings of the 24th IEEE International Conference on Computer Communications},
year = {2005},
- month = {03/2005},
+ month = mar,
pages = {2578-2589},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -8492,7 +8493,7 @@ Our results contradict some beliefs that the protocols mentioned guarantee anony
booktitle = {IMC{\textquoteright}05. Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement},
series = {IMC {\textquoteright}05},
year = {2005},
- month = {10/2005},
+ month = oct,
pages = {4{\textendash}4},
publisher = {USENIX Association},
organization = {USENIX Association},
@@ -8553,7 +8554,7 @@ This paper reports the results from a two week measurement of the entire Overnet
title = {Network coding for large scale content distribution},
booktitle = {INFOCOM{\textquoteright}05. Proceedings of the 24th IEEE International Conference on Computer Communications},
year = {2005},
- month = {03/2005},
+ month = mar,
pages = {2235-2245},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -8570,7 +8571,7 @@ This paper reports the results from a two week measurement of the entire Overnet
booktitle = {P2PEcon{\textquoteright}05. Proceedings of the 2005 ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems},
series = {P2PECON {\textquoteright}05},
year = {2005},
- month = {08/2005},
+ month = aug,
pages = {122{\textendash}127},
publisher = {ACM},
organization = {ACM},
@@ -8615,7 +8616,7 @@ We introduce and implement Obfuscated Ciphertext Mixing, the obfuscation of a mi
series = {Lecture Notes in Computer Science},
volume = {3531},
year = {2005},
- month = {06/2005},
+ month = jun,
pages = {364{\textendash}377},
publisher = {Springer},
organization = {Springer},
@@ -8646,7 +8647,7 @@ We introduce and implement Obfuscated Ciphertext Mixing, the obfuscation of a mi
journal = {ACM SIGecom Exchanges},
volume = {5},
year = {2005},
- month = {07/2005},
+ month = jul,
pages = {41{\textendash}50},
publisher = {ACM},
address = {New York, NY, USA},
@@ -8663,7 +8664,7 @@ We introduce and implement Obfuscated Ciphertext Mixing, the obfuscation of a mi
journal = {FGCS. Future Generations Computer Systems },
volume = {21},
year = {2005},
- month = {03/2005},
+ month = mar,
pages = {333-347},
abstract = {A crucial aspect of Peer-to-Peer (P2P) systems is that of providing incentives for users to contribute their resources to the system. Without such incentives, empirical data show that a majority of the participants act asfree riders. As a result, a substantial amount of resource goes untapped, and, frequently, P2P systems devolve into client-server systems with attendant issues of performance under high load. We propose to address the free rider problem by introducing the notion of a P2P contract. In it, peers are made aware of the benefits they receive from the system as a function of their contributions. In this paper, we first describe a utility-based framework to determine the components of the contract and formulate the associated resource allocation problem. We consider the resource allocation problem for a flash crowd scenario and show how the contract mechanism implemented using a centralized server can be used to quickly create pseudoservers that can serve out the requests. We then study a decentralized implementation of the P2P contract scheme in which each node implements the contract based on local demand. We show that in such a system, other than contributing storage and bandwidth to serve out requests, it is also important that peer nodes function as application-level routers to connect pools of available pseudoservers. We study the performance of the distributed implementation with respect to the various parameters including the terms of the contract and the triggers to create pseudoservers and routers},
keywords = {contracts, framework, P2P, peer-to-peer networking, resource exchange, service exchange},
@@ -8676,7 +8677,7 @@ We introduce and implement Obfuscated Ciphertext Mixing, the obfuscation of a mi
title = {Pastis: A Highly-Scalable Multi-user Peer-to-Peer File System},
booktitle = {Euro-Par{\textquoteright}05 Parallel Processing},
year = {2005},
- month = {09/2005},
+ month = sep,
pages = {1173-1182},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
@@ -8693,7 +8694,7 @@ We have developed a prototype based on the FreePastry open-source implementation
title = {Peer-to-Peer Communication Across Network Address Translators},
booktitle = {ATEC05. Proceedings of the USENIX Annual Technical Conference},
year = {2005},
- month = {04/2005},
+ month = apr,
pages = {179{\textendash}192},
publisher = {USENIX Association},
organization = {USENIX Association},
@@ -8718,7 +8719,7 @@ We have developed a prototype based on the FreePastry open-source implementation
booktitle = {AAMAS{\textquoteright}05 - Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems},
series = {AAMAS {\textquoteright}05},
year = {2005},
- month = {07/2005},
+ month = jul,
pages = {1041{\textendash}1048},
publisher = {ACM},
organization = {ACM},
@@ -8864,7 +8865,7 @@ We have developed a prototype based on the FreePastry open-source implementation
booktitle = {Parallel and Distributed Systems, 2005. Proceedings. 11th International Conference on},
volume = {2},
year = {2005},
- month = {07/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},
keywords = {anonymity, GNUnet, routing, shortcut},
@@ -8876,7 +8877,7 @@ We have developed a prototype based on the FreePastry open-source implementation
@article {2005,
title = {A Quick Introduction to Bloom Filters},
year = {2005},
- month = {08/2005},
+ month = aug,
institution = {The GNUnet Project},
keywords = {Bloom filter, GNUnet},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/bloomfilter.pdf},
@@ -9003,7 +9004,7 @@ This overview focuses on the three DHT systems that have received the most atten
booktitle = {SPAA{\textquoteright}05. Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures},
series = {SPAA {\textquoteright}05},
year = {2005},
- month = {07/2005},
+ month = jul,
pages = {203{\textendash}212},
publisher = {ACM},
organization = {ACM},
@@ -9051,7 +9052,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
booktitle = {P2PECON{\textquoteright}05. Proceedings of the 2005 ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems},
series = {P2PECON {\textquoteright}05},
year = {2005},
- month = {08/2005},
+ month = aug,
pages = {93{\textendash}98},
publisher = {ACM},
organization = {ACM},
@@ -9114,7 +9115,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
booktitle = {Proceedings of the 2005 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems},
series = {SIGMETRICS {\textquoteright}05},
year = {2005},
- month = {06/2005},
+ month = jun,
pages = {398{\textendash}399},
publisher = {ACM},
organization = {ACM},
@@ -9157,7 +9158,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
booktitle = {Proceedings of the 2005 ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems},
series = {P2PECON {\textquoteright}05},
year = {2005},
- month = {08/2005},
+ month = aug,
pages = {128{\textendash}132},
publisher = {ACM},
organization = {ACM},
@@ -9306,7 +9307,7 @@ In this paper we present a novel routing approach that is capable of handling co
title = {An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol},
booktitle = {INFOCOM 2006. Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies},
year = {2004},
- month = {04/2006},
+ month = apr,
address = {Barcelona, Catalunya, Spain},
abstract = {Skype is a peer-to-peer VoIP client developed by KaZaa in 2003. Skype claims that it can work almost seamlessly across NATs and firewalls and has better voice quality than the MSN and Yahoo IM applications. It encrypts calls end-to-end, and stores user information in a decentralized fashion. Skype also supports instant messaging and conferencing. This report analyzes key Skype functions such as login, NAT and firewall traversal, call establishment, media transfer, codecs, and conferencing under three different network setups. Analysis is performed by careful study of Skype network traffic},
keywords = {P2P, VoIP},
@@ -9411,7 +9412,7 @@ In this paper we propose an {\textquotedblleft}onion-like{\textquotedblright} en
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},
year = {2004},
- month = {10/2004},
+ month = oct,
publisher = {ACM},
organization = {ACM},
address = {Taormina, Sicily, Italy},
@@ -9487,7 +9488,7 @@ We identify flaws in the software in Reliable that further compromise its abilit
journal = {IEEE Journal on Selected Areas in Communications},
volume = {22},
year = {2004},
- month = {01/2004},
+ month = jan,
pages = {18-28},
abstract = {There are many research interests in peer-to-peer (P2P) overlay architectures. Most widely used unstructured P2P networks rely on central directory servers or massive message flooding, clearly not scalable. Structured overlay networks based on distributed hash tables (DHT) are expected to eliminate flooding and central servers, but can require many long-haul message deliveries. An important aspect of constructing an efficient overlay network is how to exploit network locality in the underlying network. We propose a novel mechanism, mOverlay, for constructing an overlay network that takes account of the locality of network hosts. The constructed overlay network can significantly decrease the communication cost between end hosts by ensuring that a message reaches its destination with small overhead and very efficient forwarding. To construct the locality-aware overlay network, dynamic landmark technology is introduced. We present an effective locating algorithm for a new host joining the overlay network. We then present a theoretical analysis and simulation results to evaluate the network performance. Our analysis shows that the overhead of our locating algorithm is O(logN), where N is the number of overlay network hosts. Our simulation results show that the average distance between a pair of hosts in the constructed overlay network is only about 11\% of the one in a traditional, randomly connected overlay network. Network design guidelines are also provided. Many large-scale network applications, such as media streaming, application-level multicasting, and media distribution, can leverage mOverlay to enhance their performance},
keywords = {distributed hash table, flooding attacks, overlay networks, P2P},
@@ -9528,7 +9529,7 @@ We identify flaws in the software in Reliable that further compromise its abilit
title = {The Decentralised Coordination of Self-Adaptive Components for Autonomic Distributed Systems},
volume = {Doctor of Philosophy},
year = {2004},
- month = {10/2004},
+ month = oct,
pages = {214},
school = {University of Dublin},
address = {Dublin, Ireland},
@@ -9583,7 +9584,7 @@ We identify flaws in the software in Reliable that further compromise its abilit
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 },
year = {2004},
- month = {03/2004},
+ month = mar,
pages = {7{\textendash}7},
publisher = {USENIX Association},
organization = {USENIX Association},
@@ -9602,7 +9603,7 @@ Measurements with 425 server instances running on 150 PlanetLab and RON hosts sh
title = {Designing Incentive mechanisms for peer-to-peer systems},
booktitle = {GECON 2004. 1st IEEE International Workshop on Grid Economics and Business Models},
year = {2004},
- month = {04/2004},
+ month = apr,
pages = {67-81},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -9645,7 +9646,7 @@ We present new DC-net constructions that simultaneously achieve non-interactivit
series = {Lecture Notes in Computer Science},
volume = {3015},
year = {2004},
- month = {04/2004},
+ month = apr,
pages = {1-11},
publisher = {Springer},
organization = {Springer},
@@ -9868,7 +9869,7 @@ This work was supported in part by the National Science Foundation under Contrac
booktitle = {PINS{\textquoteright}04. Proceedings of the ACM SIGCOMM Workshop on Practice and Theory of Incentives in Networked Systems},
series = {PINS {\textquoteright}04},
year = {2004},
- month = {08/2004},
+ month = aug,
pages = {228{\textendash}236},
publisher = {ACM},
organization = {ACM},
@@ -10013,7 +10014,7 @@ The key feature of our approach is its modularity. It yields precise, formal spe
@mastersthesis {Amnefelt04keso-,
title = {Keso - a Scalable, Reliable and Secure Read/Write Peer-to-Peer File System},
year = {2004},
- month = {05/2004},
+ month = may,
pages = {77},
school = {KTH/Royal Institute of Technology},
type = {Master{\textquoteright}s Thesis},
@@ -10134,7 +10135,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
booktitle = {SIGCOMM{\textquoteright}04. Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications},
series = {SIGCOMM {\textquoteright}04},
year = {2004},
- month = {08/2004},
+ month = aug,
pages = {367{\textendash}378},
publisher = {ACM},
organization = {ACM},
@@ -10173,7 +10174,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
booktitle = {SODA{\textquoteright}04 - Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms},
series = {SODA {\textquoteright}04},
year = {2004},
- month = {01/2004},
+ month = jan,
pages = {76{\textendash}85},
publisher = {Society for Industrial and Applied Mathematics},
organization = {Society for Industrial and Applied Mathematics},
@@ -10190,7 +10191,7 @@ Specifically, we implement a variant of a recently proposed technique that passi
booktitle = {ATEC{\textquoteright}04. Proceedings of the Annual Conference on USENIX Annual Technical Conference},
series = {ATEC {\textquoteright}04},
year = {2004},
- month = {06/2004},
+ month = jun,
pages = {11{\textendash}11},
publisher = {USENIX Association},
organization = {USENIX Association},
@@ -10255,7 +10256,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
journal = {Informatik Spektrum},
volume = {27},
year = {2004},
- month = {02/2004},
+ month = feb,
pages = {51-54},
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},
keywords = {computing, networking, peer-to-peer networking},
@@ -10303,7 +10304,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
title = {Practical Anonymity for the Masses with MorphMix},
booktitle = {Proceedings of Financial Cryptography (FC {\textquoteright}04)},
year = {2004},
- month = {February},
+ month = feb,
pages = {233{\textendash}250},
publisher = {Springer-Verlag, LNCS 3110},
organization = {Springer-Verlag, LNCS 3110},
@@ -10321,7 +10322,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
journal = {SIGCOMM Computer Communication Review},
volume = {34},
year = {2004},
- month = {01/2004},
+ month = jan,
pages = {113{\textendash}118},
publisher = {ACM},
address = {New York, NY, USA},
@@ -10379,7 +10380,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
booktitle = {WPES{\textquoteright}04 - Proceedings of the 2004 ACM workshop on Privacy in the electronic society},
series = {WPES {\textquoteright}04},
year = {2004},
- month = {10/2004},
+ month = oct,
pages = {103{\textendash}114},
publisher = {ACM},
organization = {ACM},
@@ -10410,7 +10411,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
series = {Lecture Notes in Computer Science},
volume = {3191},
year = {2004},
- month = {09/2004},
+ month = sep,
pages = {62-76},
publisher = {Springer},
organization = {Springer},
@@ -10438,7 +10439,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
title = {Provable Unlinkability Against Traffic Analysis},
booktitle = {Proceedings of Financial Cryptography (FC {\textquoteright}04)},
year = {2004},
- month = {February},
+ month = feb,
pages = {266{\textendash}280},
publisher = {Springer-Verlag, LNCS 3110},
organization = {Springer-Verlag, LNCS 3110},
@@ -10533,7 +10534,7 @@ We propose three very efficient protocols for reputable mixnets, all synchronous
booktitle = {P2P{\textquoteright}04. Proceedings of the 4th International Conference on Peer-to-Peer Computing},
series = {P2P {\textquoteright}04},
year = {2004},
- month = {08/2004},
+ month = aug,
pages = {124{\textendash}132},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -10560,7 +10561,7 @@ We propose three very efficient protocols for reputable mixnets, all synchronous
booktitle = {EC{\textquoteright}04. Proceedings of the 5th ACM Conference on Electronic Commerce},
series = {EC {\textquoteright}04},
year = {2004},
- month = {05/2004},
+ month = may,
pages = {102{\textendash}111},
publisher = {ACM},
organization = {ACM},
@@ -10609,7 +10610,7 @@ This paper describes the design and implementation of a secure, reliable, and sc
@mastersthesis {2004,
title = {Signaling and Networking in Unstructured Peer-to-Peer Networks},
year = {2004},
- month = {09/2004},
+ month = sep,
pages = {177},
school = {Technische Universit{\"a}t M{\"u}nchen},
type = {Dissertation},
@@ -10674,7 +10675,7 @@ In this paper, we present, a scalable simulation environment for wireless sensor
journal = {ACM Computing Surveys},
volume = {36},
year = {2004},
- month = {12/2004},
+ month = dec,
pages = {335{\textendash}371},
publisher = {ACM},
address = {New York, NY, USA},
@@ -10690,7 +10691,7 @@ In this paper, we present, a scalable simulation environment for wireless sensor
title = {SWIFT: A System With Incentives For Trading},
booktitle = {P2PECON{\textquoteright}04. Proceedings of the 2nd Workshop on Economics of Peer-to-Peer Systems},
year = {2004},
- month = {06/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},
keywords = {SWIFT, trading},
@@ -10728,7 +10729,7 @@ In this paper, we present, a scalable simulation environment for wireless sensor
title = {Timing Attacks in Low-Latency Mix-Based Systems},
booktitle = {Proceedings of Financial Cryptography (FC {\textquoteright}04)},
year = {2004},
- month = {February},
+ month = feb,
pages = {251{\textendash}265},
publisher = {Springer-Verlag, LNCS 3110},
organization = {Springer-Verlag, LNCS 3110},
@@ -10800,7 +10801,7 @@ This paper describes the motivation, architecture and implementation for a new p
title = {Universal Re-Encryption for Mixnets},
booktitle = {Proceedings of the 2004 RSA Conference, Cryptographer{\textquoteright}s track},
year = {2004},
- month = {February},
+ month = feb,
publisher = {Springer Berlin / Heidelberg},
organization = {Springer Berlin / Heidelberg},
address = {San Francisco, USA},
@@ -10829,7 +10830,7 @@ While technically and conceptually simple, universal re-encryption leads to new
journal = {SIGCOMM Computer Communication Review},
volume = {34},
year = {2004},
- month = {10/2004},
+ month = oct,
pages = {15{\textendash}26},
publisher = {ACM},
address = {New York, NY, USA},
@@ -10985,7 +10986,7 @@ While technically and conceptually simple, universal re-encryption leads to new
title = {Bootstrapping a Distributed Computational Economy with Peer-to-Peer Bartering},
booktitle = {Proceedings of the 1st Worshop on Economics of Peer-to-Peer Systems},
year = {2003},
- month = {06/2003},
+ month = jun,
address = {Berkeley, CA, USA},
keywords = {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},
@@ -10995,7 +10996,7 @@ While technically and conceptually simple, universal re-encryption leads to new
title = {Breaking and Mending Resilient Mix-nets},
booktitle = {Proceedings of Privacy Enhancing Technologies workshop (PET 2003)},
year = {2003},
- month = {March},
+ month = mar,
pages = {66{\textendash}80},
publisher = {Springer-Verlag, LNCS 2760},
organization = {Springer-Verlag, LNCS 2760},
@@ -11025,7 +11026,7 @@ While technically and conceptually simple, universal re-encryption leads to new
booktitle = {SOSP{\textquoteright}03. Proceedings of the 19th ACM Symposium on Operating Systems Principles},
series = {SOSP {\textquoteright}03},
year = {2003},
- month = {10/2003},
+ month = oct,
pages = {282{\textendash}297},
publisher = {ACM},
organization = {ACM},
@@ -11101,7 +11102,7 @@ Because our scheme requires cooperation, it is potentially vulnerable to several
booktitle = {WIAPP{\textquoteright}03 - Proceedings of the The Third IEEE Workshop on Internet Applications},
series = {WIAPP {\textquoteright}03},
year = {2003},
- month = {06/2003},
+ month = jun,
pages = {112{\textendash}},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -11117,7 +11118,7 @@ Because our scheme requires cooperation, it is potentially vulnerable to several
title = {Defending Anonymous Communication Against Passive Logging Attacks},
booktitle = {Proceedings of the 2003 IEEE Symposium on Security and Privacy},
year = {2003},
- month = {05/2003},
+ month = may,
pages = {28{\textendash}43},
publisher = {IEEE Computer Society Washington, DC, USA},
organization = {IEEE Computer Society Washington, DC, USA},
@@ -11189,7 +11190,7 @@ This paper presents the design and implementation of a cooperative off-site back
title = {The effect of rumor spreading in reputation systems for mobile ad-hoc networks},
booktitle = {Proceedings of WiOpt {\textquoteleft}03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks},
year = {2003},
- month = {03/2003},
+ month = mar,
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},
keywords = {mobile Ad-hoc networks, reputation, reputation system, rumor},
@@ -11201,7 +11202,7 @@ This paper presents the design and implementation of a cooperative off-site back
booktitle = {SAINT{\textquoteright}03. Proceedings of the 2003 Symposium on Applications and the Internet},
series = {SAINT {\textquoteright}03},
year = {2003},
- month = {01/2003},
+ month = jan,
pages = {226{\textendash}},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -11219,7 +11220,7 @@ This paper presents the design and implementation of a cooperative off-site back
booktitle = {WWW{\textquoteright}03. Proceedings of the 12th International Conference on World Wide Web},
series = {WWW {\textquoteright}03},
year = {2003},
- month = {05/2003},
+ month = may,
pages = {640{\textendash}651},
publisher = {ACM},
organization = {ACM},
@@ -11253,7 +11254,7 @@ This paper presents the design and implementation of a cooperative off-site back
journal = {Proceedings of the National Academy of Sciences of the USA},
volume = {100},
year = {2003},
- month = {03/2003},
+ month = mar,
pages = {3531-3535},
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},
keywords = {altruistic cooperation, altruistic punishment, cooperation, human society, nonrelatives},
@@ -11306,7 +11307,7 @@ In this paper we analyze several extensions to the exponential feedback algorith
title = {A game theoretic framework for incentives in P2P systems},
booktitle = {Proceedings of the 3rd International Conference on Peer-to-Peer Computing},
year = {2003},
- month = {09/2003},
+ month = sep,
pages = {48-56},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -11339,7 +11340,7 @@ schemes, allowing individual nodes to balance anonymity with efficiency accordin
title = {Generalising Mixes},
booktitle = {Proceedings of Privacy Enhancing Technologies workshop (PET 2003)},
year = {2003},
- month = {March},
+ month = mar,
pages = {18{\textendash}31},
publisher = {Springer-Verlag, LNCS 2760},
organization = {Springer-Verlag, LNCS 2760},
@@ -11357,7 +11358,7 @@ We then show how to express existing mixes in the framework, and then suggest ot
title = {Heartbeat Traffic to Counter (n-1) Attacks},
booktitle = {Proceedings of the Workshop on Privacy in the Electronic Society (WPES 2003)},
year = {2003},
- month = {10/2003},
+ month = oct,
publisher = {ACM New York, NY, USA},
organization = {ACM New York, NY, USA},
address = {Washington, DC, USA},
@@ -11373,7 +11374,7 @@ We then show how to express existing mixes in the framework, and then suggest ot
title = {Herbivore: A Scalable and Efficient Protocol for Anonymous Communication},
number = {2003-1890},
year = {2003},
- month = {February},
+ month = feb,
publisher = {Cornell University},
address = {Ithaca, NY},
abstract = {Anonymity is increasingly important for networked applications amidst concerns over censorship and privacy. In this paper, we describe Herbivore, a peer-to-peer, scalable, tamper-resilient communication system that provides provable anonymity and privacy. Building on dining cryptographer networks, Herbivore scales by partitioning the network into anonymizing cliques. Adversaries able to monitor all network traffic cannot deduce the identity of a sender or receiver beyond an anonymizing clique. In addition to strong anonymity, Herbivore simultaneously provides high efficiency and scalability, distinguishing it from other anonymous communication protocols. Performance measurements from a prototype implementation show that the system can achieve high bandwidths and low latencies when deployed over the Internet},
@@ -11401,7 +11402,7 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
title = {High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two},
booktitle = {HotOS IX - Proceedings of the 9th conference on Hot Topics in Operating Systems },
year = {2003},
- month = {05/2003},
+ month = may,
pages = {1{\textendash}1},
publisher = {USENIX Association},
organization = {USENIX Association},
@@ -11416,7 +11417,7 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
title = {Identity Crisis: Anonymity vs. Reputation in P2P Systems},
booktitle = {P2P{\textquoteright}03. Proceecings of the 3rd International Conference on Peer-to-Peer Computing},
year = {2003},
- month = {09/2003},
+ month = sep,
pages = {134},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -11433,7 +11434,7 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
booktitle = {SIGCOMM {\textquoteright}03 - Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications},
series = {SIGCOMM {\textquoteright}03},
year = {2003},
- month = {08/2003},
+ month = aug,
pages = {381{\textendash}394},
publisher = {ACM},
organization = {ACM},
@@ -11450,7 +11451,7 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
title = {Improving Onion Notation},
booktitle = {Proceedings of Privacy Enhancing Technologies workshop (PET 2003)},
year = {2003},
- month = {March},
+ month = mar,
pages = {81{\textendash}87},
publisher = {Springer-Verlag, LNCS 2760},
organization = {Springer-Verlag, LNCS 2760},
@@ -11465,7 +11466,7 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
title = {Incentives build robustness in BitTorrent},
booktitle = {NetEcon{\textquoteright}03 - Proceedings of the Workshop on Economics of Peer-to-Peer Systems },
year = {2003},
- month = {06/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},
keywords = {BitTorrent, resource utilization, robustness},
@@ -11476,7 +11477,7 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
title = {Incentives for Cooperation in Peer-to-Peer Networks},
booktitle = {P2PECON. Proceedings of the First Workshop on Economics of Peer-to-Peer Systems},
year = {2003},
- month = {06/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},
keywords = {P2P, privacy},
@@ -11502,7 +11503,7 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
title = {KARMA: a Secure Economic Framework for P2P Resource Sharing},
booktitle = {P2PECON{\textquoteright}05. Proceedings of the 3rd Workshop on Economics of Peer-to-Peer Systems},
year = {2003},
- month = {06/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},
keywords = {economic framework, freeloader, karma, p2p resource sharing},
@@ -11592,7 +11593,7 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
title = {Metrics for Traffic Analysis Prevention},
booktitle = {Proceedings of Privacy Enhancing Technologies workshop (PET 2003)},
year = {2003},
- month = {March},
+ month = mar,
pages = {48{\textendash}65},
publisher = {Springer-Verlag, LNCS 2760},
organization = {Springer-Verlag, LNCS 2760},
@@ -11629,7 +11630,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
title = {Mix-networks with Restricted Routes},
booktitle = {Proceedings of Privacy Enhancing Technologies workshop (PET 2003)},
year = {2003},
- month = {March},
+ month = mar,
pages = {1{\textendash}17},
publisher = {Springer-Verlag, LNCS 2760},
organization = {Springer-Verlag, LNCS 2760},
@@ -11644,7 +11645,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
title = {Modelling Unlinkability},
booktitle = {Proceedings of Privacy Enhancing Technologies workshop (PET 2003)},
year = {2003},
- month = {March},
+ month = mar,
pages = {32{\textendash}47},
publisher = {Springer-Verlag, LNCS 2760},
organization = {Springer-Verlag, LNCS 2760},
@@ -11822,7 +11823,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
title = {PPay: micropayments for peer-to-peer systems},
booktitle = {CCS{\textquoteright}03. Proceedings od the 10th ACM Conference on Computer and Communications Security},
year = {2003},
- month = {10/2003},
+ month = oct,
pages = {300-310},
publisher = {ACM},
organization = {ACM},
@@ -11837,7 +11838,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
title = {Practical Anonymity for the Masses with Mix-Networks},
booktitle = {Proceedings of the IEEE 8th Intl. Workshop on Enterprise Security (WET ICE 2003)},
year = {2003},
- month = {06/2003},
+ month = jun,
publisher = {IEEE Computer Society Washington, DC, USA},
organization = {IEEE Computer Society Washington, DC, USA},
address = {Linz, Austria},
@@ -11879,7 +11880,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
title = {Probabilistic Treatment of MIXes to Hamper Traffic Analysis},
booktitle = {Proceedings of the 2003 IEEE Symposium on Security and Privacy},
year = {2003},
- month = {05/2003},
+ month = may,
pages = {16{\textendash}27},
publisher = {IEEE Computer Society Washington, DC, USA},
organization = {IEEE Computer Society Washington, DC, USA},
@@ -11908,7 +11909,7 @@ for such length-preserving mixes, but it is not secure against active attacks. W
title = {Puzzles in P2P Systems},
booktitle = {8th CaberNet Radicals Workshop},
year = {2003},
- month = {10/2003},
+ month = oct,
publisher = {Network of Excellence in Distributed and Dependable Computing Systems},
organization = {Network of Excellence in Distributed and Dependable Computing Systems},
address = {Ajaccio, Corsica},
@@ -11921,7 +11922,7 @@ for such length-preserving mixes, but it is not secure against active attacks. W
title = {Quantifying Disincentives in Peer-to-Peer Networks},
booktitle = {Workshop on Economics of Peer-to-Peer Systems},
year = {2003},
- month = {06/2003},
+ month = jun,
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},
keywords = {incentives, peer-to-peer networking},
@@ -11973,7 +11974,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
series = {Lecture Notes in Computer Science},
volume = {2735},
year = {2003},
- month = {02/2003},
+ month = feb,
pages = {247-255},
publisher = {Springer},
organization = {Springer},
@@ -12027,7 +12028,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
booktitle = {ICNP{\textquoteright}03. Proceedings of the 11th IEEE International Conference on Network Protocols},
series = {ICNP {\textquoteright}03},
year = {2003},
- month = {11/2003},
+ month = nov,
pages = {16{\textendash}},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -12053,7 +12054,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
title = {Reusable Anonymous Return Channels},
booktitle = {Proceedings of the Workshop on Privacy in the Electronic Society (WPES 2003)},
year = {2003},
- month = {10/2003},
+ month = oct,
publisher = {ACM New York, NY, USA},
organization = {ACM New York, NY, USA},
address = {Washington, DC, USA},
@@ -12084,7 +12085,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
title = {Samsara: Honor Among Thieves in Peer-to-Peer Storage},
booktitle = {SOSP{\textquoteright}03 - Proceedings of the Nineteenth ACM Symposium on Operating Systems Principles},
year = {2003},
- month = {10/2003},
+ month = oct,
pages = {120{\textendash}132},
publisher = {ACM Press},
organization = {ACM Press},
@@ -12101,7 +12102,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
series = {Lecture Notes in Computer Science, 2003},
volume = {2816},
year = {2003},
- month = {09/2003},
+ month = sep,
pages = {47-57},
publisher = {Springer},
organization = {Springer},
@@ -12134,7 +12135,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
booktitle = {SIGCOMM{\textquoteright}03. Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications},
series = {SIGCOMM {\textquoteright}03},
year = {2003},
- month = {08/2003},
+ month = aug,
pages = {151{\textendash}162},
publisher = {ACM},
organization = {ACM},
@@ -12217,7 +12218,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
journal = {SIGOPS{\textquoteright}03 Operating Systems Review},
volume = {37},
year = {2003},
- month = {10/2003},
+ month = oct,
pages = {298{\textendash}313},
publisher = {ACM},
address = {New York, NY, USA},
@@ -12319,7 +12320,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
title = {Thwarding Web Censorship with Untrusted Messenger Delivery},
booktitle = {Proceedings of Privacy Enhancing Technologies workshop (PET 2003)},
year = {2003},
- month = {March},
+ month = mar,
pages = {125{\textendash}140},
publisher = {Springer-Verlag, LNCS 2760},
organization = {Springer-Verlag, LNCS 2760},
@@ -12342,7 +12343,7 @@ this, we propose separating the proxy into two distinct components|the messenger
series = {Lecture Notes in Computer Science},
volume = {2735},
year = {2003},
- month = {02/2003},
+ month = feb,
pages = {33-44},
publisher = {Springer},
organization = {Springer},
@@ -12484,7 +12485,7 @@ this, we propose separating the proxy into two distinct components|the messenger
title = {An Analysis of the Degradation of Anonymous Protocols},
booktitle = {Proceedings of the Network and Distributed Security Symposium - NDSS {\textquoteright}02},
year = {2002},
- month = {February},
+ month = feb,
publisher = {IEEE},
organization = {IEEE},
abstract = {There have been a number of protocols proposed for anonymous network communication. In this paper we investigate attacks by corrupt group members that degrade the anonymity of each protocol over time. We prove that when a particular initiator continues communication with a particular responder across path reformations, existing protocols are subject to the attack. We use this result to place an upper bound on how long existing protocols, including Crowds, Onion Routing, Hordes, Web Mixes, and DC-Net, can maintain anonymity in the face of the attacks described. Our results show that fully-connected DC-Net is the most resilient to these attacks, but it su$\#$ers from scalability issues that keep anonymity group sizes small. Additionally, we show how violating an assumption of the attack allows malicious users to setup other participants to falsely appear to be the initiator of a connection},
@@ -12509,7 +12510,7 @@ this, we propose separating the proxy into two distinct components|the messenger
title = {Anonymizing censorship resistant systems},
booktitle = {Proceedings of the 1st International Peer To Peer Systems Workshop (IPTPS 2002)},
year = {2002},
- month = {03/2002},
+ month = mar,
publisher = {Springer-Verlag London, UK},
organization = {Springer-Verlag London, UK},
abstract = {In this paper we propose a new Peer-to-Peer architecture for a censorship resistant system with user, server and active-server document anonymity as well as efficient document retrieval. The retrieval service is layered on top of an existing Peer-to-Peer infrastructure, which should facilitate its implementation. The key idea is to separate the role of document storers from the machines visible to the users, which makes each individual part of the system less prone to attacks, and therefore to censorship.
@@ -12554,7 +12555,7 @@ Placing application-dedicated functionality within the network requires a flexib
booktitle = {PODC{\textquoteright}02 - Proceedings of the 21st Annual Symposium on Principles of Distributed Computing},
series = {PODC {\textquoteright}02},
year = {2002},
- month = {07/2002},
+ month = jul,
pages = {108{\textendash}117},
publisher = {ACM},
organization = {ACM},
@@ -12654,7 +12655,7 @@ Placing application-dedicated functionality within the network requires a flexib
booktitle = {IPTPS{\textquoteright}01 - Revised Papers from the First International Workshop on Peer-to-Peer Systems},
series = {IPTPS {\textquoteright}01},
year = {2002},
- month = {03/2002},
+ month = mar,
pages = {242{\textendash}259},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
@@ -12671,7 +12672,7 @@ Placing application-dedicated functionality within the network requires a flexib
booktitle = {HICSS{\textquoteright}02. Proceedings of the 35th Annual Hawaii International Conference on System Sciences},
series = {HICSS {\textquoteright}02},
year = {2002},
- month = {01/2002},
+ month = jan,
pages = {2431 - 2439 },
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -12742,7 +12743,7 @@ Placing application-dedicated functionality within the network requires a flexib
journal = {IEEE/ACM Transactions on Networking},
volume = {10},
year = {2002},
- month = {06/2002},
+ month = jun,
pages = {381-395 },
publisher = {ACM},
address = {New York, NY, USA},
@@ -12759,7 +12760,7 @@ Placing application-dedicated functionality within the network requires a flexib
booktitle = {DIALM{\textquoteright}06. Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications},
series = {DIALM {\textquoteright}02},
year = {2002},
- month = {09/2002},
+ month = sep,
pages = {1{\textendash}13},
publisher = {ACM},
organization = {ACM},
@@ -12776,7 +12777,7 @@ Placing application-dedicated functionality within the network requires a flexib
title = {Distributed Data Location in a Dynamic Network},
number = {UCB/CSD-02-1178},
year = {2002},
- month = {Apr},
+ month = april,
publisher = {EECS Department, University of California, Berkeley},
abstract = {Modern networking applications replicate data and services widely, leading to a need for location-independent routing {\textendash} the ability to route queries directly to objects using names that are independent of the objects{\textquoteright} physical locations. Two important properties of a routing infrastructure are routing locality and rapid adaptation to arriving and departing nodes. We show how these two properties can be achieved with an efficient solution to the nearest-neighbor problem. We present a new distributed algorithm that can solve the nearest-neighbor problem for a restricted metric space. We describe our solution in the context of Tapestry, an overlay network infrastructure that employs techniques proposed by Plaxton, Rajaraman, and Richa},
url = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2002/5214.html},
@@ -12934,7 +12935,7 @@ in the different DHT routing protocols. We conclude that proximity neighbor sele
booktitle = {OSDI 2000 - Proceedings of the 4th USENIX Symposium on Operating Systems Design and Implementation},
volume = {20},
year = {2002},
- month = {10/2000},
+ month = oct,
pages = {1{\textendash}24},
publisher = {ACM},
organization = {ACM},
@@ -13009,7 +13010,7 @@ The read-only file system makes the security of published content independent fr
@article {2002,
title = {The GNet Whitepaper},
year = {2002},
- month = {06/2002},
+ month = jun,
institution = {Purdue University},
type = {Technical report},
keywords = {anonymity, economics, encoding, GNUnet, obsolete database},
@@ -13081,7 +13082,7 @@ The read-only file system makes the security of published content independent fr
journal = {IEEE/ACM Trans. Netw},
volume = {10},
year = {2002},
- month = {04/2002},
+ month = apr,
pages = {208{\textendash}216},
publisher = {IEEE Press},
address = {Piscataway, NJ, USA},
@@ -13162,7 +13163,7 @@ The read-only file system makes the security of published content independent fr
series = {Lecture Notes in Computer Science},
volume = {2429},
year = {2002},
- month = {03/2001},
+ month = mar,
pages = {53{\textendash}65},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
@@ -13216,7 +13217,7 @@ The read-only file system makes the security of published content independent fr
booktitle = {CRYPTO{\textquoteright}02 - Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology},
series = {Lecture Notes in Computer Science},
year = {2002},
- month = {08/2002},
+ month = aug,
pages = {47{\textendash}60},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
@@ -13265,7 +13266,7 @@ Randomized partial checking is particularly well suited for voting systems, as i
volume = {50},
number = {4},
year = {2002},
- month = {07/2002},
+ month = jul,
pages = {603{\textendash}616},
publisher = {INFORMS},
address = {Institute for Operations Research and the Management Sciences (INFORMS), Linthicum, Maryland, USA},
@@ -13332,7 +13333,7 @@ We further investigate this intriguing proposal. Specifically, we
journal = {Journal of Computer Security},
volume = {Volume 13 ,},
year = {2002},
- month = {December 2005},
+ month = dec,
pages = {839 - 876},
publisher = {IOS Press Amsterdam, The Netherlands},
abstract = {We present a protocol for anonymous communication over the Internet. Our protocol, called P (Peer-to-Peer Personal Privacy Protocol) provides sender-, receiver-, and sender-receiver anonymity. P is designed to be implemented over the current Internet protocols, and does not require any special infrastructure support. A novel feature of P is that it allows individual participants to trade-off degree of anonymity for communication efficiency, and hence can be used to scalably implement large anonymous groups. We present a description of P , an analysis of its anonymity and communication efficiency, and evaluate its performance using detailed packet-level simulations},
@@ -13392,7 +13393,7 @@ We further investigate this intriguing proposal. Specifically, we
title = {Probabilistic Location and Routing},
booktitle = {INFOCOM{\textquoteright}02. Proceedings of the 21th Annual Joint Conference of the IEEE Computer and Communications Societies},
year = {2002},
- month = {06/2002},
+ month = jun,
pages = {-1{\textendash}1},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -13425,7 +13426,7 @@ We further investigate this intriguing proposal. Specifically, we
booktitle = {ICDCS{\textquoteright}02 - Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS{\textquoteright}02)},
series = {ICDCS {\textquoteright}02},
year = {2002},
- month = {07/2002},
+ month = jul,
pages = {617{\textendash}},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -13453,7 +13454,7 @@ We further investigate this intriguing proposal. Specifically, we
title = {Reliable MIX Cascade Networks through Reputation},
booktitle = {Proceedings of Financial Cryptography (FC {\textquoteright}02)},
year = {2002},
- month = {March},
+ month = mar,
publisher = {Springer-Verlag, LNCS 2357},
organization = {Springer-Verlag, LNCS 2357},
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. Nodes send test messages to monitor their cascades. Senders can also demonstrate message decryptions to convince honest cascade members that a cascade is misbehaving. By allowing any node to declare the failure of its own cascade, we eliminate the need for global trusted witnesses},
@@ -13563,7 +13564,7 @@ We further investigate this intriguing proposal. Specifically, we
booktitle = {ACSAC{\textquoteright}02 - Proceedings of the 18th Annual Computer Security Applications Conference},
series = {ACSAC {\textquoteright}02},
year = {2002},
- month = {12/2003},
+ month = dec,
pages = {172{\textendash}},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -13734,7 +13735,7 @@ We further investigate this intriguing proposal. Specifically, we
booktitle = {IPTPS{\textquoteright}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 = {03/2002},
+ month = mar,
pages = {251{\textendash}260},
publisher = {Springer-Verlag London},
organization = {Springer-Verlag London},
@@ -13768,7 +13769,7 @@ We further investigate this intriguing proposal. Specifically, we
volume = {4},
number = {2},
year = {2002},
- month = {12/2002},
+ month = dec,
pages = {28{\textendash}34},
publisher = {ACM},
address = {New York, NY, USA},
@@ -13797,7 +13798,7 @@ We further investigate this intriguing proposal. Specifically, we
title = {Towards an Information Theoretic Metric for Anonymity},
booktitle = {Proceedings of Privacy Enhancing Technologies Workshop (PET 2002)},
year = {2002},
- month = {04/2003},
+ month = apr,
publisher = {Springer-Verlag, LNCS 2482},
organization = {Springer-Verlag, LNCS 2482},
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},
@@ -13822,7 +13823,7 @@ We further investigate this intriguing proposal. Specifically, we
title = {Towards measuring anonymity},
booktitle = {Proceedings of Privacy Enhancing Technologies Workshop (PET 2002)},
year = {2002},
- month = {04/2003},
+ month = apr,
publisher = {Springer-Verlag, LNCS 2482},
organization = {Springer-Verlag, LNCS 2482},
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 different 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 different systems amongst each other},
@@ -13952,7 +13953,7 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
journal = {Group Decision and Negociation},
volume = {10},
year = {2001},
- month = {03/2001},
+ month = mar,
pages = {199-215},
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},
keywords = {automated negociation autonomous agent, negociation},
@@ -14038,7 +14039,7 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
title = {The Design and Implementation of a Transparent Cryptographic File System for UNIX},
booktitle = {Proceedings of the FREENIX Track: 2001 USENIX Annual Technical Conference},
year = {2001},
- month = {06/2001},
+ month = jun,
pages = {199{\textendash}212},
publisher = {USENIX Association},
organization = {USENIX Association},
@@ -14217,7 +14218,7 @@ Our construction strictly improves upon previous constructions and resolves some
title = {Investigating the energy consumption of a wireless network interface in an ad hoc networking environment},
booktitle = { INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE },
year = {2001},
- month = {04/2001},
+ month = apr,
address = {Anchorage, AK , USA},
abstract = {Energy-aware design and evaluation of network protocols requires knowledge of the energy consumption behavior of actual wireless interfaces. But little practical information is available about the energy consumption behavior of well-known wireless network interfaces and device specifications do not provide information in a form that is helpful to protocol developers. This paper describes a series of experiments which obtained detailed measurements of the energy consumption of an IEEE 802.11 wireless network interface operating in an ad hoc networking environment. The data is presented as a collection of linear equations for calculating the energy consumed in sending, receiving and discarding broadcast and point-to-point data packets of various sizes. Some implications for protocol design and evaluation in ad hoc networks are discussed},
keywords = {ad-hoc networks, energy consumption, IEEE 802.11},
@@ -14307,7 +14308,7 @@ Pastry is completely decentralized, scalable, and self-organizing; it automatica
series = {Lecture Notes in Computer Science},
volume = {2218},
year = {2001},
- month = {11/2001},
+ month = nov,
pages = {329{\textendash}350},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
@@ -14677,7 +14678,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
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},
year = {2000},
- month = {06/2000},
+ month = jun,
pages = {1{\textendash}12},
publisher = {ACM},
organization = {ACM},
@@ -14885,7 +14886,7 @@ A part of this research was done while the author visited the Tokyo Institute of
booktitle = {OSDI{\textquoteright}00. Proceedings of the 4th conference on Symposium on Operating System Design \& Implementation},
series = {OSDI{\textquoteright}00},
year = {2000},
- month = {10/2000},
+ month = oct,
pages = {14{\textendash}14},
publisher = {USENIX Association},
organization = {USENIX Association},
@@ -14953,7 +14954,7 @@ Results based on simulations confirm that Overcast provides its added functional
journal = {Communications of the ACM},
volume = {43},
year = {2000},
- month = {12/2000},
+ month = dec,
pages = {45{\textendash}48},
publisher = {ACM},
address = {New York, NY, USA},
@@ -15117,7 +15118,7 @@ Results based on simulations confirm that Overcast provides its added functional
booktitle = {STOC{\textquoteright}99. Proceedings of the thirty-first Annual ACM Symposium On Theory of Computing},
series = {STOC {\textquoteright}99},
year = {1999},
- month = {05/1999},
+ month = may,
pages = {129{\textendash}140},
publisher = {ACM},
organization = {ACM},
@@ -15135,7 +15136,7 @@ Results based on simulations confirm that Overcast provides its added functional
booktitle = {STAC{\textquoteright}99. Symposium on Theoretical Aspects of Computer Science},
series = {STACS{\textquoteright}99},
year = {1999},
- month = {03/1999},
+ month = mar,
pages = {1{\textendash}15},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
@@ -15307,7 +15308,7 @@ This exposition presents a model to formally study such algorithms. This model,
volume = {66},
number = {1},
year = {1999},
- month = {01/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},
keywords = {contracts, Lagrangean conditions, unobservability},
@@ -15371,7 +15372,7 @@ This exposition presents a model to formally study such algorithms. This model,
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},
year = {1998},
- month = {09/1998},
+ month = sep,
pages = {56{\textendash}67},
publisher = {ACM},
organization = {ACM},
@@ -15414,7 +15415,7 @@ This exposition presents a model to formally study such algorithms. This model,
@booklet {pipenet10,
title = {PipeNet 1.0},
year = {1998},
- month = {January},
+ 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},
author = {Dai, Wei}
@@ -15526,7 +15527,7 @@ This exposition presents a model to formally study such algorithms. This model,
booktitle = {STOC 1997 - Proceedings of the 29th annual ACM symposium on Theory of computing},
series = {STOC {\textquoteright}97},
year = {1997},
- month = {05/1997},
+ month = may,
pages = {150{\textendash}159},
publisher = {ACM},
organization = {ACM},
@@ -15543,7 +15544,7 @@ This exposition presents a model to formally study such algorithms. This model,
title = {Privacy-enhancing Technologies for the Internet},
booktitle = {Compcon {\textquoteright}97. Proceedings, IEEE},
year = {1997},
- month = {02/1997},
+ month = feb,
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {San Jose, CA, United States},
@@ -15629,7 +15630,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
title = {The Eternity Service},
booktitle = {Pragocrypt{\textquoteright}96 - Proceedings of the 1st International Conference on the Theory and Applications of Crytology},
year = {1996},
- month = {09/1996},
+ month = sep,
pages = {242{\textendash}252},
address = {Prague, CZ},
abstract = {The Internet was designed to provide a communications channel that is as resistant to denial of service attacks as human ingenuity can make it. In this note, we propose the construction of a storage medium with similar properties. The basic idea is to use redundancy and scattering techniques to replicate data across a large set of machines (such as the Internet), and add anonymity mechanisms to drive up the cost of selective service denial attacks. The detailed design of this service is an interesting scientific problem, and is not merely academic: the service may be vital in safeguarding individual rights against new threats posed by the spread of electronic publishing},
@@ -15659,7 +15660,7 @@ in the communication chain. This implies that neither the respondent nor his pro
booktitle = {AAAI{\textquoteright}96 - Proceedings of the 13th National Conference on Artificial Intelligence},
series = {AAAI{\textquoteright}96},
year = {1996},
- month = {08/1996},
+ month = aug,
pages = {175{\textendash}180},
publisher = {AAAI Press},
organization = {AAAI Press},
@@ -15744,7 +15745,7 @@ in the communication chain. This implies that neither the respondent nor his pro
title = {Preserving Privacy in a Network of Mobile Computers},
booktitle = {Proceedings of the 1995 IEEE Symposium on Security and Privacy},
year = {1995},
- month = {05/1995},
+ 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},
@@ -15829,7 +15830,7 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
journal = {Journal of Political Economy},
volume = {101},
year = {1993},
- month = {02/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},
keywords = {allocative efficiency, double auction, market, zero-intelligence trader},
@@ -15903,7 +15904,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
series = {Lecture Notes in Computer Science},
volume = {658},
year = {1992},
- month = {05/1992},
+ month = may,
pages = {390-407},
publisher = {Springer},
organization = {Springer},
@@ -15942,7 +15943,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
title = {ISDN-mixes: Untraceable communication with very small bandwidth overhead},
booktitle = {Proceedings of the GI/ITG Conference on Communication in Distributed Systems},
year = {1991},
- month = {02/1991},
+ month = feb,
pages = {451{\textendash}463},
publisher = {Springer-Verlag London, UK},
organization = {Springer-Verlag London, UK},
@@ -15957,7 +15958,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
booktitle = {EUROCRYPT{\textquoteright}89 - Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology},
series = {EUROCRYPT {\textquoteright}89},
year = {1990},
- month = {04/1989},
+ month = apr,
pages = {690{\textendash}},
publisher = {Springer-Verlag New York, Inc},
organization = {Springer-Verlag New York, Inc},
@@ -16068,7 +16069,7 @@ We also sketch applications of these signatures to a payment system, solving dis
booktitle = {SIGCOMM{\textquoteright}87. Proceedings of the ACM Workshop on Frontiers in Computer Communications Technology},
series = {SIGCOMM {\textquoteright}87},
year = {1987},
- month = {08/1987},
+ month = aug,
pages = {245{\textendash}253},
publisher = {ACM},
organization = {ACM},
@@ -16143,7 +16144,7 @@ We also sketch applications of these signatures to a payment system, solving dis
title = {Networks Without User Observability {\textendash} Design Options},
booktitle = {Proceedings of EUROCRYPT 1985},
year = {1985},
- month = {04/1985},
+ month = apr,
publisher = {Springer-Verlag New York, Inc},
organization = {Springer-Verlag New York, Inc},
address = {Linz, Austria},
@@ -16193,7 +16194,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
volume = {28},
number = {10},
year = {1985},
- month = {10/1985},
+ month = oct,
pages = {1030 - 1044 },
abstract = {The large-scale automated transaction systems of the near future can be designed to protect the privacy and maintain the security of both individuals and organizations},
issn = {0001-0782},
@@ -16246,7 +16247,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
volume = {24},
number = {2},
year = {1981},
- month = {02/1981},
+ month = feb,
pages = {84 - 90},
abstract = {A technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication - in spite of an unsecured underlying telecommunication system. The technique does not require a universally trusted authority. One correspondent can remain anonymous to a second, while allowing the second to respond via an untraceable return address.
The technique can also be used to form rosters of untraceable digital pseudonyms from selected applications. Applicants retain the exclusive ability to form digital signatures corresponding to their pseudonyms. Elections in which any interested party can verify that the ballots have been properly counted are possible if anonymously mailed ballots are signed with pseudonyms from a roster of registered voters. Another use allows an individual to correspond with a record-keeping organization under a unique pseudonym which appears in a roster of acceptable clients},
@@ -16283,7 +16284,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
title = {Limitations of End-to-End Encryption in Secure Computer Networks},
number = {ESD-TR-78-158},
year = {1978},
- month = {08/1978},
+ month = aug,
institution = {The MITRE Corporation: Bedford MA, HQ Electronic Systems Division},
address = {Hanscom AFB, MA},
keywords = {traffic analysis},
@@ -16316,7 +16317,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
journal = {IEEE Transactions on Information Theory},
volume = {22},
year = {1976},
- month = {11/1976},
+ month = nov,
pages = {644-654},
abstract = {Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distribution channels and supply the equivalent of a written signature. This paper suggests ways to solve these currently open problems. It also discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
},
@@ -16331,7 +16332,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
journal = {The Quarterly Review of Biology },
volume = {46},
year = {1971},
- month = {03/1971},
+ month = mar,
pages = {35-57},
abstract = {A model is presented to account for the natural selection of what is termed reciprocally altruistic behavior. The model shows how selection can operate against the cheater (non-reciprocator) in the system. Three instances of altruistic behavior are discussed, the evolution of which the model can explain: (1) behavior involved in cleaning symbioses; (2) warning cries in birds; and (3) human reciprocal altruism. Regarding human reciprocal altruism, it is shown that the details of the psychological system that regulates this altruism can be explained by the model. Specifically, friendship, dislike, moralistic aggression, gratitude, sympathy, trust, suspicion, trustworthiness, aspects of guilt, and some forms of dishonesty and hypocrisy can be explained as important adaptations to regulate the altruistic system. Each individual human is seen as possessing altruistic and cheating tendencies, the expression of which is sensitive to developmental variables that were selected to set the tendencies at a balance appropriate to the local social and ecological environment},
keywords = {behavior, evolution, reciprocal altruism},
@@ -16356,7 +16357,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
journal = {The Quarterly Journal of Economics},
volume = {84},
year = {1970},
- month = {08/1970},
+ month = aug,
pages = {488-500},
abstract = {I. Introduction, 488.--II. The model with automobiles as an example, 489.--III. Examples and applications, 492.--IV. Counteracting institutions, 499.--V. Conclusion, 500},
url = { http://www.jstor.org/stable/1879431},
@@ -16404,7 +16405,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
volume = {8},
number = {2},
year = {1960},
- month = {06/1960},
+ month = jun,
pages = {300{\textendash}304},
keywords = {filing-erasure-coding},
url = {http://www.jstor.org/pss/2098968},
@@ -16441,7 +16442,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
journal = {PNAS. Proceedings of the National Academy of Sciences of the USA},
volume = {36},
year = {1950},
- month = {01/1950},
+ month = jan,
pages = {48-49},
abstract = {One may define a concept of an n-person game in which each player has a finite set of pure strategies and in which a definite set of payments to the n players corresponds to each n-tuple of pure strategies, one strategy being taken for each player. For mixed strategies, which are probability distributions over the pure strategies, the pay-off functions are the expectations of the players, thus becoming polylinear forms},
keywords = {n-persona game, strategy},
