9 search results - page 2 / 2 » Constant-Round Resettable Zero Knowledge with Concurrent Sou... |
ASIACRYPT
2004
Springer
13 years 10 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
2001
Springer
13 years 9 months ago
2001
Springer
In STOC 2000, Canetti, Goldreich, Goldwasser, and Micali put forward the strongest notion of zero-knowledge to date, resettable zero-knowledge (RZK) and implemented it in constant ...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We consider a type of zero-knowledge protocols that are of interest for their practical applications within networks like the Internet: efficient zero-knowledge arguments of knowl...
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We show that only languages in BPP have public-coin, blackbox zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. Thi...