Skip to search formSkip to main contentSkip to account menu>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

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… Expand

Highly Cited

2008

Highly Cited

2008

We propose a simple and general framework for constructing oblivious transfer (OT) protocols that are efficient, universally… Expand

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… Expand

Highly Cited

2001

Highly Cited

2001

We have constructed a series of new code families for the spectral-amplitude-coding optical code-division multiple-access (CDMA… Expand

Highly Cited

1997

Highly Cited

1997

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

Highly Cited

1996

Highly Cited

1996

A set of n-tuples over Z/sub 4/ is called a code over Z/sub 4/ or a Z/sub 4/ code if it is a Z/sub 4/ module. We prove that any Z… Expand

Highly Cited

1989

Highly Cited

1989

Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a… Expand

Highly Cited

1987

Highly Cited

1987

The notion of a zero knowledge interactive proof that one party "knows" some secret information is explored. It is shown that any… Expand

Highly Cited

1986

Highly Cited

1986

Two closely-related pseudo-random sequence generators are presented: The ${1 / P}$generator, with input P a prime, outputs the… Expand

Highly Cited

1957

Highly Cited

1957

If p is a prime other than 2, half of the numbers 1, 2, … p —1 are quadratic residues (mod p ) and the other half are quadratic… Expand