Non-Interactive Zero-Knowledge Proofs for Composite Statements
ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT III, pp. 643-673, 2018.
The two most common ways to design non-interactive zero-knowledge (NIZK) proofs are based on Sigma protocols and QAP-based SNARKs. The former is highly efficient for proving algebraic statements while the latter is superior for arithmetic representations. Motivated by applications such as privacy-preserving credentials and privacy-preserv...More
Full Text (Upload PDF)
PPT (Upload PPT)