commit 45c58f0900b456aea664c84328d5a626ede91210
parent b43e786aae9c1d62f7dcfa62a6ed77ba5e9f7783
Author: Nils Gillmann <ng0@n0.is>
Date: Sun, 7 Oct 2018 19:48:11 +0000
bibtex: fix pages + unicode related errors.
Signed-off-by: Nils Gillmann <ng0@n0.is>
Diffstat:
| M | gnunetbib.bib | | | 160 | +++++++++++++++++++++++++++++++++++++++---------------------------------------- |
1 file changed, 79 insertions(+), 81 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -5399,8 +5399,7 @@ This paper attempts to put existing works of P2P designs into the perspective of
publisher = {ACM New York, NY, USA},
organization = {ACM New York, NY, USA},
address = {Washington, DC, USA},
- abstract = {Tor has become one of the most popular overlay networks for anonymizing TCP traffic. Its popularity is due in part to its perceived strong anonymity properties and its relatively low latency service. Low latency is achieved through Tor{\^a}s ability to balance the traffic load by optimizing Tor router selection to probabilistically favor routers with highbandwidth capabilities.
-
+ abstract = {Tor has become one of the most popular overlay networks for anonymizing TCP traffic. Its popularity is due in part to its perceived strong anonymity properties and its relatively low latency service. Low latency is achieved through Tor{\^a}s ability to balance the traffic load by optimizing Tor router selection to probabilistically favor routers with highbandwidth capabilities.
We investigate how Tor{\^a}s routing optimizations impact its ability to provide strong anonymity. Through experiments conducted on PlanetLab, we show the extent to which routing performance optimizations have left the system vulnerable to end-to-end traffic analysis attacks from non-global adversaries with minimal resources. Further, we demonstrate that entry guards, added to mitigate path disruption attacks, are themselves vulnerable to attack. Finally, we explore solutions to improve Tor{\^a}s current routing algorithms and propose alternative routing strategies that prevent some of the routing attacks used in our experiments},
keywords = {anonymity, load balancing, Tor, traffic analysis},
isbn = {978-1-59593-883-1},
@@ -6357,7 +6356,7 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
volume = {10},
year = {2006},
month = jan,
- pages = {1-7},
+ pages = {1--7},
abstract = {The WAT system, as used in Japan, allows for businesses to issue their own tickets (IOU{\textquoteright}s) which can circulate as a complementary currency within a community. This paper proposes a variation on that model, where the issuer of a ticket can offer a guarantee, in the form of some goods or services. The difference in value, along with a reasonable acceptance that the issuer is capable of delivering the service or goods, allows for a higher degree of confidence in the ticket, and therefore a greater liquidity},
keywords = {guarantee, peer-to-peer currencies},
issn = {1325-9547},
@@ -6451,7 +6450,7 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
series = {Lecture Notes in Computer Science},
volume = {4052},
year = {2006},
- pages = {1-12},
+ pages = {1--12},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
abstract = {In 1977 Dalenius articulated a desideratum for statistical databases: nothing about an individual should be learnable from the database that cannot be learned without access to the database. We give a general impossibility result showing that a formalization of Dalenius{\textquoteright} goal along the lines of semantic security cannot be achieved. Contrary to intuition, a variant of the result threatens the privacy even of someone not in the database. This state of affairs suggests a new measure, differential privacy, which, intuitively, captures the increased risk to one{\textquoteright}s privacy incurred by participating in a database.The techniques developed in a sequence of papers [8, 13, 3], culminating in those described in [12], can achieve any desired level of privacy under this measure. In many cases, extremely accurate information about the database can be provided while simultaneously ensuring very high levels of privacy},
@@ -6482,7 +6481,7 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
title = {Distributed k-ary System: Algorithms for Distributed Hash Tables},
year = {2006},
month = dec,
- pages = {209},
+ pages = {0--209},
school = {KTH/Royal Institute of Technology},
type = {Doctoral},
address = {Stockholm},
@@ -6825,7 +6824,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
booktitle = {Proceedings of the 26th IEEE International Conference on Distributed Computing Systems},
year = {2006},
month = jan,
- pages = {66},
+ pages = {0--66},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Lisboa, Portugal},
@@ -6901,7 +6900,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
volume = {Philosophy (Media and Governance)},
year = {2006},
month = jan,
- pages = {231},
+ pages = {0--231},
school = {Keio University,},
address = {Washington, DC, USA},
keywords = {i-WAT, OpenPGP, WAT system},
@@ -6915,7 +6914,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
series = {Lecture Notes in Computer Science},
volume = {4168},
year = {2006},
- pages = {456-467},
+ pages = {456--467},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
abstract = {A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi (x) = h1(x) + ih2(x). We demonstrate that this technique can be usefully applied to Bloom filters and related data structures. Specifically, only two hash functions are necessary to effectively implement a Bloom filter without any loss in the asymptotic false positive probability. This leads to less computation and potentially less need for randomness in practice},
@@ -7150,7 +7149,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
booktitle = {Proceedings of the 26th IEEE International Conference on Distributed Computing Systems},
series = {ICDCS {\textquoteright}06},
year = {2006},
- pages = {23--},
+ pages = {0--23},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Washington, DC, USA},
@@ -7338,7 +7337,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
title = {Reputation Mechanisms},
booktitle = {Handbook on Information Systems and Economics},
year = {2006},
- pages = {629-660},
+ pages = {629--660},
publisher = {Elsevier},
organization = {Elsevier},
keywords = {online marketplace, reputation mechanism},
@@ -7386,7 +7385,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
booktitle = {Proceedings of Multi-Echelon/Public Applications of Supply Chain Management Conference},
year = {2006},
note = {only published on CD},
- pages = {1-52},
+ pages = {1--52},
abstract = {Although the benefits of information sharing between supply-chain partners are well known, many companies are averse to share their {\textquotedblleft}private{\textquotedblright} information due to fear of adverse impact of information leakage.
This paper uses techniques from Secure Multiparty Computation (SMC) to develop {\textquotedblleft}secure protocols{\textquotedblright} for the CPFR (Collaborative Planning, Forecasting, and Replenishment) business process. The result is a process that permits supply-chain partners to capture all of the benefits of information-sharing and collaborative decision-making, but without disclosing their {\textquotedblleft}private{\textquotedblright} demandsignal (e.g., promotions) and cost information to one another. In our collaborative CPFR) scenario, the retailer and supplier engage in SMC protocols that result in: (1) a forecast that uses both the retailers and the suppliers observed demand signals to better forecast demand; and (2) prescribed order/shipment quantities based on system-wide costs and inventory levels (and on the joint forecasts) that minimize supply-chain expected cost/period. Our contributions are as follows: (1) we demonstrate that CPFR can be securely implemented without disclosing the private information of either partner; (2) we show that the CPFR business process is not incentive compatible without transfer payments and develop an incentive-compatible linear transfer-payment scheme for
collaborative forecasting; (3) we demonstrate that our protocols are not only secure (i.e., privacy preserving), but that neither partner is able to make accurate inferences about the others future demand signals from the outputs of the protocols; and (4) we illustrate the benefits of secure collaboration using simulation},
@@ -7508,7 +7507,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
volume = {33},
year = {2006},
month = feb,
- pages = {286-311},
+ 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},
keywords = {communication network, game theory},
@@ -7584,7 +7583,7 @@ collaborative forecasting; (3) we demonstrate that our protocols are not only se
series = {Lecture Notes in Computer Science},
volume = {3876},
year = {2006},
- pages = {285-304},
+ pages = {285--304},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
abstract = {We show that if a set of players hold shares of a value a {\epsilon} Fp for some prime p (where the set of shares is written [a] p ), it is possible to compute, in constant rounds and with unconditional security, sharings of the bits of a, i.e., compute sharings [a0] p , ..., [al- 1] p such that l = ⌈ log2 p ⌉, a0,...,al--1 {\epsilon} {0,1} and a = summation of ai * 2^i where 0 <= i <= l- 1. Our protocol is secure against active adversaries and works for any linear secret sharing scheme with a multiplication protocol. The complexity of our protocol is O(llogl) invocations of the multiplication protocol for the underlying secret sharing scheme, carried out in O(1) rounds.
@@ -7751,7 +7750,7 @@ We show that applying encoding based on universal re-encryption can solve many o
volume = {3640},
year = {2005},
month = feb,
- pages = {205-216},
+ pages = {205--216},
publisher = {Springer},
organization = {Springer},
address = {Ithaca, NY, USA},
@@ -7840,7 +7839,7 @@ We show that applying encoding based on universal re-encryption can solve many o
volume = {3640},
year = {2005},
month = nov,
- pages = {127-140},
+ pages = {127--140},
publisher = {Springer Berlin / Heidelberg},
organization = {Springer Berlin / Heidelberg},
address = {Ithaca, NY, USA},
@@ -7904,7 +7903,7 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
volume = {89},
year = {2005},
month = aug,
- pages = {1457-1468},
+ 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},
doi = {doi:10.1016/j.jpubeco.2004.03.008},
@@ -7989,7 +7988,7 @@ We then extend our scheme to our second result, the first e-cash scheme that pro
volume = {1},
year = {2005},
month = mar,
- pages = {374-385},
+ pages = {374--385},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Miami, FL, USA},
@@ -8095,7 +8094,7 @@ This paper describes the design and implementation of rcc, the router configurat
booktitle = {Proceedings of International Conference on Distributed Computing Systems 2004},
year = {2005},
month = mar,
- pages = {524-533},
+ pages = {524--533},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Tokyo, Japan},
@@ -8111,7 +8110,7 @@ This paper describes the design and implementation of rcc, the router configurat
booktitle = {INFOCOM 2005. Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies},
year = {2005},
month = mar,
- pages = {2147-2158},
+ pages = {2147--2158},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Miami, FL, USA},
@@ -8127,7 +8126,7 @@ This paper describes the design and implementation of rcc, the router configurat
title = {Exploiting co-location history for ef.cient service selection in ubiquitous computing systems},
journal = {Mobile and Ubiquitous Systems, Annual International Conference on},
year = {2005},
- pages = {202-212},
+ pages = {202--212},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
abstract = {As the ubiquitous computing vision materializes, the number and diversity of digital elements in our environment increases. Computing capability comes in various forms and is embedded in different physical objects, ranging from miniature devices such as human implants and tiny sensor particles, to large constructions such as vehicles and entire buildings. The number of possible interactions among such elements, some of which may be invisible or offer similar functionality, is growing fast so that it becomes increasingly hard to combine or select between them. Mechanisms are thus required for intelligent matchmaking that will achieve controlled system behavior, yet without requiring the user to continuously input desirable options in an explicit manner. In this paper we argue that information about the colocation relationship of computing elements is quite valuable in this respect and can be exploited to guide automated service selection with minimal or no user involvement. We also discuss the implementation of such mechanism that is part of our runtime system for smart objects},
@@ -8140,7 +8139,7 @@ This paper describes the design and implementation of rcc, the router configurat
title = {The Feasibility of DHT-based Streaming Multicast},
journal = {2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems},
year = {2005},
- pages = {288-298},
+ pages = {288--298},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
issn = {1526-7539},
@@ -8169,7 +8168,7 @@ This paper describes the design and implementation of rcc, the router configurat
series = {Lecture Notes in Computer Science},
volume = {3485},
year = {2005},
- pages = {35-56},
+ pages = {35--56},
publisher = {Springer Berlin / Heidelberg},
organization = {Springer Berlin / Heidelberg},
abstract = {Peer-to-Peer (P2P) networks appeared roughly around the year 2000 when a broadband Internet infrastructure (even at the network edge) became widely available. Other than traditional networks Peer-to-Peer networks do not rely on a specific infrastructure offering transport services. Instead they form {\textquotedblleft}overlay structures{\textquotedblright} focusing on content allocation and distribution based on TCP or HTTP connections. Whereas in a standard Client-Server configuration content is stored and provided only via some central server(s), Peer-to-Peer networks are highly decentralized and locate a desired content at some participating peer and provide the corresponding IP address of that peer to the searching peer. The download of that content is then initiated using a separate connection, often using HTTP. Thus, the high load usually resulting for a central server and its surrounding network is avoided leading to a more even distribution of load on the underlying physical network. On the other hand, such networks are typically subject to frequent changes because peers join and leave the network without any central control},
@@ -8526,7 +8525,7 @@ Our results contradict some beliefs that the protocols mentioned guarantee anony
booktitle = {INFOCOM{\textquoteright}05. Proceedings of the 24th IEEE International Conference on Computer Communications},
year = {2005},
month = mar,
- pages = {2578-2589},
+ pages = {2578--2589},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Miami, FL, USA},
@@ -8604,7 +8603,7 @@ This paper reports the results from a two week measurement of the entire Overnet
booktitle = {INFOCOM{\textquoteright}05. Proceedings of the 24th IEEE International Conference on Computer Communications},
year = {2005},
month = mar,
- pages = {2235-2245},
+ pages = {2235--2245},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Miami, FL, USA},
@@ -8715,7 +8714,7 @@ We introduce and implement Obfuscated Ciphertext Mixing, the obfuscation of a mi
volume = {21},
year = {2005},
month = mar,
- pages = {333-347},
+ 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},
issn = {0167-739X},
@@ -8728,7 +8727,7 @@ We introduce and implement Obfuscated Ciphertext Mixing, the obfuscation of a mi
booktitle = {Euro-Par{\textquoteright}05 Parallel Processing},
year = {2005},
month = sep,
- pages = {1173-1182},
+ pages = {1173--1182},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
address = {Lisboa, Portugal},
@@ -8818,7 +8817,7 @@ We have developed a prototype based on the FreePastry open-source implementation
series = {Lecture Notes in Computer Science},
volume = {3621},
year = {2005},
- pages = {241-257},
+ pages = {241--257},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
abstract = {In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party{\textquoteright}s input to the function is his private input multiset. In order to protect these private sets, the players perform privacy-preserving computation; that is, no party learns more information about other parties{\textquoteright} private input sets than what can be deduced from the result. In this paper, we propose efficient techniques for privacy-preserving operations on multisets. By building a framework of multiset operations, employing the mathematical properties of polynomials, we design efficient, secure, and composable methods to enable privacy-preserving computation of the union, intersection, and element reduction operations. We apply these techniques to a wide range of practical problems, achieving more efficient results than those of previous work},
@@ -8835,7 +8834,7 @@ We have developed a prototype based on the FreePastry open-source implementation
series = {Lecture Notes in Computer Science},
volume = {3506},
year = {2005},
- pages = {104-120},
+ pages = {104--120},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
abstract = {In mining and integrating data from multiple sources, there are many privacy and security issues. In several different contexts, the security of the full privacy-preserving data mining protocol depends on the security of the underlying private scalar product protocol. We show that two of the private scalar product protocols, one of which was proposed in a leading data mining conference, are insecure. We then describe a provably private scalar product protocol that is based on homomorphic encryption and improve its efficiency so that it can also be used on massive datasets},
@@ -8916,7 +8915,7 @@ We have developed a prototype based on the FreePastry open-source implementation
volume = {2},
year = {2005},
month = jul,
- pages = {235-239},
+ 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},
issn = {1521-9097},
@@ -9038,7 +9037,7 @@ We have developed a prototype based on the FreePastry open-source implementation
series = {Lecture Notes in Computer Science},
volume = {3485},
year = {2005},
- pages = {95-117},
+ pages = {95--117},
publisher = {Springer},
organization = {Springer},
chapter = {8},
@@ -9131,7 +9130,7 @@ In this paper, we present a fully self-organizing routing scheme that is able to
title = {Service discovery using volunteer nodes for pervasive environments},
journal = {International Conference on Pervasive Services},
year = {2005},
- pages = {188-197},
+ pages = {188--197},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
abstract = {We propose a service discovery architecture called VSD (service discovery based on volunteers) for heterogeneous and dynamic pervasive computing environments. The proposed architecture uses a small subset of the nodes called volunteers that perform directory services. Relatively stable and capable nodes serve as volunteers, thus recognizing node heterogeneity in terms of mobility and capability. We discuss characteristics of VSD architecture and methods to improve connectivity among volunteers for higher discovery rate. By showing that VSD performs quite well compared to a broadcast based scheme in MANET scenarios, we validate that VSD is a flexible and adaptable architecture appropriate for dynamic pervasive computing environments. VSD incorporates several novel features: i) handles dynamism and supports self-reconfiguration; ii) provides physical locality and scalability; and iii) improves reliability and copes with uncertainty through redundancy by forming overlapped clusters},
@@ -9265,7 +9264,7 @@ Modern conflicts often turn on connectivity: consider, for instance, anything fr
title = {Towards Autonomic Networking using Overlay Routing Techniques},
booktitle = {Proceedings of the 18th International Conference on Architecture of Computing Systems (ARCS {\textquoteright}05)--System Aspects in Organic and Pervasive Computing},
year = {2005},
- pages = {222?235},
+ pages = {222--235},
publisher = {Springer Berlin / Heidelberg},
organization = {Springer Berlin / Heidelberg},
type = {publication},
@@ -9331,7 +9330,7 @@ In this paper we present a novel routing approach that is capable of handling co
title = {Using redundancy to cope with failures in a delay tolerant network},
booktitle = {SIGCOMM},
year = {2005},
- pages = {109-120},
+ pages = {109--120},
publisher = {ACM New York, NY, USA},
organization = {ACM New York, NY, USA},
address = {Philadelphia, Pennsylvania, USA},
@@ -9537,7 +9536,7 @@ We identify flaws in the software in Reliable that further compromise its abilit
volume = {22},
year = {2004},
month = jan,
- pages = {18-28},
+ 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},
www_section = {http://kmweb.twbbs.org/drupal/node/13},
@@ -9577,7 +9576,7 @@ We identify flaws in the software in Reliable that further compromise its abilit
volume = {Doctor of Philosophy},
year = {2004},
month = oct,
- pages = {214},
+ pages = {0--214},
school = {University of Dublin},
address = {Dublin, Ireland},
keywords = {autonomic distributed system, descentralised coordination},
@@ -9588,7 +9587,7 @@ We identify flaws in the software in Reliable that further compromise its abilit
title = {Defending against eclipse attacks on overlay networks},
booktitle = {EW 11: Proceedings of the 11th workshop on ACM SIGOPS European workshop},
year = {2004},
- pages = {21},
+ pages = {0--21},
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
@@ -9651,7 +9650,7 @@ Measurements with 425 server instances running on 150 PlanetLab and RON hosts sh
booktitle = {GECON 2004. 1st IEEE International Workshop on Grid Economics and Business Models},
year = {2004},
month = apr,
- pages = {67-81},
+ pages = {67--81},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Seoul, South Corea},
@@ -9694,7 +9693,7 @@ We present new DC-net constructions that simultaneously achieve non-interactivit
volume = {3015},
year = {2004},
month = apr,
- pages = {1-11},
+ pages = {1--11},
publisher = {Springer},
organization = {Springer},
address = {Antibes Juan-les-Pins, France},
@@ -9748,7 +9747,7 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
series = {Lecture Notes in Computer Science},
volume = {3027},
year = {2004},
- pages = {1-19},
+ pages = {1--19},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
abstract = {We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has many applications for online collaboration. We present protocols, based on the use of homomorphic encryption and balanced hashing, for both semi-honest and malicious environments. For lists of length k, we obtain O(k) communication overhead and O(k ln ln k) computation. The protocol for the semi-honest environment is secure in the standard model, while the protocol for the malicious environment is secure in the random oracle model. We also consider the problem of approximating the size of the intersection, show a linear lower-bound for the communication overhead of solving this problem, and provide a suitable secure protocol. Lastly, we investigate other variants of the matching problem, including extending the protocol to the multi-party setting as well as considering the problem of approximate matching},
@@ -9854,7 +9853,7 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
booktitle = {Proceedings of the IEEE International Symposium on Information Theory, ISIT 2004},
year = {2004},
month = jan,
- pages = {39},
+ pages = {0--39},
abstract = {This paper provides an efficient method for analyzing the error probability of the belief propagation (BP) decoder applied to LT Codes. Each output symbol is generated independently by sampling from a distribution and adding the input symbols corresponding to the support of the sampled vector},
keywords = {algoweb_ldpc},
isbn = {0-7695-1822-2},
@@ -9935,7 +9934,7 @@ This work was supported in part by the National Science Foundation under Contrac
series = {Lecture Notes in Computer Science},
volume = {3142},
year = {2004},
- pages = {183-195},
+ pages = {183--195},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
isbn = {978-3-540-22849-3},
@@ -10046,7 +10045,7 @@ The key feature of our approach is its modularity. It yields precise, formal spe
@book {2004_7,
title = {An Introduction to Auction Theory},
year = {2004},
- pages = {199},
+ pages = {0--199},
publisher = {Oxford University Press},
organization = {Oxford University Press},
edition = {1st},
@@ -10062,7 +10061,7 @@ The key feature of our approach is its modularity. It yields precise, formal spe
title = {Keso--a Scalable, Reliable and Secure Read/Write Peer-to-Peer File System},
year = {2004},
month = may,
- pages = {77},
+ pages = {0--77},
school = {KTH/Royal Institute of Technology},
type = {Master{\textquoteright}s Thesis},
address = {Stockholm},
@@ -10305,7 +10304,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
volume = {27},
year = {2004},
month = feb,
- pages = {51-54},
+ 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},
doi = {10.1007/s00287-003-0362-9},
@@ -10331,7 +10330,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
volume = {16},
year = {2004},
month = jan,
- pages = {28-40},
+ pages = {28--40},
abstract = {Current Web search engines are built to serve all users, independent of the special needs of any individual user. Personalization of Web search is to carry out retrieval for each user incorporating his/her interests. We propose a novel technique to learn user profiles from users{\textquoteright} search histories. The user profiles are then used to improve retrieval effectiveness in Web search. A user profile and a general profile are learned from the user{\textquoteright}s search history and a category hierarchy, respectively. These two profiles are combined to map a user query into a set of categories which represent the user{\textquoteright}s search intention and serve as a context to disambiguate the words in the user{\textquoteright}s query. Web search is conducted based on both the user query and the set of categories. Several profile learning and category mapping algorithms and a fusion algorithm are provided and evaluated. Experimental results indicate that our technique to personalize Web search is both effective and efficient},
keywords = {BANDWIDTH, category hierarchy, category mapping algorithms, Displays, fusion algorithm, History, human factors, information filtering, information retrieval, libraries, personalized Web search, profile learning, retrieval effectiveness, search engines, search intention, special needs, user interfaces, user profiles, user search histories, Web search, Web search engines},
issn = {1041-4347},
@@ -10460,7 +10459,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
volume = {3191},
year = {2004},
month = sep,
- pages = {62-76},
+ pages = {62--76},
publisher = {Springer},
organization = {Springer},
address = {Erfurt, Germany},
@@ -10659,7 +10658,7 @@ This paper describes the design and implementation of a secure, reliable, and sc
title = {Signaling and Networking in Unstructured Peer-to-Peer Networks},
year = {2004},
month = sep,
- pages = {177},
+ pages = {0--177},
school = {Technische Universit{\"a}t M{\"u}nchen},
type = {Dissertation},
address = {Munich, Germany},
@@ -10836,7 +10835,7 @@ This paper describes the motivation, architecture and implementation for a new p
booktitle = {Lecture Notes in Computer Science},
volume = {3032},
year = {2004},
- pages = {371-378},
+ pages = {371--378},
publisher = {Springer Berlin / Heidelberg},
organization = {Springer Berlin / Heidelberg},
abstract = {Most of the past studies on peer-to-peer systems have emphasized routing and lookup. The selfishness of users, which brings on the free riding problem, has not attracted sufficient attention from researchers. In this paper, we introduce a decentralized reputation-based trust model first, in which trust relationships could be built based on the reputation of peers. Subsequently, we use the iterated prisoner{\textquoteright}s dilemma to model the interactions in peer-to-peer systems and propose a simple incentive mechanism. By simulations, it{\textquoteright}s shown that the stable cooperation can emerge after limited rounds of interaction between peers by using the incentive mechanism},
@@ -11062,7 +11061,7 @@ While technically and conceptually simple, universal re-encryption leads to new
volume = {21},
year = {2003},
month = aug,
- pages = {995-1002},
+ pages = {995--1002},
abstract = {Scheme to build dynamic, distributed P2P networks of constant degree and logarithmic diameter},
www_section = {http://www.cs.brown.edu/people/eli/papers/focs01.pdf},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/focs01.pdf},
@@ -11150,7 +11149,7 @@ Because our scheme requires cooperation, it is potentially vulnerable to several
series = {WIAPP {\textquoteright}03},
year = {2003},
month = jun,
- pages = {112--},
+ pages = {0--112},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {San Jos{\'e}, CA, USA},
@@ -11250,7 +11249,7 @@ This paper presents the design and implementation of a cooperative off-site back
series = {SAINT {\textquoteright}03},
year = {2003},
month = jan,
- pages = {226--},
+ pages = {0--226},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Orlando, Florida, USA},
@@ -11302,7 +11301,7 @@ This paper presents the design and implementation of a cooperative off-site back
volume = {100},
year = {2003},
month = mar,
- pages = {3531-3535},
+ 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},
doi = {10.1073/pnas.0630443100},
@@ -11355,7 +11354,7 @@ In this paper we analyze several extensions to the exponential feedback algorith
booktitle = {Proceedings of the 3rd International Conference on Peer-to-Peer Computing},
year = {2003},
month = sep,
- pages = {48-56},
+ pages = {48--56},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Link{\"o}ping, Sweden},
@@ -11434,7 +11433,7 @@ We then show how to express existing mixes in the framework, and then suggest ot
title = {HIERAS: A DHT Based Hierarchical P2P Routing Algorithm},
journal = {Parallel Processing, International Conference on},
year = {2003},
- pages = {187},
+ pages = {0--187},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
abstract = {Routing algorithm has great influence on system overall performance in Peer-to-Peer (P2P) applications. In current DHT based routing algorithms, routing tasks are distributed across all system peers. However, a routing hop could happen between two widely separated peers with high network link latency which greatly increases system routing overheads.
@@ -11465,7 +11464,7 @@ In this paper, we propose a new P2P routing algorithm--- HIERAS to relieve this
booktitle = {P2P{\textquoteright}03. Proceecings of the 3rd International Conference on Peer-to-Peer Computing},
year = {2003},
month = sep,
- pages = {134},
+ pages = {0--134},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Link{\"o}ping, Sweden},
@@ -11809,7 +11808,7 @@ cryptography to hide the correlation between its inputs and outputs. Sending mes
title = {An Overlay-Network Approach for Distributed Access to SRS},
booktitle = {CCGRID {\textquoteright}03: Proceedings of the 3st International Symposium on Cluster Computing and the Grid},
year = {2003},
- pages = {601},
+ pages = {0--601},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Washington, DC, USA},
@@ -11871,7 +11870,7 @@ We analyse the anonymity of connection-based systems against passive adversaries
booktitle = {CCS{\textquoteright}03. Proceedings od the 10th ACM Conference on Computer and Communications Security},
year = {2003},
month = oct,
- pages = {300-310},
+ pages = {300--310},
publisher = {ACM},
organization = {ACM},
address = {Washington, DC, USA},
@@ -12022,7 +12021,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
volume = {2735},
year = {2003},
month = feb,
- pages = {247-255},
+ pages = {247--255},
publisher = {Springer},
organization = {Springer},
address = {Berkeley, CA, USA},
@@ -12076,7 +12075,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
series = {ICNP {\textquoteright}03},
year = {2003},
month = nov,
- pages = {16--},
+ pages = {0--16},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Atlanta, Georgia, USA},
@@ -12150,7 +12149,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
volume = {2816},
year = {2003},
month = sep,
- pages = {47-57},
+ pages = {47--57},
publisher = {Springer},
organization = {Springer},
address = {Munich, Germany},
@@ -12322,7 +12321,7 @@ We provide a rigorous stochastic analysis of how much information is revealed by
title = {Supporting Peer-to-Peer Computing with FlexiNet},
booktitle = {CCGRID {\textquoteright}03: Proceedings of the 3st International Symposium on Cluster Computing and the Grid},
year = {2003},
- pages = {390},
+ pages = {0--390},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Washington, DC, USA},
@@ -12392,7 +12391,7 @@ this, we propose separating the proxy into two distinct components|the messenger
volume = {2735},
year = {2003},
month = feb,
- pages = {33-44},
+ pages = {33--44},
publisher = {Springer},
organization = {Springer},
address = {Berkeley, CA, USA},
@@ -12792,7 +12791,7 @@ Placing application-dedicated functionality within the network requires a flexib
volume = {10},
year = {2002},
month = jun,
- pages = {381-395 },
+ pages = {381--395},
publisher = {ACM},
address = {New York, NY, USA},
abstract = {Current Internet congestion control protocols operate independently on a per-flow basis. Recent work has demonstrated that cooperative congestion control strategies between flows can improve performance for a variety of applications, ranging from aggregated TCP transmissions to multiple-sender multicast applications. However, in order for this cooperation to be effective, one must first identify the flows that are congested at the same set of resources. We present techniques based on loss or delay observations at end hosts to infer whether or not two flows experiencing congestion are congested at the same network resources. Our novel result is that such detection can be achieved for unicast flows, but the techniques can also be applied to multicast flows. We validate these techniques via queueing analysis, simulation and experimentation within the Internet. In addition, we demonstrate preliminary simulation results that show that the delay-based technique can determine whether two TCP flows are congested at the same set of resources. We also propose metrics that can be used as a measure of the amount of congestion sharing between two flows},
@@ -13090,7 +13089,7 @@ The read-only file system makes the security of published content independent fr
title = {Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities},
booktitle = {CCGRID {\textquoteright}02: Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid},
year = {2002},
- pages = {376},
+ pages = {0--376},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Washington, DC, USA},
@@ -13282,7 +13281,7 @@ The read-only file system makes the security of published content independent fr
title = {LT Codes},
journal = {Foundations of Computer Science, Annual IEEE Symposium on},
year = {2002},
- pages = {271},
+ pages = {0--271},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
abstract = {We introduce LT codes, the first rateless erasure codes that are very efficient as the data length grows},
@@ -13358,7 +13357,7 @@ We further investigate this intriguing proposal. Specifically, we
series = {Lecture Notes in Computer Science},
volume = {2429},
year = {2002},
- pages = {130-140},
+ pages = {130--140},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
isbn = {978-3-540-44179-3},
@@ -13476,7 +13475,7 @@ We further investigate this intriguing proposal. Specifically, we
series = {ICDCS {\textquoteright}02},
year = {2002},
month = jul,
- pages = {617--},
+ pages = {0--617},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {Vienna, Austria},
@@ -13601,7 +13600,7 @@ We further investigate this intriguing proposal. Specifically, we
journal = {IEEE Journal on Selected Areas in Communications (JSAC)},
volume = {20},
year = {2002},
- pages = {2002},
+ pages = {0--2002},
abstract = {This paper presents Scribe, a scalable application-level multicast infrastructure. Scribe supports large numbers of groups, with a potentially large number of members per group. Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet, and leverages Pastry{\textquoteright}s reliability, self-organization, and locality properties. Pastry is used to create and manage groups and to build efficient multicast trees for the dissemination of messages to each group. Scribe provides best-effort reliability guarantees, but we outline how an application can extend Scribe to provide stronger reliability. Simulation results, based on a realistic network topology model, show that Scribe scales across a wide range of groups and group sizes. Also, it balances the load on the nodes while achieving acceptable delay and link stress when compared to IP multicast},
keywords = {distributed hash table, multicast, Scribe},
www_section = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.20.299\&rep=rep1\&type=pdf},
@@ -13614,7 +13613,7 @@ We further investigate this intriguing proposal. Specifically, we
series = {ACSAC {\textquoteright}02},
year = {2002},
month = dec,
- pages = {172--},
+ pages = {0--172},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
address = {San Diego, CA, USA},
@@ -14000,7 +13999,7 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
volume = {10},
year = {2001},
month = mar,
- pages = {199-215},
+ 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},
doi = {10.1023},
@@ -14028,7 +14027,7 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
journal = {Journal of Cryptology},
volume = {16},
year = {2001},
- pages = {2003},
+ pages = {0--2003},
abstract = {Applies graph theory to anonymity. The paper suffers from the fundamental problem that it does not discuss attacks on the scheme, and there are a couple of pretty basic ways to break anonymity. Also, the scheme uses lots of traffic; some variants end up looking much like a pipenet },
www_section = {http://gecko.cs.purdue.edu/gnet/papers/BD.pdf },
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/BD.pdf},
@@ -14225,7 +14224,7 @@ We then show how these building blocks can be used for applying the scheme to ef
title = {Incentives for Sharing in Peer-to-Peer Networks},
booktitle = {EC{\textquoteright}01: Proceedings of the Second International Workshop on Electronic Commerce},
year = {2001},
- pages = {75-87 },
+ pages = {75--87},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
address = {London, UK},
@@ -14241,8 +14240,8 @@ We then show how these building blocks can be used for applying the scheme to ef
volume = {2076},
year = {2001},
pages = {89--98},
- abstract = {A Private Information Retrieval (PIR) protocol enables a user to retrieve a data item from a database while hiding the identity of the item being retrieved. In a t-private, k-server PIR protocol the database is replicated among k servers, and the user{\textquoteright}s privacy is protected from any collusion of up to t servers. The main cost-measure of such protocols is the communication complexity of retrieving a single bit of data.
-This work addresses the information-theoretic setting for PIR, in which the user{\textquoteright}s privacy should be unconditionally protected from collusions of servers. We present a unified general construction, whose abstract components can be instantiated to yield both old and new families of PIR protocols. A main ingredient in the new protocols is a generalization of a solution by Babai, Kimmel, and Lokam to a communication complexity problem in the so-called simultaneous messages model.
+ abstract = {A Private Information Retrieval (PIR) protocol enables a user to retrieve a data item from a database while hiding the identity of the item being retrieved. In a t-private, k-server PIR protocol the database is replicated among k servers, and the user{\textquoteright}s privacy is protected from any collusion of up to t servers. The main cost-measure of such protocols is the communication complexity of retrieving a single bit of data.
+This work addresses the information-theoretic setting for PIR, in which the user{\textquoteright}s privacy should be unconditionally protected from collusions of servers. We present a unified general construction, whose abstract components can be instantiated to yield both old and new families of PIR protocols. A main ingredient in the new protocols is a generalization of a solution by Babai, Kimmel, and Lokam to a communication complexity problem in the so-called simultaneous messages model.
Our construction strictly improves upon previous constructions and resolves some previous anomalies. In particular, we obtain: (1) t-private k-server PIR protocols with O(n 1/⌊ (2k-1)/tc⌋) communication bits, where n is the database size. For t > 1, this is a substantial asymptotic improvement over the previous state of the art; (2) a constant-factor improvement in the communication complexity of 1-private PIR, providing the first improvement to the 2-server case since PIR protocols were introduced; (3) efficient PIR protocols with logarithmic query length. The latter protocols have applications to the construction of efficient families of locally decodable codes over large alphabets and to PIR protocols with reduced work by the servers},
keywords = {communication complexity, privacy, private information retrieval},
isbn = {978-3-540-42287-7},
@@ -14299,7 +14298,7 @@ Our construction strictly improves upon previous constructions and resolves some
series = {Lecture Notes in Computer Science},
volume = {2045},
year = {2001},
- pages = {280-300},
+ pages = {280--300},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
abstract = {We introduce a new approach to multiparty computation (MPC) basing it on homomorphic threshold crypto-systems. We show that given keys for any sufficiently efficient system of this type,general MPC protocols for n parties can be devised which are secure against an active adversary that corrupts any minority of the parties. The total number of bits broadcast is O(nk|C|),where k is the security parameter and |C| is the size of a (Boolean) circuit computing the function to be securely evaluated. An earlier proposal by Franklin and Haber with the same complexity was only secure for passive adversaries,while all earlier protocols with active security had complexity at least quadratic in n. We give two examples of threshold cryptosystems that can support our construction and lead to the claimed complexities},
@@ -14527,7 +14526,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
title = {Search in JXTA and Other Distributed Networks},
journal = {Peer-to-Peer Computing, IEEE International Conference on},
year = {2001},
- pages = {0030},
+ pages = {0--0030},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
isbn = {0-7695-1503-7},
@@ -14599,7 +14598,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
@book {2001_6,
title = {The Theory of Incentives: The Principal-Agent Model},
year = {2001},
- pages = {360},
+ pages = {0--360},
publisher = {Princeton University Press},
organization = {Princeton University Press},
address = {Princeton, New Jersey, USA},
@@ -15027,7 +15026,7 @@ Results based on simulations confirm that Overcast provides its added functional
title = {Set Reconciliation with Nearly Optimal Communication Complexity},
booktitle = {International Symposium on Information Theory},
year = {2000},
- pages = {232},
+ pages = {0--232},
keywords = {set reconciliation},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/reconcile.pdf},
author = {Yaron Minsky and Ari Trachtenberg and Richard Zippel}
@@ -16234,7 +16233,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
number = {7},
year = {1985},
pages = {637--654},
- publisher = {John Wiley \& Sons, Inc},
+ publisher = {John Wiley & Sons, Inc},
address = {New York, NY, USA},
abstract = {An important problem in program development and maintenance is version control, i.e., the task of keeping a software system consisting of many versions and configurations well organized. The Revision Control System (RCS) is a software tool that assists with that task. RCS manages revisions of text documents, in particular source programs, documentation, and test data. It automates the storing, retrieval, logging and identification of revisions, and it provides selection mechanisms for composing configurations. This paper introduces basic version control concepts and discusses the practice of version control using RCS. For conserving space, RCS stores deltas, i.e., differences between successive revisions. Several delta storage methods are discussed. Usage statistics show that RCS{\textquoteright}s delta storage method is space and time efficient. The paper concludes with a detailed survey of version control tools},
keywords = {version control},
@@ -16516,10 +16515,9 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
organization = {Princeton University Press},
edition = {60th},
address = {Princeton, New Jersey, USA},
- keywords = {economic behavior, games, theory},
+ keywords = {economic behavior, games, theory},
isbn = {978-0-691-13061-3 },
www_section = {http://www.archive.org/details/theoryofgamesand030098mbp},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Neumann\%20\%26\%20Morgenstern\%20-\%20Theory\%20of\%20Games\%20and\%20Economic\%20Behavior.pdf},
author = {John von Neumann and Oskar Morgenstern}
}
-
