Mohammad Mahmoody

International Association for Cryptologic Research

Mohammad Mahmoody Search web for home page

Program Committees

1	2019	Eurocrypt	pc
2	2018	Eurocrypt	pc
3	2015	TCC	pc
4	2014	TCC	pc
5	2013	TCC	pc
6	2011	TCC	pc

Publications

	year	title	booktitle	pages
1	2019	Registration-Based Encryption from Standard Assumptions	pkc	63-93
2	2018	Limits on the Power of Garbling Techniques for Public-Key Encryption	crypto	335-364
3	2018	On the Round Complexity of OT Extension	crypto	545-574
4	2018	Registration-Based Encryption: Removing Private-Key Generator from IBE	tcc	689-718
5	2017	Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives	crypto	661-695
6	2017	Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners	tcc	245-279
7	2017	When Does Functional Encryption Imply Obfuscation?	tcc	82-115
8	2016	On the Power of Hierarchical Identity-Based Encryption	eurocrypt	online
9	2016	On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models	tcc	online
10	2016	Lower Bounds on Assumptions Behind Indistinguishability Obfuscation	tcc	online
11	2015	On the Power of Hierarchical Identity-Based Encryption	eprint	online
12	2015	Lower Bounds on Assumptions behind Indistinguishability Obfuscation	eprint	online
13	2015	More on Impossibility of Virtual Black-Box Obfuscation in Idealized Models	eprint	online
14	2014	On the Impossibility of Cryptography with Tamperable Randomness	crypto	online
15	2014	Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?	tcc	online
16	2014	On the Power of Public-Key Encryption in Secure Computation	tcc	online
17	2013	Languages with Efficient Zero-Knowledge PCPs are in SZK	tcc	online
18	2012	On Efficient Zero-Knowledge PCPs	tcc	online
19	2012	On Black-Box Reductions between Predicate Encryption Schemes	tcc	online
20	2012	The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives	crypto	online
21	2011	On the Black-Box Complexity of Optimally-Fair Coin Tossing	tcc	online
22	2011	Time-Lock Puzzles in the Random Oracle Model	crypto	online
23	2010	Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography	eprint	online
24	2010	Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography	crypto	online
25	2009	Merkle Puzzles Are Optimal - An O(n²)-Query Attack on Any Key Exchange from a Random Oracle	crypto	online
26	2008	Merkle Puzzles are Optimal	eprint	online
27	2008	Lower Bounds on Signatures From Symmetric Primitives	eprint	online

Mohammad Mahmoody Search web for home page

Program Committees

Publications

Coauthors of Mohammad Mahmoody