Ronen Shaltiel

	2009
47		Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen Shaltiel: Strong Parallel Repetition Theorem for Free Projection Games. APPROX-RANDOM 2009: 352-365
46		Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel: Pseudorandom Generators and Typically-Correct Derandomization. APPROX-RANDOM 2009: 574-587
45		Iftach Haitner, Alon Rosen, Ronen Shaltiel: On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. TCC 2009: 220-237
44		Tal Moran, Ronen Shaltiel, Amnon Ta-Shma: Non-interactive Timestamping in the Bounded-Storage Model. J. Cryptology 22(2): 189-226 (2009)
43		Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel: Reducing Complexity Assumptions for Statistically-Hiding Commitment. J. Cryptology 22(3): 283-310 (2009)
	2008
42		Ariel Gabizon, Ronen Shaltiel: Increasing the Output Length of Zero-Error Dispersers. APPROX-RANDOM 2008: 430-443
41		Ronen Shaltiel, Emanuele Viola: Hardness amplification proofs require majority. STOC 2008: 589-598
40		Ronen Shaltiel: How to get more mileage from randomness extractors. Random Struct. Algorithms 33(2): 157-186 (2008)
	2007
39		Ronen Shaltiel, Christopher Umans: Low-end uniform hardness vs. randomness tradeoffs for AM. STOC 2007: 430-439
38		Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. Computational Complexity 16(4): 412-441 (2007)
37		Ronen Shaltiel, Christopher Umans: Low-end uniform hardness vs. randomness tradeoffs for AM. Electronic Colloquium on Computational Complexity (ECCC) 14(069): (2007)
36		Ronen Shaltiel, Emanuele Viola: Hardness amplification proofs require majority. Electronic Colloquium on Computational Complexity (ECCC) 14(130): (2007)
35		Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel: Constant-Round Oblivious Transfer in the Bounded Storage Model. J. Cryptology 20(2): 165-202 (2007)
	2006
34		Ronen Shaltiel: How to Get More Mileage from Randomness Extractors. IEEE Conference on Computational Complexity 2006: 46-60
33		Boaz Barak, Anup Rao, Ronen Shaltiel, Avi Wigderson: 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. STOC 2006: 671-680
32		Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson: Reducing The Seed Length In The Nisan-Wigderson Generator. Combinatorica 26(6): 647-681 (2006)
31		Ronen Shaltiel, Christopher Umans: Pseudorandomness for Approximate Counting and Sampling. Computational Complexity 15(4): 298-341 (2006)
30		Omer Reingold, Ronen Shaltiel, Avi Wigderson: Extracting Randomness via Repeated Condensing. SIAM J. Comput. 35(5): 1185-1209 (2006)
29		Ariel Gabizon, Ran Raz, Ronen Shaltiel: Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. SIAM J. Comput. 36(4): 1072-1094 (2006)
	2005
28		Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel: Reducing Complexity Assumptions for Statistically-Hiding Commitment. EUROCRYPT 2005: 58-77
27		Ronen Shaltiel, Christopher Umans: Pseudorandomness for Approximate Counting and Sampling. IEEE Conference on Computational Complexity 2005: 212-226
26		Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances. IEEE Conference on Computational Complexity 2005: 243-257
25		Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson: Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. STOC 2005: 1-10
24		Ariel Gabizon, Ran Raz, Ronen Shaltiel: Deterministic Extractors for Bit-fixing Sources by Obtaining an Independent Seed Electronic Colloquium on Computational Complexity (ECCC)(109): (2005)
23		Ronen Shaltiel: How to get more mileage from randomness extractors Electronic Colloquium on Computational Complexity (ECCC)(145): (2005)
22		Ronen Shaltiel, Christopher Umans: Simple extractors for all min-entropies and a new pseudorandom generator. J. ACM 52(2): 172-216 (2005)
	2004
21		Tal Moran, Ronen Shaltiel, Amnon Ta-Shma: Non-interactive Timestamping in the Bounded Storage Model. CRYPTO 2004: 460-476
20		Ariel Gabizon, Ran Raz, Ronen Shaltiel: Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. FOCS 2004: 394-403
19		Cynthia Dwork, Ronen Shaltiel, Adam Smith, Luca Trevisan: List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument. TCC 2004: 101-120
18		Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel: Constant-Round Oblivious Transfer in the Bounded Storage Model. TCC 2004: 446-472
17		Ronen Shaltiel, Christopher Umans: Pseudorandomness for Approximate Counting and Sampling Electronic Colloquium on Computational Complexity (ECCC)(086): (2004)
16		Iftach Haitner, Ronen Shaltiel: Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions Electronic Colloquium on Computational Complexity (ECCC)(115): (2004)
	2003
15		Boaz Barak, Ronen Shaltiel, Eran Tromer: True Random Number Generators Secure in a Changing Environment. CHES 2003: 166-180
14		Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. IEEE Conference on Computational Complexity 2003: 33-47
13		Boaz Barak, Ronen Shaltiel, Avi Wigderson: Computational Analogues of Entropy. RANDOM-APPROX 2003: 200-215
12		Ronen Shaltiel: Towards proving strong direct product theorems. Computational Complexity 12(1-2): 1-22 (2003)
11		Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Computational Complexity 12(3-4): 85-130 (2003)
	2002
10		Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel: Streaming Computation of Combinatorial Objects. IEEE Conference on Computational Complexity 2002: 165-174
9		Ronen Shaltiel: Recent Developments in Explicit Constructions of Extractors. Bulletin of the EATCS 77: 67-95 (2002)
	2001
8		Ronen Shaltiel, Christopher Umans: Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator. FOCS 2001: 648-657
7		Ronen Shaltiel: Towards Proving Strong Direct Product Theorems. IEEE Conference on Computational Complexity 2001: 107-117
6		Ronen Shaltiel: Towards proving strong direct product theorems Electronic Colloquium on Computational Complexity (ECCC) 8(9): (2001)
	2000
5		Omer Reingold, Ronen Shaltiel, Avi Wigderson: Extracting Randomness via Repeated Condensing. FOCS 2000: 22-31
4		Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson: Extractors and pseudo-random generators with optimal seed length. STOC 2000: 1-10
3		Omer Reingold, Ronen Shaltiel, Avi Wigderson: Extracting Randomness via Repeated Condensing Electronic Colloquium on Computational Complexity (ECCC) 7(59): (2000)
2		Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson: Extractors and pseudo-random generators with optimal seed length Electronic Colloquium on Computational Complexity (ECCC) 7(9): (2000)
	1999
1		Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson: Near-Optimal Conversion of Hardness into Pseudo-Randomness. FOCS 1999: 181-190

Coauthor Index

1	Ziv Bar-Yossef	[10]
2	Boaz Barak	[13] [15] [25] [33] [47]
3	Yan Zong Ding	[18] [35]
4	Cynthia Dwork	[19]
5	Ariel Gabizon	[20] [24] [29] [42]
6	Dan Gutfreund (Danny Gutfreund)	[11] [14] [26] [38]
7	Iftach Haitner	[16] [28] [43] [45]
8	Danny Harnik	[18] [35]
9	Omer Horvitz	[28] [43]
10	Russell Impagliazzo	[1] [2] [4] [32]
11	Jonathan Katz	[28] [43]
12	Guy Kindler	[25]
13	Jeff Kinne	[46]
14	Chiu-Yuen Koo	[28] [43]
15	Dieter van Melkebeek	[46]
16	Tal Moran	[21] [44]
17	Ruggero Morselli	[28] [43]
18	Anup Rao	[33] [47]
19	Ran Raz	[20] [24] [29] [47]
20	Omer Reingold	[3] [5] [10] [30]
21	Alon Rosen	[18] [35] [45]
22	Ricky Rosen	[47]
23	Adam Smith	[19]
24	Benny Sudakov	[25]
25	Amnon Ta-Shma	[11] [14] [21] [26] [38] [44]
26	Luca Trevisan	[10] [19]
27	Eran Tromer	[15]
28	Christopher Umans	[8] [17] [22] [27] [31] [37] [39]
29	Emanuele Viola	[36] [41]
30	Avi Wigderson	[1] [2] [3] [4] [5] [13] [25] [30] [32] [33]