Articles with public access mandates - Moni NaorLearn more
Available somewhere: 18
Is there an oblivious RAM lower bound?
E Boyle, M Naor
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
Mandates: US National Science Foundation, European Commission
One-way functions and (im) perfect obfuscation
I Komargodski, T Moran, M Naor, R Pass, A Rosen, E Yogev
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 374-383, 2014
Mandates: European Commission
Privately learning thresholds: Closing the exponential gap
H Kaplan, K Ligett, Y Mansour, M Naor, U Stemmer
Conference on Learning Theory, 2263-2285, 2020
Mandates: US National Science Foundation, US Department of Defense
The power of distributed verifiers in interactive proofs
M Naor, M Parter, E Yogev
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
Mandates: European Commission
Adversarial laws of large numbers and optimal regret in online classification
N Alon, O Ben-Eliezer, Y Dagan, S Moran, M Naor, E Yogev
Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing …, 2021
Mandates: US National Science Foundation
Collision resistant hashing for paranoids: Dealing with multiple collisions
I Komargodski, M Naor, E Yogev
Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018
Mandates: US Department of Defense
Making NSEC5 practical for DNSSEC
D Papadopoulos, D Wessels, S Huque, M Naor, J Včelák, L Reyzin, ...
Cryptology ePrint Archive, 2017
Mandates: US National Science Foundation
Universal constructions and robust combiners for indistinguishability obfuscation and witness encryption
P Ananth, A Jain, M Naor, A Sahai, E Yogev
Annual International Cryptology Conference, 491-520, 2016
Mandates: US National Science Foundation
Hardness-preserving reductions via cuckoo hashing
I Berman, I Haitner, I Komargodski, M Naor
Journal of Cryptology 32, 361-392, 2019
Mandates: US National Science Foundation, US Department of Defense
NSEC5 from elliptic curves: Provably preventing DNSSEC zone enumeration with shorter responses
S Goldberg, M Naor, D Papadopoulos, L Reyzin
Cryptology ePrint Archive, 2016
Mandates: US National Science Foundation
Universal obfuscation and witness encryption: Boosting correctness and combining security
P Ananth, A Jain, M Naor, A Sahai, E Yogev
Cryptology ePrint Archive, 2016
Mandates: US National Science Foundation
The security of lazy users in out-of-band authentication
M Naor, L Rotem, G Segev
ACM Transactions on Privacy and Security (TOPS) 23 (2), 1-32, 2020
Mandates: US National Science Foundation, European Commission
Incrementally verifiable computation via incremental PCPs
M Naor, O Paneth, GN Rothblum
Theory of Cryptography: 17th International Conference, TCC 2019, Nuremberg …, 2019
Mandates: US National Science Foundation, US Department of Defense, European Commission
Can NSEC5 be practical for DNSSEC deployments?
D Papadopoulos, D Wessels, S Huque, M Naor, J Včelák, L Reyzin, ...
Mandates: US National Science Foundation
The family holiday gathering problem or fair and periodic scheduling of independent sets
A Amir, O Kapah, T Kopelowitz, M Naor, E Porat
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and …, 2016
Mandates: US National Science Foundation
Instance complexity and unlabeled certificates in the decision tree model
T Grossman, I Komargodski, M Naor
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
Mandates: US Department of Defense
Out-of-band authenticated group key exchange: From strong authentication to immediate key delivery
M Naor, L Rotem, G Segev
Cryptology ePrint Archive, 2019
Mandates: European Commission
That’s not my signature! Fail-stop signatures for a post-quantum world
C Boschini, H Dahari, M Naor, E Ronen
Cryptology ePrint Archive, 2023
Mandates: Swiss National Science Foundation, US Department of Defense
Publication and funding information is determined automatically by a computer program
