Showing papers by "Moni Naor published in 1990"
IBM1
TL;DR: This work shows how to construct a public-key cryptosystem (as originally defined by DiNe and Hellman) secure against chosen ciphertezt attacks, given aPublic-Key cryptosystern secure against passive eavesdropping and a noninteractive zero-knowledge proof system in the shared string model.
Abstract: We show how to construct a public-key cryptosystem (as originally defined by DiNe and Hellman) secure against chosen ciphertezt attacks, given a public-key cryptosystern secure against passive eavesdropping and a noninteractive zero-knowledge proof system in the shared string model. No such secure cryptosystems were known before. A concrete implementation can be based on quadratic residuosity intractability.
1,220 citations
01 Feb 1990
TL;DR: The use of credit cards today is an act of faith on the p a t of all concerned as discussed by the authors, and each party is vulnerable to fraud by the others, and the cardholder in particular has no protection against surveillance.
Abstract: The use of credit cards today is an act of faith on the p a t of all concerned. Each party is vulnerable to fraud by the others, and the cardholder in particular has no protection against surveillance.
1,031 citations
01 Apr 1990
TL;DR: It is shown how to efficiently construct a small probability space on n binary random variables such that for every subset, its parity is either zero or one with "almost" equal probability.
Abstract: It is shown how to efficiently construct a small probability space on n binary random variables such that for every subset, its parity is either zero or one with “almost” equal probability. They are called $\epsilon $-biased random variables. The number of random bits needed to generate the random variables is $O(\log n + \log \frac{1}{\epsilon })$. Thus, if $\epsilon $ is polynomially small, then the size of the sample space is also polynomial. Random variables that are $\epsilon $-biased can be used to construct “almost” k-wise independent random variables where $\epsilon $ is a function of k.These probability spaces have various applications: l. Derandomization of algorithms: Many randomized algorithms that require only k-wise independence of their random bits (where k is bounded by $O(\log n)$), can be derandomized by using $\epsilon $-biased random variables. 2. Reducing the number of random bits required by certain randomized algorithms, e.g., verification of matrix multiplication. 3. Exhaustive tes...
406 citations
IBM1
TL;DR: The problem of maximum-likelihood decoding of linear block codes is known to be hard but the fact that the problem remains hard even if the code is known in advance, and can be preprocessed for as long as desired in order to device a decoding algorithm, is shown.
Abstract: The problem of maximum-likelihood decoding of linear block codes is known to be hard. The fact that the problem remains hard even if the code is known in advance, and can be preprocessed for as long as desired in order to device a decoding algorithm, is shown. The hardness is based on the fact that existence of a polynomial-time algorithm implies that the polynomial hierarchy collapses. Thus, some linear block codes probably do not have an efficient decoder. The proof is based on results in complexity theory that relate uniform and nonuniform complexity classes. >
132 citations
IBM1
TL;DR: It is shown that general unlabeled graphs on n nodes can be represented by (n2) − n log2 n + O(n) bits which is optimal up to the O( n) term.
69 citations
Proceedings Article•
01 Jan 1990
TL;DR: In this paper, it was shown that for every c < 1 there are games on n players in which no coalition of cn players can influence the outcome with probability greater than some universal constant times c.
Abstract: Perfect information coin-flipping and leaderelection games arise naturally in the study of fault tolerant distributed computing and have been considered in many different scenarios. Answering a question of Ben-Or and Linial we prove that for every c < 1 there are such games on n players in which no coalition of cn players can influence the outcome with probability greater than some universal constant times c. We show that a random protocol of a certain length has this property and give an explicit construction as well.
33 citations
IBM1
TL;DR: It is proved that for every c<1 there are perfect-information coin-flipping and leader-election games on n players in which no coalition of cn players can influence the outcome with probability greater than some universal constant times c.
Abstract: It is proved that for every c<1 there are perfect-information coin-flipping and leader-election games on n players in which no coalition of cn players can influence the outcome with probability greater than some universal constant times c. It is shown that a random protocol of a certain length has this property, and an explicit construction is given as well.
27 citations
[...]
TL;DR: This paper explores how the one-bit translation of unbounded message algorithms can be sped up by pipelining, and considers two problems: routing between two processors in an arbitrary network and in some special networks.
Abstract: Many algorithms in distributed systems assume that the size of a single message depends on the number of processors. In this paper, we assume in contrast that messages consist of a single bit. Our main goal is to explore how the one-bit translation of unbounded message algorithms can be sped up by pipelining. We consider two problems. The first is routing between two processors in an arbitrary network and in some special networks (ring, grid, hypercube). The second problem is coloring a synchronous ring with three colors. The routing problem is a very basic subroutine in many distributed algorithms; the three coloring problem demonstrates that pipelining is not always useful.
16 citations