×

zbMATH — the first resource for mathematics

Shaltiel, Ronen

Compute Distance To:
Author ID: shaltiel.ronen Recent zbMATH articles by "Shaltiel, Ronen"
Published as: Shaltiel, Ronen
Documents Indexed: 56 Publications since 2000, including 1 Book

Publications by Year

Citations contained in zbMATH Open

50 Publications have been cited 311 times in 196 Documents Cited by Year
Recent developments in explicit constructions of extractors. Zbl 1051.68070
Shaltiel, Ronen
36
2002
Simple extractors for all min-entropies and a new pseudorandom generator. Zbl 1317.68132
Shaltiel, Ronen; Umans, Christopher
20
2005
Mining circuit lower bound proofs for meta-algorithms. Zbl 1401.68116
Chen, Ruiwen; Kabanets, Valentine; Kolokolova, Antonina; Shaltiel, Ronen; Zuckerman, David
18
2015
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. Zbl 1301.68191
Barak, Boaz; Rao, Anup; Shaltiel, Ronen; Wigderson, Avi
17
2006
Simulating independence: new constructions of condensers Ramsey graphs, dispersers, and extractors. Zbl 1192.68468
Barak, Boaz; Kindler, Guy; Shaltiel, Ronen; Sudakov, Benny; Wigderson, Avi
17
2005
Deterministic extractors for bit-fixing sources by obtaining an independent seed. Zbl 1118.68096
Gabizon, Ariel; Raz, Ran; Shaltiel, Ronen
16
2006
Computational analogues of entropy. Zbl 1279.68074
Barak, Boaz; Shaltiel, Ronen; Wigderson, Avi
15
2003
Towards proving strong direct product theorems. Zbl 1084.68542
Shaltiel, Ronen
15
2003
An introduction to randomness extractors. Zbl 1333.68289
Shaltiel, Ronen
13
2011
Pseudorandomness for approximate counting and sampling. Zbl 1125.68058
Shaltiel, Ronen; Umans, Christopher
13
2006
Hardness amplification proofs require majority. Zbl 1214.68175
Shaltiel, Ronen; Viola, Emanuele
10
2010
Extracting randomness via repeated condensing. Zbl 1100.68030
Reingold, Omer; Shaltiel, Ronen; Wigderson, Avi
9
2006
Constant-round oblivious transfer in the bounded storage model. Zbl 1197.94184
Ding, Yan Zong; Harnik, Danny; Rosen, Alon; Shaltiel, Ronen
8
2004
True random number generators secure in a changing environment. Zbl 1274.94037
Barak, Boaz; Shaltiel, Ronen; Tromer, Eran
8
2003
2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction. Zbl 1256.05146
Barak, Boaz; Rao, Anup; Shaltiel, Ronen; Wigderson, Avi
7
2012
Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors. Zbl 1327.68172
Barak, Boaz; Kindler, Guy; Shaltiel, Ronen; Sudakov, Benny; Wigderson, Avi
7
2010
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Zbl 1085.68055
Gutfreund, Dan; Shaltiel, Ronen; Ta-Shma, Amnon
7
2003
Extractors and pseudo-random generators with optimal seed length. Zbl 1296.65007
Impagliazzo, Russell; Shaltiel, Ronen; Wigderson, Avi
6
2000
How to get more mileage from randomness extractors. Zbl 1181.68170
Shaltiel, Ronen
5
2008
Pseudorandom generators, typically-correct derandomization, and circuit lower bounds. Zbl 1242.68108
Kinne, Jeff; van Melkebeek, Dieter; Shaltiel, Ronen
4
2012
Dispersers for affine sources with sub-polynomial entropy. Zbl 1292.68115
Shaltiel, Ronen
4
2011
Weak derandomization of weak algorithms: explicit versions of Yao’s lemma. Zbl 1252.68127
Shaltiel, Ronen
4
2011
Low-end uniform hardness versus randomness tradeoffs for AM. Zbl 1194.68120
Shaltiel, Ronen; Umans, Christopher
4
2009
If NP languages are hard on the worst-case, then it is easy to find their hard instances. Zbl 1133.68352
Gutfreund, Dan; Shaltiel, Ronen; Ta-Shma, Amnon
4
2007
Reducing the seed length in the Nisan-Wigderson generator. Zbl 1121.68052
Impagliazzo, Russell; Shaltiel, Ronen; Wigderson, Avi
4
2006
Reducing complexity assumptions for statistically-hiding commitment. Zbl 1137.94345
Haitner, Iftach; Horvitz, Omer; Katz, Jonathan; Koo, Chiu-Yuen; Morselli, Ruggero; Shaltiel, Ronen
4
2005
Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification. Zbl 1343.68088
Artemenko, Sergei; Shaltiel, Ronen
3
2011
Pseudorandom generators and typically-correct derandomization. Zbl 1255.68292
Kinne, Jeff; van Melkebeek, Dieter; Shaltiel, Ronen
3
2009
Pseudorandomness when the odds are against you. Zbl 1380.68434
Artemenko, Sergei; Impagliazzo, Russell; Kabanets, Valentine; Shaltiel, Ronen
2
2016
Parallel hashing via list recoverability. Zbl 1351.94050
Haitner, Iftach; Ishai, Yuval; Omri, Eran; Shaltiel, Ronen
2
2015
On beating the hybrid argument. Zbl 1347.68159
Fefferman, Bill; Shaltiel, Ronen; Umans, Christopher; Viola, Emanuele
2
2012
Strong parallel repetition theorem for free projection games. Zbl 1255.68146
Barak, Boaz; Rao, Anup; Raz, Ran; Rosen, Ricky; Shaltiel, Ronen
2
2009
On the (im)possibility of Arthur-Merlin witness hiding protocols. Zbl 1213.94106
Haitner, Iftach; Rosen, Alon; Shaltiel, Ronen
2
2009
Hardness amplification proofs require majority. Zbl 1231.68144
Shaltiel, Ronen; Viola, Emanuele
2
2008
Increasing the output length of zero-error dispersers. Zbl 1159.68640
Gabizon, Ariel; Shaltiel, Ronen
2
2008
Non-interactive timestamping in the bounded storage model. Zbl 1104.94051
Moran, Tal; Shaltiel, Ronen; Ta-Shma, Amnon
2
2004
Channels of small log-ratio leakage and characterization of two-party differentially private computation. Zbl 1455.94162
Haitner, Iftach; Mazor, Noam; Shaltiel, Ronen; Silbak, Jad
1
2019
Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits. Zbl 1427.68111
Artemenko, Sergei; Shaltiel, Ronen
1
2017
Incompressible functions, relative-error extractors, and the power of nondeterministic reductions. Zbl 1345.68126
Applebaum, Benny; Artemenko, Sergei; Shaltiel, Ronen; Yang, Guang
1
2016
Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits. Zbl 1315.68143
Artemenko, Sergei; Shaltiel, Ronen
1
2014
Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification. Zbl 1366.68070
Artemenko, Sergei; Shaltiel, Ronen
1
2014
On beating the hybrid argument. Zbl 1298.81047
Fefferman, Bill; Shaltiel, Ronen; Umans, Christopher; Viola, Emanuele
1
2013
Derandomized parallel repetition theorems for free games. Zbl 1290.68043
Shaltiel, Ronen
1
2013
Invertible zero-error dispersers and defective memory with stuck-at errors. Zbl 1372.68025
Gabizon, Ariel; Shaltiel, Ronen
1
2012
Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1–3, 2010. Proceedings. Zbl 1195.68012
Serna, Maria (ed.); Shaltiel, Ronen (ed.); Jansen, Klaus (ed.); Rolim, José (ed.)
1
2010
Reducing complexity assumptions for statistically-hiding commitment. Zbl 1173.94006
Haitner, Iftach; Horvitz, Omer; Katz, Jonathan; Koo, Chiu-Yuen; Morselli, Ruggero; Shaltiel, Ronen
1
2009
Non-interactive timestamping in the bounded-storage model. Zbl 1159.94368
Moran, Tal; Shaltiel, Ronen; Ta-Shma, Amnon
1
2009
Low-end uniform hardness vs. randomness tradeoffs for AM. Zbl 1232.68059
Shaltiel, Ronen; Umans, Christopher
1
2007
Constant-round oblivious transfer in the bounded storage model. Zbl 1113.68046
Ding, Yan Zong; Harnik, Danny; Rosen, Alon; Shaltiel, Ronen
1
2007
Recent developments in explicit constructions of extractors. Zbl 1082.68124
Shaltiel, Ronen
1
2004
Channels of small log-ratio leakage and characterization of two-party differentially private computation. Zbl 1455.94162
Haitner, Iftach; Mazor, Noam; Shaltiel, Ronen; Silbak, Jad
1
2019
Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits. Zbl 1427.68111
Artemenko, Sergei; Shaltiel, Ronen
1
2017
Pseudorandomness when the odds are against you. Zbl 1380.68434
Artemenko, Sergei; Impagliazzo, Russell; Kabanets, Valentine; Shaltiel, Ronen
2
2016
Incompressible functions, relative-error extractors, and the power of nondeterministic reductions. Zbl 1345.68126
Applebaum, Benny; Artemenko, Sergei; Shaltiel, Ronen; Yang, Guang
1
2016
Mining circuit lower bound proofs for meta-algorithms. Zbl 1401.68116
Chen, Ruiwen; Kabanets, Valentine; Kolokolova, Antonina; Shaltiel, Ronen; Zuckerman, David
18
2015
Parallel hashing via list recoverability. Zbl 1351.94050
Haitner, Iftach; Ishai, Yuval; Omri, Eran; Shaltiel, Ronen
2
2015
Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits. Zbl 1315.68143
Artemenko, Sergei; Shaltiel, Ronen
1
2014
Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification. Zbl 1366.68070
Artemenko, Sergei; Shaltiel, Ronen
1
2014
On beating the hybrid argument. Zbl 1298.81047
Fefferman, Bill; Shaltiel, Ronen; Umans, Christopher; Viola, Emanuele
1
2013
Derandomized parallel repetition theorems for free games. Zbl 1290.68043
Shaltiel, Ronen
1
2013
2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction. Zbl 1256.05146
Barak, Boaz; Rao, Anup; Shaltiel, Ronen; Wigderson, Avi
7
2012
Pseudorandom generators, typically-correct derandomization, and circuit lower bounds. Zbl 1242.68108
Kinne, Jeff; van Melkebeek, Dieter; Shaltiel, Ronen
4
2012
On beating the hybrid argument. Zbl 1347.68159
Fefferman, Bill; Shaltiel, Ronen; Umans, Christopher; Viola, Emanuele
2
2012
Invertible zero-error dispersers and defective memory with stuck-at errors. Zbl 1372.68025
Gabizon, Ariel; Shaltiel, Ronen
1
2012
An introduction to randomness extractors. Zbl 1333.68289
Shaltiel, Ronen
13
2011
Dispersers for affine sources with sub-polynomial entropy. Zbl 1292.68115
Shaltiel, Ronen
4
2011
Weak derandomization of weak algorithms: explicit versions of Yao’s lemma. Zbl 1252.68127
Shaltiel, Ronen
4
2011
Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification. Zbl 1343.68088
Artemenko, Sergei; Shaltiel, Ronen
3
2011
Hardness amplification proofs require majority. Zbl 1214.68175
Shaltiel, Ronen; Viola, Emanuele
10
2010
Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors. Zbl 1327.68172
Barak, Boaz; Kindler, Guy; Shaltiel, Ronen; Sudakov, Benny; Wigderson, Avi
7
2010
Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1–3, 2010. Proceedings. Zbl 1195.68012
Serna, Maria (ed.); Shaltiel, Ronen (ed.); Jansen, Klaus (ed.); Rolim, José (ed.)
1
2010
Low-end uniform hardness versus randomness tradeoffs for AM. Zbl 1194.68120
Shaltiel, Ronen; Umans, Christopher
4
2009
Pseudorandom generators and typically-correct derandomization. Zbl 1255.68292
Kinne, Jeff; van Melkebeek, Dieter; Shaltiel, Ronen
3
2009
Strong parallel repetition theorem for free projection games. Zbl 1255.68146
Barak, Boaz; Rao, Anup; Raz, Ran; Rosen, Ricky; Shaltiel, Ronen
2
2009
On the (im)possibility of Arthur-Merlin witness hiding protocols. Zbl 1213.94106
Haitner, Iftach; Rosen, Alon; Shaltiel, Ronen
2
2009
Reducing complexity assumptions for statistically-hiding commitment. Zbl 1173.94006
Haitner, Iftach; Horvitz, Omer; Katz, Jonathan; Koo, Chiu-Yuen; Morselli, Ruggero; Shaltiel, Ronen
1
2009
Non-interactive timestamping in the bounded-storage model. Zbl 1159.94368
Moran, Tal; Shaltiel, Ronen; Ta-Shma, Amnon
1
2009
How to get more mileage from randomness extractors. Zbl 1181.68170
Shaltiel, Ronen
5
2008
Hardness amplification proofs require majority. Zbl 1231.68144
Shaltiel, Ronen; Viola, Emanuele
2
2008
Increasing the output length of zero-error dispersers. Zbl 1159.68640
Gabizon, Ariel; Shaltiel, Ronen
2
2008
If NP languages are hard on the worst-case, then it is easy to find their hard instances. Zbl 1133.68352
Gutfreund, Dan; Shaltiel, Ronen; Ta-Shma, Amnon
4
2007
Low-end uniform hardness vs. randomness tradeoffs for AM. Zbl 1232.68059
Shaltiel, Ronen; Umans, Christopher
1
2007
Constant-round oblivious transfer in the bounded storage model. Zbl 1113.68046
Ding, Yan Zong; Harnik, Danny; Rosen, Alon; Shaltiel, Ronen
1
2007
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. Zbl 1301.68191
Barak, Boaz; Rao, Anup; Shaltiel, Ronen; Wigderson, Avi
17
2006
Deterministic extractors for bit-fixing sources by obtaining an independent seed. Zbl 1118.68096
Gabizon, Ariel; Raz, Ran; Shaltiel, Ronen
16
2006
Pseudorandomness for approximate counting and sampling. Zbl 1125.68058
Shaltiel, Ronen; Umans, Christopher
13
2006
Extracting randomness via repeated condensing. Zbl 1100.68030
Reingold, Omer; Shaltiel, Ronen; Wigderson, Avi
9
2006
Reducing the seed length in the Nisan-Wigderson generator. Zbl 1121.68052
Impagliazzo, Russell; Shaltiel, Ronen; Wigderson, Avi
4
2006
Simple extractors for all min-entropies and a new pseudorandom generator. Zbl 1317.68132
Shaltiel, Ronen; Umans, Christopher
20
2005
Simulating independence: new constructions of condensers Ramsey graphs, dispersers, and extractors. Zbl 1192.68468
Barak, Boaz; Kindler, Guy; Shaltiel, Ronen; Sudakov, Benny; Wigderson, Avi
17
2005
Reducing complexity assumptions for statistically-hiding commitment. Zbl 1137.94345
Haitner, Iftach; Horvitz, Omer; Katz, Jonathan; Koo, Chiu-Yuen; Morselli, Ruggero; Shaltiel, Ronen
4
2005
Constant-round oblivious transfer in the bounded storage model. Zbl 1197.94184
Ding, Yan Zong; Harnik, Danny; Rosen, Alon; Shaltiel, Ronen
8
2004
Non-interactive timestamping in the bounded storage model. Zbl 1104.94051
Moran, Tal; Shaltiel, Ronen; Ta-Shma, Amnon
2
2004
Recent developments in explicit constructions of extractors. Zbl 1082.68124
Shaltiel, Ronen
1
2004
Computational analogues of entropy. Zbl 1279.68074
Barak, Boaz; Shaltiel, Ronen; Wigderson, Avi
15
2003
Towards proving strong direct product theorems. Zbl 1084.68542
Shaltiel, Ronen
15
2003
True random number generators secure in a changing environment. Zbl 1274.94037
Barak, Boaz; Shaltiel, Ronen; Tromer, Eran
8
2003
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Zbl 1085.68055
Gutfreund, Dan; Shaltiel, Ronen; Ta-Shma, Amnon
7
2003
Recent developments in explicit constructions of extractors. Zbl 1051.68070
Shaltiel, Ronen
36
2002
Extractors and pseudo-random generators with optimal seed length. Zbl 1296.65007
Impagliazzo, Russell; Shaltiel, Ronen; Wigderson, Avi
6
2000
all top 5

