Square Span Programs with Applications to Succinct NIZK Arguments

George Danezis; Cedric Fournet; Jens Groth; Markulf Kohlweiss

Paper 2014/718 Original: eprint.iacr.org/2014/718 ↗

Square Span Programs with Applications to Succinct NIZK Arguments

George Danezis

Cedric Fournet

Jens Groth

Markulf Kohlweiss

Abstract

We propose a new characterization of NP using square span programs (SSPs). We first characterize NP as affine map constraints on small vectors. We then relate this characterization to SSPs, which are similar but simpler than Quadratic Span Programs (QSPs) and Quadratic Arithmetic Programs (QAPs) since they use a single series of polynomials rather than 2 or 3. We use SSPs to construct succinct non-interactive zero-knowledge arguments of knowledge. For performance, our proof system is defined over Type III bilinear groups; proofs consist of just 4 group elements, verified in just 6 pairings. Concretely, using the Pinocchio libraries, we estimate that proofs will consist of 160 bytes verified in less than 6 ms.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2014-09-16: last updated; 2014-09-16: published
Short URL: https://ia.cr/2014/718
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2014/718,
      author = {George Danezis and Cedric Fournet and Jens Groth and Markulf Kohlweiss},
      title = {Square Span Programs with Applications to Succinct NIZK Arguments},
      howpublished = {Cryptology {ePrint} Archive, Paper 2014/718},
      year = {2014},
      url = {https://eprint.iacr.org/2014/718}
}