commit 372706e9171785b96577f202a67a24425184f2e2
parent 29fc0b1636fb2f6858d5f31a98197c168115016d
Author: ng0 <ng0@n0.is>
Date: Mon, 8 Jan 2018 18:05:27 +0000
more braces
Diffstat:
| M | gnunetbib.bib | | | 60 | ++++++++++++++++++++++-------------------------------------- |
1 file changed, 22 insertions(+), 38 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -241,7 +241,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/paper_short.pdf},
author = {Matthias Wachs and Fabian Oehlmann and Christian Grothoff}
}
-@inbook {2014,
+@inbook {pir2014,
title = {The Best of Both Worlds: Combining Information-Theoretic and Computational PIR for Communication Efficiency},
booktitle = {Privacy Enhancing Technologies},
series = {Lecture Notes in Computer Science},
@@ -250,8 +250,8 @@ We also include the perspective of merchants, as existing systems have often str
pages = {63-82},
publisher = {Springer International Publishing},
organization = {Springer International Publishing},
- abstract = {The goal of Private Information Retrieval (PIR) is the ability to query a database successfully without the operator of the database server discovering which record(s) of the database the querier is interested in. There are two main classes of PIR protocols: those that provide privacy guarantees based on the computational limitations of servers (CPIR) and those that rely on multiple servers not colluding for privacy (IT-PIR). These two classes have different advantages and disadvantages that make them more or less attractive to designers of PIR-enabled privacy enhancing technologies.
-We present a hybrid PIR protocol that combines two PIR protocols, one from each of these classes. Our protocol inherits many positive aspects of both classes and mitigates some of the negative aspects. For example, our hybrid protocol maintains partial privacy when the security assumptions of one of the component protocols is broken, mitigating the privacy loss in such an event. We have implemented our protocol as an extension of the Percy++ library so that it combines a PIR protocol by Aguilar Melchor and Gaborit with one by Goldberg. We show that our hybrid protocol uses less communication than either of these component protocols and that our scheme is particularly beneficial when the number of records in a database is large compared to the size of the records. This situation arises in applications such as TLS certificate verification, anonymous communications systems, private LDAP lookups, and others.},
+ abstract = {{The goal of Private Information Retrieval (PIR) is the ability to query a database successfully without the operator of the database server discovering which record(s) of the database the querier is interested in. There are two main classes of PIR protocols: those that provide privacy guarantees based on the computational limitations of servers (CPIR) and those that rely on multiple servers not colluding for privacy (IT-PIR). These two classes have different advantages and disadvantages that make them more or less attractive to designers of PIR-enabled privacy enhancing technologies.
+We present a hybrid PIR protocol that combines two PIR protocols, one from each of these classes. Our protocol inherits many positive aspects of both classes and mitigates some of the negative aspects. For example, our hybrid protocol maintains partial privacy when the security assumptions of one of the component protocols is broken, mitigating the privacy loss in such an event. We have implemented our protocol as an extension of the Percy++ library so that it combines a PIR protocol by Aguilar Melchor and Gaborit with one by Goldberg. We show that our hybrid protocol uses less communication than either of these component protocols and that our scheme is particularly beneficial when the number of records in a database is large compared to the size of the records. This situation arises in applications such as TLS certificate verification, anonymous communications systems, private LDAP lookups, and others.}},
isbn = {978-3-319-08505-0},
doi = {10.1007/978-3-319-08506-7_4},
url = {http://dx.doi.org/10.1007/978-3-319-08506-7_4},
@@ -259,32 +259,25 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
author = {Devet, Casey and Goldberg, Ian},
editor = {De Cristofaro, Emiliano and Murdoch, StevenJ.}
}
-@conference {9998,
+@conference {CADET,
title = {CADET: Confidential Ad-hoc Decentralized End-to-End Transport},
booktitle = {Med-Hoc-Net 2014},
year = {2014},
month = {2014},
- 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.},
+ 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},
author = {Polot, Bartlomiej and Christian Grothoff}
}
-@conference {2014,
+@conference {DistributedSearch2014Hermann,
title = {Censorship-Resistant and Privacy-Preserving Distributed Web Search},
booktitle = {IEEE International Conference on Peer to Peer computing},
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.},
+ 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},
author = {Michael Herrmann and Ren Zhang and Kai-Chun Ning and Claudia Diaz}
}
-@conference {2014,
+@conference {CANS2014camera-ready,
title = {A Censorship-Resistant, Privacy-Enhancing and Fully Decentralized Name System},
booktitle = {International Conference on Cryptology and Network Security (CANS)},
year = {2014},
@@ -295,7 +288,7 @@ show their effectiveness and feasibility with simulations. Finally, we elaborate
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/paper_cans2014_camera_ready.pdf},
author = {Matthias Wachs and Martin Schanzenbach and Christian Grothoff}
}
-@mastersthesis {2014,
+@mastersthesis {scheibner-thesis2014,
title = {Control Flow Analysis for Event-Driven Programs},
volume = {B.Sc},
year = {2014},
@@ -304,12 +297,12 @@ show their effectiveness and feasibility with simulations. Finally, we elaborate
school = {Technical University of Munich},
type = {Bachelors},
address = {Munich},
- 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.},
+ 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},
author = {Florian Scheibner}
}
-@mastersthesis {2014,
+@mastersthesis {morales2014cryogenic,
title = {Cryogenic: Enabling Power-Aware Applications on Linux},
volume = {M. Sc.},
year = {2014},
@@ -318,21 +311,15 @@ show their effectiveness and feasibility with simulations. Finally, we elaborate
school = {Technische Universitaet Muenchen},
type = {Masters},
address = {Garching bei Muenchen},
- abstract = {{As a means of reducing power consumption, hardware devices are capable to enter into sleep-states that have low power consumption. Waking up from those states in order to return to work is typically a rather energy-intensive activity. Some existing applications have non-urgent tasks that currently force hardware to wake up needlessly or prevent it from going to sleep. It would be better if such non-urgent activities could be scheduled to execute when the respective devices are active
-to maximize the duration of sleep-states. This requires cooperation between applications and the kernel in order to determine when the execution of a task will not be expensive in terms of power consumption.
-
-This work presents the design and implementation of Cryogenic, a POSIX-compatible API that enables clustering tasks based on the hardware activity state. Specifically, Cryogenic{\textquoteright}s API allows applications to defer their execution until other tasks use the device they want to use. As a result,
-two actions that contribute to reduce the device energy consumption are achieved: reduce the number of hardware wake-ups and maximize the idle periods.
-
-The energy measurements enacted at the end of this thesis demonstrate that, for the specific setup and conditions present during our experimentation, Cryogenic is capable to achieve savings between 1\% and 10\% for a USB WiFi device.
-
-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.
-},
+ abstract = {{As a means of reducing power consumption, hardware devices are capable to enter into sleep-states that have low power consumption. Waking up from those states in order to return to work is typically a rather energy-intensive activity. Some existing applications have non-urgent tasks that currently force hardware to wake up needlessly or prevent it from going to sleep. It would be better if such non-urgent activities could be scheduled to execute when the respective devices are active to maximize the duration of sleep-states. This requires cooperation between applications and the kernel in order to determine when the execution of a task will not be expensive in terms of power consumption.
+ This work presents the design and implementation of Cryogenic, a POSIX-compatible API that enables clustering tasks based on the hardware activity state. Specifically, Cryogenic{\textquoteright}s API allows applications to defer their execution until other tasks use the device they want to use. As a result, two actions that contribute to reduce the device energy consumption are achieved: reduce the number of hardware wake-ups and maximize the idle periods.
+ The energy measurements enacted at the end of this thesis demonstrate that, for the specific setup and conditions present during our experimentation, Cryogenic is capable to achieve savings between 1\% and 10\% for a USB WiFi device.
+ 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},
author = {Alejandra Morales}
}
-@mastersthesis {2014,
+@mastersthesis {dold-thesis2014voting,
title = {Cryptographically Secure, Distributed Electronic Voting},
volume = {B.S.},
year = {2014},
@@ -341,25 +328,22 @@ Although we ideally target mobile platforms, Cryogenic has been developed by mea
school = {Technische Universitaet Muenchen},
type = {Bachelor{\textquoteright}s},
address = {Muenchen},
- abstract = {{Elections are a vital tool for decision-making in democratic societies. The past decade has witnessed a handful of attempts to apply modern technology to the election process in order to make it faster and more cost-effective.
-Most of the practical efforts in this area have focused on replacing traditional voting booths with electronic terminals, but did not attempt to apply cryptographic techniques able to guarantee critical properties of elections such as secrecy of ballot and verifiability. While such techniques were extensively researched in the past 30 years, practical implementation of cryptographically secure remote electronic voting schemes are not readily available. All existing implementation we are aware of either exhibit critical security flaws, are proprietary black-box systems or require additional physical assumptions such as a preparatory key ceremony executed by the election officials. The latter makes such systems unusable for purely digital communities.
-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.
-},
+ abstract = {{Elections are a vital tool for decision-making in democratic societies. The past decade has witnessed a handful of attempts to apply modern technology to the election process in order to make it faster and more cost-effective.
+ Most of the practical efforts in this area have focused on replacing traditional voting booths with electronic terminals, but did not attempt to apply cryptographic techniques able to guarantee critical properties of elections such as secrecy of ballot and verifiability. While such techniques were extensively researched in the past 30 years, practical implementation of cryptographically secure remote electronic voting schemes are not readily available. All existing implementation we are aware of either exhibit critical security flaws, are proprietary black-box systems or require additional physical assumptions such as a preparatory key ceremony executed by the election officials. The latter makes such systems unusable for purely digital communities.
+ 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},
author = {Florian Dold}
}
-@mastersthesis {2014,
+@mastersthesis {decmon2014,
title = {A Decentralized and Autonomous Anomaly Detection Infrastructure for Decentralized Peer-to-Peer Networks},
volume = {Master},
year = {2014},
month = {10/2014},
pages = {63},
type = {Master},
- abstract = {{In decentralized networks, collecting and analysing information from the network is useful for developers and operators to monitor the behaviour and detect anomalies such as attacks or failures in both the overlay and underlay networks. But realizing such an infrastructure is hard to achieve due to the decentralized nature of the network especially if the anomaly occurs on systems not operated by developers or participants get separated from the collection points. In this thesis a decentralized monitoring infrastructure using a decentralized peer-to-peer network is developed to collect information and detect anomalies in a collaborative way without coordination by and in absence of a centralized infrastructure and report detected incidents to a monitoring infrastructure.
-
-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.},
+ abstract = {{In decentralized networks, collecting and analysing information from the network is useful for developers and operators to monitor the behaviour and detect anomalies such as attacks or failures in both the overlay and underlay networks. But realizing such an infrastructure is hard to achieve due to the decentralized nature of the network especially if the anomaly occurs on systems not operated by developers or participants get separated from the collection points. In this thesis a decentralized monitoring infrastructure using a decentralized peer-to-peer network is developed to collect information and detect anomalies in a collaborative way without coordination by and in absence of a centralized infrastructure and report detected incidents to a monitoring infrastructure.
+ 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},
author = {Omar Tarabai}
