commit b477f4d33a2b0e98c3c62e84e4f3ab3290a28689
parent ac2894231c9e90a7191fa850fbca192403e6eac0
Author: ng0 <ng0@n0.is>
Date: Fri, 5 Jan 2018 19:12:31 +0000
+++
Diffstat:
1 file changed, 17 insertions(+), 21 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -16063,7 +16063,7 @@ We also sketch applications of these signatures to a payment system, solving dis
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
- abstract = {{Every function of n inputs can be efficiently computed by a complete network of n processors in such a way that: If no faults occur, no set of size t < n/2 of players gets any additional information (other than the function value), Even if Byzantine faults are allowed, no set of size t < n/3 can either disrupt the computation or get additional information. Furthermore, the above bounds on t are tight!},
+ abstract = {{Every function of n inputs can be efficiently computed by a complete network of n processors in such a way that: If no faults occur, no set of size t < n/2 of players gets any additional information (other than the function value), Even if Byzantine faults are allowed, no set of size t < n/3 can either disrupt the computation or get additional information. Furthermore, the above bounds on t are tight!}},
isbn = {0-89791-264-0},
doi = {10.1145/62212.62213},
url = {http://doi.acm.org/10.1145/62212.62213},
@@ -16076,9 +16076,7 @@ We also sketch applications of these signatures to a payment system, solving dis
volume = {1},
year = {1988},
pages = {65{\textendash}75},
- abstract = {{Keeping confidential who sends which messages, in a world where any physical transmission can be traced to its origin, seems impossible. The solution
-presented here is unconditionally or cryptographically secure, depending on whether it is based on one-time-use keys or on public keys, respectively. It can be
-adapted to address efficiently a wide variety of practical considerations.},
+ abstract = {{Keeping confidential who sends which messages, in a world where any physical transmission can be traced to its origin, seems impossible. The solution presented here is unconditionally or cryptographically secure, depending on whether it is based on one-time-use keys or on public keys, respectively. It can be adapted to address efficiently a wide variety of practical considerations.}},
keywords = {pseudonym, unconditional security, untraceability},
issn = {0933-2790},
url = {http://portal.acm.org/citation.cfm?id=54239},
@@ -16092,7 +16090,7 @@ adapted to address efficiently a wide variety of practical considerations.},
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
- abstract = {{Suppose your netmail is being erratically censored by Captain Yossarian. Whenever you send a message, he censors each bit of the message with probability 1/2, replacing each censored bit by some reserved character. Well versed in such concepts as redundancy, this is no real problem to you. The question is, can it actually be turned around and used to your advantage? We answer this question strongly in the affirmative. We show that this protocol, more commonly known as oblivious transfer, can be used to simulate a more sophisticated protocol, known as oblivious circuit evaluation([Y]). We also show that with such a communication channel, one can have completely noninteractive zero-knowledge proofs of statements in NP. These results do not use any complexity-theoretic assumptions. We can show that they have applications to a variety of models in which oblivious transfer can be done.},
+ abstract = {{Suppose your netmail is being erratically censored by Captain Yossarian. Whenever you send a message, he censors each bit of the message with probability 1/2, replacing each censored bit by some reserved character. Well versed in such concepts as redundancy, this is no real problem to you. The question is, can it actually be turned around and used to your advantage? We answer this question strongly in the affirmative. We show that this protocol, more commonly known as oblivious transfer, can be used to simulate a more sophisticated protocol, known as oblivious circuit evaluation([Y]). We also show that with such a communication channel, one can have completely noninteractive zero-knowledge proofs of statements in NP. These results do not use any complexity-theoretic assumptions. We can show that they have applications to a variety of models in which oblivious transfer can be done.}},
keywords = {oblivious circuits},
isbn = {0-89791-264-0},
doi = {10.1145/62212.62215},
@@ -16107,7 +16105,7 @@ adapted to address efficiently a wide variety of practical considerations.},
publisher = {ACM},
organization = {ACM},
address = {New York, NY, USA},
- abstract = {{We present a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest. Our algorithm automatically solves all the multi-party protocol problems addressed in complexity-based cryptography during the last 10 years. It actually is a completeness theorem for the class of distributed protocols with honest majority. Such completeness theorem is optimal in the sense that, if the majority of the players is not honest, some protocol problems have no efficient solution [C].},
+ abstract = {{We present a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest. Our algorithm automatically solves all the multi-party protocol problems addressed in complexity-based cryptography during the last 10 years. It actually is a completeness theorem for the class of distributed protocols with honest majority. Such completeness theorem is optimal in the sense that, if the majority of the players is not honest, some protocol problems have no efficient solution [C].}},
isbn = {0-89791-221-7},
doi = {10.1145/28395.28420},
url = {http://doi.acm.org/10.1145/28395.28420},
@@ -16123,7 +16121,7 @@ adapted to address efficiently a wide variety of practical considerations.},
pages = {149{\textendash}154},
publisher = {ACM},
address = {New York, NY, USA},
- abstract = {{This paper describes a technique for implementing the sort of small databases that frequently occur in the design of operating systems and distributed systems. We take advantage of the existence of very large virtual memories, and quite large real memories, to make the technique feasible. We maintain the database as a strongly typed data structure in virtual memory, record updates incrementally on disk in a log and occasionally make a checkpoint of the entire database. We recover from crashes by restoring the database from an old checkpoint then replaying the log. We use existing packages to convert between strongly typed data objects and their disk representations, and to communicate strongly typed data across the network (using remote procedure calls). Our memory is managed entirely by a general purpose allocator and garbage collector. This scheme has been used to implement a name server for a distributed system. The resulting implementation has the desirable property of being simultaneously simple, efficient and reliable. },
+ abstract = {{This paper describes a technique for implementing the sort of small databases that frequently occur in the design of operating systems and distributed systems. We take advantage of the existence of very large virtual memories, and quite large real memories, to make the technique feasible. We maintain the database as a strongly typed data structure in virtual memory, record updates incrementally on disk in a log and occasionally make a checkpoint of the entire database. We recover from crashes by restoring the database from an old checkpoint then replaying the log. We use existing packages to convert between strongly typed data objects and their disk representations, and to communicate strongly typed data across the network (using remote procedure calls). Our memory is managed entirely by a general purpose allocator and garbage collector. This scheme has been used to implement a name server for a distributed system. The resulting implementation has the desirable property of being simultaneously simple, efficient and reliable. }},
issn = {0163-5980},
doi = {10.1145/37499.37517},
url = {http://portal.acm.org/citation.cfm?id=37499.37517$\#$},
@@ -16140,7 +16138,7 @@ adapted to address efficiently a wide variety of practical considerations.},
publisher = {ACM},
organization = {ACM},
address = {Stowe, VT, USA},
- abstract = {{Decentralized resource management in distributed systems has become more practical with the availability of communication facilities that support multicasting. In this paper we present several example solutions for managing resources in a decentralized fashion, using multicasting facilities. We review the properties of these solutions in terms of scalability, fault tolerance and efficiency. We conclude that decentralized solutions compare favorably to centralized solutions with respect to all three criteria.},
+ abstract = {{Decentralized resource management in distributed systems has become more practical with the availability of communication facilities that support multicasting. In this paper we present several example solutions for managing resources in a decentralized fashion, using multicasting facilities. We review the properties of these solutions in terms of scalability, fault tolerance and efficiency. We conclude that decentralized solutions compare favorably to centralized solutions with respect to all three criteria.}},
keywords = {decentralized, distributed systems, multicasting},
isbn = {0-89791-245-4},
doi = {http://doi.acm.org/10.1145/55482.55508},
@@ -16157,7 +16155,7 @@ adapted to address efficiently a wide variety of practical considerations.},
pages = {245-253},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
- abstract = {{In usual communication networks, the network operator or an intruder could easily observe when, how much and with whom the users communicate (traffic analysis), even if the users employ end-to-end encryption. When ISDNs are used for almost everything, this becomes a severe threat. Therefore, we summarize basic concepts to keep the recipient and sender or at least their relationship unobservable, consider some possible implementations and necessary hierarchical extensions, and propose some suitable performance and reliability enhancements.},
+ abstract = {{In usual communication networks, the network operator or an intruder could easily observe when, how much and with whom the users communicate (traffic analysis), even if the users employ end-to-end encryption. When ISDNs are used for almost everything, this becomes a severe threat. Therefore, we summarize basic concepts to keep the recipient and sender or at least their relationship unobservable, consider some possible implementations and necessary hierarchical extensions, and propose some suitable performance and reliability enhancements.}},
isbn = {978-3-540-16468-5},
doi = {10.1007/3-540-39805-8_29},
url = {http://dx.doi.org/10.1007/3-540-39805-8_29},
@@ -16174,7 +16172,7 @@ adapted to address efficiently a wide variety of practical considerations.},
pages = {37{\textendash}79},
publisher = {ACM},
address = {New York, NY, USA},
- abstract = {{The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis Steele Jr. and Gerald Jay Sussman. It was designed to have an exceptionally clear and simple semantics and few different ways to form expressions. A wide variety of programming paradigms, including imperative, functional, and message passing styles, find convenient expression in Scheme. The introduction offers a brief history of the language and of the report. The first three chapters present the fundamental ideas of the language and describe the notational conventions used for describing the language and for writing programs in the language.},
+ abstract = {{The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis Steele Jr. and Gerald Jay Sussman. It was designed to have an exceptionally clear and simple semantics and few different ways to form expressions. A wide variety of programming paradigms, including imperative, functional, and message passing styles, find convenient expression in Scheme. The introduction offers a brief history of the language and of the report. The first three chapters present the fundamental ideas of the language and describe the notational conventions used for describing the language and for writing programs in the language.}},
issn = {0362-1340},
doi = {10.1145/15042.15043},
url = {http://en.scientificcommons.org/42347723},
@@ -16185,7 +16183,7 @@ adapted to address efficiently a wide variety of practical considerations.},
title = {Using Sparse Capabilities in a Distributed Operating System},
year = {1986},
pages = {558{\textendash}563},
- abstract = {{this paper we discuss a system, Amoeba, that uses capabilities for naming and protecting objects. In contrast to traditional, centralized operating systems, in which capabilities are managed by the operating system kernel, in Amoeba all the capabilities are managed directly by user code. To prevent tampering, the capabilities are protected cryptographically. The paper describes a variety of the issues involved, and gives four different ways of dealing with the access rights.},
+ abstract = {{this paper we discuss a system, Amoeba, that uses capabilities for naming and protecting objects. In contrast to traditional, centralized operating systems, in which capabilities are managed by the operating system kernel, in Amoeba all the capabilities are managed directly by user code. To prevent tampering, the capabilities are protected cryptographically. The paper describes a variety of the issues involved, and gives four different ways of dealing with the access rights.}},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.7998},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.56.3350.pdf},
author = {Andrew Tanenbaum and Sape J. Mullender and Robbert Van Renesse}
@@ -16199,7 +16197,7 @@ adapted to address efficiently a wide variety of practical considerations.},
pages = {374{\textendash}382},
publisher = {ACM},
address = {New York, NY, USA},
- abstract = {{The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the {\textquotedblleft}Byzantine Generals{\textquotedblright} problem.},
+ abstract = {{The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the {\textquotedblleft}Byzantine Generals{\textquotedblright} problem.}},
issn = {0004-5411},
doi = {10.1145/3149.214121},
url = {http://portal.acm.org/citation.cfm?id=214121$\#$},
@@ -16214,9 +16212,8 @@ adapted to address efficiently a wide variety of practical considerations.},
publisher = {Springer-Verlag New York, Inc.},
organization = {Springer-Verlag New York, Inc.},
address = {Linz, Austria},
- abstract = {{In present-day communication networks, the network operator or an intruder could easily observe when, how much and with whom the users communicate (traffic analysis), even if the users employ end-to-end encryption. With the increasing use of ISDNs, this becomes a severe threat.
-Therefore, we summarize basic concepts to keep the recipient and sender or at least their relationship unobservable, consider some possible implementations and necessary hierarchical extensions, and propose some suitable performance and reliability enhancements.
-},
+ abstract = {{In present-day communication networks, the network operator or an intruder could easily observe when, how much and with whom the users communicate (traffic analysis), even if the users employ end-to-end encryption. With the increasing use of ISDNs, this becomes a severe threat.
+Therefore, we summarize basic concepts to keep the recipient and sender or at least their relationship unobservable, consider some possible implementations and necessary hierarchical extensions, and propose some suitable performance and reliability enhancements.}},
keywords = {anonymity, dining cryptographers, fault-tolerance, ISDN, mix, ring network, traffic analysis, user observability},
isbn = {0-387-16468-5},
url = {http://www.semper.org/sirene/publ/PfWa_86anonyNetze.html},
@@ -16231,7 +16228,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
publisher = {Springer-Verlag New York, Inc.},
organization = {Springer-Verlag New York, Inc.},
address = {Santa Barbara, California},
- abstract = {{A new signature scheme is proposed together with an implementation of the Diffie - Hellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the difficulty of computing discrete logarithms over finite fields.},
+ abstract = {{A new signature scheme is proposed together with an implementation of the Diffie - Hellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the difficulty of computing discrete logarithms over finite fields.}},
keywords = {cryptosystem, discrete logarithms, public key, signature scheme},
isbn = {0-387-15658-5},
url = {http://dl.acm.org/citation.cfm?id=19478.19480s},
@@ -16247,7 +16244,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
pages = {637{\textendash}654},
publisher = {John Wiley \& Sons, Inc.},
address = {New York, NY, USA},
- abstract = {{An important problem in program development and maintenance is version control, i.e., the task of keeping a software system consisting of many versions and configurations well organized. The Revision Control System (RCS) is a software tool that assists with that task. RCS manages revisions of text documents, in particular source programs, documentation, and test data. It automates the storing, retrieval, logging and identification of revisions, and it provides selection mechanisms for composing configurations. This paper introduces basic version control concepts and discusses the practice of version control using RCS. For conserving space, RCS stores deltas, i.e., differences between successive revisions. Several delta storage methods are discussed. Usage statistics show that RCS{\textquoteright}s delta storage method is space and time efficient. The paper concludes with a detailed survey of version control tools.},
+ abstract = {{An important problem in program development and maintenance is version control, i.e., the task of keeping a software system consisting of many versions and configurations well organized. The Revision Control System (RCS) is a software tool that assists with that task. RCS manages revisions of text documents, in particular source programs, documentation, and test data. It automates the storing, retrieval, logging and identification of revisions, and it provides selection mechanisms for composing configurations. This paper introduces basic version control concepts and discusses the practice of version control using RCS. For conserving space, RCS stores deltas, i.e., differences between successive revisions. Several delta storage methods are discussed. Usage statistics show that RCS{\textquoteright}s delta storage method is space and time efficient. The paper concludes with a detailed survey of version control tools.}},
keywords = {version control},
issn = {0038-0644},
doi = {10.1002/spe.4380150703},
@@ -16263,7 +16260,7 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
year = {1985},
month = {10/1985},
pages = {1030 - 1044 },
- abstract = {{The large-scale automated transaction systems of the near future can be designed to protect the privacy and maintain the security of both individuals and organizations.},
+ abstract = {{The large-scale automated transaction systems of the near future can be designed to protect the privacy and maintain the security of both individuals and organizations.}},
issn = {0001-0782},
doi = {http://doi.acm.org/10.1145/4372.4373},
url = {http://portal.acm.org/citation.cfm?id=4373},
@@ -16316,9 +16313,8 @@ Therefore, we summarize basic concepts to keep the recipient and sender or at le
year = {1981},
month = {02/1981},
pages = {84 - 90},
- abstract = {{A technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication - in spite of an unsecured underlying telecommunication system. The technique does not require a universally trusted authority. One correspondent can remain anonymous to a second, while allowing the second to respond via an untraceable return address.
-
-The technique can also be used to form rosters of untraceable digital pseudonyms from selected applications. Applicants retain the exclusive ability to form digital signatures corresponding to their pseudonyms. Elections in which any interested party can verify that the ballots have been properly counted are possible if anonymously mailed ballots are signed with pseudonyms from a roster of registered voters. Another use allows an individual to correspond with a record-keeping organization under a unique pseudonym which appears in a roster of acceptable clients.},
+ abstract = {{A technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication - in spite of an unsecured underlying telecommunication system. The technique does not require a universally trusted authority. One correspondent can remain anonymous to a second, while allowing the second to respond via an untraceable return address.
+The technique can also be used to form rosters of untraceable digital pseudonyms from selected applications. Applicants retain the exclusive ability to form digital signatures corresponding to their pseudonyms. Elections in which any interested party can verify that the ballots have been properly counted are possible if anonymously mailed ballots are signed with pseudonyms from a roster of registered voters. Another use allows an individual to correspond with a record-keeping organization under a unique pseudonym which appears in a roster of acceptable clients.}},
keywords = {digital signature, electronic mail, privacy, pseudonym, public key cryptography, traffic analysis},
issn = {0001-0782 },
doi = {http://doi.acm.org/10.1145/358549.358563},
