We are pleased to announce that, within the framework of the NATO Science for Peace and Security (NATO-SPS) project, a new scientific publication has been released: “Extended Review of Polynomial Commitments”

Authors: Maksim Iavich, Tamari Kuchukhidze, and Razvan Bocu

Published in: Advanced Information Networking and Applications

Review: Polynomial Commitment Schemes (PCS) are fundamental cryptographic primitives that allow a prover to commit to a polynomial and later reveal evaluations with succinct and verifiable proofs. As modern cryptographic applications such as Verkle trees and zk-SNARKs continue to evolve, the transition from classical cryptographic constructions to post-quantum alternatives has become increasingly important.

This paper presents a comprehensive review of major polynomial commitment schemes, including pairing-based KZG commitments, transparent Bulletproofs, lattice-based constructions, and hash-based post-quantum approaches. The authors analyze the key trade-offs between efficiency and quantum resistance, highlighting the challenges associated with proof size, verification performance, and adaptive security in post-quantum settings.

The study also identifies important open research directions aimed at narrowing the performance gap between classical and quantum-resistant constructions, providing both a strategic roadmap and a valuable technical reference for future developments in post-quantum cryptography.

Publication link:

https://link.springer.com/…/10.1007/978-3-032-23341-7_14

Cite this paper

Iavich, M., Kuchukhidze, T., Bocu, R. (2026). Extended Review of Polynomial Commitments. In: Barolli, L., KG Seah, W., Woungang, I. (eds) Advanced Information Networking and Applications. AINA 2026. Lecture Notes on Data Engineering and Communications Technologies, vol 300. Springer, Cham. https://doi.org/10.1007/978-3-032-23341-7_14