Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Mohammad Mahmoody
2010 – today
- 2013
[c11]Mohammad Mahmoody, Tal Moran, Salil P. Vadhan: Publicly verifiable proofs of sequential work. ITCS 2013: 373-388- [c10]Kai-Min Chung, Huijia Lin, Mohammad Mahmoody, Rafael Pass: On the power of nonuniformity in proofs of security. ITCS 2013: 389-400
- [c9]Mohammad Mahmoody, David Xiao: Languages with Efficient Zero-Knowledge PCPs are in SZK. TCC 2013: 297-314
- [i12]Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth: On the (Im)Possibility of Tamper-Resilient Cryptography: Using Fourier Analysis in Computer Viruses. IACR Cryptology ePrint Archive 2013: 194 (2013)
- 2012
- [c8]Mohammad Mahmoody, Rafael Pass: The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives. CRYPTO 2012: 701-718
- [c7]
- [c6]Vipul Goyal, Virendra Kumar, Satyanarayana V. Lokam, Mohammad Mahmoody: On Black-Box Reductions between Predicate Encryption Schemes. TCC 2012: 440-457
- [i11]Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran: Limits of Random Oracles in Secure Computation. CoRR abs/1205.3554 (2012)
- [i10]Mohammad Mahmoody, David Xiao: Languages with Efficient Zero-Knowledge PCPs are in SZK. Electronic Colloquium on Computational Complexity (ECCC) 19: 52 (2012)
- [i9]Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran: Limits of Random Oracles in Secure Computation. Electronic Colloquium on Computational Complexity (ECCC) 19: 65 (2012)
- [i8]Mohammad Mahmoody, David Xiao: Languages with Efficient Zero-Knowledge PCP's are in SZK. IACR Cryptology ePrint Archive 2012: 229 (2012)
- [i7]Mohammad Mahmoody, Rafael Pass: The Curious Case of Non-Interactive Commitments. IACR Cryptology ePrint Archive 2012: 523 (2012)
- [i6]Kai-Min Chung, Edward Lui, Mohammad Mahmoody, Rafael Pass: Unprovable Security of Two-Message Zero Knowledge. IACR Cryptology ePrint Archive 2012: 711 (2012)
- 2011
- [c5]Mohammad Mahmoody, Tal Moran, Salil P. Vadhan: Time-Lock Puzzles in the Random Oracle Model. CRYPTO 2011: 39-50
- [c4]Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin: On the Black-Box Complexity of Optimally-Fair Coin Tossing. TCC 2011: 450-467
- [i5]Mohammad Mahmoody, Tal Moran, Salil P. Vadhan: Non-Interactive Time-Stamping and Proofs of Work in the Random Oracle Model. IACR Cryptology ePrint Archive 2011: 553 (2011)
- 2010
- [c3]Mohammad Mahmoody, David Xiao: On the Power of Randomized Reductions and the Checkability of SAT. IEEE Conference on Computational Complexity 2010: 64-75
- [c2]Iftach Haitner, Mohammad Mahmoody, David Xiao: A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. IEEE Conference on Computational Complexity 2010: 76-87
- [c1]Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit Sahai: Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography. CRYPTO 2010: 173-190
- [i4]Iftach Haitner, Mohammad Mahmoody, David Xiao: A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. Electronic Colloquium on Computational Complexity (ECCC) 17: 1 (2010)
- [i3]Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit Sahai: Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography. Electronic Colloquium on Computational Complexity (ECCC) 17: 20 (2010)
- [i2]Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit Sahai: Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography. IACR Cryptology ePrint Archive 2010: 89 (2010)
2000 – 2009
- 2009
- [i1]Mohammad Mahmoody, David Xiao: On the Power of Randomized Reductions and the Checkability of SAT. Electronic Colloquium on Computational Complexity (ECCC) 16: 139 (2009)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-13 21:42 CEST by the dblp team