Paper 2024/616

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

Hyeonbum Lee, Hanyang University
Seunghun Paik, Hanyang University
Hyunjung Son, Hanyang University
Jae Hong Seo, Hanyang University
Abstract

An inner product argument (IPA) is a cryptographic primitive used to construct a zero-knowledge proof (ZKP) system, which is a notable privacy-enhancing technology. We propose a novel efficient IPA called $\mathsf{Cougar}$. $\mathsf{Cougar}$ 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 ($\mathsf{Protocol3}$) and one without pairing ($\mathsf{Protocol4}$). To construct $\mathsf{Cougar}$, we first revisit $\mathsf{Protocol4}$ and reconstruct it to make it compatible with the proof system for the homomorphic commitment scheme. Next, we utilize $\mathsf{Protocol3}$ as the proof system for the reconstructed $\mathsf{Protocol4}$. Furthermore, we provide a soundness proof for $\mathsf{Cougar}$ in the DL assumption.

Note: Full version of a ESORICS'24 submission

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
inner product arugmentzero knowledge proofproof systemtransparent setup
Contact author(s)
leehb3706 @ hanyang ac kr
whitesoonguh @ hanyang ac kr
dk9050rx @ hanyang ac kr
jaehongseo @ hanyang ac kr
History
2024-04-26: approved
2024-04-22: received
See all versions
Short URL
https://ia.cr/2024/616
License
Creative Commons Attribution-NonCommercial
CC BY-NC

BibTeX

@misc{cryptoeprint:2024/616,
      author = {Hyeonbum Lee and Seunghun Paik and Hyunjung Son and Jae Hong Seo},
      title = {$\mathsf{Cougar}$: Cubic Root Verifier Inner Product Argument under Discrete Logarithm Assumption},
      howpublished = {Cryptology ePrint Archive, Paper 2024/616},
      year = {2024},
      note = {\url{https://eprint.iacr.org/2024/616}},
      url = {https://eprint.iacr.org/2024/616}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.