Updateable Inner Product Argument with Logarithmic Verifier and Applications

DOI10.1007/978-3-030-45374-9_18zbMath1501.94039OpenAlexW3021398893MaRDI QIDQ5041169

Alexandros Zacharakis, Vanesa Daza, Carla Ràfols

Publication date: 13 October 2022

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-45374-9_18

zbMATH Keywords

inner productzero knowledgeSNARKSrange proofsupdateable

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

An algebraic framework for universal and updatable SNARKs, Gemini: elastic SNARKs for diverse environments, An optimized inner product argument with more application scenarios, SnarkPack: practical SNARK aggregation, Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier, MyOPE: malicious security for oblivious polynomial evaluation, \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions, CRS-updatable asymmetric quasi-adaptive NIZK arguments, Linear-map vector commitments and their practical applications

Uses Software

• Pinocchio
• Ligero
• ZKBoo
• vSQL
• Marlin

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Updatable and universal common reference strings with applications to zk-SNARKs
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• A subversion-resistant SNARK
• Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
• Subversion-zero-knowledge SNARKs
• The algebraic group model and its applications
• Transparent SNARKs from DARK compilers
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Aurora: transparent succinct arguments for R1CS
• Scalable zero knowledge with no trusted setup
• Libra: succinct zero-knowledge proofs with optimal prover computation
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Square Span Programs with Applications to Succinct NIZK Arguments
• NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Interactive Oracle Proofs
• Succinct Non-interactive Arguments via Linear Interactive Proofs
• Quadratic Span Programs and Succinct NIZKs without PCPs
• On the Size of Pairing-Based Non-interactive Arguments
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting