2576 search results - page 5 / 516 » The Complexity of Zero Knowledge |
95
Voted
ASIACRYPT
2011
Springer
13 years 9 months ago
2011
Springer
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
81
Voted
COCO
2005
Springer
15 years 3 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...
82
Voted
ASIACRYPT
2004
Springer
15 years 2 months ago
2004
Springer
In the bare public-key model, introduced by Canetti et al. [STOC 2000], it is only assumed that each verifier deposits during a setup phase a public key in a file accessible by a...
EUROCRYPT
2003
Springer
15 years 2 months ago
2003
Springer
A new public-key model for resettable zero-knowledge (rZK) protocols, which is an extension and generalization of the upper-bounded public-key (UPK) model introduced by Micali and ...
CRYPTO
1998
Springer
15 years 1 months ago
1998
Springer
