commit 4e45cba23a2d2220328200eab5d5b631f0f1c723
parent 7846dae22bda909dc5e5e74391fe2f0631a76798
Author: Nils Gillmann <ng0@n0.is>
Date: Mon, 8 Oct 2018 11:26:18 +0000
gnunetbib.bib
Signed-off-by: Nils Gillmann <ng0@n0.is>
Diffstat:
| M | gnunetbib.bib | | | 61 | ++++++++++++++++++++++++++++++++++++------------------------- |
1 file changed, 36 insertions(+), 25 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -9,6 +9,9 @@
% an entry.
% www_important -- set for important entries
% www_remarks -- annotation for an entry
+% www_section: A category or keyword, NOT the website.
+% example:
+% www_section = misc
%% List of sections
@string{comm = "Anonymous communication"}
@@ -24,6 +27,7 @@
@string{misc = "Misc"}
@string{torperf = "Tor Performance"}
@string{conference = "Conference"}
+@string{unsorted}
#
# Proposed new sections: application privacy, data anonymization, ...
@@ -43,7 +47,7 @@
abstract = {In this thesis we translate Brandt{\textquoteright}s privacy preserving sealed-bid online auction protocol from RSA to elliptic curve arithmetic and analyze the theoretical and practical benefits. With Brandt{\textquoteright}s protocol, the auction outcome is completely resolved by the bidders and the seller without the need for a trusted third party. Loosing bids are not revealed to anyone. We present libbrandt, our implementation of four algorithms with different outcome and pricing properties, and describe how they can be incorporated in a real-world online auction system. Our performance measurements show a reduction of computation time and prospective bandwidth cost of over 90\% compared to an implementation of the RSA version of the same algorithms. We also evaluate how libbrandt scales in different dimensions and conclude that the system we have presented is promising with respect to an adoption in the real world},
keywords = {auctions, GNUnet, secure multi-party computation},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/thesis_0.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Markus Teich},
editor = {Totakura, Sree Harsha and Grothoff, Christian and Felix Brandt}
}
@@ -58,7 +62,7 @@
address = {Berlin},
abstract = {In contrast to ubiquitous cloud-based solutions the telephony application GNUnet conversation provides fully-decentralized, secure voice communication and thus impedes mass surveillance. The aim of this thesis is to investigate why GNUnet conversation currently provides poor Quality of Experience under typical wide area network conditions and to propose optimization measures. After network shaping and the initialization of two isolated GNUnet peers had been automated, delay measurements were done. With emulated network characteristics network delay, cryptography delays and audio codec delays were measured and transmitted speech was recorded. An analysis of the measurement results and a subjective assessment of the speech recordings revealed that extreme outliers occur in most scenarios and impair QoE. Moreover it was shown that GNUnet conversation introduces a large delay that confines the environment in which good QoE is possible. In the measurement environment at least 23 ms always ocurred of which large parts are were caused by cryptography. It was shown that optimization in the cryptography part and other components are possible. Finally the conditions for currently reaching good QoE were determined and ideas for further investigations were presented},
keywords = {CADET, GNUnet, measurement, performance},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/lurchi-bs-thesis.pdf},
author = {Christian Ulrich}
}
@@ -66,7 +70,7 @@
title = {Byzantine Set-Union Consensus using Efficient Set Reconciliation},
booktitle = {International Conference on Availability, Reliability and Security (ARES)},
year = {2016},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/dold2016byzantine.pdf},
author = {Dold, Florian and Grothoff, Christian}
}
@@ -78,7 +82,7 @@
abstract = {Applications of secure multiparty computation such as certain electronic voting or auction protocols require Byzantine agreement on large sets of elements. Implementations proposed in the literature so far have relied on state machine replication, and reach agreement on each individual set element in sequence. We introduce set-union consensus, a specialization of Byzantine consensus that reaches agreement over whole sets. This primitive admits an efficient and simple implementation by the composition of Eppstein{\textquoteright}s set reconciliation protocol with Ben-Or{\textquoteright}s ByzConsensus protocol. A free software implementation of this construction is available in GNUnet. Experimental results indicate that our approach results in an efficient protocol for very large sets, especially in the absence of Byzantine faults. We show the versatility of set-union consensus by using it to implement distributed key generation, ballot collection and cooperative decryption for an electronic voting protocol implemented in GNUnet},
keywords = {byzantine fault tolerance, consensus, GNUnet},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/consensus2016.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Florian Dold and Christian Grothoff}
}
@conference {taler2016space,
@@ -92,7 +96,7 @@
abstract = {GNU Taler is a new electronic online payment system which provides privacy for customers and accountability for merchants. It uses an exchange service to issue digital coins using blind signatures, and is thus not subject to the performance issues that plague Byzantine fault-tolerant consensus-based solutions. The focus of this paper is addressing the challenges payment systems face in the context of the Web. We discuss how to address Web-specific challenges, such as handling bookmarks and sharing of links, as well as supporting users that have disabled JavaScript. Web payment systems must also navigate various constraints imposed by modern Web browser security architecture, such as same-origin policies and the separation between browser extensions and Web pages. While our analysis focuses on how Taler operates within the security infrastructure provided by the modern Web, the results partially generalize to other payment systems. We also include the perspective of merchants, as existing systems have often struggled with securing payment information at the merchant{\textquoteright}s side. Here, challenges include avoiding database transactions for customers that do not actually go through with the purchase, as well as cleanly separating security-critical functions of the payment system from the rest of the Web service},
keywords = {blind signatures, GNUnet, incentives, payments, Taler, web},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/taler2016space.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Jeffrey Burdges and Florian Dold and Christian Grothoff and Marcello Stanisci}
}
@mastersthesis {xrs2016,
@@ -107,7 +111,7 @@
abstract = {This thesis studies the GNUnet project comprising its history, ideas and the P2P network technology. It specifically investigates the question of emancipatory potentials with regard to forms of information power due to a widely deployed new Internet technology and tries to identify essential suspensions of power within the scope of an impact assessment. Moreover, we will see by contrasting the GNUnet project with the critical data protection project, founded on social theory, that both are heavily concerned about the problem of illegitimate and unrestrained information power, giving us additional insights for the assessment. Last but least I{\textquoteright}ll try to present a scheme of how both approaches may interact to realize their goals},
keywords = {GNUnet, peer-to-peer},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/xrs2016.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Christian Ricardo K{\"u}hne}
}
@conference {2016,
@@ -120,7 +124,7 @@
address = {Crete, Greece},
abstract = {Today, user attributes are managed at centralized identity providers. However, two centralized identity providers dominate digital identity and access management on the web. This is increasingly becoming a privacy problem in times of mass surveillance and data mining for targeted advertisement. Existing systems for attribute sharing or credential presentation either rely on a trusted third party service or require the presentation to be online and synchronous. In this paper we propose a concept that allows the user to manage and share his attributes asynchronously with a requesting party using a secure, decentralized name system},
keywords = {Decentralisation, GNUnet, Identity and Access Management, User Attributes},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Martin Schanzenbach and Christian Banse}
}
@conference {p4t2016,
@@ -134,7 +138,7 @@
abstract = {Future online social networks need to not only protect sensitive data of their users, but also protect them from abusive behavior coming from malicious participants in the network. We investigate the use of supervised learning techniques to detect abusive behavior and describe privacy-preserving protocols to compute the feature set required by abuse classification algorithms in a secure and privacy-preserving way. While our method is not yet fully resilient against a strong adaptive adversary, our evaluation suggests that it will be useful to detect abusive behavior with a minimal impact on privacy},
keywords = {abuse, GNUnet, Privacy preserving, reputation, Social networking},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p4t.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {{\'A}lvaro Garc{\'\i}a-Recuero and Jeffrey Burdges and Christian Grothoff}
}
@article {fk-2016-1-p46,
@@ -144,7 +148,7 @@
chapter = {46},
keywords = {Architecture, GNUnet, Internet},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fk-2016-1-p46.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Christian Ricardo K{\"u}hne}
}
@mastersthesis {ma_dold_consensus_21dec2015byzantine,
@@ -159,7 +163,7 @@
abstract = {Byzantine consensus is a fundamental and well-studied problem in the area of distributed system. It requires a group of peers to reach agreement on some value, even if a fraction of the peers is controlled by an adversary. This thesis proposes set union consensus, an efficient generalization of Byzantine consensus from single elements to sets. This is practically motivated by Secure Multiparty Computation protocols such as electronic voting, where a large set of elements must be collected and agreed upon. Existing practical implementations of Byzantine consensus are typically based on state machine replication and not well-suited for agreement on sets, since they must process individual agreements on all set elements in sequence. We describe and evaluate our implementation of set union consensus in GNUnet, which is based on a composition of Eppstein set reconciliation protocol with the simple gradecast consensus prococol described by Ben-Or},
keywords = {byzantine consensus, GNUnet, secure multiparty computation, set reconciliation, voting},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ma_dold_consensus_21dec2015.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Florian Dold}
}
@article {mcb-es2015,
@@ -171,7 +175,7 @@
keywords = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
journal = {unknown},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-es.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum}
}
@article {mcb-it2015,
@@ -183,7 +187,7 @@
keywords = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
journal = {unknown},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-it.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum and Luca Saiu}
}
@article {mcb-fr2015,
@@ -195,7 +199,7 @@
keywords = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
journal = {unknown},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-fr.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum and Ludovic Courtes}
}
@article {mcb-en2015,
@@ -207,7 +211,7 @@
keywords = {DNS, DNSSEC, MORECOWBELL, NAMECOIN, TLS},
journal = {unknown},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-en.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum}
}
@mastersthesis {mwachs2014,
@@ -241,7 +245,7 @@
First, the motivation to use home routers for services besides routing and the need to protect their physical integrity is discussed. Second, the idea and functionality of the Panic! system is introduced and the high-level interactions between its components explained. Third, the software components to be run on the router are described. Fourth, the requirements of the measurement circuit are declared and a prototype is presented. Fifth, some characteristics of pressurized environments are discussed and the difficulties for finding adequate containments are explained. Finally, an outlook to tasks left for the future is given},
keywords = {GNUnet, home router, intrusion detection, memory erasure, Panic, physical access},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/panic.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Nicolas Bene{\v s}}
}
@conference {paper_short2014,
@@ -255,7 +259,7 @@
We begin by detailing the overall requirements for an algorithm for transport selection and resource allocation, and then compare three different solutions using (1) a heuristic, (2) linear optimisation, and (3) machine learning. To show the suitability and the specific benefits of each approach, we evaluate their performance with respect to usability, scalability and quality of the solution found in relation to application requirements},
keywords = {GNUnet, resource allocation},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/paper_short.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Matthias Wachs and Fabian Oehlmann and Christian Grothoff}
}
@book {pir2014,
@@ -284,7 +288,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
abstract = {This paper describes CADET, a new transport protocol for confidential and authenticated data transfer in decentralized networks. This transport protocol is designed to operate in restricted-route scenarios such as friend-to-friend or ad-hoc wireless networks. We have implemented CADET and evaluated its performance in various network scenarios, compared it to the well-known TCP/IP stack and tested its response to rapidly changing network topologies. While our current implementation is still significantly slower in high-speed low-latency networks, for typical Internet-usage our system provides much better connectivity and security with comparable performance to TCP/IP},
keywords = {CADET, encryption, GNUnet, routing},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cadet.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Polot, Bartlomiej and Christian Grothoff}
}
@conference {DistributedSearch2014Hermann,
@@ -293,7 +297,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
year = {2014},
abstract = {The vast majority of Internet users are relying on centralized search engine providers to conduct their web searches. However, search results can be censored and search queries can be recorded by these providers without the user{\textquoteright}s knowledge. Distributed web search engines based on peer-to-peer networks have been proposed to mitigate these threats. In this paper we analyze the three most popular real-world distributed web search engines: Faroo, Seeks and Yacy, with respect to their censorship resistance and privacy protection. We show that none of them provides an adequate level of protection against an adversary with modest resources. Recognizing these flaws, we identify security properties a censorship-resistant and privacy-preserving distributed web search engine should provide. We propose two novel defense mechanisms called node density protocol and webpage verification protocol to achieve censorship resistance and show their effectiveness and feasibility with simulations. Finally, we elaborate on how state-of-the-art defense mechanisms achieve privacy protection in distributed web search engines},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/DistributedSearch2014Hermann.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Michael Herrmann and Ren Zhang and Kai-Chun Ning and Claudia Diaz}
}
@conference {CANS2014camera-ready,
@@ -305,7 +309,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
abstract = {The Domain Name System (DNS) is vital for access to information on the Internet. This makes it a target for attackers whose aim is to suppress free access to information. This paper introduces the design and implementation of the GNU Name System (GNS), a fully decentralized and censorship-resistant name system. GNS provides a privacy-enhancing alternative to DNS which preserves the desirable property of memorable names. Due to its design, it can also double as a partial replacement of public key infrastructures, such as X.509. The design of GNS incorporates the capability to integrate and coexist with DNS. GNS is based on the principle of a petname system and builds on ideas from the Simple Distributed Security Infrastructure (SDSI), addressing a central issue with the decentralized mapping of secure identifiers to memorable names: namely the impossibility of providing a global, secure and memorable mapping without a trusted authority. GNS uses the transitivity in the SDSI design to replace the trusted root with secure delegation of authority, thus making petnames useful to other users while operating under a very strong adversary model. In addition to describing the GNS design, we also discuss some of the mechanisms that are needed to smoothly integrate GNS with existing processes and procedures in Web browsers. Specifically, we show how GNS is able to transparently support many assumptions that the existing HTTP(S) infrastructure makes about globally unique names},
keywords = {DNS, GNU Name System, GNUnet, PKI},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/paper_cans2014_camera_ready.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Matthias Wachs and Martin Schanzenbach and Christian Grothoff}
}
@mastersthesis {scheibner-thesis2014,
@@ -320,7 +324,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
abstract = {Static analysis is often used to automatically check for common bugs in programs. Compilers already check for some common programming errors and issue warnings; however, they do not do a very deep analysis because this would slow the compilation of the program down. Specialized tools like Coverity or Clang Static Analyzer look at possible runs of a program and track the state of variables in respect to function calls. This information helps to identify possible bugs. In event driven programs like GNUnet callbacks are registered for later execution. Normal static analysis cannot track these function calls. This thesis is an attempt to extend different static analysis tools so that they can handle this case as well. Different solutions were thought of and executed with Coverity and Clang. This thesis describes the theoretical background of model checking and static analysis, the practical usage of wide spread static analysis tools, and how these tools can be extended in order to improve their usefulness},
keywords = {event-driven, flow control, GNUnet, static analysis},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/scheibner_thesis.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Florian Scheibner}
}
@mastersthesis {morales2014cryogenic,
@@ -338,7 +342,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
Although we ideally target mobile platforms, Cryogenic has been developed by means a new Linux module that integrates with the existing POSIX event loop system calls. This allows to use Cryogenic on many different platforms as long as they use a GNU/Linux distribution as the main operating system. An evidence of this can be found in this thesis, where we demonstrate the power savings on a single-board computer},
keywords = {cooperative, cryogenic, GNUnet, Linux, POSIX, power},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/morales2014cryogenic.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Alejandra Morales}
}
@mastersthesis {dold-thesis2014voting,
@@ -355,7 +359,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
This thesis describes the design and implementation of an electronic voting system in GNUnet, a framework for secure and decentralized networking. We provide a short survey of voting schemes and existing implementations. The voting scheme we implemented makes use of threshold cryptography, a technique which requires agreement among a large subset of the election officials to execute certain cryptographic operations. Since such protocols have applications outside of electronic voting, we describe their design and implementation in GNUnet separately},
keywords = {GNUnet, secure multiparty computation, voting},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/ba_dold_voting_24aug2014.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Florian Dold}
}
@mastersthesis {decmon2014,
@@ -369,7 +373,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
We start by introducing background information about peer-to-peer networks, anomalies and anomaly detection techniques in literature. Then we present some of the related work regarding monitoring decentralized networks, anomaly detection and data aggregation in decentralized networks. Then we perform an analysis of the system objectives, target environment and the desired properties of the system. Then we design the system in terms of the overall structure and its individual components. We follow with details about the system implementation. Lastly, we evaluate the final system implementation against our desired objectives},
keywords = {anomaly, censorship, detection, GNUnet},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/decmon_0.pdf},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
author = {Omar Tarabai}
}
@book {anonymity_and_cover_traffic2014,
@@ -653,6 +657,7 @@ In this paper we describe the problems that occur when debugging widely distribu
year = {2013},
edition = {Fall 2013},
author = {DeCew, Judith},
+ publisher = {unknown},
www_section = {https://bibliography.gnunet.org},
editor = {Edward N. Zalta}
}
@@ -2107,6 +2112,7 @@ Beyond the theoretical interest in modeling KDFs, this work is intended to addre
keywords = {GNUnet, HKDF, HMAC, key derivation},
www_section = {http://eprint.iacr.org/2010/264},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/264.pdf},
+ publisher = {unknown},
author = {Hugo Krawczyk}
}
@mastersthesis {2010_3,
@@ -3138,6 +3144,7 @@ Unlike previous proposals for P2P anonymity schemes, Torsk does not require all
doi = {10.1007/978-3-642-10865-5},
www_section = {http://www.springerlink.com/content/28660w27373vh408/},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fulltext3.pdf},
+ publisher = {unknown},
author = {Yaser Houri and Manfred Jobmann and Thomas Fuhrmann}
}
@conference {2009_15,
@@ -3341,6 +3348,7 @@ techniques, we show how to optimally modify packets in real-time to reduce the a
doi = {10.1007/978-3-642-10865-5},
www_section = {http://www.springerlink.com/content/h7r3q58251x72155/},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fulltext.pdf},
+ publisher = {unknown},
author = {Benedikt Elser and Andreas F{\"o}rschler and Thomas Fuhrmann}
}
@conference {1582481,
@@ -4712,6 +4720,7 @@ To sample the results, we show that web traffic makes up the majority of the con
doi = {http://doi.acm.org/10.1145/1315245.1315270},
www_section = {http://doi.acm.org/10.1145/1315245.1315270},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/CCS\%2707\%20-\%20ABE\%20with\%20non-monotonic\%20access\%20structures.pdf},
+ publisher = {unknown},
author = {Rafail Ostrovsky and Amit Sahai and Waters, Brent}
}
@book {2007_1,
@@ -4719,6 +4728,7 @@ To sample the results, we show that web traffic makes up the majority of the con
year = {2007},
abstract = {This report documents the current status of the development and implementation of the B.A.T.M.A.N (better approach to mobile ad-hoc networking) routing protocol. B.A.T.M.A.N uses a simple and robust algorithm for establishing multi-hop routes in mobile ad-hoc networks.It ensures highly adaptive and loop-free routing while causing only low processing and traffic cost},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/batman-status.pdf},
+ publisher = {unknown},
author = {Axel Neumann and Corinna Elektra Aichele and Marek Lindner}
}
@conference {ccs07-blac,
@@ -6316,6 +6326,7 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
doi = {10.1007/11822035},
www_section = {http://www.springerlink.com/content/4540535t4v2g2548/},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Combining\%20Virtual\%20and\%20Physical\%20Structures\%20for\%20Self-organized\%20Routing_0.pdf},
+ publisher = {unknown},
author = {Thomas Fuhrmann}
}
@article {2006_4,
@@ -16495,7 +16506,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
month = jan,
pages = {290--297},
keywords = {graphs, random, random graphs},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Erd\%C5\%91s\%20\%26\%20R\%C3\%A9nyi\%20-\%20On\%20Random\%20Graphs.pdf},
author = {Paul Erd{\H o}s and Alfr{\'e}d R{\'e}nyi}
}
@@ -16523,7 +16534,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
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},
- www_section = {https://bibliography.gnunet.org/},
+ www_section = unsorted,
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/PNAS\%20-\%20Nash\%20-\%20Equilibrium\%20points\%20in\%20n-person\%20games.pdf},
author = {John F. Nash Jr.}
}
