Follow
Noam Mazor
Noam Mazor
Verified email at tauex.tau.ac.il - Homepage
Title
Cited by
Cited by
Year
A novel tool for time‐locking study plans to results
M Mazor, N Mazor, R Mukamel
European Journal of Neuroscience 49 (9), 1149-1156, 2019
152019
On the communication complexity of key-agreement protocols
I Haitner, N Mazor, R Oshman, O Reingold, A Yehudayoff
10th Innovations in Theoretical Computer Science, 2019
132019
Lower bounds on the time/memory tradeoff of function inversion
D Chawin, I Haitner, N Mazor
Theory of Cryptography Conference, 305-334, 2020
122020
On the complexity of two-party differential privacy
I Haitner, N Mazor, J Silbak, E Tsfadia
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
112022
The non-uniform perebor conjecture for time-bounded kolmogorov complexity is false
N Mazor, R Pass
15th Innovations in Theoretical Computer Science Conference (ITCS 2024), 2024
102024
Channels of small log-ratio leakage and characterization of two-party differentially private computation
I Haitner, N Mazor, R Shaltiel, J Silbak
Theory of Cryptography Conference, 531-560, 2019
102019
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement
M Ball, Y Liu, N Mazor, R Pass
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
82023
A Lower Bound on the Share Size in Evolving Secret Sharing
N Mazor
4th Conference on Information-Theoretic Cryptography (ITC), 2023
72023
Counting unpredictable bits: A simple prg from one-way functions
N Mazor, R Pass
Theory of Cryptography Conference, 191-218, 2023
62023
Incompressiblity and next-block pseudoentropy
I Haitner, N Mazor, J Silbak
14th Innovations in Theoretical Computer Science, 2023
62023
Simple Constructions from (Almost) Regular One-Way Functions
N Mazor, J Zhang
Journal of Cryptology 37 (3), 25, 2024
32024
Gap MCSP is not (Levin) NP-complete in Obfustopia
N Mazor, R Pass
Cryptology ePrint Archive, 2024
32024
Search-to-decision reductions for kolmogorov complexity
N Mazor, R Pass
39th Computational Complexity Conference (CCC 2024), 34: 1-34: 20, 2024
22024
Key-agreement with perfect completeness from random oracles
N Mazor
Cryptology ePrint Archive, 2023
22023
Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions
A Beimel, T Malkin, N Mazor
Annual International Cryptology Conference, 459-488, 2024
12024
A Note on Zero-Knowledge for NP and One-Way Functions
Y Liu, N Mazor, R Pass
Cryptology ePrint Archive, 2024
12024
A Note On the Universality of Black-box MKtP Solvers
N Mazor, R Pass
Cryptology ePrint Archive, 2023
12023
On White-Box Learning and Public-Key Encryption
Y Liu, N Mazor, R Pass
Cryptology ePrint Archive, 2024
2024
On Witness Encryption and Laconic Zero-Knowledge Arguments
Y Liu, N Mazor, R Pass
Cryptology ePrint Archive, 2024
2024
Lower Bounds on the Overhead of Indistinguishability Obfuscation
Z Lu, N Mazor, IC Oliveira, R Pass
Cryptology ePrint Archive, 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–20