commit 60af6afd6b87515064bb9a92c2b2ce2f53184a45
parent 53b335a217b8d7ac599d2c60283755a77292fbc2
Author: Nils Gillmann <ng0@n0.is>
Date: Thu, 4 Oct 2018 23:13:25 +0000
For every month=YEAR use january.
Signed-off-by: Nils Gillmann <ng0@n0.is>
Diffstat:
1 file changed, 20 insertions(+), 20 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -260,7 +260,7 @@ We present a hybrid PIR protocol that combines two PIR protocols, one from each
title = {CADET: Confidential Ad-hoc Decentralized End-to-End Transport},
booktitle = {Med-Hoc-Net 2014},
year = {2014},
- month = {2014},
+ month = jan,
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},
@@ -2430,7 +2430,7 @@ outperforms methods that use only one type of social content. Second, we present
booktitle = {Proceedings of 15th International GI/ITG Conference on "Measurement, Modelling and Evaluation of Computing Systems"},
year = {2010},
note = {Best Paper Award},
- month = {2010},
+ month = jan,
pages = {62{\textendash}77},
publisher = {Springer Berlin, Heidelberg},
organization = {Springer Berlin, Heidelberg},
@@ -3294,7 +3294,7 @@ techniques, we show how to optimally modify packets in real-time to reduce the a
title = {Using link-layer broadcast to improve scalable source routing},
booktitle = {IWCMC {\textquoteright}09: Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing},
year = {2009},
- month = {2009},
+ month = jan,
pages = {466{\textendash}471},
publisher = {ACM},
organization = {ACM},
@@ -3384,7 +3384,7 @@ The solutions are efficient, with bandwidth and latency overheads of under 4\% a
title = {AmbiComp: A platform for distributed execution of Java programs on embedded systems by offering a single system image },
booktitle = {AmI-Blocks{\textquoteright}08, European Conference on Ambient Intelligence 2008 manuscript No},
year = {2008},
- month = {2008},
+ month = jan,
abstract = {Ambient Intelligence pursues the vision that small networked computers will jointly perform tasks that create the illusion of an intelligent environment. One of the most pressing challenges in this context is the question how one could easily develop software for such highly complex, but resource-scarce systems. In this paper we present a snapshot of our ongoing work towards facilitating oftware development for Am- bient Intelligence systems. In particular, we present the AmbiComp [1] platform. It consists of small, modular hardware, a
exible rmware including a Java Virtual Machine, and an Eclipse-based integrated development environment},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/publ_2008_eickhold-fuhrmann-saballus-ua_ambicomp.pdf},
@@ -6300,7 +6300,7 @@ In this paper we review SSR{\textquoteright}s self-organizing features and demon
journal = {International Journal of Community Currency Research},
volume = {10},
year = {2006},
- month = {2006},
+ month = jan,
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},
@@ -6518,7 +6518,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
volume = {24},
number = {3},
year = {2006},
- month = {2006},
+ month = jan,
pages = {250{\textendash}291},
publisher = {ACM},
address = {New York, NY, USA},
@@ -6771,7 +6771,7 @@ The algorithms have been implemented in a middleware called the Distributed k-ar
title = {Improving traffic locality in BitTorrent via biased neighbor selection},
booktitle = {Proceedings of the 26th IEEE International Conference on Distributed Computing Systems},
year = {2006},
- month = {2006},
+ month = jan,
pages = {66},
publisher = {IEEE Computer Society},
organization = {IEEE Computer Society},
@@ -9392,7 +9392,7 @@ In this paper we propose an {\textquotedblleft}onion-like{\textquotedblright} en
title = {An Asymptotically Optimal Scheme for P2P File Sharing},
booktitle = {2nd Workshop on the Economics of Peer-to-Peer Systems},
year = {2004},
- month = {2004},
+ month = jan,
address = {Harvard University},
abstract = {The asymptotic analysis of certain public good models for p2p systems suggests that when the aim is to maximize social welfare a fixed contribution scheme in terms of the number of files shared can be asymptotically optimal as the number of participants grows to infinity. Such a simple scheme eliminates free riding, is incentive compatible and obtains a value of social welfare that is within o(n) of that obtained by the second-best policy of the corresponding mechanism design formulation of the problem. We extend our model to account for file popularity, and discuss properties of the resulting equilibria. The fact that a simple optimization problem can be used to closely approximate the solution of the exact model (which is in most cases practically intractable both analytically and computationally), is of great importance for studying several interesting aspects of the system. We consider the evolution of the system to equilibrium in its early life, when both peers and the system planner are still learning about system parameters. We also analyse the case of group formation when peers belong to different classes (such as DSL and dial-up users), and it may be to their advantage to form distinct groups instead of a larger single group, or form such a larger group but avoid disclosing their class. We finally discuss the game that occurs when peers know that a fixed fee will be used, but the distribution of their valuations is unknown to the system designer},
keywords = {asymptotically optimal, P2P, sharing},
@@ -9770,7 +9770,7 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
journal = {Information Management \& Computer Security},
volume = {12},
year = {2004},
- month = {2004},
+ month = jan,
pages = {255--287},
type = {survey},
abstract = {This paper presents a state-of-the-art review of the Web privacy and anonymity enhancing security mechanisms, tools, applications and services, with respect to their architecture, operational principles and vulnerabilities. Furthermore, to facilitate a detailed comparative analysis, the appropriate parameters have been selected and grouped in classes of comparison criteria, in the form of an integrated comparison framework. The main concern during the design of this framework was to cover the confronted security threats, applied technological issues and users{\textquoteright} demands satisfaction. GNUnet{\textquoteright}s Anonymity Protocol (GAP), Freedom, Hordes, Crowds, Onion Routing, Platform for Privacy Preferences (P3P), TRUSTe, Lucent Personalized Web Assistant (LPWA), and Anonymizer have been reviewed and compared. The comparative review has clearly highlighted that the pros and cons of each system do not coincide, mainly due to the fact that each one exhibits different design goals and thus adopts dissimilar techniques for protecting privacy and anonymity},
@@ -9806,7 +9806,7 @@ ict theory to analyse these systems. Under our assumptions, resource distributio
title = {Finite length analysis of LT codes},
booktitle = {Proceedings of the IEEE International Symposium on Information Theory, ISIT 2004},
year = {2004},
- month = {2002},
+ month = jan,
pages = {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},
@@ -10468,7 +10468,7 @@ In this paper we improve these results: we show that the same level of unlinkabi
title = {Public-key encryption with keyword search},
booktitle = {Eurocrypt 2004},
year = {2004},
- month = {2004},
+ month = jan,
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
abstract = {We study the problem of searching on data that is encrypted using a public key system. Consider user Bob who sends email to user Alice encrypted under Alice{\textquoteright}s public key. An email gateway wants to test whether the email contains the keyword "urgent" so that it could route the email accordingly. Alice, on the other hand does not wish to give the gateway the ability to decrypt all her messages. We define and construct a mechanism that enables Alice to provide a key to the gateway that},
@@ -10881,7 +10881,7 @@ While technically and conceptually simple, universal re-encryption leads to new
title = {Active Traffic Analysis Attacks and Countermeasures},
booktitle = {Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing},
year = {2003},
- month = {2003},
+ month = jan,
pages = {31{\textendash}39},
publisher = {IEEE Computer Society Washington, DC, USA},
organization = {IEEE Computer Society Washington, DC, USA},
@@ -10925,7 +10925,7 @@ While technically and conceptually simple, universal re-encryption leads to new
title = {An Analysis of GNUnet and the Implications for Anonymous, Censorship-Resistant Networks},
booktitle = {Proceedings of the 3rd International Workshop on Privacy Enhancing Technologies (PET 2003)},
year = {2003},
- month = {2003},
+ month = jan,
pages = {161{\textendash}176},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
@@ -11489,7 +11489,7 @@ In this paper, we propose a new P2P routing algorithm - - HIERAS to relieve this
title = {k-Anonymous Message Transmission},
booktitle = {Conference on Computer and Communications Security},
year = {2003},
- month = {2003},
+ month = jan,
publisher = {ACM New York, NY, USA},
organization = {ACM New York, NY, USA},
address = {Washington D.C., USA},
@@ -13992,7 +13992,7 @@ We also present a scheme resilient to even pseudonymous profiling yet preserving
title = {Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications},
booktitle = {Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications},
year = {2001},
- month = {2001},
+ month = jan,
pages = {149{\textendash}160},
publisher = { ACM New York, NY, USA},
organization = { ACM New York, NY, USA},
@@ -14905,7 +14905,7 @@ Results based on simulations confirm that Overcast provides its added functional
title = {Practical Techniques for Searches on Encrypted Data},
booktitle = { Security and Privacy, 2000. S\&P 2000. Proceedings. 2000 IEEE Symposium on},
year = {2000},
- month = {2000},
+ month = jan,
address = { Berkeley, CA, USA},
abstract = {It is desirable to store data on data storage servers such as mail servers and file servers in encrypted form to reduce security and privacy risks. But this usually implies that one has to sacrifice functionality for security. For example, if a client wishes to retrieve only documents containing certain words, it was not previously known how to let the data storage server perform the search and answer the query without loss of data confidentiality},
isbn = {0-7695-0665-8},
@@ -15224,7 +15224,7 @@ This exposition presents a model to formally study such algorithms. This model,
title = {Group Principals and the Formalization of Anonymity},
booktitle = {Proceedings of the World Congress on Formal Methods (1)},
year = {1999},
- month = {1999},
+ month = jan,
pages = {814{\textendash}833},
abstract = {We introduce the concept of a group principal and present a number of different classes of group principals, including threshold-group-principals. These appear to naturally useful concepts for looking at security. We provide an associated epistemic language and logic and use it to reason about anonymity protocols and anonymity services, where protection properties are formulated from the intruder{\textquoteright}s knowledge of group principals. Using our language, we give an epistemic characterization of anonymity properties. We also present a specification of a simple anonymizing system using our theory},
keywords = {anonymity service},
@@ -16159,7 +16159,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
title = {A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms},
booktitle = {Proceedings of CRYPTO 84 on Advances in cryptology},
year = {1985},
- month = {1985},
+ month = jan,
pages = {10{\textendash}18},
publisher = {Springer-Verlag New York, Inc},
organization = {Springer-Verlag New York, Inc},
@@ -16345,7 +16345,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
journal = {The Bell System Technical Journal },
volume = {49},
year = {1970},
- month = {1970},
+ month = jan,
pages = {291-307},
abstract = {We consider the problem of partitioning the nodes of a graph with costs on its edges into subsets of given sizes so as to minimize the sum of the costs on all edges cut. This problem arises in several physical situations- for example, in assigning the components of electronic circuits to circuit boards to minimize the number of connections between boards. This paper presents a heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems},
keywords = {heuristic method, partitioning graphs},
@@ -16417,7 +16417,7 @@ The technique can also be used to form rosters of untraceable digital pseudonyms
journal = {Publicationes Mathematicae (Debrecen)},
volume = {6},
year = {1959},
- month = {1959},
+ month = jan,
pages = {290-297},
keywords = {graphs, random, random graphs},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Erd\%C5\%91s\%20\%26\%20R\%C3\%A9nyi\%20-\%20On\%20Random\%20Graphs.pdf},
