commit e6fd36c39f1abafbd188d75c902c5ef924d0be5b
parent d80fe1dfa267aa0e7824c76f37f0b42e75c8e223
Author: Nils Gillmann <ng0@n0.is>
Date: Mon, 8 Oct 2018 12:05:35 +0000
style
Signed-off-by: Nils Gillmann <ng0@n0.is>
Diffstat:
1 file changed, 16 insertions(+), 16 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -63,7 +63,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},
www_section = {CADET, GNUnet, measurement, performance},
- www_section = unsorted,
+ www_section = unsorted,
%url = unsorted,
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/lurchi-bs-thesis.pdf},
author = {Christian Ulrich}
@@ -72,7 +72,7 @@
title = {Byzantine Set-Union Consensus using Efficient Set Reconciliation},
booktitle = {International Conference on Availability, Reliability and Security (ARES)},
year = {2016},
- www_section = unsorted,
+ www_section = unsorted,
%url = unsorted,
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/dold2016byzantine.pdf},
author = {Dold, Florian and Grothoff, Christian}
@@ -85,7 +85,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},
www_section = {byzantine fault tolerance, consensus, GNUnet},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/consensus2016.pdf},
- www_section = unsorted,
+ www_section = unsorted,
%url = unsorted,
author = {Florian Dold and Christian Grothoff}
}
@@ -100,7 +100,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},
www_section = {blind signatures, GNUnet, incentives, payments, Taler, web},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/taler2016space.pdf},
- www_section = unsorted,
+ www_section = unsorted,
%url = unsorted,
author = {Jeffrey Burdges and Florian Dold and Christian Grothoff and Marcello Stanisci}
}
@@ -116,7 +116,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},
www_section = {GNUnet, peer-to-peer},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/xrs2016.pdf},
- www_section = unsorted,
+ www_section = unsorted,
%url = unsorted,
author = {Christian Ricardo K{\"u}hne}
}
@@ -130,7 +130,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},
www_section = {Decentralisation, GNUnet, Identity and Access Management, User Attributes},
- www_section = unsorted,
+ www_section = unsorted,
%url = unsorted,
author = {Martin Schanzenbach and Christian Banse}
}
@@ -145,7 +145,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},
www_section = {abuse, GNUnet, Privacy preserving, reputation, Social networking},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/p4t.pdf},
- www_section = unsorted,
+ www_section = unsorted,
%url = unsorted,
author = {{\'A}lvaro Garc{\'\i}a-Recuero and Jeffrey Burdges and Christian Grothoff}
}
@@ -156,7 +156,7 @@
chapter = {46},
www_section = {Architecture, GNUnet, Internet},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fk-2016-1-p46.pdf},
- www_section = unsorted,
+ www_section = unsorted,
%url = unsorted,
author = {Christian Ricardo K{\"u}hne}
}
@@ -172,7 +172,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},
www_section = {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 = unsorted,
+ www_section = unsorted,
%url = unsorted,
author = {Florian Dold}
}
@@ -185,7 +185,7 @@
www_section = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
journal = {unknown},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-es.pdf},
- www_section = unsorted,
+ www_section = unsorted,
%url = unsorted,
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum}
}
@@ -198,7 +198,7 @@
www_section = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
journal = {unknown},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-it.pdf},
- www_section = unsorted,
+ www_section = unsorted,
%url = unsorted,
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum and Luca Saiu}
}
@@ -211,7 +211,7 @@
www_section = {DNS, DNSSEC, MORECOWBELL, NAMECOIN},
journal = {unknown},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-fr.pdf},
- www_section = unsorted,
+ www_section = unsorted,
%url = unsorted,
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum and Ludovic Courtes}
}
@@ -224,7 +224,7 @@
www_section = {DNS, DNSSEC, MORECOWBELL, NAMECOIN, TLS},
journal = {unknown},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-en.pdf},
- www_section = unsorted,
+ www_section = unsorted,
%url = unsorted,
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum}
}
@@ -259,7 +259,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},
www_section = {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 = unsorted,
+ www_section = unsorted,
%url = unsorted,
author = {Nicolas Bene{\v s}}
}
@@ -274,7 +274,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},
www_section = {GNUnet, resource allocation},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/paper_short.pdf},
- www_section = unsorted,
+ www_section = unsorted,
%url = unsorted,
author = {Matthias Wachs and Fabian Oehlmann and Christian Grothoff}
}
@@ -304,7 +304,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},
www_section = {CADET, encryption, GNUnet, routing},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/cadet.pdf},
- www_section = unsorted,
+ www_section = unsorted,
%url = unsorted,
author = {Polot, Bartlomiej and Christian Grothoff}
}
