Paper 2024/616

$\mathsf{Cougar}$: Cubic Root Verifier Inner Product Argument under Discrete Logarithm Assumption

Abstract

An inner product argument (IPA) is a cryptographic primitive used to construct a zero-knowledge proof system, which is a notable privacy-enhancing technology. We propose a novel efficient IPA called $$. $$ features cubic root verifier and logarithmic communication under the discrete logarithm (DL) assumption. At Asiacrypt2022, Kim et al. proposed two square root verifier IPAs under the DL assumption. Our main objective is to overcome the limitation of square root complexity in the DL setting. To achieve this, we combine two distinct square root IPAs from Kim et al.: one with pairing ($$; one was later named $$) and one without pairing ($$). To construct $$, we first revisit $$ and reconstruct it to make it compatible with the proof system for the homomorphic commitment scheme. Next, we utilize $$ as the proof system for the reconstructed $$. Finally, to facilitate proving the relation between elliptic curve points appearing in $$, we introduce a novel $$-based proof system equipped with custom gates for mixed elliptic curve addition. We show that $$ indeed satisfies all the claimed features, along with providing a soundness proof under the DL assumption. In addition, we implemented $$ in Rust, demonstrating that the verification time of $$ increases much slowly as the length of the witness $$ grows, compared to other IPAs under the DL assumption and transparatent setup: BulletProofs and $$. Concretely, $$ takes 0.346s for verification in our setting when $$, which is a $$ speed-up from BulletProofs.

Note: Revise Abstract, Add constraint systems and implementation results