14 search results - page 3 / 3 » An Unconditional Study of Computational Zero Knowledge |
COCO
2005
Springer
13 years 10 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
CP
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
IJCV
2002
13 years 4 months ago
2002
In this paper we describe the theory and practice of self-calibration of cameras which are fixed in location and may freely rotate while changing their internal parameters by zoomi...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriï...