Sciweavers

Share
CRYPTO
2004
Springer

Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model

9 years 7 months ago
Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model
In the bare public-key model (BPK in short), each verifier is assumed to have deposited a public key in a file that is accessible by all users at all times. In this model, introduced by Canetti et al. [STOC 2000], constant-round black-box concurrent and resettable zero knowledge is possible as opposed to the standard model for zero knowledge. As pointed out by Micali and Reyzin [Crypto 2001], the notion of soundness in this model is more subtle and complex than in the classical model and indeed four distinct notions have been introduced (from weakest to strongest): one-time, sequential, concurrent and resettable soundness. In this paper we present the first constant-round concurrently sound resettable zeroknowledge argument system in the bare public-key model for NP. More specifically, we present a 4-round protocol, which is optimal as far as the number of rounds is concerned. Our result solves the main open problem on resettable zero knowledge in the BPK model and improves the pr...
Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Vis
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where CRYPTO
Authors Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Visconti
Comments (0)
books