International Association for Cryptologic Research
Mohammad Mahmoody Search web for home page
Program Committees
| 1 | 2014 | TCC | pc |
| 2 | 2013 | TCC | pc |
| 3 | 2011 | TCC | pc |
Publications
| year | title | booktitle | pages | |
|---|---|---|---|---|
| 1 | 2013 | Languages with Efficient Zero-Knowledge PCPs are in SZK | TCC | 295 |
| 2 | 2012 | On Efficient Zero-Knowledge PCPs | tcc | 151-168 |
| 3 | 2012 | On Black-Box Reductions between Predicate Encryption Schemes | tcc | 440-457 |
| 4 | 2012 | The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives | crypto | 701-718 |
| 5 | 2011 | Time-Lock Puzzles in the Random Oracle Model | crypto | 39 |
| 6 | 2011 | On the Black-Box Complexity of Optimally-Fair Coin Tossing | tcc | 450 |
| 7 | 2010 | Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography | crypto | 173-190 |
| 8 | 2010 | Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography | eprint | online |
| 9 | 2009 | Merkle Puzzles Are Optimal - An O(n2)-Query Attack on Any Key Exchange from a Random Oracle | crypto | 374-390 |
| 10 | 2008 | Merkle Puzzles are Optimal | eprint | online |
| 11 | 2008 | Lower Bounds on Signatures From Symmetric Primitives | eprint | online |
Coauthors of Mohammad Mahmoody |