Cited by 311 Authors

14 Shaltiel, Ronen
7 Watson, Thomas C.
6 Skorski, Maciej
5 Musatov, Daniil
5 Seto, Kazuhisa
5 Vadhan, Salil P.
5 Zuckerman, David
4 Chattopadhyay, Arkadev
4 Chen, Ruiwen
4 Goldreich, Oded
4 Haitner, Iftach
4 Kabanets, Valentine
4 Lu, Chijen
4 Pietrzak, Krzysztof
4 Pitassi, Toniann
4 Raz, Ran
4 Tamaki, Suguru
4 Teruyama, Junichi
4 van Melkebeek, Dieter
3 Applebaum, Benny
3 Artemenko, Sergei
3 Braverman, Mark
3 Hitchcock, John M.
3 Koucký, Michal
3 Meir, Or
3 Reingold, Omer
3 Sakai, Takayuki
3 Santhanam, Rahul
3 Sudakov, Benny
3 Ta-Shma, Amnon
3 Tsai, Shi-Chun
3 Umans, Christopher
3 Vinodchandran, N. Variyam
3 Viola, Emanuele
2 Allender, Eric W.
2 Aydinlioǧlu, Bariş
2 Bourgain, Jean
2 Buhrman, Harry
2 Chakaravarthy, Venkatesan T.
2 Cheraghchi, Mahdi
2 Ciss, Abdoul Aziz
2 Cohen, Gil
2 Crépeau, Claude
2 Dinur, Irit
2 Doty, David
2 Drucker, Andrew
2 Dvir, Zeev
2 Edmonds, Jeff A.
2 Ellen, Faith
2 Fortnow, Lance J.
2 Fox, Jacob
2 Fuller, Benjamin
2 Gabizon, Ariel
2 Golovnev, Alexander
2 Göös, Mika
2 Impagliazzo, Russell
2 Jain, Rahul
2 Kawachi, Akinori
2 Kinne, Jeff
2 Komargodski, Ilan
2 Krivelevich, Michael
2 Lee, Chia-Jung
2 Nagao, Atsuki
2 Naor, Moni
2 O’Neill, Adam
2 Pavan, Aduri
2 Rao, Anup
2 Reyzin, Leonid
2 Romashchenko, Andrei
2 Ron-Zewi, Noga
2 Roy, Sambuddha
2 Savvides, George
2 Shen, Alexander
2 Sow, Djiby
2 Tell, Roei
2 Vaikuntanathan, Vinod
2 Vereshchagin, Nikolay K.
2 Vidick, Thomas
2 Wigderson, Avi
2 Yashunsky, Aleksey D.
1 Anderson, Matthew T.
1 Antoniadis, Karolos
1 Antunes, Luis
1 Asodi, Vera
1 Assad, Syed M.
1 Bapst, Victor
1 Barak, Boaz
1 Bellare, Mihir
1 Ben-Eliezer, Ido
1 Ben-Sasson, Eli
1 Ben Shil, Assia
1 Bienvenu, Laurent
1 Birrell, Eleanor
1 Bitansky, Nir
1 Blacher, René
1 Blanchard, Peva
1 Blibech Sinaoui, Kaouther
1 Bonacina, Ilario
1 Bouda, Jan
1 Boyar, Joan F.
...and 211 more Authors

Citations by Year