Anzeige
Erschienen in:
2008 | OriginalPaper | Buchkapitel
Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
verfasst von : Yi Deng, Dongdai Lin
Erschienen in: Information Security and Cryptology
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper we present the
first
constant round resettable zero knowledge arguments with concurrent soundness for
$\mathcal{NP}$
in the bare public-key (BPK for short) model assuming only collision-resistant hash functions against
polynomial-time
adversaries. This resolves the problem whether there exist such protocols for
$\mathcal{NP}$
in BPK model without assuming
sub-exponential hardness
. In our protocol, the resettable zero knowledge is demonstrated via a black-box simulator, while the concurrent soundness is proved by using the malicious prover strategy in
non-black-box
manner.