Scholarlink

<p>Inner product arguments are core building blocks of numerous cryptographic primitives and therefore minimizing their complexity is a central goal in this research area. In this paper, we follow the work of Kim et al. (ASIACRYPT’22) and propose the first inner product argument having sublogarithmic communication complexity and sub-square-root verifier complexity simultaneously. We first devise a new subvector combination method for recursion and utilize an aggregated multi-exponentiation argument to prove some committed group elements are valid. We then modify the commitment keys in inner product arguments to be structured and reduce the verifier complexity by delegating the costly computations to the prover. Compared with the state-of-the-art inner product arguments, our protocol is highly competitive in terms of asymptotic complexity.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Efficient inner product arguments with sublogarithmic proof and sub-square-root verifier

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年7月9日

查看全文
  • Zibo Zhou,
  • Zongyang Zhang,
  • Jianwei Liu,
  • Haifeng Qian

摘要

Inner product arguments are core building blocks of numerous cryptographic primitives and therefore minimizing their complexity is a central goal in this research area. In this paper, we follow the work of Kim et al. (ASIACRYPT’22) and propose the first inner product argument having sublogarithmic communication complexity and sub-square-root verifier complexity simultaneously. We first devise a new subvector combination method for recursion and utilize an aggregated multi-exponentiation argument to prove some committed group elements are valid. We then modify the commitment keys in inner product arguments to be structured and reduce the verifier complexity by delegating the costly computations to the prover. Compared with the state-of-the-art inner product arguments, our protocol is highly competitive in terms of asymptotic complexity.