An optimized inner product argument with more application scenarios

DOI10.1007/978-3-030-88052-1_20zbMath1500.94062OpenAlexW3199911917MaRDI QIDQ2673065

Zibo Zhou, Weihan Li, Hongyu Tao, Zong-yang Zhang

Publication date: 8 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-88052-1_20

zbMATH Keywords

argument of knowledgevector commitmentinner product argument

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Communication theory (94A05) Communication complexity, information complexity (68Q11)

Cites Work

• Parallel coin-tossing and constant-round secure two-party computation
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• Recursive proof composition from accumulation schemes
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Updateable Inner Product Argument with Logarithmic Verifier and Applications
• Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
• 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: An optimized inner product argument with more application scenarios