Journal article · 2026 · Open access
How to Build Succinct Arguments From Succinct Commitments
Proceedings of the IEEE, 1–30 · Published 1 January 2026 · DOI 10.1109/jproc.2026.3716313
In brief
“How to Build Succinct Arguments From Succinct Commitments” is a 2026 journal article by Alessandro Chiesa and 3 co-authors, published in Proceedings of the IEEE. OpenAlex counts 0 citations as of 17 November 2026. It is open access under a CC BY-NC-ND licence: the full text is free to read at Infoscience (Ecole Polytechnique Fédérale de Lausanne).
- Citations
- 0
- Authors
- 4
Abstract
One of the celebrated achievements of modern cryptography is formulating and constructing a multitude of proof systems that, thanks to their surprising properties, act as invaluable tools in theoretical computer science and even beyond that. This article focuses on succinct arguments, a class of proof systems that has received much attention due to their notable efficiency properties, which have made them indispensable tools in secure distributed systems. Informally, in a succinct argument for an NP language, the communication complexity is much smaller than the number of bits in the witness. In this article, we provide an introduction to succinct arguments constructed from succinct commitments. This notable class includes elegant constructions that capture numerous concrete examples of succinct arguments that have both theoretical and practical applications. In particular, this class includes the most performant succinct arguments known, including ones proved to be postquantum secure. We structure ideas in progressive generality, starting from the well-known Kilian protocol, and also touch on other topics such as the Fiat–Shamir transformation.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Chiesa, A., Guan, Z., Knabenhans, C., & Yogev, E. (2026). How to Build Succinct Arguments From Succinct Commitments. Proceedings of the IEEE, 1–30. https://doi.org/10.1109/jproc.2026.3716313
MLA 9
Chiesa, Alessandro, et al. “How to Build Succinct Arguments From Succinct Commitments.” Proceedings of the IEEE, 2026, pp. 1–30. https://doi.org/10.1109/jproc.2026.3716313.
Chicago
Chiesa, Alessandro, Ziyi Guan, Christian Knabenhans, and Eylon Yogev. 2026. “How to Build Succinct Arguments From Succinct Commitments.” Proceedings of the IEEE: 1–30. https://doi.org/10.1109/jproc.2026.3716313.
Harvard
Chiesa, A. et al. (2026) ‘How to Build Succinct Arguments From Succinct Commitments’, Proceedings of the IEEE, pp. 1–30. doi:10.1109/jproc.2026.3716313.
IEEE
A. Chiesa, Z. Guan, C. Knabenhans, and E. Yogev, “How to Build Succinct Arguments From Succinct Commitments,” Proceedings of the IEEE, pp. 1–30, 2026, doi: 10.1109/jproc.2026.3716313.
BibTeX
@article{chiesa2026build,
title = {{How to Build Succinct Arguments From Succinct Commitments}},
author = {Chiesa, Alessandro and Guan, Ziyi and Knabenhans, Christian and Yogev, Eylon},
journal = {Proceedings of the IEEE},
year = {2026},
pages = {1--30},
doi = {10.1109/jproc.2026.3716313},
url = {https://doi.org/10.1109/jproc.2026.3716313}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- succinct proofs
- Fiat-Shamir transformation
- NP languages
- communication complexity
- zero-knowledge proofs
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Chiesa, A., Guan, Z., Knabenhans, C., & Yogev, E. (2026). How to Build Succinct Arguments From Succinct Commitments. Proceedings of the IEEE, 1–30. https://doi.org/10.1109/jproc.2026.3716313
How many times has this paper been cited?
0 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Infoscience (Ecole Polytechnique Fédérale de Lausanne): sign in and open the full text from this page.
Who wrote this paper?
Alessandro Chiesa, Ziyi Guan, Christian Knabenhans, Eylon Yogev.
What is the DOI of this paper?
10.1109/jproc.2026.3716313, permanently at https://doi.org/10.1109/jproc.2026.3716313. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.