Follow
Ronen Shaltiel
Ronen Shaltiel
Professor of Computer Science, University of Haifa
Verified email at cs.haifa.ac.il
Title
Cited by
Cited by
Year
L. Fortnow: The Computational Complexity Column Recent Developments in Explicit Constructions of Extractors
R Shaltiel
BULLETIN-European Association For Theoretical Computer Science 77, 67-95, 2002
387*2002
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
B Barak, A Rao, R Shaltiel, A Wigderson
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
182*2006
True random number generators secure in a changing environment
B Barak, R Shaltiel, E Tromer
Cryptographic Hardware and Embedded Systems-CHES 2003: 5th International …, 2003
1732003
Simple extractors for all min-entropies and a new pseudorandom generator
R Shaltiel, C Umans
Journal of the ACM (JACM) 52 (2), 172-216, 2005
1492005
Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors
B Barak, G Kindler, R Shaltiel, B Sudakov, A Wigderson
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
1362005
Simple extractors for all min-entropies and a new pseudo-random generator
R Shaltiel, C Umans
Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 648-657, 2001
1312001
Computational analogues of entropy
B Barak, R Shaltiel, A Wigderson
Approximation, Randomization, and Combinatorial Optimization.. Algorithms …, 2003
1302003
Extracting randomness via repeated condensing
O Reingold, R Shaltiel, A Wigderson
SIAM Journal on Computing 35 (5), 1185-1209, 2006
1172006
Deterministic extractors for bit-fixing sources by obtaining an independent seed
A Gabizon, R Raz, R Shaltiel
SIAM Journal on Computing 36 (4), 1072-1094, 2006
1142006
Towards proving strong direct product theorems
R Shaltiel
Proceedings 16th Annual IEEE Conference on Computational Complexity, 107-117, 2001
1122001
An introduction to randomness extractors
R Shaltiel
International colloquium on automata, languages, and programming, 21-41, 2011
1112011
Hardness amplification proofs require majority
R Shaltiel, E Viola
Proceedings of the fortieth annual ACM symposium on Theory of computing, 589-598, 2008
1022008
Constant-round oblivious transfer in the bounded storage model
YZ Ding, D Harnik, A Rosen, R Shaltiel
Theory of Cryptography Conference, 446-472, 2004
882004
Extractors and pseudo-random generators with optimal seed length
R Impagliazzo, R Shaltiel, A Wigderson
Proceedings of the thirty-second annual ACM symposium on theory of computing …, 2000
882000
If NP languages are hard on the worst-case, then it is easy to find their hard instances
D Gutfreund, R Shaltiel, A Ta-Shma
Computational Complexity 16, 412-441, 2007
812007
Pseudorandomness for approximate counting and sampling
R Shaltiel, C Umans
computational complexity 15, 298-341, 2006
792006
Mining circuit lower bound proofs for meta-algorithms
R Chen, V Kabanets, A Kolokolova, R Shaltiel, D Zuckerman
Computational Complexity 24, 333-392, 2015
772015
Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors
B Barak, G Kindler, R Shaltiel, B Sudakov, A Wigderson
Journal of the ACM (JACM) 57 (4), 1-52, 2010
682010
Reducing complexity assumptions for statistically-hiding commitment
I Haitner, O Horvitz, J Katz, CY Koo, R Morselli, R Shaltiel
Advances in Cryptology–EUROCRYPT 2005: 24th Annual International Conference …, 2005
652005
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
D Gutfreund, R Shaltiel, A Ta-Shma
computational complexity 12 (3-4), 85-130, 2003
652003
The system can't perform the operation now. Try again later.
Articles 1–20