179 search results - page 21 / 36 » eccc 2010 |
ECCC
2006
13 years 7 months ago
2006
Abstract. This article points out a gap between two natural formulations of the concept of a proof of knowledge, and shows that in all natural cases (e.g., NP-statements) this gap ...
ECCC
2007
13 years 7 months ago
2007
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
ECCC
2007
13 years 7 months ago
2007
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a constan...
ECCC
2007
13 years 7 months ago
2007
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
ECCC
2000
13 years 7 months ago
2000
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...