Mohammad Mahmoody
Mohammad Mahmoody
Associate Professor, University of Virginia
Geverifieerd e-mailadres voor virginia.edu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Merkle puzzles are optimal—an O(n^2)-query attack on any key exchange from a random oracle
B Barak, M Mahmoody-Ghidary
Advances in Cryptology-CRYPTO 2009, 374-390, 2009
822009
The curse of concentration in robust learning: Evasion and poisoning attacks from concentration of measure
S Mahloujifar, DI Diochnos, M Mahmoody
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 4536-4543, 2019
782019
Time-lock puzzles in the random oracle model
M Mahmoody, T Moran, S Vadhan
Annual Cryptology Conference, 39-50, 2011
682011
Interactive locking, zero-knowledge PCPs, and unconditional cryptography
V Goyal, Y Ishai, M Mahmoody, A Sahai
Annual Cryptology Conference, 173-190, 2010
682010
Publicly verifiable proofs of sequential work
M Mahmoody, T Moran, S Vadhan
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
652013
On the black-box complexity of optimally-fair coin tossing
D Dachman-Soled, Y Lindell, M Mahmoody, T Malkin
Theory of Cryptography Conference, 450-467, 2011
562011
Lower bounds on signatures from symmetric primitives
B Barak, M Mahmoody-Ghidary
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 680-688, 2007
502007
On the impossibility of cryptography with tamperable randomness
P Austrin, KM Chung, M Mahmoody, R Pass, K Seth
Annual Cryptology Conference, 462-479, 2014
422014
The curious case of non-interactive commitments–on the power of black-box vs. non-black-box use of primitives
M Mahmoody, R Pass
Annual Cryptology Conference, 701-718, 2012
322012
Adversarial risk and robustness: General definitions and implications for the uniform distribution
DI Diochnos, S Mahloujifar, M Mahmoody
arXiv preprint arXiv:1810.12272, 2018
302018
Can optimally-fair coin tossing be based on one-way functions?
D Dachman-Soled, M Mahmoody, T Malkin
Theory of Cryptography Conference, 217-239, 2014
292014
Can Adversarially Robust Learning LeverageComputational Hardness?
S Mahloujifar, M Mahmoody
Algorithmic Learning Theory, 581-609, 2019
272019
On the power of randomized reductions and the checkability of SAT
M Mahmoody, D Xiao
2010 IEEE 25th Annual Conference on Computational Complexity, 64-75, 2010
272010
On efficient zero-knowledge PCPs
Y Ishai, M Mahmoody, A Sahai
Theory of Cryptography Conference, 151-168, 2012
232012
A new sampling protocol and applications to basing cryptographic primitives on the hardness of NP
I Haitner, M Mahmoody, D Xiao
2010 IEEE 25th Annual Conference on Computational Complexity, 76-87, 2010
232010
Lower bounds on assumptions behind indistinguishability obfuscation
M Mahmoody, A Mohammed, S Nematihaji, R Pass, A Shelat
Theory of Cryptography Conference, 49-66, 2016
202016
Limits of random oracles in secure computation
M Mahmoody, HK Maji, M Prabhakaran
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
202014
Limits of random oracles in secure computation
M Mahmoody, HK Maji, M Prabhakaran
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
202014
On the power of nonuniformity in proofs of security
KM Chung, H Lin, M Mahmoody, R Pass
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
202013
Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners
S Mahloujifar, M Mahmoody
Theory of Cryptography Conference, 245-279, 2017
192017
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20