Academic
Publications
Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model

Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model,10.1007/978-3-540-72540-4_8,Moti Yung,Yunlei Zhao

Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model   (Citations: 7)
BibTex | RIS | RefWorks Download
We present a generic construction for constant-round concurrsound resettable zero-knowledge (rZK-CS) arguments for NP\mathcal{NP} in the bare public-key (BPK) model under any (sub-exponentially strong) one-way function (OWF), which is a traditional assumption in this area. The generic construction in turn allows round-optimal implementation for NP\mathcal{NP} still under general assumptions, and can be converted into a highly practical instantiation (under specific number-theoretic assumptions) for any language admitting Σ-protocols. Further, the rZK-CS arguments developed in this work also satisfy a weak (black-box) concurrent knowledge-extractability property as proofs of knowledge, in which case some super-polynomial-time assumption is intrinsic.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: