O. Goldreich, L. A. Levin and N. Nisan, On Constructing 1-1 One-Way Functions, Electronic Colloquium on Computational Complexity (ECCC), Vol. 2, Nr. 029, 1995.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Limits on the Power of Quantum Statistical Zero-Knowledge - Watrous (2002) (3 citations) (Correct)
....Zeroknowledge proof systems were first defined by Goldwasser, Micali, and Rackoff [14] in 1985, are have since been studied extensively in complexity theory and cryptography. Familiarity with the basics of zero knowledge proof systems is assumed in this paper; see, for instance, Goldreich [9, 10] for background on zero knowledge. Several notions of zero knowledge have been studied, but we will only consider statistical zero knowledge in this paper. Moreover, we will focus on honest verifier statistical zero knowledge, which means that it need only be possible for a polynomial time ....
O. Goldreich. Probabilistic proof systems. Technical Report TR94-008, Electronic Colloquium on Computational Complexity, 1994.
Universal Service-Providers for Database Private.. - Di-Crescenzo, Ishai, .. (1999) (Correct)
....(in the appropriate sense) by the adversary. Any commodity scheme C (or PIR scheme P) can be extended into a ae query scheme using ae parallel and independent repetitions. This extension will be referred to as the naive q query extension of C. It follows by a standard hybrid argument (cf. [12]) that if C is private with privacy level (F ; E) then its naive ae query extension is private with privacy level (F ; aeE) where aeE = fae : 2 e.g. We show that in the case of our commodity schemes, the commodity cost of the naive ae query extension can be reduced. We start with a ....
O. Goldreich. Foundations of Cryptography (fragments of a book). Electronic Colloquium on Computational Complexity, 1995. Electronic publication: http://www.eccc.uni-trier.de/eccc-local/ECCC-Books/eccc-books.html.
In Search of an Easy Witness: Exponential Time vs.. - Impagliazzo, Kabanets (Correct)
....generator mapping f0; 1g . Such a circuit C may not use some of its n inputs. 7 As observed in [Yao82, NW94] a quick SIZE(n) pseudorandom generator G : f0; 1g allows one to simulate every BPP algorithm in deterministic time 2 , for some k 2 N. Goldreich and Zuckerman [GZ97] show that a quick SIZE(n) pseudorandom generator G : f0; 1g allows one to decide every MA language in nondeterministic time 2 , for some k 2 N. Thus, if we can efficiently generate the truth tables of Boolean functions of superpolynomial circuit complexity, then we can derandomize MA, ....
O. Goldreich and D. Zuckerman. Another proof that BPP`PH (and more). Electronic Colloquium on Computational Complexity, TR97-045, 1997.
Efficient and Concurrent Zero-Knowledge from any public.. - Micciancio, Petrank (2002) (Correct)
....applications one needs to make sure that the proof system is zero knowledge not only when executed in isolation, but also when many instances of the proof system are executed asynchronously and concurrently. This strong notion of zero knowledge has been the subject of many recent investigations [15, 33, 14, 9, 10, 5, 39, 32, 6, 8, 1]. For example, in [10, 5] it is shown that if a public key infrastructure (PKI) is in place, then all languages in NP have an ecient (constant round) concurrent zero knowledge proof system. Unfortunately, in the standard model, where no PKI is available, Canetti, Kilian, Petrank and Rosen [6] ....
....is zero knowledge not only when executed in isolation, but also when many instances of the proof system are executed asynchronously and concurrently. This strong notion of zero knowledge has been the subject of many recent investigations [15, 33, 14, 9, 10, 5, 39, 32, 6, 8, 1] For example, in [10, 5], it is shown that if a public key infrastructure (PKI) is in place, then all languages in NP have an ecient (constant round) concurrent zero knowledge proof system. Unfortunately, in the standard model, where no PKI is available, Canetti, Kilian, Petrank and Rosen [6] have shown that no ....
R. Canetti, O. Goldreich, S. Goldwasser and S. Micali. Resettable zero-knowledge. Revision 1 of Report CR99-042, the Electronic Colloquium on Computational Complexity (ECCC) ftp://ftp.eccc.uni-trier.de/pub/eccc/, June 2000.
Extractors and Pseudorandom Generators - Trevisan (1999) (7 citations) (Correct)
....informationtheoretic randomness is being considered. In the past there have been some instances of results about computational randomness inspired by (typically trivial) information theoretic analogs, e.g. the celebrated Yao s XOR Lemma and various kind of direct product results (see e.g. GNW95] On the other hand, it seemed clear that one could not go the other way, and have informationtheoretic applications of computational results. This prejudice might be one reason why the connection discovered in this paper has been missed by the several people who worked on weak random sources ....
O. Goldreich, N. Nisan, and A. Wigderson. On Yao's XOR lemma. Technical Report TR95-50, Electronic Colloquium on Computational Complexity, 1995.
On the Query Complexity of Sets - Beigel, Gasarch, Kummer, Martin.. (1996) (Correct)
....the following sets. n = f(x 1 ; xn ) jA fx 1 ; xn gj is oddg, for n 1. n = f(x 1 ; xn ) jA fx 1 ; xn gj 6j 0 (mod m)g, for m 2; n 1. The set ODD n is similar to the PARITY problem, which has been well studied [5, 9, 16] In addition, Yao has proved [8, 13] (in a different framework) that if a set A is unpredictable, then ODD n is also unpredictable. Hence the set n is of interest. WMOD(m) n is a generalization of ODD n . The acronym WMODm stands for Weak MODm. MODm is the numeric function that, given x, returns y 2 f0; m Gamma 1g such ....
O. Goldreich, N. Nisan, and A. Wigderson. On Yao's xor-lemma. Technical Report TR95-050, Electronic Colloquium on Computational Complexity, 1995.
Reductions in Streaming Algorithms, with an.. - Bar-Yossef, Kumar.. (Correct)
....the AMS algorithm and the estimator Y . Without loss of generality, we assume m is a power of two; otherwise, we replace it by the smallest power of two above it. The 2 universal family of hash functions we use for both the AMS simulation and the estimator Y is the Toeplitz family [Gol97]: for M N , an M N Toeplitz matrix is one whose diagonals are homogeneous, i.e. all the entries in each diagonal contain the same value. Thus, a Toeplitz matrix is completely speci ed by the values at its rst row and its rst column. Each function h : f0; 1g N f0; 1g M in the Toeplitz ....
O. Goldreich. A sample of samplers { a computational perspective on sampling (survey). Electronic Colloquium on Computational Complexity (ECCC), TR97-020, 1997.
On Concurrent and Resettable Zero-Knowledge Proofs for NP - Kilian, Petrank, Richardson (Correct)
....does not remain concurrent zero knowledge. Possibly, the same proof system remains zero knowledge even if the number of rounds is set to O(log n) but we do not know how to show it. This is an interesting open question. 1.2. 1 Resettable zero knowledge Finally, we note that the techniques in [3] apply to our new protocol. Thus, our concurrent zeroknowledge interactive proof can be modi ed to be made resettable zero knowledge. Resettable zeroknowledge proofs were presented by Canetti, Goldreich, Goldwasser and Micali [3] Such proofs are zero knowledge proofs that on top of being ....
....Resettable zero knowledge Finally, we note that the techniques in [3] apply to our new protocol. Thus, our concurrent zeroknowledge interactive proof can be modi ed to be made resettable zero knowledge. Resettable zeroknowledge proofs were presented by Canetti, Goldreich, Goldwasser and Micali [3]. Such proofs are zero knowledge proofs that on top of being concurrent, maintain zero knowledge properties when the veri er is allowed to run the prover repeatedly on a xed (yet, randomly chosen) random tape. The practical motivation behind such robustness is a use of zero knowledge in ....
[Article contains additional citation context not shown here]
R. Canetti, O. Goldreich, S. Goldwasser and S. Micali. Resettable zero-knowledge. Revision 1 of Report TR99-042, the Electronic Colloquium on Computational Complexity (ECCC) ftp://ftp.eccc.uni-trier.de/pub/eccc/, June 2000. A preliminary version appears in Proc. 32nd Annual ACM Symposium on Theory of Computing May 2000.
Candidate One-Way Functions and One-Way Permutations Based on.. - Gligoroski (2005) Self-citation (One-way) (Correct)
No context found.
O. Goldreich, L. A. Levin and N. Nisan, On Constructing 1-1 One-Way Functions, Electronic Colloquium on Computational Complexity (ECCC), Vol. 2, Nr. 029, 1995.
Session-Key Generation Using Human Passwords Only - Goldreich, Lindell (2005) (24 citations) Self-citation (Goldreich) (Correct)
No context found.
O. Goldreich, L.A. Levin and N. Nisan. On Constructing 1--1 One-Way Functions. Electronic Colloquium on Computational Complexity, TR95-029, 1995.
Robust PCPs of Proximity, Shorter PCPs and.. - Ben-Sasson.. (2004) Self-citation (Goldreich) (Correct)
No context found.
Goldreich, O. A sample of samplers { a computational perspective on sampling. Tech. Rep. TR97-020, Electronic Colloquium on Computational Complexity, 1997.
List-Decoding Using The XOR Lemma - Luca Trevisan Computer (2003) Self-citation (Xor) (Correct)
No context found.
O. Goldreich, N. Nisan, and A. Wigderson. On Yao's XOR lemma. Technical Report TR95-50, Electronic Colloquium on Computational Complexity, 1995.
Robust PCPs of Proximity, Shorter PCPs and.. - Ben-Sasson.. (2004) Self-citation (Goldreich) (Correct)
No context found.
Goldreich, O. A sample of samplers { a computational perspective on sampling. Tech. Rep. TR97-020, Electronic Colloquium on Computational Complexity, 1997.
One-way Trapdoor Permutations Are Sufficient for.. - Kushilevitz, Ostrovsky (2000) (1 citation) (Correct)
No context found.
O. Goldreich. Foundations of Cryptography (fragments of a book). Electronic Colloquium on Computational Complexity, 1995. Electronic publication: http://www.eccc.unitrier. de/eccc-local/ECCC-Books/eccc-books.html.
Nonuniform Hard Boolean Functions and Uniform Complexity Classes - Kabanets (2001) (Correct)
No context found.
O. Goldreich and D. Zuckerman. Another proof that BPPPH (and more). Electronic Colloquium on Computational Complexity, TR97-045, 1997.
Pseudorandomness and Average-case Complexity via Uniform.. - Trevisan, Vadhan (2002) (5 citations) (Correct)
No context found.
O. Goldreich, N. Nisan, and A. Wigderson. On Yao's XOR lemma. Technical Report TR95--050, Electronic Colloquium on Computational Complexity, March 1995. http://www.eccc.uni-trier.de/eccc.
Concurrent Zero-Knowledge Proofs for NP - Kilian, Petrank, Richardson (2001) (1 citation) (Correct)
No context found.
R. Canetti, O. Goldreich, S. Goldwasser and S. Micali. Resettable zero-knowledge. Revision 1 of Report TR99-042, the Electronic Colloquium on Computational Complexity (ECCC) ftp://ftp.eccc.uni-trier.de/pub/eccc/, June 2000.
Efficient and Concurrent Zero-Knowledge from any public.. - Micciancio, Petrank (Correct)
No context found.
R. Canetti, O. Goldreich, S. Goldwasser and S. Micali. Resettable zero-knowledge. Revision 1 of Report CR99-042, the Electronic Colloquium on Computational Complexity (ECCC) ftp://ftp.eccc.uni-trier.de/pub/eccc/, June 2000.
Improved Randomness Extraction from Two Independent Sources - Dodis, Elbaz, Oliveira, Raz (2004) (1 citation) (Correct)
No context found.
O. Goldreich. Three XOR-Lemmas - An Exposition. Electronic Colloquium on Computational Complexity (ECCC), 1995.
Hardness Amplification within NP - O'Donnell (2002) (Correct)
No context found.
O. Goldreich, N. Nisan, A. Wigderson. On Yao's XOR-Lemma. Electronic Colloquium on Computational Complexity, 1995.
The Computational Complexity Column - Lance Fortnow Nec (Correct)
No context found.
O. Goldreich and D. Zuckerman. Another proof that BPPPH (and more). Electronic Colloquium on Computational Complexity, TR97-045, 1997.
The Computational Complexity Column - Lance Fortnow Nec (Correct)
No context found.
O. Goldreich, N. Nisan, and A. Wigderson. On Yao's XOR-Lemma. Electronic Colloquium on Computational Complexity, TR95-050, 1995.
Lecture Notes on Computational Complexity - Trevisan (2004) (Correct)
No context found.
O. Goldreich, N. Nisan, and A. Wigderson. On Yao's XOR lemma. Technical Report TR95-50, Electronic Colloquium on Computational Complexity, 1995.
On Pseudorandomness and Resource-Bounded Measure - Arvind Institute Of (1997) (9 citations) (Correct)
No context found.
O. Goldreich and D. Zuckerman. Another proof that BPPPH (and more). Technical Report TR97-045, Electronic Colloquium on Computational Complexity, October 1997.
New Lowness Results for ZPP^NP and other Complexity Classes - Arvind, Köbler (Correct)
No context found.
O. Goldreich and D. Zuckerman, Another proof that BPPPH (and more), Technical Report TR97-045, Electronic Colloquium on Computational Complexity, 1997.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC