R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudorandom generator. In Proc. 42st FOCS, pages 648--657. IEEE, 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Extractors: Optimal up to Constant Factors - Lu, Reingold, Vadhan (2003) (6 citations) (Correct)
....for subconstant, indeed arbitrary, min entropy rate. However, thus far, it was only known how to optimize one of two parameters to within a constant factor, while paying a superconstant factor in the other. Constructions with seed length d = O(log n) for arbitrary min entropy were given in [26, 10, 17, 20], but the best output length achieved was m = k log k [17, 23] Constructions with output length The original definition of extractors in [14] is stronger than the one above (from [13] in that it requires the seed to be explicitly included in the output. Our constructions also imply such ....
....The task of extraction is made significantly easier given this additional structure of block sources. Indeed, good extractors for block sources are already known. Such extractors are called block source extractors. Based on the method for block source extraction of [14] and using newer extractors [16, 13, 10, 23, 20] it is possible to obtain a block source extractors that extract k1 bits using O(log n) long seed as long as k2 is at least poly log n (e.g. log n) Somewhere Random Sources. A central notion in our paper is that of a somewhere random source, as introduced by Ta Shma [13] Roughly speaking, a ....
[Article contains additional citation context not shown here]
R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudo-random generator. In Proc. 42nd FOCS, pages 648--657, 2001.
Derandomization and Distinguishing Complexity - Allender, Koucky, Ronneburger.. (2003) (Correct)
.... resource bounded Kolmogorov complexity and derandomization techniques begun in [2, 3] We introduce nondeterministic time bounded Kolmogorov complexity measures (KNt and KNT) and examine the properties of these measures using constructions of hitting set generators for nondeterministic circuits [22, 26]. We observe that KNt bears many similarities to the nondeterministic distinguishing complexity CND of [8] This motivates the definition of a new notion of time bounded distinguishing complexity KDt, as an intermediate notion with connections to the class FewEXP.ThesetofKDt random strings is ....
....begun in [2, 3] in which recent progress in derandomization techniques is employed to provide new insights about resource bounded Kolmogorov complexity. One topic that was not discussed in the earlier papers is derandomization techniques for nondeterministic circuits, as provided by [22] and [26]. We will turn our attention to that task in Section 2, after first laying some groundwork by presenting our basic definitions. In the earlier papers [2, 3] we focused on notions of resource bounded Kolmogorov complexity, including Kt and KT. The first of these was originally defined and studied ....
[Article contains additional citation context not shown here]
R. Shaltiel and C. Umans. Simple extractors for all minentropies and a new pseudo-random generator. In Proc. IEEE Symp. on Found. of Comp. Sci. (FOCS), pages 648-- 657, 2001.
List-Decoding of Linear Functions and Analysis of a.. - Dwork, Shaltiel.. Self-citation (Shaltiel) (Correct)
No context found.
R. Shaltiel, C. Umans. Simple extractors for all min-entropies and a new pseudorandom generator. In Proc. 42nd IEEE Symp. on Foundations of Computer Science, 2001.
Uniform hardness vs. randomness tradeoffs for Arthur-Merlin .. - Gutfreund, Shaltiel, al. Self-citation (Shaltiel) (Correct)
No context found.
R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudo-random generator. In 42nd IEEE Symposium on Foundations of Computer Science (FOCS-01), pages 648--657, 2001.
List-Decoding of Linear Functions and Analysis of a.. - Dwork, Shaltiel.. Self-citation (Shaltiel) (Correct)
No context found.
R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudo-random generator. In 42nd IEEE Symposium on Foundations of Computer Science (FOCS-01), pages 648--657, 2001.
The Computational Complexity Column - Lance Fortnow Nec Self-citation (Shaltiel) (Correct)
No context found.
R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudorandom generator. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001.
Streaming Computation of Combinatorial Objects - Bar-Yossef, Reingold, al. (2002) (2 citations) Self-citation (Shaltiel) (Correct)
No context found.
R. Shaltiel and C. Umans. Simple extractors for all minentropies and a new pseudo-random generator. In Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 648--657, 2001.
Lower Bounds for Non-Black-Box Zero Knowledge - Barak, Lindell, Vadhan (2004) (1 citation) (Correct)
No context found.
R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudorandom generator. In Proc. 42st FOCS, pages 648--657. IEEE, 2001.
On Extracting Private Randomness Over a Public Channel - Yevgeniy Dodis Roberto (2003) (1 citation) (Correct)
No context found.
R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudo-random generator. In Proceedings of FOCS 2001.
Pseudorandomness and Average-case Complexity via Uniform.. - Trevisan, Vadhan (2002) (5 citations) (Correct)
No context found.
R. Shaltiel and C. Umans. Simple extractors for all minentropies and a new pseudo-random generator. In 42nd Annual Symposium on Foundations of Computer Science. IEEE, 14--17 Oct. 2001.
Extractors from Reed-Muller Codes - Ta-Shma, Zuckerman, Safra (2003) (Correct)
No context found.
R. Shaltiel, C. Umans, Simple extractors for all min-entropies and a new pseudo-random generator, in: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, pp. 648--657.
Batch Codes and Their Applications - Yuval Ishai Yuvali (2004) (Correct)
No context found.
R. Shaltiel and C. Umans. Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator. In Proc. 42nd FOCS, pages 648-657, 2001.
Improved Randomness Extraction from Two Independent Sources - Dodis, Elbaz, Oliveira, Raz (2004) (1 citation) (Correct)
No context found.
R. Shaltiel, C. Umans. Simple extractors for all min-entropies and a new pseudorandom generator. In Proceedings of FOCS 2001, pp.648-657, IEEE Computer Society, 2001.
The Computational Complexity Column - Lance Fortnow Nec (Correct)
No context found.
R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudorandom generator. In Proceedings of the Forty-Second Annual IEEE Symposium on Foundations of Computer Science, pages 648-657, 2001.
Lecture Notes on Computational Complexity - Trevisan (2004) (Correct)
No context found.
R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudo-random generator. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pages 648--657, 2001.
Batch Codes and Their Applications - Ishai, Kushilevitz, Ostrovsky, Sahai (2004) (Correct)
No context found.
R. Shaltiel and C. Umans. Simple Extractors for All Min-Entropies and a New PseudoRandom Generator. In Proc. 42nd FOCS, pages 648-657, 2001.
Extractors from Reed-Muller Codes - Ta-Shma, Zuckerman, Safra (Correct)
No context found.
R. Shaltiel and C. Umans. Simple extractors for all minentropies and a new pseudo-random generator. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001.
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