1401 search results - page 35 / 281 » Randomness in Interactive Proofs |
106
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
CTRSA
2005
Springer
15 years 3 months ago
2005
Springer
Traditional password-based authentication and key-exchange protocols suffer from the simple fact that a single server stores the sensitive user password. In practice, when such a ...
73
Voted
CJ
2007
14 years 9 months ago
2007
Although the Yahalom protocol, proposed by Burrows, Abadi, and Needham in 1990, is one of the most prominent key establishment protocols analyzed by researchers from the computer s...
ASIACRYPT
2008
Springer
14 years 11 months ago
2008
Springer
In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client's data. The central challenge is to build syst...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...