Efficient inner product arguments with sublogarithmic proof and sub-square-root verifier
Uloženo v:
| Název: | Efficient inner product arguments with sublogarithmic proof and sub-square-root verifier |
|---|---|
| Autoři: | Zibo Zhou, Zongyang Zhang, Jianwei Liu, Haifeng Qian |
| Zdroj: | Cybersecurity, Vol 8, Iss 1, Pp 1-15 (2025) |
| Informace o vydavateli: | SpringerOpen, 2025. |
| Rok vydání: | 2025 |
| Sbírka: | LCC:Computer engineering. Computer hardware LCC:Electronic computers. Computer science |
| Témata: | Inner product arguments, Multi-exponentiation arguments, Vector commitments, Zero-knowledge proofs, Computer engineering. Computer hardware, TK7885-7895, Electronic computers. Computer science, QA75.5-76.95 |
| Popis: | 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. |
| Druh dokumentu: | article |
| Popis souboru: | electronic resource |
| Jazyk: | English |
| ISSN: | 2523-3246 |
| Relation: | https://doaj.org/toc/2523-3246 |
| DOI: | 10.1186/s42400-024-00304-x |
| Přístupová URL adresa: | https://doaj.org/article/7b774248a1ca4f6d8e36931ddea548b9 |
| Přístupové číslo: | edsdoj.7b774248a1ca4f6d8e36931ddea548b9 |
| Databáze: | Directory of Open Access Journals |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstrakt: | 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. |
|---|---|
| ISSN: | 25233246 |
| DOI: | 10.1186/s42400-024-00304-x |