On the Size of Pairing-Based Non-interactive Arguments

By Jens Groth. 2016

1,575 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

In Information Systems

Citations in the corpus

Bulletproofs: Short Proofs for Confidential Transactions and More (2018, background): “Zero-knowledge SNARKs have been the subject of extensive research [4], [5], [36]–[40].”
Transparent SNARKs from DARK Compilers (2020, methodology): “These are the pairing-based SNARKs extending from GGPR [31,47,9,6,35], which have been implemented in numerous libraries [6,16], and even deployed in live systems such as the ZCash [1] cryptocurrency.”
Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings (2019, methodology): “Using knowledge assumptions, it is possible to build zk-SNARKs [15, 18, 35, 45, 47, 54, 59].”
Formalizing Human Ingenuity: A Quantitative Framework for Copyright Law's Substantial Similarity (2022, background): “Using modern zero knowledge arguments, the resulting proofs, to be placed in the public record can be a few hundred kilobytes in size (e.g., using [40]).”
Poseidon: A New Hash Function for Zero-Knowledge Proof Systems (2021, methodology): “Groth16 [Gro16] is an optimization of the Pinocchio proof system and currently the fastest SNARK with the smallest proofs.”
Spartan: Efficient and general-purpose zkSNARKs without trusted setup (2020, methodology): “By building on the work of Ishai et al. [69], Groth [63], and Lipmaa [80], GGPR construct a zkSNARK for R1CS in which the prover’s running time is O ( n log n ) , the size of a proof is O ( 1 ) , and the verifier incurs O ( | io | ) computation to verify a proof, where n is the size of the statement”
Scalable, transparent, and post-quantum secure computational integrity (2018, background): “al [53] (see [64, 52, 81, 30, 62, 63] for related work and further improvements).”
Doubly-Efficient zkSNARKs Without Trusted Setup (2018, methodology): “Bootle et al. [24] give two ZK arguments for AC satisfiability from the hardness of discrete logarithms, building on the work of Groth [52] and of Bayer and Groth [6].”