Paper Info
Title
Min-round Resettable Zero-Knowledge in the Public-Key Model
Abstract
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 rounds in a new model, where the verifier simply has a public key registered before any interaction with the prover. To achieve ultimate round efficiency, we advocate a slightly stronger model. Informally, we show that, as long as the honest verifier does not use a given public key more than a fixed-polynomial number of times, there exist 3-round (which we prove optimal) RZK protocols for all of NP.
Year
DOI
Venue
2001
10.1007/3-540-44987-6_23
EUROCRYPT
Keywords
Field
DocType
fixed-polynomial number,honest verifier,min-round resettable zero-knowledge,constant round,resettable zero-knowledge,new model,public key,stronger model,rzk protocol,public-key model,ultimate round efficiency,strongest notion,zero knowledge
Pseudorandom function family,Discrete mathematics,Computer science,Cryptography,Commitment scheme,Theoretical computer science,Cryptographic primitive,Security parameter,Gas meter prover,Zero-knowledge proof,Public-key cryptography
Conference
Volume
ISSN
ISBN
2045
0302-9743
3-540-42070-3
Citations 
PageRank 
References 
20
0.86
22
Authors
2
Name
Order
Citations
PageRank
Silvio Micali1114342581.31
Leonid Reyzin22640132.67