Noam Mazor

According to our database, Noam Mazor authored at least 24 papers between 2019 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Guest Column: On Cryptography and Meta-Complexity.

Noam Mazor, Rafael Pass

SIGACT News, June, 2025

Mildly Accurate Computationally Differentially Private Inner Product Protocols Imply Oblivious Transfer.

Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia, Chao Yan

CoRR, February, 2025

On White-Box Learning and Public-Key Encryption.

Yanyi Liu, Noam Mazor, Rafael Pass

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

On Witness Encryption and Laconic Zero-Knowledge Arguments.

Yanyi Liu, Noam Mazor, Rafael Pass

Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Computationally Differentially Private Inner-Product Protocols Imply Oblivious Transfer.

Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia, Chao Yan

Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Key-Agreement with Perfect Completeness from Random Oracles.

Noam Mazor

Proceedings of the 6th Conference on Information-Theoretic Cryptography, 2025

2024

Lower Bounds on the Overhead of Indistinguishability Obfuscation.

Zhenjian Lu, Noam Mazor, Igor C. Oliveira, Rafael Pass

Electron. Colloquium Comput. Complex., 2024

A Note on Zero-Knowledge for NP and One-Way Functions.

Yanyi Liu, Noam Mazor, Rafael Pass

Electron. Colloquium Comput. Complex., 2024

The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity Is False.

Noam Mazor, Rafael Pass

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions.

Amos Beimel, Tal Malkin, Noam Mazor

Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Gap MCSP Is Not (Levin) NP-Complete in Obfustopia.

Noam Mazor, Rafael Pass

Proceedings of the 39th Computational Complexity Conference, 2024

Search-To-Decision Reductions for Kolmogorov Complexity.

Noam Mazor, Rafael Pass

Proceedings of the 39th Computational Complexity Conference, 2024

On Black-Box Meta Complexity and Function Inversion.

Noam Mazor, Rafael Pass

Proceedings of the Approximation, 2024

2023

A Note On the Universality of Black-box MKtP Solvers.

Noam Mazor, Rafael Pass

Electron. Colloquium Comput. Complex., 2023

Counting Unpredictable Bits: A Simple PRG from One-Way Functions.

Noam Mazor, Rafael Pass

Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Incompressiblity and Next-Block Pseudoentropy.

Iftach Haitner, Noam Mazor, Jad Silbak

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement.

Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Non-adaptive Universal One-Way Hash Functions from Arbitrary One-Way Functions.

Xinyu Mao, Noam Mazor, Jiapeng Zhang

Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

A Lower Bound on the Share Size in Evolving Secret Sharing.

Noam Mazor

Proceedings of the 4th Conference on Information-Theoretic Cryptography, 2023

2022

On the complexity of two-party differential privacy.

Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021

Simple Constructions from (Almost) Regular One-Way Functions.

Noam Mazor, Jiapeng Zhang

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

2020

Lower Bounds on the Time/Memory Tradeoff of Function Inversion.

Dror Chawin, Iftach Haitner, Noam Mazor

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2019

Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.

Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

On the Communication Complexity of Key-Agreement Protocols.

Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019