Proofs for inner pairing products and applications
From MaRDI portal
Publication:6157545
DOI10.1007/978-3-030-92078-4_3zbMath1514.94052OpenAlexW3209623239MaRDI QIDQ6157545
Psi Vesely, Benedikt Bünz, Nirvan Tyagi, Pratyush Mishra, Mary Maller
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92078-4_3
Related Items (10)
Gemini: elastic SNARKs for diverse environments ⋮ SnarkPack: practical SNARK aggregation ⋮ Private polynomial commitments and applications to MPC ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ MyOPE: malicious security for oblivious polynomial evaluation ⋮ Nova: recursive zero-knowledge arguments from folding schemes ⋮ Linear-map vector commitments and their practical applications ⋮ Lattice-based succinct arguments from vanishing polynomials (extended abstract) ⋮ Algebraic reductions of knowledge
Cites Work
- Unnamed Item
- Structure-preserving signatures and commitments to group elements
- Updatable and universal common reference strings with applications to zk-SNARKs
- Checking the correctness of memories
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- The algebraic group model and its applications
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Recursive proof composition from accumulation schemes
- Lightweight delegatable proofs of storage
- Tight proofs of space and replication
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Composable and Modular Anonymous Credentials: Definitions and Practical Constructions
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Constant-Size Commitments to Polynomials and Their Applications
- Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
- Asynchronous Computational VSS with Reduced Communication Complexity
- Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
This page was built for publication: Proofs for inner pairing products and applications
