KZG10, IPA, FRI, and DARKS: Analysis Of Polynomial Commitment Schemesby@sin7y
2,789 reads

KZG10, IPA, FRI, and DARKS: Analysis Of Polynomial Commitment Schemes

tldt arrow
Read on Terminal Reader🖨️
JS🚫

Too Long; Didn't Read

Polynomial Commitment (PC) is a commitment to a certain polynomial P, and the committer can prove that the value at a certain point z satisfies P(z) = a through a proof. Different PC schemes result in different ZKP algorithms with different properties, efficiency, and security. This article will compare the differences between the above PC schemes from different perspectives. Table 1 shows the computation forms of common PCs. Table 2 lists the advantages and disadvantages of each PC schemes. Table 3 shows the performance indicators corresponding to each PC.

Company Mentioned

Mention Thumbnail
featured image - KZG10, IPA, FRI, and DARKS: Analysis Of Polynomial Commitment Schemes
Sin7Y HackerNoon profile picture

@sin7y

Sin7Y

react to story with heart

RELATED STORIES

L O A D I N G
. . . comments & more!
Hackernoon hq - po box 2206, edwards, colorado 81632, usa