Noam Mazor

According to our database1, Noam Mazor authored at least 21 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Simple Constructions from (Almost) Regular One-Way Functions.
J. Cryptol., September, 2024

Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions.
IACR Cryptol. ePrint Arch., 2024

Gap MCSP is not (Levin) NP-complete in Obfustopia.
Electron. Colloquium Comput. Complex., 2024

Search-to-Decision Reductions for Kolmogorov Complexity.
Electron. Colloquium Comput. Complex., 2024

Lower Bounds on the Overhead of Indistinguishability Obfuscation.
Electron. Colloquium Comput. Complex., 2024

On White-Box Learning and Public-Key Encryption.
Electron. Colloquium Comput. Complex., 2024

On Witness Encryption and Laconic Zero-Knowledge Arguments.
Electron. Colloquium Comput. Complex., 2024

A Note on Zero-Knowledge for NP and One-Way Functions.
Electron. Colloquium Comput. Complex., 2024

Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement.
Electron. Colloquium Comput. Complex., 2024

On Black-Box Meta Complexity and Function Inversion.
Proceedings of the Approximation, 2024

2023
A Note On the Universality of Black-box MKtP Solvers.
Electron. Colloquium Comput. Complex., 2023

The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity is False.
Electron. Colloquium Comput. Complex., 2023

Counting Unpredictable Bits: A Simple PRG from One-way Functions.
Electron. Colloquium Comput. Complex., 2023

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

A Lower Bound on the Share Size in Evolving Secret Sharing.
Electron. Colloquium Comput. Complex., 2023

2022
Non-Adaptive Universal One-Way Hash Functions from Arbitrary One-Way Functions.
Electron. Colloquium Comput. Complex., 2022

Incompressiblity and Next-Block Pseudoentropy.
Electron. Colloquium Comput. Complex., 2022

2021
On the Complexity of Two-Party Differential Privacy.
Electron. Colloquium Comput. Complex., 2021

2020
Lower Bounds on the Time/Memory Tradeoff of Function Inversion.
Electron. Colloquium Comput. Complex., 2020

2019
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.
Electron. Colloquium Comput. Complex., 2019

2018
On the Communication Complexity of Key-Agreement Protocols.
Electron. Colloquium Comput. Complex., 2018


  Loading...