2020 | OriginalPaper | Chapter
Shorter Non-interactive Zero-Knowledge Arguments and ZAPs for Algebraic Languages
Authors : Geoffroy Couteau, Dominik Hartmann
Published in: Advances in Cryptology – CRYPTO 2020
Publisher: Springer International Publishing
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
Abstract
-
conceptual simplicity, parameters derive from the \(\varSigma \)-protocol;
-
proofs as short as resulting from the Fiat-Shamir heuristic applied to the underlying \(\varSigma \)-protocol;
-
fully adaptive soundness and perfect zero-knowledge in the common random string model with a single random group element as CRS;
-
yields simple and efficient two-round, public coin, publicly-verifiable perfect witness-indistinguishable (WI) arguments(ZAPs) in the plain model. To our knowledge, this is the first construction of two-rounds statistical witness-indistinguishable arguments from pairing assumptions.