Proofs for inner pairing products and applications
From MaRDI portal
Publication:6157545
DOI10.1007/978-3-030-92078-4_3zbMATH Open1514.94052OpenAlexW3209623239MaRDI QIDQ6157545FDOQ6157545
Authors: Benedikt Bünz, Mary Maller, Pratyush Mishra, Nirvan Tyagi, Psi Vesely 
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
Recommendations
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- On the size of pairing-based non-interactive arguments
- SnarkPack: practical SNARK aggregation
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- Prover-efficient commit-and-prove zero-knowledge SNARKs
Cites Work
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Checking the correctness of memories
- Title not available (Why is that?)
- Structure-preserving signatures and commitments to group elements
- Efficient zero-knowledge arguments from two-tiered homomorphic commitments
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Updatable and universal common reference strings with applications to zk-SNARKs
- The algebraic group model and its applications
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Zero-knowledge argument for polynomial evaluation with application to blacklists
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Libra: succinct zero-knowledge proofs with optimal prover computation
- On the size of pairing-based non-interactive arguments
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- Scalable zero knowledge via cycles of elliptic curves
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Composable and modular anonymous credentials: definitions and practical constructions
- Constant-Size Commitments to Polynomials and Their Applications
- Transparent SNARKs from DARK compilers
- \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
- Tight proofs of space and replication
- Recursive proof composition from accumulation schemes
- Lightweight delegatable proofs of storage
- Asynchronous computational VSS with reduced communication complexity
Cited In (22)
- Efficient transparent polynomial commitments for zk-SNARKs
- SnarkPack: practical SNARK aggregation
- Private polynomial commitments and applications to MPC
- Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
- 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)
- \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- MyOPE: malicious security for oblivious polynomial evaluation
- Algebraic reductions of knowledge
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- Gemini: elastic SNARKs for diverse environments
- A holistic security analysis of Monero transactions
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- An optimized inner product argument with more application scenarios
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- How to prove statements obliviously?
- Mangrove: a scalable framework for folding-based SNARKs
- Polymath: Groth16 is not the limit
- Pairings in rank-1 constraint systems
This page was built for publication: Proofs for inner pairing products and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157545)
