commit 7846dae22bda909dc5e5e74391fe2f0631a76798
parent 190ee05d1c8fa893d2e9705b0bbcb4f01a92bcc9
Author: Nils Gillmann <ng0@n0.is>
Date: Sun, 7 Oct 2018 23:38:31 +0000
gnunetbib.bib: booktitles.
Signed-off-by: Nils Gillmann <ng0@n0.is>
Diffstat:
1 file changed, 15 insertions(+), 0 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -2592,6 +2592,7 @@ Five years ago a previous study examined the AS-level threat against client and
}
@conference {DBLP:conf/sss/Kermarrec09,
title = {Challenges in Personalizing and Decentralizing the Web: An Overview of GOSSPLE},
+ booktitle = {Challenges in Personalizing and Decentralizing the Web: An Overview of GOSSPLE},
year = {2009},
pages = {1--16},
www_section = {https://bibliography.gnunet.org},
@@ -5525,6 +5526,7 @@ Although several solutions exist in the relevant literature for this problem, th
}
@conference {2007_9,
title = {ParaNets: A Parallel Network Architecture for Challenged Networks},
+ booktitle = {ParaNets: A Parallel Network Architecture for Challenged Networks},
year = {2007},
month = mar,
abstract = {Networks characterized by challenges, such as intermittent connectivity, network heterogeneity, and large delays, are called "challenged networks". We propose a novel network architecture for challenged networks dubbed Parallel Networks, or, ParaNets. The vision behind ParaNets is to have challenged network protocols operate over multiple heterogenous networks, simultaneously available, through one or more devices. We present the ParaNets architecture and discuss its short-term challenges and longterm implications. We also argue, based on current research trends and the ParaNets architecture, for the evolution of the conventional protocol stack to a more flexible cross-layered protocol tree. To demonstrate the potential impact of ParaNets, we use Delay Tolerant Mobile Networks (DTMNs) as a representative challenged network over which we evaluate ParaNets. Our ultimate goal in this paper is to open the way for further work in challenged networks using ParaNets as the underlying architecture},
@@ -5590,6 +5592,7 @@ In this paper, our focus is on the two-party case, although most of our results
}
@conference {Dwork2007,
title = {The Price of Privacy and the Limits of LP Decoding},
+ booktitle = {The Price of Privacy and the Limits of LP Decoding},
year = {2007},
pages = {85--94},
author = {Cynthia Dwork and Frank D. McSherry and Kunal Talwar}
@@ -5906,6 +5909,7 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
}
@conference {Li2007-tcloseness,
title = {t-Closeness: Privacy Beyond k-Anonymity and $\ell$-Diversity},
+ booktitle = {t-Closeness: Privacy Beyond k-Anonymity and $\ell$-Diversity},
year = {2007},
pages = {106--115},
author = {Ninghui Li and Tiancheng Li and Suresh Venkatasubramanian}
@@ -6319,6 +6323,7 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
year = {2006},
abstract = {The disruptive advent of peer-to-peer (P2P) file sharing in 2000 attracted significant interest. P2P networks have matured from their initial form, unstructured overlays, to structured overlays like distributed hash tables (DHTs), which are considered state-of-the-art. There are huge efforts to improve their performance. Various P2P applications like distributed storage and application-layer multicast were proposed. However, little effort was spent to understand the communication abstraction P2P overlays supply. Only when it is understood, the reach of P2P ideas will significantly broaden. Furthermore, this clarification reveals novel approaches and highlights future directions. In this paper, we reconsider well-known P2P overlays, linking them to insights from distributed systems research. We conclude that the main communication abstraction is that of a virtual address space or application-specific naming. On this basis, P2P systems build a functional layer implementing, for example lookup, indirection and distributed processing. Our insights led us to identify interesting and unexplored points in the design space},
keywords = {distributed hash table, P2P},
+ journal = {unknown},
www_section = {http://www3.interscience.wiley.com/journal/109858517/abstract},
author = {Cramer Curt and Thomas Fuhrmann}
}
@@ -7299,6 +7304,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
abstract = {Many clustering protocols for mobile ad hoc networks (MANETs) have been proposed in the literature. With only one exception so far (1), all these protocols are proactive, thus wasting bandwidth when their function is not currently needed. To reduce the signalling traffic load, reactive clustering may be employed.We have developed a clustering protocol named {\textquotedblleft}On-Demand Group Mobility-Based Clustering{\textquotedblright} (ODGMBC) (2), (3) which is reactive. Its goal is to build clusters as a basis for address autoconfiguration and hierarchical routing. In contrast to the protocol described in ref. (1), the design process especially addresses the notions of group mobility and of multi-hop clusters in a MANET. As a result, ODGMBC maps varying physical node groups onto logical clusters. In this paper, ODGMBC is described. It was implemented for the ad hoc network simulator GloMoSim (4) and evaluated using several performance indicators. Simulation results are promising and show that ODGMBC leads to stable clusters. This stability is advantageous for autoconfiguration and routing mechansims to be employed in conjunction with the clustering algorithm},
keywords = {mobile Ad-hoc networks, multi-hop networks},
doi = {10.1108/17427370780000143},
+ publisher = {unknown},
www_section = {http://www.emeraldinsight.com/journals.htm?articleid=1615724\&show=pdf},
author = {Cramer, Curt and Oliver Stanze and Kilian Weniger and Martina Zitterbart}
}
@@ -7481,6 +7487,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
type = {Tech report},
address = {Amherst, MA},
abstract = {Many security mechanisms are based on specific assumptions of identity and are vulnerable to attacks when these assumptions are violated. For example, impersonation is the well-known consequence when authenticating credentials are stolen by a third party. Another attack on identity occurs when credentials for one identity are purposely shared by multiple individuals, for example to avoid paying twice for a service. In this paper, we survey the impact of the Sybil attack, an attack against identity in which an individual entity masquerades as multiple simultaneous identities. The Sybil attack is a fundamental problem in many systems, and it has so far resisted a universally applicable solution},
+ journal = {unknown},
keywords = {anonymity, security, Sybil attack},
www_section = {http://prisms.cs.umass.edu/brian/pubs/levine.sybil.tr.2006.pdf},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Tech\%20Report\%20-\%20A\%20Survey\%20of\%20Solutions\%20to\%20the\%20Sybil\%20Attack.pdf},
@@ -8063,6 +8070,7 @@ This paper describes the design and implementation of rcc, the router configurat
}
@conference {Wang05erasure-codingbased,
title = {Erasure-coding based routing for opportunistic networks},
+ booktitle = {Erasure-coding based routing for opportunistic networks},
year = {2005},
pages = {229--236},
publisher = {ACM Press},
@@ -9102,6 +9110,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
}
@conference {cramer05selfstabilizing,
title = {Self-Stabilizing Ring Networks on Connected Graphs},
+ booktitle = {Self-Stabilizing Ring Networks on Connected Graphs},
year = {2005},
type = {Technical Report},
address = {University of Karlsruhe (TH), Fakultaet fuer Informatik, Technical Report 2005-5},
@@ -10276,6 +10285,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
}
@conference {2004_8,
title = {A Peer-to-Peer File Sharing System for Wireless Ad-Hoc Networks},
+ booktitle = {A Peer-to-Peer File Sharing System for Wireless Ad-Hoc Networks},
year = {2004},
abstract = {File sharing in wireless ad-hoc networks in a peer to peer manner imposes many challenges that make conventional peer-to-peer systems operating on wire-line networks inapplicable for this case. Information and workload distribution as well as routing are major problems for members of a wireless ad-hoc network, which are only aware of their neighborhood. In this paper we propose a system that solves peer-to-peer filesharing problem for wireless ad-hoc networks. Our system works according to peer-to-peer principles, without requiring a central server, and distributes information regarding the location of shared files among members of the network. By means of a {\textquotedblleft}hashline{\textquotedblright} and forming a tree-structure based on the topology of the network, the system is able to answer location queries, and also discover and maintain routing information that is used to transfer files from a source-peer to another peer},
author = {unknown},
@@ -12237,6 +12247,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
}
@conference {Klemm03aspecial-purpose,
title = {A Special-Purpose Peer-to-Peer File Sharing System for Mobile Ad Hoc Networks},
+ booktitle = {A Special-Purpose Peer-to-Peer File Sharing System for Mobile Ad Hoc Networks},
year = {2003},
abstract = {Establishing peer-to-peer (P2P) file sharing for mobile ad hoc networks ANET) requires the construction of a search algorithm for transmitting queries and search results as well as the development of a transfer protocol for downloading files matching a query. In this paper, we present a special-purpose system for searching and file transfer tailored to both the characteristics of MANET and the requirements of peer-to-peer file sharing. Our approach is based on an application layer overlay networlc As innovative feature, overlay routes are set up on demand by the search algorithm, closely matching network topology and transparently aggregating redundant transfer paths on a per-file basis. The transfer protocol guarantees high data rates and low transmission overhead by utilizing overlay routes. In a detailed ns2 simulation study, we show that both the search algorithm and the transfer protocol outperform offthe -shelf approaches based on a P2P file sharing system for the wireline Internet, TCP and a MANET routing protocol},
keywords = {ad-hoc networks, file-sharing, P2P},
@@ -13000,6 +13011,7 @@ The read-only file system makes the security of published content independent fr
}
@conference {2002_1,
title = {Finite-length analysis of low-density parity-check codes on the binary erasure channel},
+ booktitle = {Finite-length analysis of low-density parity-check codes on the binary erasure channel},
year = {2002},
month = jan,
abstract = {In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The main result is an expression for the exact average bit and block erasure probability for a given regular ensemble of LDPC codes when decoded iteratively. We also give expressions for upper bounds on the average bit and block erasure probability for regular LDPC ensembles and the standard random ensemble under maximum-likelihood (ML) decoding. Finally, we present what we consider to be the most important open problems in this area},
@@ -13066,6 +13078,7 @@ The read-only file system makes the security of published content independent fr
}
@conference {DBLP:conf/eurocrypt/RussellW02,
title = {How to Fool an Unbounded Adversary with a Short Key},
+ booktitle = {How to Fool an Unbounded Adversary with a Short Key},
year = {2002},
pages = {133--148},
author = {Alexander Russell and Hong Wang}
@@ -13182,6 +13195,7 @@ The read-only file system makes the security of published content independent fr
}
@conference {Muthitacharoen02ivy:a,
title = {Ivy: A Read/Write Peer-to-Peer File System},
+ booktitle = {Ivy: A Read/Write Peer-to-Peer File System},
year = {2002},
pages = {31--44},
abstract = {Ivy is a multi-user read/write peer-to-peer file system. Ivy has no centralized or dedicated components, and it provides useful integrity properties without requiring users to fully trust either the underlying peer-to-peer storage system or the other users of the file system},
@@ -13670,6 +13684,7 @@ We further investigate this intriguing proposal. Specifically, we
}
@conference {Byers02simpleload,
title = {Simple Load Balancing for Distributed Hash Tables},
+ booktitle = {Simple Load Balancing for Distributed Hash Tables},
year = {2002},
pages = {80--87},
abstract = {Distributed hash tables have recently become a useful building block for a variety of distributed applications. However, current schemes based upon consistent hashing require both considerable implementation complexity and substantial storage overhead to achieve desired load balancing goals. We argue in this paper that these goals can be achieved more simply and more cost-effectively. First, we suggest the direct application of the power of two choices paradigm, whereby an item is stored at the less loaded of two (or more) random alternatives. We then consider how associating a small constant number of hash values with a key can naturally be extended to support other load balancing strategies, including load-stealing or load-shedding, as well as providing natural fault-tolerance mechanisms},
