Skip to content

Ronen Shaltiel

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

30

Venues

7

Active years

1999–2026

Best venue rank

A*

Where they publish

Papers

30 indexed papers, newest first.

YearVenueTitleAuthors
2026STOCExtractors for Samplable Distributions from the Two-Source Extractor Recipe.Justin Oh, Ronen Shaltiel
2025FOCSExtractors for Samplable Distributions with Polynomially Small Min-Entropy.Ronen Shaltiel
2025STOCExtractors for Samplable Distributions with Low Min-Entropy.Marshall Ball, Ronen Shaltiel, Jad Silbak
2024EuroCryptNon-malleable Codes with Optimal Rate for Poly-Size Circuits.Marshall Ball, Ronen Shaltiel, Jad Silbak
2024STOCExplicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions.Ronen Shaltiel, Jad Silbak
2022FOCSError Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits.Ronen Shaltiel, Jad Silbak
2021STOCExplicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity.Ronen Shaltiel, Jad Silbak
2019FOCSQuasilinear Time List-Decodable Codes for Space Bounded Channels.Jad Silbak, Swastik Kopparty, Ronen Shaltiel
2019TCCChannels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
2018FOCSIndistinguishability by Adaptive Procedures with Advice, and Lower Bounds on Hardness Amplification Proofs.Aryeh Grinberg, Ronen Shaltiel, Emanuele Viola
2018FOCSComputational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols.Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
2015CRYPTOParallel Hashing via List Recoverability.Iftach Haitner, Yuval Ishai, Eran Omri, Ronen Shaltiel
2014STOCPseudorandom generators with optimal seed length for non-boolean poly-size circuits.Sergei Artemenko, Ronen Shaltiel
2011FOCSDispersers for Affine Sources with Sub-polynomial Entropy.Ronen Shaltiel
2011ICALPAn Introduction to Randomness Extractors.Ronen Shaltiel
2009TCCOn the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols.Iftach Haitner, Alon Rosen, Ronen Shaltiel
2008STOCHardness amplification proofs require majority.Ronen Shaltiel, Emanuele Viola
2007STOCLow-end uniform hardness vs. randomness tradeoffs for AM.Ronen Shaltiel, Christopher Umans
2006STOC2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction.Boaz Barak, Anup Rao, Ronen Shaltiel, Avi Wigderson
2005EuroCryptReducing Complexity Assumptions for Statistically-Hiding Commitment.Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel
2005STOCSimulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors.Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson
2004CRYPTONon-interactive Timestamping in the Bounded Storage Model.Tal Moran, Ronen Shaltiel, Amnon Ta-Shma
2004FOCSDeterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed.Ariel Gabizon, Ran Raz, Ronen Shaltiel
2004TCCConstant-Round Oblivious Transfer in the Bounded Storage Model.Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel
2004TCCList-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument.Cynthia Dwork, Ronen Shaltiel, Adam D. Smith, Luca Trevisan
2003CHESTrue Random Number Generators Secure in a Changing Environment.Boaz Barak, Ronen Shaltiel, Eran Tromer
2001FOCSSimple Extractors for All Min-Entropies and a New Pseudo-Random Generator.Ronen Shaltiel, Christopher Umans
2000FOCSExtracting Randomness via Repeated Condensing.Omer Reingold, Ronen Shaltiel, Avi Wigderson
2000STOCExtractors and pseudo-random generators with optimal seed length.Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
1999FOCSNear-Optimal Conversion of Hardness into Pseudo-Randomness.Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson