On the Size of Pairing-Based Non-interactive Arguments¶
Groth, J. (2016). On the Size of Pairing-Based Non-interactive Arguments. Advances in Cryptology — EUROCRYPT 2016.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Succinct Cryptographic Proof Verifier
- Succinctness and soundness rest on cryptographic assumptions and correct setup; a broken assumption, a buggy circuit, or a compromised trusted setup lets false proofs verify, and the check still "passes."
This sourceGroth's succinct verifier relies on pairing-based security assumptions and a setup-generated reference string; soundness excludes an adversary's access to the setup trapdoor.
- Succinctness and soundness rest on cryptographic assumptions and correct setup; a broken assumption, a buggy circuit, or a compromised trusted setup lets false proofs verify, and the check still "passes."
- Succinct Zero-Knowledge Proof System
- The proof is small, the verification is cheap, and the private inputs stay private.
This sourceConstructs a zero-knowledge preprocessing SNARK with a three-group-element proof and verification by one pairing-product equation using three pairings.
- The proof is small, the verification is cheap, and the private inputs stay private.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.
Was it audited? Yes. A second, independent pass read the citation against the article text and recorded a verdict.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:5200180c85e5 · see in the full table