commit ae0ec8a0a8f44f6b2fbacb74851415a01971ddb3
parent 08ca4041589a255c693e1680fab38cad233e39d4
Author: Nils Gillmann <ng0@n0.is>
Date: Sun, 7 Oct 2018 14:08:49 +0000
fix pages, non-ascii
Signed-off-by: Nils Gillmann <ng0@n0.is>
Diffstat:
| M | gnunetbib.bib | | | 139 | +++++++++++++++++++++++++++++++++++++++---------------------------------------- |
1 file changed, 69 insertions(+), 70 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -2127,7 +2127,7 @@ Beyond the theoretical interest in modeling KDFs, this work is intended to addre
volume = {M.S},
year = {2010},
month = sep,
- pages = {66},
+ pages = {0--66},
school = {University of Helsinki},
type = {Master{\textquoteright}s Thesis},
address = {Helsinki},
@@ -2174,7 +2174,7 @@ To evaluate the platform{\textquoteright}s suitability for application developme
journal = {Journal of Privacy and Confidentiality},
volume = {2},
year = {2010},
- pages = {93-107},
+ pages = {93--107},
abstract = {In 1977 Tore Dalenius articulated a desideratum for statistical databases: nothing about an individual should be learnable from the database that cannot be learned without access to the database. We give a general impossibility result showing that a natural formalization of Dalenius{\textquoteright} goal cannot be achieved if the database is useful. The key obstacle is the side information that may be available to an adversary. Our results hold under very general conditions regarding the database, the notion of privacy violation, and the notion of utility.</p> <p>Contrary to intuition, a variant of the result threatens the privacy even of someone not in the database. This state of affairs motivated the notion of differential privacy [15, 16], a strong ad omnia privacy which, intuitively, captures the increased risk to one{\textquoteright}s privacy incurred by participating in a database},
www_section = {http://research.microsoft.com/apps/pubs/default.aspx?id=135704},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DisclousrePrevention2010Dwork.pdf},
@@ -2195,7 +2195,7 @@ To evaluate the platform{\textquoteright}s suitability for application developme
series = {Lecture Notes in Computer Science},
volume = {6205},
year = {2010},
- pages = {202-219},
+ pages = {202--219},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
keywords = {anonymous communication, anonymous IM, anonymous voice, Drac, F2F},
@@ -2253,7 +2253,7 @@ method detects the most efficient attacks with a very small false-negative rate,
volume = {3},
year = {2010},
month = mar,
- pages = {52-66},
+ 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},
doi = {10.1007/s12083-009-0044-8},
@@ -2296,7 +2296,7 @@ outperforms methods that use only one type of social content. Second, we present
title = {How to Build Complex, Large-Scale Emulated Networks},
booktitle = {TRIDENTCOM},
year = {2010},
- pages = {3-18},
+ pages = {3--18},
keywords = {autonetkit, emulation, netkit, network, testbed, virtualization},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/AutoNetkit_0.pdf},
author = {Hung X. Nguyen and Roughan, Matthew and Knight, Simon and Nick Falkner and Maennel, Olaf and Randy Bush}
@@ -2306,7 +2306,7 @@ outperforms methods that use only one type of social content. Second, we present
volume = {PhD},
year = {2010},
month = may,
- pages = {209},
+ pages = {0--209},
school = {University College London},
address = {London},
abstract = {A well known problem in peer-to-peer overlays is that no single entity has control over the software, hardware and configuration of peers. Thus, each peer can selfishly adapt its behaviour to maximise its benefit from the overlay. This thesis is concerned with the modelling and design of incentive mechanisms for QoS-overlays: resource allocation protocols that provide strategic peers with participation incentives, while at the same time optimising the performance of the peer-to-peer distribution overlay. The contributions of this thesis are as follows. First, we present PledgeRoute, a novel contribution accounting system that can be used, along with a set of reciprocity policies, as an incentive mechanism to encourage peers to contribute resources even when users are not actively consuming overlay services. This mechanism uses a decentralised credit network, is resilient to sybil attacks, and allows peers to achieve time and space deferred contribution reciprocity. Then, we present a novel, QoS-aware resource allocation model based on Vickrey auctions that uses PledgeRoute as a substrate. It acts as an incentive mechanism by providing efficient overlay construction, while at the same time allocating increasing service quality to those peers that contribute more to the network. The model is then applied to lagsensitive chunk swarming, and some of its properties are explored for different peer delay distributions. When considering QoS overlays deployed over the best-effort Internet, the quality received by a client cannot be adjudicated completely to either its serving peer or the intervening network between them. By drawing parallels between this situation and well-known hidden action situations in microeconomics, we propose a novel scheme to ensure adherence to advertised QoS levels. We then apply it to delay-sensitive chunk distribution overlays and present the optimal contract payments required, along with a method for QoS contract enforcement through reciprocative strategies. We also present a probabilistic model for application-layer delay as a function of the prevailing network conditions. Finally, we address the incentives of managed overlays, and the prediction of their behaviour. We propose two novel models of multihoming managed overlay incentives in which overlays can freely allocate their traffic flows between different ISPs. One is obtained by optimising an overlay utility function with desired properties, while the other is designed for data-driven least-squares fitting of the cross elasticity of demand. This last model is then used to solve for ISP profit maximisation},
@@ -2330,7 +2330,7 @@ outperforms methods that use only one type of social content. Second, we present
title = {Managing Distributed Applications Using Gush},
booktitle = {TRIDENTCOM},
year = {2010},
- pages = {401-411},
+ pages = {401--411},
keywords = {distributed applications, emulation, GENI, PlanetLab, testbed},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/gush.pdf},
author = {Jeannie R. Albrecht and Danny Yuxing Huang}
@@ -2339,7 +2339,7 @@ outperforms methods that use only one type of social content. Second, we present
title = {A Novel Testbed for P2P Networks},
booktitle = {TRIDENTCOM},
year = {2010},
- pages = {69-83},
+ pages = {69--83},
keywords = {emulation, P2P, testbed},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/A\%20Novel\%20Testbed\%20for\%20P2P\%20Networks.pdf},
author = {Pekka H. J. Per{\"a}l{\"a} and Jori P. Paananen and Milton Mukhopadhyay and Jukka-Pekka Laulajainen}
@@ -2825,7 +2825,7 @@ This paper presents HEAP, HEterogeneity-Aware gossip Protocol, where nodes dynam
booktitle = {INFOCOM{\textquoteright}09. Proceedings of the 28th IEEE International Conference on Computer Communications},
year = {2009},
month = apr,
- pages = {972-980},
+ pages = {972--980},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Rio de Janeiro, Brazil},
@@ -2856,7 +2856,7 @@ This paper presents HEAP, HEterogeneity-Aware gossip Protocol, where nodes dynam
volume = {Master Science of Artificial Intelligence},
year = {2009},
month = dec,
- pages = {93},
+ pages = {0--93},
school = {Maastricht University},
type = {Master Thesis},
address = {Maastricht, Netherlands},
@@ -2878,7 +2878,7 @@ pseudo-random simulations and limiting simulation lengths, while other technique
series = {Lecture Notes in Computer Science},
volume = {5888},
year = {2009},
- pages = {21-40},
+ pages = {21--40},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
abstract = {In this paper, we focus on the specific problems of Private Matching, Set Disjointness and Cardinality of Set Intersection in information theoretic settings. Specifically, we give perfectly secure protocols for the above problems in n party settings, tolerating a computationally unbounded semi-honest adversary, who can passively corrupt at most t < n/2 parties. To the best of our knowledge, these are the first such information theoretically secure protocols in a multi-party setting for all the three problems. Previous solutions for Distributed Private Matching and Cardinality of Set Intersection were cryptographically secure and the previous Set Disjointness solution, though information theoretically secure, is in a two party setting. We also propose a new model for Distributed Private matching which is relevant in a multi-party setting},
@@ -2909,7 +2909,7 @@ pseudo-random simulations and limiting simulation lengths, while other technique
series = {Lecture Notes in Computer Science},
volume = {5444},
year = {2009},
- pages = {1-18},
+ pages = {1--18},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
abstract = {We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common unbiased random bit, guaranteeing that even if one of the parties is malicious, it cannot significantly bias the output of the honest party. A classical result by Cleve [STOC {\textquoteright}86] showed that for any two-party r-round coin-flipping protocol there exists an efficient adversary that can bias the output of the honest party by Ω(1/r). However, the best previously known protocol only guarantees O(1/√r) bias, and the question of whether Cleve{\textquoteright}s bound is tight has remained open for more than twenty years.
@@ -2945,7 +2945,7 @@ In this paper we establish the optimal trade-off between the round complexity an
booktitle = {P2P{\textquoteright}09--Proceedings of the 9th International Conference on Peer-to-Peer},
year = {2009},
month = sep,
- pages = {99-100},
+ 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},
keywords = {P2P, peer-to-peer networking, PeerSim, simulation},
@@ -2975,7 +2975,7 @@ In this paper we establish the optimal trade-off between the round complexity an
booktitle = {International Conference on Advances in Recent Technologies in Communication and Computing, 2009. ARTCom {\textquoteright}09},
year = {2009},
month = oct,
- pages = {77-80},
+ 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},
doi = {10.1109/ARTCom.2009.31},
@@ -3053,7 +3053,7 @@ We then strengthen the original congestion attack by combining it with a novel b
booktitle = {INFOCOM{\textquoteright}09. Proceedings of the 28th IEEE International Conference on Computer Communications},
year = {2009},
month = apr,
- pages = {73-81},
+ pages = {73--81},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Rio de Janeiro, Brazil},
@@ -3144,7 +3144,7 @@ Unlike previous proposals for P2P anonymity schemes, Torsk does not require all
series = {Lecture Notes in Computer Science},
volume = {Volume 5918/2009},
year = {2009},
- pages = {65-76},
+ pages = {65--76},
abstract = {In peer-to-peer storage systems, peers can freely join and leave the system at any time. Ensuring high data availability in such an environment is a challenging task. In this paper we analyze the costs of achieving data availability in fully decentralized peer-to-peer systems. We mainly address the problem of churn and what effect maintaining availability has on network bandwidth. We discuss two different redundancy techniques -- replication and erasure coding -- and consider their monitoring and repairing costs analytically. We calculate the bandwidth costs using basic costs equations and two different Markov reward models. One for centralized monitoring system and the other for distributed monitoring. We show a comparison of the numerical results accordingly. Depending on these results, we determine the best redundancy and maintenance strategy that corresponds to peer{\textquoteright}s failure probability},
keywords = {distributed storage, Markov chain},
issn = {978-3-642-10864-8},
@@ -3205,7 +3205,7 @@ mous communication},
volume = {Doctor of Philosophy},
year = {2009},
month = dec,
- pages = {211},
+ pages = {0--211},
school = {University of Wollongog, New South Wales, Australia},
type = {PhD},
address = {Wollongog, New South Wales, Australia},
@@ -3259,7 +3259,7 @@ Finally, it is argued that any future development in distributed constraint sati
booktitle = {INFOCOM 2009. The 28th IEEE International Conference on Computer Communications},
year = {2009},
month = apr,
- pages = {343-351},
+ pages = {343--351},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Rio de Janeiro, Brazil},
@@ -3314,7 +3314,7 @@ Finally, it is argued that any future development in distributed constraint sati
booktitle = {INFOCOM 2009. The 28th IEEE International Conference on Computer Communications},
year = {2009},
month = apr,
- pages = {540-548},
+ pages = {540--548},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Rio de Janeiro},
@@ -3346,7 +3346,7 @@ techniques, we show how to optimally modify packets in real-time to reduce the a
series = {Lecture Notes in Computer Science},
volume = {Volume 5918/2009},
year = {2009},
- pages = {174-184},
+ pages = {174--184},
abstract = {Network Coordinates are a basic building block for most peer-to-peer applications nowadays. They optimize the peer selection process by allowing the nodes to preferably attach to peers to whom they then experience a low round trip time. Albeit there has been substantial research effort in this topic over the last years, the optimization of the various network coordinate algorithms has not been pursued systematically yet. Analyzing the well-known Vivaldi algorithm and its proposed optimizations with several sets of extensive Internet traffic traces, we found that in face of current Internet data most of the parameters that have been recommended in the original papers are a magnitude too high. Based on this insight, we recommend modified parameters that improve the algorithms{\textquoteright} performance significantly},
isbn = {978-3-642-10864-8},
issn = {0302-9743},
@@ -3671,7 +3671,7 @@ To evaluate our novel attack, we used a real-world anonymizing system, TOR. We s
volume = {Engineering},
year = {2008},
month = feb,
- pages = {193},
+ pages = {0--193},
school = {Universit{\"a}t Fridericiana (TH) },
type = {Doctoral},
address = {Karlsruhe, Germany},
@@ -3686,7 +3686,7 @@ Often, part of the problem is to access large files in a share way. Until now, t
volume = {38},
year = {2008},
month = aug,
- pages = {976-981},
+ 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},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/IEEE\%20Transactions\%20on\%20Systems\%20-\%20Descentralized\%20learning.pdf},
@@ -3810,7 +3810,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
title = {Estimating The Size Of Peer-To-Peer Networks Using Lambert{\textquoteright}s W Function},
booktitle = {Grid Computing--Achievements and Prospects},
year = {2008},
- pages = {61-72},
+ pages = {61--72},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
address = {New York, NY, USA},
@@ -3844,7 +3844,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
booktitle = {ICC{\textquoteright}08--Proceedings of the 2008 IEEE International Conference on Communications},
year = {2008},
month = may,
- pages = {65-69},
+ pages = {65--69},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Beijing, China},
@@ -3973,7 +3973,7 @@ To deal with such networks researchers have suggested to use flooding-based rout
title = {IgorFs: A Distributed P2P File System},
booktitle = {Peer-to-Peer Computing},
year = {2008},
- pages = {77-78},
+ pages = {77--78},
abstract = {IgorFs is a distributed, decentralized peer-to-peer (P2P) file system that is completely transparent to the user. It is built on top of the Igor peer-to-peer overlay network, which is similar to Chord, but provides additional features like service orientation or proximity neighbor and route selection. IgorFs offers an efficient means to publish data files that are subject to frequent but minor modifications. In our demonstration we show two use cases for IgorFs: the first example is (static) software-distribution and the second example is (dynamic) file distribution},
keywords = {distributed storage, P2P},
doi = {10.1109/P2P.2008.19},
@@ -4082,7 +4082,7 @@ We study this trade-off in two P2P anonymous systems, Salsa and AP3. In both cas
title = {Large-scale Virtualization in the Emulab Network Testbed},
booktitle = {USENIX Annual Technical Conference},
year = {2008},
- pages = {113-128},
+ pages = {113--128},
keywords = {emulab, emulation, testbed, virtualization},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/emulab.pdf},
author = {Mike Hibler and Robert Ricci and Leigh Stoller and Jonathon Duerig and Shashi Guruprasad and Tim Stack and Kirk Webb and Jay Lepreau}
@@ -4332,7 +4332,7 @@ In this paper, we demonstrate a payment scheme that can be used to compensate no
journal = {New Mathematics and Natural Computation},
volume = {4},
year = {2008},
- pages = {343-357},
+ pages = {343--357},
abstract = {Monte-Carlo Tree Search (MCTS) is a new best-first search guided by the results of Monte-Carlo simulations. In this article, we introduce two progressive strategies for MCTS, called progressive bias and progressive unpruning. They enable the use of relatively time-expensive heuristic knowledge without speed reduction. Progressive bias directs the search according to heuristic knowledge. Progressive unpruning first reduces the branching factor, and then increases it gradually again. Experiments assess that the two progressive strategies significantly improve the level of our Go program Mango. Moreover, we see that the combination of both strategies performs even better on larger board sizes},
keywords = {computer go, MCTS heuristic search, Monte-Carlo Tree Search},
doi = {10.1142/S1793005708001094},
@@ -4590,7 +4590,7 @@ To sample the results, we show that web traffic makes up the majority of the con
title = {The Underlay Abstraction in the Spontaneous Virtual Networks (SpoVNet) Architecture},
booktitle = {Proc. 4th EuroNGI Conf. on Next Generation Internet Networks (NGI 2008)},
year = {2008},
- pages = {115-122},
+ pages = {115--122},
address = {Krakow, Poland},
abstract = {Next generation networks will combine many heterogeneous access technologies to provide services to a large number of highly mobile users while meeting their demands for quality of service, robustness, and security. Obviously, this is not a trivial task and many protocols fulfilling some combination of these requirements have been proposed. However, non of the current proposals meets all requirements, and the deployment of new applications and services is hindered by a patchwork of protocols. This paper presents Spontaneous Virtual Networks (SpoVNet), an architecture that fosters the creation of new applications and services for next generation networks by providing an underlay abstraction layer. This layer applies an overlay-based approach to cope with mobility, multi-homing, and heterogeneity. For coping with network mobility, it uses a SpoVNet-specific addressing scheme, splitting node identifiers from network locators and providing persistent connections by transparently switching locators. To deal with multihoming it transparently chooses the most appropriate pair of network locators for each connection. To cope with network and protocol heterogeneity, it uses dedicated overlay nodes, e.g., for relaying between IPv4 and IPv6 hosts},
keywords = {heterogeneity, robustness},
@@ -5067,7 +5067,7 @@ In this paper, we investigate this claim against other low latency anonymous net
booktitle = {ICN{\textquoteright}07--Proceedings of the 6th International Conference on Networking},
year = {2007},
month = apr,
- pages = {64--},
+ pages = {0--64},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Sainte-Luce, Martinique, France},
@@ -5124,7 +5124,7 @@ In this paper, we investigate this claim against other low latency anonymous net
title = {A Game Theoretic Model of a Protocol for Data Possession Verification},
journal = {A World of Wireless, Mobile and Multimedia Networks, International Symposium on},
year = {2007},
- pages = {1-6},
+ pages = {1--6},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
abstract = {This paper discusses how to model a protocol for the verification of data possession intended to secure a peer-to-peer storage application. The verification protocol is a primitive for storage assessment, and indirectly motivates nodes to behave cooperatively within the application. The capability of the protocol to enforce cooperation between a data holder and a data owner is proved theoretically by modeling the verification protocol as a Bayesian game, and demonstrating that the solution of the game is an equilibrium where both parties are cooperative},
@@ -5201,7 +5201,7 @@ Peers are identified by the so called KAD ID, which was up to now assumed to rem
volume = {25},
year = {2007},
month = aug,
- pages = {1161-1172},
+ 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},
issn = {0733-8716 },
@@ -5351,7 +5351,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
series = {Advances in Natural Computation},
volume = {4},
year = {2007},
- pages = {262},
+ pages = {0--262},
publisher = {World Scientific Publishing Co. Pte. Ltd},
organization = {World Scientific Publishing Co. Pte. Ltd},
address = {Singapore},
@@ -5375,7 +5375,7 @@ Finally, we give a distributed protocol for sampling and obfuscating each of the
booktitle = {SAINT{\textquoteright}07. Proceedings of the 2007 Symposium on Applications and the Internet},
year = {2007},
month = jan,
- pages = {58},
+ pages = {0--58},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Hiroshima, Japan},
@@ -5436,7 +5436,7 @@ message to an elliptic curve},
booktitle = {INFOCOM 2007. 26th IEEE International Conference on Computer Communications},
year = {2007},
month = may,
- pages = {1091-1099},
+ pages = {1091--1099},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Anchorage, Alaska, USA},
@@ -5469,7 +5469,7 @@ message to an elliptic curve},
series = {Lecture Notes in Computer Science},
volume = {4450},
year = {2007},
- pages = {343-360},
+ pages = {343--360},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
abstract = {Damg{\r a}rd et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposition protocol. The bit-decomposition protocol is a very powerful tool because it enables bit-oriented operations even if shared secrets are given as elements in the field. However, the bit-decomposition protocol is relatively expensive.
@@ -5587,7 +5587,7 @@ We also report strong efficiency gains over OptAPO in experiments on three probl
series = {Lecture Notes in Computer Science},
volume = {4450},
year = {2007},
- pages = {330-342},
+ pages = {330--342},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
abstract = {Yao{\textquoteright}s classical millionaires{\textquoteright} problem is about securely determining whether x > y, given two input values x,y, which are held as private inputs by two parties, respectively. The output x > y becomes known to both parties.
@@ -5710,7 +5710,7 @@ Finally we study a problem that arises when we combine probabilities with nondet
volume = {Computer Science},
year = {2007},
month = jun,
- pages = {79},
+ pages = {0--79},
school = {Technische Universit{\"a}t M{\"u}nchen},
type = {Diplomarbeit},
address = {Munich, Germany},
@@ -5773,7 +5773,7 @@ We also discuss various proposed countermeasures designed to detect, thwart or l
volume = {Computer Science},
year = {2007},
month = nov,
- pages = {74},
+ pages = {0--74},
school = {Technische Universit{\"a}t M{\"u}nchen},
address = {Munich, Germany},
abstract = {Distributed file systems have been a topic of interest for a long time and there are many file systems that are distributed in one way or another. However most distributed file systems are only reasonably usable within a local network of computers and some main tasks are still delegated to a very small number of servers.
@@ -5790,7 +5790,7 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
booktitle = {KiVS 2007},
year = {2007},
month = feb,
- pages = {457-468},
+ pages = {457--468},
publisher = {VDE Verlag},
organization = {VDE Verlag},
address = {Bern, Switzerland},
@@ -5841,7 +5841,7 @@ Usually the strategy to solve this type of problem is an encrypted multicast. Th
title = {Security Rationale for a Cooperative Backup Service for Mobile Devices},
booktitle = {LADC},
year = {2007},
- pages = {212-230},
+ pages = {212--230},
abstract = {Mobile devices (e.g., laptops, PDAs, cell phones) are increasingly relied on but are used in contexts that put them at risk of physical damage, loss or theft. This paper discusses security considerations that arise in the design of a cooperative backup service for mobile devices. Participating devices leverage encounters with other devices to temporarily replicate critical data. Anyone is free to participate in the cooperative service, without requiring any prior trust relationship with other participants. In this paper, we identify security threats relevant in this context as well as possible solutions and discuss how they map to low-level security requirements related to identity and trust establishment. We propose self-organized, policy-neutral mechanisms that allow the secure designation and identification of participating devices. We show that they can serve as a building block for a wide range of cooperation policies that address most of the security threats we are concerned with. We conclude on future directions},
keywords = {backup, reputation, self-organization},
doi = {10.1007/978-3-540-75294-3},
@@ -5953,7 +5953,7 @@ We pose a grand challenge for anonymity: the development of a network architectu
title = {Towards Fair Event Dissemination},
booktitle = {ICDCSW {\textquoteright}07: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops},
year = {2007},
- pages = {63},
+ pages = {0--63},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Washington, DC, USA},
@@ -6091,7 +6091,7 @@ In this paper we describe Valgrind, a DBI framework designed for building heavyw
volume = {Communication Systems},
year = {2006},
month = oct,
- pages = {159},
+ pages = {0--159},
school = {Eidgen{\"o}ssische Technische Hochschule Z{\"u}rich (ETH)},
type = {Master{\textquoteright}s Thesis},
address = {Zurich, Switzerland},
@@ -6148,7 +6148,7 @@ In this position paper we focus on the network effects of usability on privacy a
journal = {Proc. 2nd Symposium on Trustworthy Global Computing, LNCS. Springer},
volume = {4661/2007},
year = {2006},
- pages = {281-300},
+ pages = {281--300},
abstract = {We propose a framework in which anonymity protocols are interpreted as particular kinds of channels, and the degree of anonymity provided by the protocol as the converse of the channel{\textquoteright}s capacity. We also investigate how the adversary can test the system to try to infer the user{\textquoteright}s identity, and we study how his probability of success depends on the characteristics of the channel. We then illustrate how various notions of anonymity can be expressed in this framework, and show the relation with some definitions of probabilistic anonymity in literature.
This work has been partially supported by the INRIA DREI {\'E}quipe Associ{\'e}e PRINTEMPS. The work of Konstantinos Chatzikokolakis and Catuscia Palamidessi has been also supported by the INRIA ARC project ProNoBiS},
keywords = {anonymity},
@@ -6287,7 +6287,7 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
booktitle = {ChinaCom {\textquoteright}06. First International Conference on Communications and Networking in China},
year = {2006},
month = oct,
- pages = {1-5},
+ pages = {1--5},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Beijing, China},
@@ -6301,7 +6301,7 @@ Alpha-mixing is an approach that can be added to traditional batching strategies
@book {2006_2,
title = {Combinatorial Auctions},
year = {2006},
- pages = {649},
+ pages = {0--649},
publisher = {MIT Press},
organization = {MIT Press},
address = {Cambridge, MA},
@@ -14686,7 +14686,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
title = {Anonymity, Unobservability, and Pseudonymity--A Proposal for Terminology},
booktitle = {Workshop on Design Issues in Anonymity and Unobservability},
year = {2000},
- pages = {1-9},
+ pages = {1--9},
author = {Andreas Pfitzmann and Marit K{\"o}hntopp}
}
@conference {mitkuro,
@@ -14752,7 +14752,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
title = {Energy-Efficient Communication Protocol for Wireless Microsensor Networks},
booktitle = {HICSS {\textquoteright}00: Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8},
year = {2000},
- pages = {8020},
+ pages = {0--8020},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Washington, DC, USA},
@@ -15351,7 +15351,7 @@ This exposition presents a model to formally study such algorithms. This model,
number = {1},
year = {1999},
month = jan,
- pages = {3-21},
+ 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},
www_section = {http://econpapers.repec.org/RePEc:bla:restud:v:66:y:1999:i:1:p:3-21},
@@ -15445,7 +15445,7 @@ This exposition presents a model to formally study such algorithms. This model,
volume = {26},
number = {2},
year = {1998},
- pages = {2},
+ pages = {0--2},
publisher = {ACM},
address = {New York, NY, USA},
issn = {0163-5999},
@@ -15552,13 +15552,13 @@ This exposition presents a model to formally study such algorithms. This model,
}
@book {Ogata97faulttolerant,
title = {Fault Tolerant Anonymous Channel},
- booktitle = { Information and Communications Security},
- series = { Lecture Notes in Computer Science},
+ booktitle = {Information and Communications Security},
+ series = {Lecture Notes in Computer Science},
volume = {1334/1997},
year = {1997},
- pages = {440-444},
- publisher = { Springer Berlin / Heidelberg},
- organization = { Springer Berlin / Heidelberg},
+ pages = {440--444},
+ publisher = {Springer Berlin / Heidelberg},
+ organization = {Springer Berlin / Heidelberg},
abstract = {This paper describes a zero-knowledge proof that a mix in onion routing can perform in order to proof that it did route the messages properly. This allows the deployment of a mix-net where malicious mixes can be detected without using dummy-traffic to probe for correctness. Technical},
www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.19.357\&rep=rep1\&type=url\&i=0},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fault.dvi_.pdf},
@@ -15688,8 +15688,7 @@ for future loss recovery. With the adaptive algorithm, our reliable multicast de
pages = {137--150},
publisher = {Springer-Verlag, LNCS 1174},
organization = {Springer-Verlag, LNCS 1174},
- abstract = {Abstract. This paper describes an architecture, Onion Routing, that limits a network{\textquoteright}s vulnerability to trac analysis. The architecture provides anonymous socket connections by means of proxy servers. It provides real-time, bi-directional, nonymous communication for any protocol that can be adapted to use a proxy service. Speci cally, the architecture provides for bi-directional communication even though no-one but the initiator{\textquoteright}s proxy server knows anything but previous and next hops
-in the communication chain. This implies that neither the respondent nor his proxy server nor any external observer need know the identity of the initiator or his proxy server. A prototype of Onion Routing has been implemented. This prototype works with HTTP (World Wide Web) proxies. In addition, an analogous proxy for TELNET has been implemented. Proxies for FTP and SMTP are under development},
+ abstract = {Abstract. This paper describes an architecture, Onion Routing, that limits a network's vulnerability to trac analysis. The architecture provides anonymous socket connections by means of proxy servers. It provides real-time, bi-directional, nonymous communication for any protocol that can be adapted to use a proxy service. Speci cally, the architecture provides for bi-directional communication even though no-one but the initiator{\textquoteright}s proxy server knows anything but previous and next hops in the communication chain. This implies that neither the respondent nor his proxy server nor any external observer need know the identity of the initiator or his proxy server. A prototype of Onion Routing has been implemented. This prototype works with HTTP (World Wide Web) proxies. In addition, an analogous proxy for TELNET has been implemented. Proxies for FTP and SMTP are under development},
keywords = {communication chain, onion routing, traffic analysis},
isbn = {3-540-61996-8},
www_section = {http://portal.acm.org/citation.cfm?id=731526},
@@ -15873,7 +15872,7 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
volume = {101},
year = {1993},
month = feb,
- pages = {119-137},
+ 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},
www_section = {http://www.jstor.org/stable/2138676},
@@ -15913,7 +15912,7 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
series = {The Springer International Series in Engineering and Computer Science},
volume = {234},
year = {1993},
- pages = {144},
+ pages = {0--144},
publisher = {Springer},
organization = {Springer},
abstract = {Elliptic curves have been intensively studied in algebraic geometry and number theory. In recent years they have been used in devising efficient algorithms for factoring integers and primality proving, and in the construction of public key cryptosystems.
@@ -15947,7 +15946,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
volume = {658},
year = {1992},
month = may,
- pages = {390-407},
+ pages = {390--407},
publisher = {Springer},
organization = {Springer},
address = {Balatonf{\"u}red, Hungary},
@@ -16002,7 +16001,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
series = {EUROCRYPT {\textquoteright}89},
year = {1990},
month = apr,
- pages = {690--},
+ pages = {0--690},
publisher = {Springer-Verlag New York, Inc},
organization = {Springer-Verlag New York, Inc},
address = {Houthalen, Belgium},
@@ -16131,7 +16130,7 @@ We also sketch applications of these signatures to a payment system, solving dis
series = {Lecture Notes in Computer Science},
volume = {219},
year = {1986},
- pages = {245-253},
+ pages = {245--253},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
abstract = {In usual communication networks, the network operator or an intruder could easily observe when, how much and with whom the users communicate (traffic analysis), even if the users employ end-to-end encryption. When ISDNs are used for almost everything, this becomes a severe threat. Therefore, we summarize basic concepts to keep the recipient and sender or at least their relationship unobservable, consider some possible implementations and necessary hierarchical extensions, and propose some suitable performance and reliability enhancements},
@@ -16304,7 +16303,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
title = {Protocols for Public Key Cryptosystems},
journal = {Security and Privacy, IEEE Symposium on},
year = {1980},
- pages = {122},
+ pages = {0--122},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
abstract = {New Cryptographic protocols which take full advantage of the unique properties of public key cryptosystems are now evolving. Several protocols for public key distribution and for digital signatures are briefly compared with each other and with the conventional alternative},
@@ -16362,7 +16361,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
volume = {22},
year = {1976},
month = nov,
- pages = {644-654},
+ 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},
keywords = {cryptographic systems, cryptography},
issn = {0018-9448},
@@ -16376,7 +16375,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
volume = {46},
year = {1971},
month = mar,
- pages = {35-57},
+ 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},
www_section = {http://www.jstor.org/pss/2822435},
@@ -16389,7 +16388,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
volume = {49},
year = {1970},
month = jan,
- pages = {291-307},
+ pages = {291--307},
abstract = {We consider the problem of partitioning the nodes of a graph with costs on its edges into subsets of given sizes so as to minimize the sum of the costs on all edges cut. This problem arises in several physical situations- for example, in assigning the components of electronic circuits to circuit boards to minimize the number of connections between boards. This paper presents a heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems},
keywords = {heuristic method, partitioning graphs},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Kernighan\%20\%26\%20Lin\%20-\%20An\%20Efficient\%20Heuristic\%20Procedure\%20for\%20Partitioning\%20Graphs\%250A.pdf},
@@ -16401,7 +16400,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
volume = {84},
year = {1970},
month = aug,
- pages = {488-500},
+ 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},
www_section = { http://www.jstor.org/stable/1879431},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/akerlof.pdf},
@@ -16423,7 +16422,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
journal = {Science},
volume = {162},
year = {1968},
- pages = {1243-1248},
+ pages = {1243--1248},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Science\%20-\%20Hardin\%20-\%20The\%20Tragedy\%20of\%20the\%20Commons.pdf},
author = {Garrett Hardin}
}
@@ -16461,7 +16460,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
volume = {6},
year = {1959},
month = jan,
- pages = {290-297},
+ pages = {290--297},
keywords = {graphs, random, random graphs},
www_section = {https://bibliography.gnunet.org/},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Erd\%C5\%91s\%20\%26\%20R\%C3\%A9nyi\%20-\%20On\%20Random\%20Graphs.pdf},
@@ -16487,7 +16486,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
volume = {36},
year = {1950},
month = jan,
- pages = {48-49},
+ 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},
doi = {10.1073/pnas.36.1.48},
@@ -16498,7 +16497,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
@book {1944,
title = {The Theory of Games and Economic Behavior},
year = {1944},
- pages = {776},
+ pages = {0--776},
publisher = {Princeton University Press},
organization = {Princeton University Press},
edition = {60th},
