Mohammad Mahmoody

International Association for Cryptologic Research

Mohammad Mahmoody Search web for home page

Program Committees

1	2015	TCC	pc
2	2014	TCC	pc
3	2013	TCC	pc
4	2011	TCC	pc

Publications

	year	title	booktitle	pages
1	2016	On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models	tcc	18-48
2	2016	Lower Bounds on Assumptions Behind Indistinguishability Obfuscation	tcc	49-66
3	2016	On the Power of Hierarchical Identity-Based Encryption	eurocrypt	243-272
4	2015	Lower Bounds on Assumptions behind Indistinguishability Obfuscation	eprint	1062
5	2015	More on Impossibility of Virtual Black-Box Obfuscation in Idealized Models	eprint	632
6	2015	On the Power of Hierarchical Identity-Based Encryption	eprint	815
7	2014	On the Impossibility of Cryptography with Tamperable Randomness	crypto	462-479
8	2014	Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?	tcc	217-239
9	2014	On the Power of Public-Key Encryption in Secure Computation	tcc	240-264
10	2013	Languages with Efficient Zero-Knowledge PCPs are in SZK	TCC	295
11	2012	On Efficient Zero-Knowledge PCPs	tcc	151-168
12	2012	On Black-Box Reductions between Predicate Encryption Schemes	tcc	440-457
13	2012	The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives	crypto	701-718
14	2011	Time-Lock Puzzles in the Random Oracle Model	crypto	39
15	2011	On the Black-Box Complexity of Optimally-Fair Coin Tossing	tcc	450
16	2010	Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography	crypto	173-190
17	2010	Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography	eprint	online
18	2009	Merkle Puzzles Are Optimal - An O(n²)-Query Attack on Any Key Exchange from a Random Oracle	crypto	374-390
19	2008	Merkle Puzzles are Optimal	eprint	online
20	2008	Lower Bounds on Signatures From Symmetric Primitives	eprint	online

Mohammad Mahmoody Search web for home page

Program Committees

Publications

Coauthors of Mohammad Mahmoody