Ronen Shaltiel
ScholarGPS® ID: 16550566460937
Affiliation History
Discipline
Computer Science
Top Specialties
Combinatorial Optimization | Mathematical Optimization | Cryptography
Metrics Summary
Publication Count
74
Predicted Citations
2,749
Predicted h-index
32
Ranking
Publications and Citation History
Publications based on Top Specialties
Types of Publication
- Publications
- Books
- Patents
- NIH/NSF
|
Add
Delete
|
|---|
Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions (conference) STOC '24: 56th Annual ACM Symposium on Theory of Computing (2024) Vancouver BC Canada |
Non-malleable Codes with Optimal Rate for Poly-Size Circuits (book chapter) In Advances in Cryptology – EUROCRYPT 2024 Springer Nature Switzerland (2024) |
Is it possible to improve Yao’s XOR lemma using reductions that exploit the efficiency of their oracle? (journal article) computational complexity, volume 32, issue 1 (2023). |
Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits (conference) 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (2022) Denver, CO, USA |
Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity (conference) STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing (2021) Virtual Italy |
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels (journal article) computational complexity, volume 30, issue 1 (2021). |
SIAM Journal on Computing, volume 49, issue 6, pages 1041-1082 (2020). |
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) (2019) Baltimore, MD, USA |
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation (book chapter) In Theory of Cryptography Springer International Publishing (2019) |
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (2018) Paris |
Indistinguishability by Adaptive Procedures with Advice, and Lower Bounds on Hardness Amplification Proofs (conference) 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (2018) Paris |
Pseudorandom Generators with Optimal Seed Length for Non-Boolean Poly-Size Circuits (journal article) ACM Transactions on Computation Theory, volume 9, issue 2, pages 1-26 (2017). |
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (journal article) computational complexity, volume 25, issue 2, pages 349-418 (2016). |
Pseudorandomness when the odds are against you (conference) Conference on Computational Complexity (2016) |
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2016) |
Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (extended abstract) (conference) Conference on Computational Complexity (2015) |
Mining Circuit Lower Bound Proofs for Meta-Algorithms (journal article) computational complexity, volume 24, issue 2, pages 333-392 (2015). |
Parallel Hashing via List Recoverability (book chapter) In Advances in Cryptology -- CRYPTO 2015 Springer Berlin Heidelberg (2015) |
Randomness extractors and data storage (conference) 2014 IEEE 28th Convention of Electrical & Electronics Engineers in Israel (IEEEI) (2014) Eilat, Israel |
2014 IEEE Conference on Computational Complexity (CCC) (2014) Vancouver, BC, Canada |