80 search results - page 11 / 16 » stoc 2007 |
127
click to vote
SIROCCO
2001
15 years 5 months ago
2001
The condition-based approach for consensus solvability (that we have introduced in a previous paper, ACM STOC'01) consists in identifying sets of input vectors for which it i...
109
click to vote
ASIACRYPT
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we show a general transformation from any honest verifier statistical zero-knowledge argument to a concurrent statistical zero-knowledge argument. Our transformatio...
127
click to vote
TCC
2007
Springer
15 years 10 months ago
2007
Springer
We investigate whether security of multiparty computation in the information-theoretic setting implies their security under concurrent composition. We show that security in the sta...
118
Voted
ECCC
2007
15 years 4 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...
131
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...