Efficient inner product arguments with sublogarithmic proof and sub-square-root verifier
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 subloga...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2025-07-01
|
| Series: | Cybersecurity |
| Subjects: | |
| Online Access: | https://doi.org/10.1186/s42400-024-00304-x |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849342242612838400 |
|---|---|
| author | Zibo Zhou Zongyang Zhang Jianwei Liu Haifeng Qian |
| author_facet | Zibo Zhou Zongyang Zhang Jianwei Liu Haifeng Qian |
| author_sort | Zibo Zhou |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-7b774248a1ca4f6d8e36931ddea548b9 |
| institution | Kabale University |
| issn | 2523-3246 |
| language | English |
| publishDate | 2025-07-01 |
| publisher | SpringerOpen |
| record_format | Article |
| series | Cybersecurity |
| spelling | doaj-art-7b774248a1ca4f6d8e36931ddea548b92025-08-20T03:43:27ZengSpringerOpenCybersecurity2523-32462025-07-018111510.1186/s42400-024-00304-xEfficient inner product arguments with sublogarithmic proof and sub-square-root verifierZibo Zhou0Zongyang Zhang1Jianwei Liu2Haifeng Qian3School of Cyber Science and Technology, Beihang UniversitySchool of Cyber Science and Technology, Beihang UniversitySchool of Cyber Science and Technology, Beihang UniversitySoftware Engineering Institute, East China Normal UniversityAbstract 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.https://doi.org/10.1186/s42400-024-00304-xInner product argumentsMulti-exponentiation argumentsVector commitmentsZero-knowledge proofs |
| spellingShingle | Zibo Zhou Zongyang Zhang Jianwei Liu Haifeng Qian Efficient inner product arguments with sublogarithmic proof and sub-square-root verifier Cybersecurity Inner product arguments Multi-exponentiation arguments Vector commitments Zero-knowledge proofs |
| title | Efficient inner product arguments with sublogarithmic proof and sub-square-root verifier |
| title_full | Efficient inner product arguments with sublogarithmic proof and sub-square-root verifier |
| title_fullStr | Efficient inner product arguments with sublogarithmic proof and sub-square-root verifier |
| title_full_unstemmed | Efficient inner product arguments with sublogarithmic proof and sub-square-root verifier |
| title_short | Efficient inner product arguments with sublogarithmic proof and sub-square-root verifier |
| title_sort | efficient inner product arguments with sublogarithmic proof and sub square root verifier |
| topic | Inner product arguments Multi-exponentiation arguments Vector commitments Zero-knowledge proofs |
| url | https://doi.org/10.1186/s42400-024-00304-x |
| work_keys_str_mv | AT zibozhou efficientinnerproductargumentswithsublogarithmicproofandsubsquarerootverifier AT zongyangzhang efficientinnerproductargumentswithsublogarithmicproofandsubsquarerootverifier AT jianweiliu efficientinnerproductargumentswithsublogarithmicproofandsubsquarerootverifier AT haifengqian efficientinnerproductargumentswithsublogarithmicproofandsubsquarerootverifier |