Advertisement
Published in:
2005 | OriginalPaper | Chapter
Practical Zero-Knowledge Arguments from Σ-Protocols
Authors : Yunlei Zhao, Robert H. Deng, Binyu Zang, Yiming Zhao
Published in: Internet and Network Economics
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Zero-knowledge (ZK) plays a central role in the field of modern cryptography and is a very powerful tool for constructing various cryptographic protocols, especially cryptographic protocols in E-commerce. Unfortunately, most ZK protocols are for general
$\mathcal{NP}$
languages with going through general
$\mathcal{NP}$
-reductions, and thus cannot be directly employed in practice. On the other hand, a large number of protocols, named Σ-protocols, are developed in industry and in the field of applied cryptography for specific number-theoretic languages (e.g. DLP and RSA), which preserves the ZK property only with respect to
honest
verifiers (i.e., they are not real ZK) but are highly practical. In this work, we show a
generic yet practical
transformation from Σ-protocols to practical (real) ZK arguments without general
$\mathcal{NP}$
-reductions under either the DLP or RSA assumptions.