Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 207,842,455 papers from all fields of science

Search

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

We continue the study of protocols for secure multiparty computation (MPC) that require only two rounds of interaction. The…

Highly Cited

2017

Highly Cited

2017

We study the feasibility of two-message protocols for secure two-party computation in the plain model, for functionalities that…

Review

2011

Review

2011

A secret-sharing scheme is a method by which a dealer distributes shares to parties such that only authorized subsets of parties…

Highly Cited

2010

Highly Cited

2010

We present a general framework for constructing two-message oblivious transfer protocols using a modification of Cramer and Shoup…

Highly Cited

2009

Highly Cited

2009

Most of the work in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side…

2005

2005

We introduce Fair Zero-Knowledge, a multi-verifier ZK system where every proof is guaranteed to be “zero-knowledge for all…

Highly Cited

2001

Highly Cited

2001

We present a novel public key cryptosystem in which the public key of a subscriber can be chosen to be a publicly known value…

Highly Cited

2001

Highly Cited

2001

We formalize the notion of a cryptographic counter, which allows a group of participants to increment and decrement a…

Highly Cited

1997

Highly Cited

1997

We establish the following, quite unexpected, result: replication of data for the computational private information retrieval…

Highly Cited

1987

Highly Cited

1987

Consider n parties having local inputs x 1,x 2,...,x n respectively. and wishing to compute the value f(x 1,...,x n). where f is…