… Although, for many years it was a mostly theoretical tool, in the last decade it has been
improved with new techniques from pairing-based cryptography, becoming order of magnitude …

… for building efficient, pairing-based non-interactive zero-knowledge arguments for a large …
sizes. We note, though, that our proof system can be used to instantiate the non-interactive …

… Below we describe a forking lemma (based on [7]) that considers the setting of non-interactive
protocols with forks of size 2 via algorithms that run in strict time. Footnote 5 …

… Succinct non-interactive arguments (SNARGs) enable … has been on minimizing the length
of such arguments; nowadays, … In the case of pairing-based solutions, subexponential-time …

… length of the proof (and by correspondence, the verification complexity). We say that an
argument system for \(\mathcal {L}\) is succinct if the length … , polylogarithmic) in the size of the \(\…

… of scalars “in the exponent”, 3) pairing-based encryption of elements of the source group of
the … 3 we present the size-proof protocols that we use in our scheme and their parameters. In …

… non-interactive proofs, a particularly interesting concept for proving the computational integrity
is the Succinct Non-interactive ARgument … small compared to the size of the statement or …

… Our construction does not require the batch size or the instance length to be fixed in … only
poly-logarithmically with the batch size and the instance length. Finally, we observe that while …

… Finally, we also note that public parameters of length q (that denotes capacity) used in the
… They are used in the proof of our pairing based positive dynamic non-adaptively secure …

… work is on constructing non-interactive batch arguments (BARGs) for \(\… The CRS size of our
construction is short (ie, sublinear in the … The pairing-based techniques underlying our BARG …