@inproceedings{a0b450a678e748ceb2a2e7c57354d2fc,
title = "An Optimized Inner Product Argument with More Application Scenarios",
abstract = "The inner product argument is an effective tool to reduce communication complexity in many cryptographic protocols. Bootle et al. (EUROCRYPT{\textquoteright}16) presented an inner product argument with a statement including two vector commitments to two vectors and the inner product of the two vectors equals to a public scalar. B{\"u}nz et al. (S\&P{\textquoteright}18) then presented an inner product argument with a statement including only one vector commitment to two vectors. In this paper, we first summarize the scenarios to use inner product arguments based on Bootle et al. and B{\"u}nz et al. Then we propose and implement an improved inner product argument for the same statement as Bootle et al. Our argument has a lower communication complexity of 4 log 2n which improves by about 30\% when n= 8192. Moreover, as most existing inner product argument protocols have a recursive structure, we find the most appropriate recursive round that decides a better communication complexity.",
keywords = "Argument of knowledge, Inner product argument, Vector commitment",
author = "Zongyang Zhang and Zibo Zhou and Weihan Li and Hongyu Tao",
note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; 23rd International Conference on Information and Communications Security, ICICS 2021 ; Conference date: 19-11-2021 Through 21-11-2021",
year = "2021",
doi = "10.1007/978-3-030-88052-1\_20",
language = "英语",
isbn = "9783030880514",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "341--357",
editor = "Debin Gao and Qi Li and Xiaohong Guan and Xiaofeng Liao",
booktitle = "Information and Communications Security - 23rd International Conference, ICICS 2021, Proceedings",
address = "德国",
}