Folgen
Mohammad Mahmoody
Mohammad Mahmoody
Associate Professor, University of Virginia
Bestätigte E-Mail-Adresse bei virginia.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
1062019
Publicly verifiable proofs of sequential work
M Mahmoody, T Moran, S Vadhan
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
922013
Merkle puzzles are optimal—an -query attack on any key exchange from a random oracle
B Barak, M Mahmoody
Advances in Cryptology-CRYPTO 2009, 374-390, 2009
882009
Time-lock puzzles in the random oracle model
M Mahmoody, T Moran, S Vadhan
Annual Cryptology Conference, 39-50, 2011
872011
Interactive locking, zero-knowledge PCPs, and unconditional cryptography
V Goyal, Y Ishai, M Mahmoody, A Sahai
Annual Cryptology Conference, 173-190, 2010
742010
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
602011
Lower bounds on signatures from symmetric primitives
B Barak, M Mahmoody
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 680-688, 2007
512007
On the impossibility of cryptography with tamperable randomness
P Austrin, KM Chung, M Mahmoody, R Pass, K Seth
Annual Cryptology Conference, 462-479, 2014
502014
Adversarial risk and robustness: General definitions and implications for the uniform distribution
D Diochnos, S Mahloujifar, M Mahmoody
Advances in Neural Information Processing Systems 31, 2018
492018
Universal Multi-Party Poisoning Attacks
S Mahloujifar, M Mahmoody, A Mohammed
International Conference on Machine Learning, 4274-4283, 2019
47*2019
Is Private Learning Possible with Instance Encoding?
N Carlini, S Deng, S Garg, S Jha, S Mahloujifar, M Mahmoody, A Thakurta, ...
2021 IEEE Symposium on Security and Privacy (SP), 410-427, 2021
372021
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
372012
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
342014
Can Adversarially Robust Learning Leverage Computational Hardness?
S Mahloujifar, M Mahmoody
Algorithmic Learning Theory, 581-609, 2019
332019
On the impossibility of virtual black-box obfuscation in idealized models
M Mahmoody, A Mohammed, S Nematihaji
Theory of Cryptography Conference, 18-48, 2016
32*2016
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
292010
On efficient zero-knowledge PCPs
Y Ishai, M Mahmoody, A Sahai
Theory of cryptography conference, 151-168, 2012
262012
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
252013
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
252010
Learning under -Tampering Attacks
S Mahloujifar, DI Diochnos, M Mahmoody
Algorithmic Learning Theory, 572-596, 2018
242018
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20