#### Filter Results:

- Full text PDF available (48)

#### Publication Year

2006

2017

- This year (5)
- Last 5 years (34)
- Last 10 years (49)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Payman Mohassel, Matthew K. Franklin
- Public Key Cryptography
- 2006

We study efficiency tradeoffs for secure two-party computation in presence of malicious behavior. We investigate two main approaches for defending against malicious behavior in Yao’s garbled circuit method: (1) Committed-input scheme, (2) Equality-checker scheme. We provide asymptotic and concrete analysis of communication and computation costs of the… (More)

- Seny Kamara, Payman Mohassel, Ben Riva
- ACM Conference on Computer and Communications…
- 2012

Secure function evaluation (SFE) allows a set of mutually distrustful parties to evaluate a function of their joint inputs without revealing their inputs to each other. SFE has been the focus of active research and recent work suggests that it can be made practical. Unfortunately, current protocols and implementations have inherent limitations that are hard… (More)

- Vipul Goyal, Payman Mohassel, Adam D. Smith
- EUROCRYPT
- 2008

Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure computation protocols which are efficient enough to be usable in practice. Aumann and Lindell presented an efficient two party computation protocol secure against covert… (More)

- Payman Mohassel, Seyed Saeed Sadeghian
- EUROCRYPT
- 2013

We revisit the problem of general-purpose private function evaluation (PFE) wherein a single party P1 holds a circuit C, while each Pi for 1 ≤ i ≤ n holds a private input xi, and the goal is for a subset (or all) of the parties to learn C(x1, . . . , xn) but nothing else. We put forth a general framework for designing PFE where the task of hiding the… (More)

- Seny Kamara, Payman Mohassel, Mariana Raykova
- IACR Cryptology ePrint Archive
- 2011

We initiate the study of secure multi-party computation (MPC) in a server-aided setting, where the parties have access to a single server that (1) does not have any input to the computation; (2) does not receive any output from the computation; but (3) has a vast (but bounded) amount of computational resources. In this setting, we are concerned with… (More)

- Seny Kamara, Payman Mohassel, Mariana Raykova, Seyed Saeed Sadeghian
- Financial Cryptography
- 2014

We examine the feasibility of private set intersection (PSI) over massive datasets. PSI, which allows two parties to find the intersection of their sets without revealing them to each other, has numerous applications including to privacy-preserving data mining, location-based services and genomic computations. Unfortunately, the most efficient constructions… (More)

- Vladimir Kolesnikov, Payman Mohassel, Mike Rosulek
- IACR Cryptology ePrint Archive
- 2014

Most implementations of Yao’s garbled circuit approach for 2-party secure computation use the free-XOR optimization of Kolesnikov & Schneider (ICALP 2008). We introduce an alternative technique called flexible-XOR (fleXOR) that generalizes free-XOR and offers several advantages. First, fleXOR can be instantiated under a weaker hardness assumption on the… (More)

- Eike Kiltz, Payman Mohassel, Adam O'Neill
- EUROCRYPT
- 2010

We introduce the notion of adaptive trapdoor functions (ATDFs); roughly, ATDFs remain one-way even when the adversary is given access to an inversion oracle. Our main application is the black-box construction of chosenciphertext secure public-key encryption (CCA-secure PKE). Namely, we give a black-box construction of CCA-Secure PKE from ATDFs, as well as a… (More)

- Payman Mohassel
- IACR Cryptology ePrint Archive
- 2011

We consider secure delegation of linear algebra computation, wherein a client, privately and verifiably, outsources tasks such as matrix multiplication, matrix inversion, computing the rank and determinant, and solving a linear system to a remote worker. When operating on n×n matrices, we design non-interactive, and secure protocols for delegating matrix… (More)

- Payman Mohassel, Ben Riva
- IACR Cryptology ePrint Archive
- 2013

Applying cut-and-choose techniques to Yao’s garbled circuit protocol has been a promising approach for designing efficient Two-Party Computation (2PC) with malicious and covert security, as is evident from various optimizations and software implementations in the recent years. We revisit the security and efficiency properties of this popular approach and… (More)