Efficient inner product arguments with sublogarithmic proof and sub-square-root verifier
Authors:
Open Access
- 9 July 2025
- journal article
- research article
- Published by Springer Nature in Cybersecurity
- Vol. 8 (1) , 1-15
Abstract
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.Keywords
Funding Information
- Beijing Natural Science Foundation (L222050)
- National Natural Science Foundation of China (62372020, 72031001)
- Innovation Program of Shanghai Municipal Education Commission (2021-01-07-00-08-E00101)
- “Digital Silk Road” Shanghai International Joint Lab of Trustworthy Intelligent Software (22510750100)
This publication has 25 references indexed in Scilit:
- Leopard: Sublinear Verifier Inner Product Argument Under Discrete Logarithm AssumptionIEEE Transactions on Information Forensics and Security, 2023
- Efficient inner product arguments and their applications in range proofsIET Information Security, 2023
- Bulletproofs+: Shorter Proofs for a Privacy-Enhanced Distributed LedgerIEEE Access, 2022
- Compressed $\varSigma $-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics2020
- Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof2020
- Bulletproofs: Short Proofs for Confidential Transactions and More2018
- Doubly-Efficient zkSNARKs Without Trusted Setup2018
- Structure-Preserving Signatures and Commitments to Group ElementsJournal of Cryptology, 2015
- Short Signatures Without Random Oracles and the SDH Assumption in Bilinear GroupsJournal of Cryptology, 2007
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing2001