Short Pairing-Based Non-interactive Zero-Knowledge Arguments

By Jens Groth. 2010

512 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems, Privacy & Security

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

1. Srinath T. V. Setty
2. Dan Boneh
3. Eli Ben-Sasson
4. Michael Walfish
5. Andrew Justin Blumberg
6. Justin Thaler
7. Eran Tromer
8. Alessandro Chiesa

In Information Systems

1. Srinath T. V. Setty
2. Dan Boneh
3. Eli Ben-Sasson
4. Eran Tromer
5. Craig Gentry
6. Michael Walfish
7. Helger Lipmaa
8. Iddo Bentov

In Privacy & Security

1. Srinath T. V. Setty
2. Michael Walfish
3. Andrew Justin Blumberg
4. Dan Boneh
5. Eli Ben-Sasson
6. Eran Tromer
7. Helger Lipmaa
8. Justin Thaler

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].”
• Geppetto: Versatile Verifiable Computation (2015, background): “Prior work on verifying computation focused on narrow classes of computation [32, 51], relied on physical-security assumptions [41, 47], assumed uncorrelated failures [19, 20], or achieved good asymptotics [2, 28, 30, 31, 33, 38, 44] but impractical concrete performance [46, 50].”
• Doubly-Efficient zkSNARKs Without Trusted Setup (2018, background): “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].”
• Scalable, transparent, and post-quantum secure computational integrity (2018, methodology): “[69] (for the “designated verifier” case) and Groth [60] (for the “publicly verifiable” case), uses an efficient information-theoretic model called a “linear PCP” that is then “compiled” into a cryptographic system using hPKC.”
• Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract (2013, background): “Reducing from BHRAM to sCSAT benefits many zero-knowledge argument systems, including [52, 51, 1, 48, 50, 49, 66, 35, 15].”
• SoK: Consensus in the Age of Blockchains (2017, background): “ing privacy also have implications for scalability. The most established exemplar of this family is Zcash [26], where a transaction contains a succinct non-interactive zero-knowledge proof (zk-SNARK) [74], proving that it is spending an existing unspent coin, but without publicly specifying which on”
• On the Size of Pairing-Based Non-interactive Arguments (2016, methodology): “Groth [Gro10] combined these techniques with ideas from interactive zero-knowledge arguments [Gro09] to give the first constant size NIZK arguments.”
• 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”
• Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes (2013, background): “In [16], the CRS length is Θ(s(2)), and in [19], it is Θ(r−1 3 (s)) = o(s2 2 √ 2 log2 ), where r3(N) = Ω(N log N/2(2) √ 2 log2N ) [9] is the cardinality of the largest progression-free subset of [N ].”