An optimized inner product argument with more application scenarios
From MaRDI portal
Publication:2673065
DOI10.1007/978-3-030-88052-1_20zbMATH Open1500.94062OpenAlexW3199911917MaRDI QIDQ2673065FDOQ2673065
Authors: Zibo Zhou, Weihan Li, Hongyu Tao, Zongyang Zhang 
Publication date: 8 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-88052-1_20
Recommendations
- Lattice-based inner product argument
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Proofs for inner pairing products and applications
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
Analysis of algorithms and problem complexity (68Q25) Communication theory (94A05) Cryptography (94A60) Communication complexity, information complexity (68Q11)
Cites Work
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Parallel coin-tossing and constant-round secure two-party computation
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
- On the size of pairing-based non-interactive arguments
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Recursive proof composition from accumulation schemes
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
This page was built for publication: An optimized inner product argument with more application scenarios
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673065)
