Results 1 
3 of
3
ConstantRound Resettable Zero Knowledge With Concurrent Soundness in the Bare PublicKey Model
 Advances in Cryptology – CRYPTO 2004, volume 3152 Lecture Notes in Computer Science
, 2004
"... In the bare publickey model (BPK in short), each veri er is assumed to have deposited a public key in a le that is accessible by all users at all times. In this model, introduced by Canetti et al. [STOC 2000], constantround blackbox concurrent and resettable zero knowledge is possible as opp ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
In the bare publickey model (BPK in short), each veri er is assumed to have deposited a public key in a le that is accessible by all users at all times. In this model, introduced by Canetti et al. [STOC 2000], constantround blackbox concurrent and resettable zero knowledge is possible as opposed to the standard model for zero knowledge.
Concurrent/Resettable ZeroKnowledge with Concurrent Soundness in the Bare PublicKey Model and Its Applications
, 2003
"... In this paper, we present both practical and general 4round concurrent and resettable zeroknowledge arguments with concurrent soundness in the bare publickey (BPK) model. To our knowledge, our result is the first work that achieves concurrent soundness for ZK protocols in the BPK model and stan ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
In this paper, we present both practical and general 4round concurrent and resettable zeroknowledge arguments with concurrent soundness in the bare publickey (BPK) model. To our knowledge, our result is the first work that achieves concurrent soundness for ZK protocols in the BPK model and stands for the current stateoftheart of concurrent zeroknowledge with setup assumptions.
ConstantRound Resettable Zero Knowledge with Concurrent Soundness in the Bare PublicKey Model
"... In the bare publickey 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], constantround blackbox concurrent and resettable zero knowledge is possible as oppos ..."
Abstract
 Add to MetaCart
In the bare publickey 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], constantround blackbox 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): onetime, sequential, concurrent and resettable soundness. In this paper we present the first constantround concurrently sound resettable zeroknowledge argument system in the bare publickey model for N P. More specifically, we present a 4round 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 previous works of Micali and Reyzin [EuroCrypt 2001] and Zhao et al. [EuroCrypt 2003] since they achieved concurrent soundness in stronger models. 1