Paper 2025/2258 Original: eprint.iacr.org/2025/2258 ↗
On the Equivalence of Polynomial Commitments for an Identical Polynomial under Different Bases
Abstract
We propose a Pairing-based Polynomial Consistency Protocol (PPCP) that verifies the equivalence of polynomial commitments generated under different basis representations, such as the coefficient and Lagrange bases. By leveraging pairing relations, PPCP proves that two commitments correspond to an identical underlying polynomial vector without revealing the polynomial itself. This enables efficient proof aggregation and recursive composition across heterogeneous SNARK systems that adopt distinct polynomial encodings.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2025-12-16: last updated
- 2025-12-16: published
- Short URL
- https://ia.cr/2025/2258
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2025/2258,
author = {Dengji Ma and Jingyu Ke and Sinka Gao and Guoqiang Li},
title = {On the Equivalence of Polynomial Commitments for an Identical Polynomial under Different Bases},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/2258},
year = {2025},
url = {https://eprint.iacr.org/2025/2258}
}