On the Communication Complexity of Key-Agreement Protocols. - Iftach Haitner; Noam Mazor; Rotem Oshman; Omer Reingold; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2018)

Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. - Iftach Haitner; Noam Mazor; Ronen Shaltiel; Jad Silbak (Electron. Colloquium Comput. Complex., 2019)

Lower Bounds on the Time/Memory Tradeoff of Function Inversion. - Dror Chawin; Iftach Haitner; Noam Mazor (Electron. Colloquium Comput. Complex., 2020)

On the Complexity of Two-Party Differential Privacy. - Iftach Haitner; Noam Mazor; Jad Silbak; Eliad Tsfadia (Electron. Colloquium Comput. Complex., 2021)

Incompressiblity and Next-Block Pseudoentropy. - Iftach Haitner; Noam Mazor; Jad Silbak (Electron. Colloquium Comput. Complex., 2022)

Non-Adaptive Universal One-Way Hash Functions from Arbitrary One-Way Functions. - Xinyu Mao; Noam Mazor; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2022)

A Lower Bound on the Share Size in Evolving Secret Sharing. - Noam Mazor (Electron. Colloquium Comput. Complex., 2023)

Key-Agreement with Perfect Completeness from Random Oracles. - Noam Mazor (Electron. Colloquium Comput. Complex., 2023)

Counting Unpredictable Bits: A Simple PRG from One-way Functions. - Noam Mazor; Rafael Pass (Electron. Colloquium Comput. Complex., 2023)

The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity is False. - Noam Mazor; Rafael Pass (Electron. Colloquium Comput. Complex., 2023)

A Note On the Universality of Black-box MKtP Solvers. - Noam Mazor; Rafael Pass (Electron. Colloquium Comput. Complex., 2023)

On Black-Box Meta Complexity and Function Inversion. - Noam Mazor; Rafael Pass (APPROX/RANDOM, 2024)

Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. - Marshall Ball; Yanyi Liu; Noam Mazor; 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)

On Witness Encryption and Laconic Zero-Knowledge Arguments. - Yanyi Liu; Noam Mazor; Rafael Pass (Electron. Colloquium Comput. Complex., 2024)

On White-Box Learning and Public-Key Encryption. - Yanyi Liu; Noam Mazor; Rafael Pass (Electron. Colloquium Comput. Complex., 2024)

Lower Bounds on the Overhead of Indistinguishability Obfuscation. - Zhenjian Lu; Noam Mazor; Igor C. Oliveira 001; Rafael Pass (Electron. Colloquium Comput. Complex., 2024)

Search-to-Decision Reductions for Kolmogorov Complexity. - Noam Mazor; Rafael Pass (Electron. Colloquium Comput. Complex., 2024)

Gap MCSP is not (Levin) NP-complete in Obfustopia. - Noam Mazor; Rafael Pass (Electron. Colloquium Comput. Complex., 2024)

Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions. - Amos Beimel; Tal Malkin; Noam Mazor (IACR Cryptol. ePrint Arch., 2024)

Simple Constructions from (Almost) Regular One-Way Functions. - Noam Mazor; Jiapeng Zhang (J. Cryptol., 2024)

Computationally Differentially Private Inner-Product Protocols Imply Oblivious Transfer. - Iftach Haitner; Noam Mazor; Jad Silbak; Eliad Tsfadia; Chao Yan (CRYPTO (4), 2025)

Mildly Accurate Computationally Differentially Private Inner Product Protocols Imply Oblivious Transfer. - Iftach Haitner; Noam Mazor; Jad Silbak; Eliad Tsfadia; Chao Yan (CoRR, 2025)

Guest Column: On Cryptography and Meta-Complexity. - Noam Mazor; Rafael Pass (SIGACT News, 2025)