#### Filter Results:

- Full text PDF available (29)

#### Publication Year

2009

2018

- This year (4)
- Last 5 years (21)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit Sahai
- CRYPTO
- 2010

Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs for NP. We show that… (More)

- Mohammad Mahmoody, Tal Moran, Salil P. Vadhan
- ITCS
- 2013

We construct a publicly verifiable protocol for proving computational work based on collision-resistant hash functions and a new plausible complexity assumption regarding the existence of "inherently… (More)

- Iftach Haitner, Mohammad Mahmoody, David Xiao
- 2010 IEEE 25th Annual Conference on Computational…
- 2010

We investigate the question of what languages can be decided efficiently with the help of a recursive collision-finding oracle. Such an oracle can be used to break collision-resistant hash functions… (More)

- Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth
- Algorithmica
- 2014

We initiate a study of the security of cryptographic primitives in the presence of efficient tampering attacks to the randomness of honest parties. More precisely, we consider p-tampering attackers… (More)

A fair two-party coin tossing protocol is one in which both parties output the same bit that is almost uniformly distributed (i.e., it equals 0 and 1 with probability that is at most negligibly far… (More)

- Mohammad Mahmoody, Tal Moran, Salil P. Vadhan
- CRYPTO
- 2011

A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until enough time has elapsed for the… (More)

- Mohammad Mahmoody, David Xiao
- 2010 IEEE 25th Annual Conference on Computational…
- 2009

We prove new results regarding the complexity of various complexity classes under randomized oracle reductions. We first prove that BPP^prSZK \subseteq AM \cap coAM, where prSZK is the class of… (More)

Coin tossing is a basic cryptographic task that allows two distrustful parties to obtain an unbiased random bit in a way that neither party can bias the output by deviating from the protocol or… (More)

- Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth
- IACR Cryptology ePrint Archive
- 2013

We initiate a study of the security of cryptographic primitives in the presence of efficient tampering attacks to the randomness of honest parties. More precisely, we consider p-tampering attackers… (More)

We prove that every key agreement protocol in the random oracle model in which the honest users make at most n queries to the oracle can be broken by an adversary who makes O(n) queries to the… (More)