Cryptology ePrint Archive: Report 2020/1333

Updateable Inner Product Argument with Logarithmic Verifier and Applications

Vanesa Daza and Carla Ràfols and Alexandros Zacharakis

Abstract: We propose an improvement for the inner product argument of Bootle et al. (EUROCRYPT’16). The new argument replaces the unstructured common reference string (the commitment key) by a structured one. We give two instantiations of this argument, for two different distributions of the CRS. In the designated verifier setting, this structure can be used to reduce verification from linear to logarithmic in the circuit size. The argument can be compiled to the publicly verifiable setting in asymmetric bilinear groups. The new common reference string can easily be updateable. The argument can be directly used to improve verification of Bulletproofs range proofs (IEEE SP’18). On the other hand, to use the improved argument to prove circuit satisfiability with logarithmic verification, we adapt recent techniques from Sonic (ACM CCS’19) to work with the new common reference string. The resulting argument is secure under standard assumptions (in the Random Oracle Model), in contrast with Sonic and recent works that improve its efficiency (Plonk, Marlin, AuroraLight), which, apart from the Random Oracle Model, need either the Algebraic Group Model or Knowledge Type assumptions.

Category / Keywords: cryptographic protocols / Zero Knowledge, Inner Product, SNARKS, Range Proofs, Updateable

Original Publication (in the same form): IACR-PKC-2020

Date: received 23 Oct 2020

Contact author: vanesa daza at upf edu, carla rafols@upf edu, alexandros zacharakis@upf edu

Available format(s): PDF | BibTeX Citation

Version: 20201026:092231 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]