Zero-Knowledge Polynomial Commitment in Binary Fields
发表信息
作者
- Benjamin E Diamond
笔记
In recent work, Diamond and Posen (‘24) introduce a polynomial commitment scheme for large binary fields, adapting BaseFold (CRYPTO ‘24). In this note, we devise a zero-knowledge variant of Diamond and Posen’s scheme. Our construction reprises a few ideas from Aurora (EUROCRYPT ‘19). We carry through those ideas in characteristic 2, and moreover show that they’re compatible with BaseFold.
在近期研究中，Diamond与Posen（‘24）提出了一种适用于大二进制域（large binary fields）的多项式承诺方案（polynomial commitment scheme），该方案基于BaseFold（CRYPTO ‘24）改进而成。本文中，我们设计了一种Diamond与Posen方案的零知识（zero-knowledge）变体。我们的构造复用了Aurora（EUROCRYPT ‘19）中的若干思想，并在特征2（characteristic 2）的域上实现了这些思想，同时证明其与BaseFold的兼容性。
关键词提炼：
- 多项式承诺方案（polynomial commitment scheme）
- 零知识（zero-knowledge）
- 大二进制域（large binary fields）
- BaseFold