Paper 2026/284

Knowledge Soundness of Polynomial Commitments in the Algebraic Group Model Does Not Guarantee Extractability

Petr Chmel, Charles University
Pavel Hubáček, Institute of Mathematics, Czech Academy of Sciences, Charles University
Dominik Stejskal, Charles University
Abstract

The Algebraic Group Model (AGM) has become a standard framework for analyzing the knowledge soundness of group-based polynomial commitment schemes. In this work, we formally establish inherent limitations of this methodology. For many PCSs analyzed in the AGM, the algebraic explanation directly determines a polynomial and any required randomness that together reproduce the commitment. We call this structural property AGM-clarity. The extraction proof then only needs to show that the accepted evaluation agrees with this polynomial. For AGM-clear schemes, evaluation binding alone implies knowledge soundness in the AGM. If the commitment algorithm is itself algebraic, knowledge soundness in the AGM is in fact equivalent to weak evaluation binding, a relaxation of evaluation binding introduced by Catalano, Fiore, and Tucker (ASIACRYPT 2022). We then show that this guarantee implies neither standard-model extraction nor evaluation binding. Under the discrete-logarithm and SBDH assumptions, we give a succinct modification of the KZG polynomial commitment that is evaluation binding and, hence, knowledge-sound in the AGM. It admits a prover that is accepted on every evaluation point, yet no efficient extractor recovers an opening of its commitment, even given the prover's code and state. For a non-succinct variant, no polynomial consistent with the transcript exists at all, so extraction fails even for unbounded extractors. A minor modification of those PCSs destroys evaluation binding while leaving knowledge soundness in the AGM intact, so the AGM notion lies strictly below evaluation binding. Finally, we show that the common formulation, which also requires algebraic explanations of evaluation proofs, is strictly weaker than the variant characterized by weak evaluation binding. Our separating schemes satisfy even the stronger variant, so no property implied by either formulation guarantees extraction in the standard model.

Note: Replaced the WIKS/CIB formulation with a characterization by weak evaluation binding. Added explicit separations from standard-model extraction and evaluation binding and clarified when existing schemes satisfy AGM-clarity.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
Keywords
Polynomial Commitment SchemesExtractabilityKnowledge SoundnessEvaluation BindingAlgebraic Group ModelAGM
Contact author(s)
chmel @ iuuk mff cuni cz
hubacek @ math cas cz
History
2026-10-29: last of 2 revisions
2026-02-17: received
See all versions
Short URL
https://ia.cr/2026/284
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/284,
      author = {Petr Chmel and Pavel Hubáček and Dominik Stejskal},
      title = {Knowledge Soundness of Polynomial Commitments in the Algebraic Group Model Does Not Guarantee Extractability},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/284},
      year = {2026},
      url = {https://eprint.iacr.org/2026/284}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.