Spartan: efficient and general-purpose zkSNARKs without trusted setup
type: Item
instance of: scholarly article
title: Spartan: efficient and general-purpose zkSNARKs without trusted setup
zbMATH Open document ID: 1504.94185
DOI: 10.1007/978-3-030-56877-1_25
author: Srinath Setty
publication date: 2022-12-07T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7627839
zbMATH Keywords: zero-knowledge succinct non-interactive arguments of knowledge
zbMATH Keywords: Spartan's prover
cites work: Pinocchio
cites work: Proof verification and the hardness of approximation problems
cites work: Probabilistic checking of proofs
cites work: Addendum to: Non-deterministic exponential time has two-prower interactive protocols
cites work: Q5750398
cites work: Scalable zero knowledge with no trusted setup
cites work: Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
cites work: On the concrete efficiency of probabilistically-checkable proofs
cites work: SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
cites work: Aurora: transparent succinct arguments for R1CS
cites work: Interactive Oracle Proofs
cites work: Scalable Zero Knowledge via Cycles of Elliptic Curves
cites work: Simple PCPs with poly-log rate and query complexity
cites work: Short PCPs with Polylog Query Complexity
cites work: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
cites work: Succinct Non-interactive Arguments via Linear Interactive Proofs
cites work: Checking the correctness of memories
cites work: Zero-knowledge proofs on secret-shared data via fully linear PCPs
cites work: Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
cites work: Minimum disclosure proofs of knowledge
cites work: Transparent SNARKs from DARK compilers
cites work: \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
cites work: Advances in Cryptology - ASIACRYPT 2003
cites work: Practical verified computation with streaming interactive proofs
cites work: Q4249348
cites work: The PCP theorem by gap amplification
cites work: How Efficient Can Memory Checking Be?
cites work: Interactive proofs and the hardness of approximating cliques
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Quadratic Span Programs and Succinct NIZKs without PCPs
cites work: Separating succinct non-interactive arguments from all falsifiable assumptions
cites work: Q3549691
cites work: Short Pairing-Based Non-interactive Zero-Knowledge Arguments
cites work: On the Size of Pairing-Based Non-interactive Arguments
cites work: Updatable and universal common reference strings with applications to zk-SNARKs
cites work: Decaf: Eliminating Cofactors Through Point Compression
cites work: Q4526964
cites work: Q3549593
cites work: Constant-Size Commitments to Polynomials and Their Applications
cites work: Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
cites work: Algebraic methods for interactive proof systems
cites work: Signatures of Correct Computation
cites work: Constant-round interactive proofs for delegating computation
cites work: Time-Optimal Interactive Proofs for Circuit Evaluation
cites work: Libra: succinct zero-knowledge proofs with optimal prover computation
describes a project that uses: Pinocchio
describes a project that uses: LegoSNARK
describes a project that uses: xJsnark
describes a project that uses: vSQL
describes a project that uses: dalek
describes a project that uses: Geppetto
describes a project that uses: libsnark
describes a project that uses: libiop
describes a project that uses: vRAM
describes a project that uses: Ligero
MaRDI profile type: Publication
full work available at URL: 978-3-030-56877-1 25
OpenAlex ID: W2954625838
description: scientific article; zbMATH DE number 7627839