Noam Mazor

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 48

Top Topics

Key Agreement Protocol

Kolmogorov Complexity

Top Venues

Electron. Colloquium Comput. Complex.

IACR Cryptol. ePrint Arch.

Publications

Noam Mazor, Rafael Pass
Search-to-Decision Reductions for Kolmogorov Complexity. Electron. Colloquium Comput. Complex. (2024)
Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. IACR Cryptol. ePrint Arch. 2024 (2024)
Noam Mazor, Rafael Pass
Gap MCSP is not (Levin) NP-complete in Obfustopia. IACR Cryptol. ePrint Arch. 2024 (2024)
Noam Mazor, Jiapeng Zhang
Simple Constructions from (Almost) Regular One-Way Functions. J. Cryptol. 37 (3) (2024)
Amos Beimel, Tal Malkin, Noam Mazor
Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions. IACR Cryptol. ePrint Arch. 2024 (2024)
Noam Mazor, Rafael Pass
Gap MCSP Is Not (Levin) NP-Complete in Obfustopia. CCC (2024)
Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. Electron. Colloquium Comput. Complex. (2024)
Amos Beimel, Tal Malkin, Noam Mazor
Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions. CRYPTO (5) (2024)
Noam Mazor, Rafael Pass
Search-To-Decision Reductions for Kolmogorov Complexity. CCC (2024)
Noam Mazor, Rafael Pass
Gap MCSP is not (Levin) NP-complete in Obfustopia. Electron. Colloquium Comput. Complex. (2024)
Noam Mazor, Rafael Pass
The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity Is False. ITCS (2024)
Yanyi Liu, Noam Mazor, Rafael Pass
A Note on Zero-Knowledge for NP and One-Way Functions. Electron. Colloquium Comput. Complex. (2024)
Yanyi Liu, Noam Mazor, Rafael Pass
A Note on Zero-Knowledge for NP and One-Way Functions. IACR Cryptol. ePrint Arch. 2024 (2024)
Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. FOCS (2023)
Noam Mazor, Rafael Pass
Counting Unpredictable Bits: A Simple PRG from One-way Functions. Electron. Colloquium Comput. Complex. (2023)
Noam Mazor
Key-Agreement with Perfect Completeness from Random Oracles. Electron. Colloquium Comput. Complex. (2023)
Noam Mazor, Rafael Pass
The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity is False. Electron. Colloquium Comput. Complex. (2023)
Noam Mazor, Rafael Pass
A Note On the Universality of Black-box MKtP Solvers. Electron. Colloquium Comput. Complex. (2023)
Noam Mazor
Key-Agreement with Perfect Completeness from Random Oracles. IACR Cryptol. ePrint Arch. 2023 (2023)
Noam Mazor, Rafael Pass
The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity is False. IACR Cryptol. ePrint Arch. 2023 (2023)
Noam Mazor, Rafael Pass
A Note On the Universality of Black-box MKtP Solvers. IACR Cryptol. ePrint Arch. 2023 (2023)
Noam Mazor
A Lower Bound on the Share Size in Evolving Secret Sharing. ITC (2023)
Iftach Haitner, Noam Mazor, Jad Silbak
Incompressiblity and Next-Block Pseudoentropy. ITCS (2023)
Noam Mazor, Rafael Pass
Counting Unpredictable Bits: A Simple PRG from One-Way Functions. TCC (1) (2023)
Noam Mazor
A Lower Bound on the Share Size in Evolving Secret Sharing. Electron. Colloquium Comput. Complex. (2023)
Noam Mazor, Rafael Pass
Counting Unpredictable Bits: A Simple PRG from One-way Functions. IACR Cryptol. ePrint Arch. 2023 (2023)
Xinyu Mao, Noam Mazor, Jiapeng Zhang
Non-adaptive Universal One-Way Hash Functions from Arbitrary One-Way Functions. EUROCRYPT (4) (2023)
Noam Mazor
A Lower Bound on the Share Size in Evolving Secret Sharing. IACR Cryptol. ePrint Arch. 2023 (2023)
Iftach Haitner, Noam Mazor, Jad Silbak
Incompressiblity and Next-Block Pseudoentropy. IACR Cryptol. ePrint Arch. 2022 (2022)
Xinyu Mao, Noam Mazor, Jiapeng Zhang
Non-Adaptive Universal One-Way Hash Functions from Arbitrary One-Way Functions. IACR Cryptol. ePrint Arch. 2022 (2022)
Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia
On the complexity of two-party differential privacy. STOC (2022)
Iftach Haitner, Noam Mazor, Jad Silbak
Incompressiblity and Next-Block Pseudoentropy. Electron. Colloquium Comput. Complex. (2022)
Xinyu Mao, Noam Mazor, Jiapeng Zhang
Non-Adaptive Universal One-Way Hash Functions from Arbitrary One-Way Functions. Electron. Colloquium Comput. Complex. (2022)
Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia
On the Complexity of Two-Party Differential Privacy. Electron. Colloquium Comput. Complex. 28 (2021)
Dror Chawin, Iftach Haitner, Noam Mazor
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. CoRR (2021)
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. CoRR (2021)
Noam Mazor, Jiapeng Zhang
Simple Constructions from (Almost) Regular One-Way Functions. TCC (2) (2021)
Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff
On the Communication Complexity of Key-Agreement Protocols. CoRR (2021)
Noam Mazor, Jiapeng Zhang
Simple Constructions from (Almost) Regular One-Way Functions. IACR Cryptol. ePrint Arch. 2021 (2021)
Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia
On the Complexity of Two-Party Differential Privacy. CoRR (2021)
Dror Chawin, Iftach Haitner, Noam Mazor
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. TCC (3) (2020)
Dror Chawin, Iftach Haitner, Noam Mazor
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. Electron. Colloquium Comput. Complex. 27 (2020)
Dror Chawin, Iftach Haitner, Noam Mazor
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. IACR Cryptol. ePrint Arch. 2020 (2020)
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. IACR Cryptol. ePrint Arch. 2019 (2019)
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. Electron. Colloquium Comput. Complex. 26 (2019)
Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff
On the Communication Complexity of Key-Agreement Protocols. ITCS (2019)
Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. TCC (1) (2019)
Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff
On the Communication Complexity of Key-Agreement Protocols. Electron. Colloquium Comput. Complex. 25 (2018)