commit 3bd89656fe936df81c32d8bc687d1ed93fffaeb9
parent 6553dc3783549ef7356cc13e6839670c497dfd1f
Author: ng0 <ng0@n0.is>
Date: Fri, 5 Jan 2018 19:07:27 +0000
+++
Diffstat:
| M | gnunetbib.bib | | | 53 | ++++++++++++++++++++++++----------------------------- |
1 file changed, 24 insertions(+), 29 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -66,7 +66,7 @@
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/dold2016byzantine.pdf},
author = {Dold, Florian and Grothoff, Christian}
}
-@conference {2016,
+@conference {consensus2016,
title = {Byzantine Set-Union Consensus using Efficient Set Reconciliation},
booktitle = {International Conference on Availability, Reliability and Security (ARES)},
year = {2016},
@@ -84,11 +84,11 @@
publisher = {Springer},
organization = {Springer},
address = {Hyderabad},
- 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.
+ 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.},
+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},
author = {Jeffrey Burdges and Florian Dold and Christian Grothoff and Marcello Stanisci}
@@ -102,8 +102,7 @@ We also include the perspective of merchants, as existing systems have often str
school = {Humboldt-Universitaet zu Berlin},
type = {Diplomarbeit},
address = {Berlin},
- 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.
-},
+ 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},
author = {Christian Ricardo K{\"u}hne}
@@ -116,11 +115,11 @@ We also include the perspective of merchants, as existing systems have often str
publisher = {Springer},
organization = {Springer},
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.},
+ 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},
author = {Martin Schanzenbach and Christian Banse}
}
-@conference {2016,
+@conference {p4t2016,
title = {Privacy-Preserving Abuse Detection in Future Decentralised Online Social Networks},
booktitle = {Data Privacy Management (DPM)},
year = {2016},
@@ -128,12 +127,12 @@ We also include the perspective of merchants, as existing systems have often str
publisher = {Springer},
organization = {Springer},
address = {Heraklion, Greece},
- 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.},
+ 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},
author = {{\'A}lvaro Garc{\'\i}a-Recuero and Jeffrey Burdges and Christian Grothoff}
}
-@article {2016,
+@article {fk-2016-1-p46,
title = {Zur Idee herrschaftsfreier kooperativer Internetdienste},
journal = {FIfF-Kommunikation},
year = {2016},
@@ -142,7 +141,7 @@ We also include the perspective of merchants, as existing systems have often str
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/fk-2016-1-p46.pdf},
author = {Christian Ricardo K{\"u}hne}
}
-@mastersthesis {dold2015byzantine,
+@mastersthesis {ma_dold_consensus_21dec2015byzantine,
title = {Byzantine Fault Tolerant Set Consensus with Efficient Set Reconciliation},
volume = {M.S.},
year = {2015},
@@ -151,12 +150,12 @@ We also include the perspective of merchants, as existing systems have often str
school = {Technische Universitaet Muenchen},
type = {Master{\textquoteright}s},
address = {Muenchen},
- 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.},
+ 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},
author = {Florian Dold}
}
-@article {2015,
+@article {mcb-es2015,
title = {El programa MORECOWBELL de la NSA: Doblan las campanas para el DNS},
year = {2015},
month = {01/2015},
@@ -166,7 +165,7 @@ We also include the perspective of merchants, as existing systems have often str
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-es.pdf},
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum}
}
-@article {2015,
+@article {mcb-it2015,
title = {Il programma MORECOWBELL della NSA: Campane a morto per il DNS},
year = {2015},
month = {01/2015},
@@ -176,7 +175,7 @@ We also include the perspective of merchants, as existing systems have often str
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-it.pdf},
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum and Luca Saiu}
}
-@article {2015,
+@article {mcb-fr2015,
title = {Le programme MORECOWBELL de la NSA Sonne le glas du NSA},
year = {2015},
month = {01/2015},
@@ -186,7 +185,7 @@ We also include the perspective of merchants, as existing systems have often str
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-fr.pdf},
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum and Ludovic Courtes}
}
-@article {2015,
+@article {mcb-en2015,
title = {NSA{\textquoteright}s MORECOWBELL: Knell for DNS},
year = {2015},
month = {01/2015},
@@ -196,7 +195,7 @@ We also include the perspective of merchants, as existing systems have often str
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mcb-en.pdf},
author = {Christian Grothoff and Matthias Wachs and Monika Ermert and Jacob Appelbaum}
}
-@mastersthesis {2014,
+@mastersthesis {mwachs2014,
title = {A Secure and Resilient Communication Infrastructure for Decentralized Networking Applications},
volume = {PhD},
year = {2015},
@@ -205,7 +204,7 @@ We also include the perspective of merchants, as existing systems have often str
school = {Technische Universit{\"a}t M{\"u}nchen},
type = {PhD},
address = {M{\"u}nchen},
- abstract = {This thesis provides the design and implementation of a secure and resilient communication infrastructure for decentralized peer-to-peer networks. The proposed communication infrastructure tries to overcome limitations to unrestricted communication on today{\textquoteright}s Internet and has the goal of re-establishing unhindered communication between users. With the GNU name system, we present a fully decentralized, resilient, and privacy-preserving alternative to DNS and existing security infrastructures. },
+ abstract = {{This thesis provides the design and implementation of a secure and resilient communication infrastructure for decentralized peer-to-peer networks. The proposed communication infrastructure tries to overcome limitations to unrestricted communication on today{\textquoteright}s Internet and has the goal of re-establishing unhindered communication between users. With the GNU name system, we present a fully decentralized, resilient, and privacy-preserving alternative to DNS and existing security infrastructures. }},
keywords = {Communication, GNU Name System, GNUnet, P2P, resilience},
isbn = {3-937201-45-9},
doi = {10.2313/NET-2015-02-1},
@@ -213,7 +212,7 @@ We also include the perspective of merchants, as existing systems have often str
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/NET-2015-02-1.pdf},
author = {Matthias Wachs}
}
-@mastersthesis {2014,
+@mastersthesis {panic2014,
title = {An Approach for Home Routers to Securely Erase Sensitive Data},
volume = {Bachelor},
year = {2014},
@@ -222,26 +221,22 @@ We also include the perspective of merchants, as existing systems have often str
school = {Technische Universit{\"a}t M{\"u}nchen},
type = {Bachelor Thesis},
address = {Munich},
- abstract = {Home routers are always-on low power embedded systems and part of the Internet infrastructure. In addition to the basic router functionality, they can be used to operate sensitive personal services, such as for private web and email servers, secure peer-to-peer networking services like GNUnet and Tor, and encrypted network file system services. These services naturally involve cryptographic operations with the cleartext keys being stored in RAM. This makes router devices possible targets to physical attacks by home intruders. Attacks include interception of unprotected data on bus wires, alteration of firmware through exposed JTAG headers, or recovery of cryptographic keys through the cold boot attack.
-
-This thesis presents Panic!, a combination of open hardware design and free software to detect physical integrity attacks and to react by securely erasing cryptographic keys and other sensitive data from memory. To improve auditability and to allow cheap reproduction, the components of Panic! are kept simple in terms of conceptual design and lines of code.
-
-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.},
+ abstract = {{Home routers are always-on low power embedded systems and part of the Internet infrastructure. In addition to the basic router functionality, they can be used to operate sensitive personal services, such as for private web and email servers, secure peer-to-peer networking services like GNUnet and Tor, and encrypted network file system services. These services naturally involve cryptographic operations with the cleartext keys being stored in RAM. This makes router devices possible targets to physical attacks by home intruders. Attacks include interception of unprotected data on bus wires, alteration of firmware through exposed JTAG headers, or recovery of cryptographic keys through the cold boot attack.
+ This thesis presents Panic!, a combination of open hardware design and free software to detect physical integrity attacks and to react by securely erasing cryptographic keys and other sensitive data from memory. To improve auditability and to allow cheap reproduction, the components of Panic! are kept simple in terms of conceptual design and lines of code.
+ 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},
author = {Nicolas Bene{\v s}}
}
-@conference {2014,
+@conference {paper_short2014,
title = {Automatic Transport Selection and Resource Allocation for Resilient Communication in Decentralised Networks},
booktitle = {14-th IEEE International Conference on Peer-to-Peer Computing},
year = {2014},
month = {10/2014},
address = {London. England},
- abstract = {Making communication more resilient is a main focus for modern decentralised networks. A current development to increase connectivity between participants and to be resilient against service degradation attempts is to support different communication protocols, and to switch between these protocols in case degradation or censorship are detected. Supporting multiple protocols with different properties and having to share resources for communication with multiple partners creates new challenges with respect to protocol selection and resource allocation to optimally satisfy the applications{\textquoteright} requirements for communication.
-
-This paper presents a novel approach for automatic transport selection and resource allocation with a focus on decentralised networks. Our goal is to evaluate the communication mechanisms available for each communication partner and then allocate resources in line with the requirements of the applications.
-
-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.},
+ abstract = {{Making communication more resilient is a main focus for modern decentralised networks. A current development to increase connectivity between participants and to be resilient against service degradation attempts is to support different communication protocols, and to switch between these protocols in case degradation or censorship are detected. Supporting multiple protocols with different properties and having to share resources for communication with multiple partners creates new challenges with respect to protocol selection and resource allocation to optimally satisfy the applications{\textquoteright} requirements for communication.
+ This paper presents a novel approach for automatic transport selection and resource allocation with a focus on decentralised networks. Our goal is to evaluate the communication mechanisms available for each communication partner and then allocate resources in line with the requirements of the applications.
+ 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},
author = {Matthias Wachs and Fabian Oehlmann and Christian Grothoff}
