On the Security of KZG Commitment for VSS
Atsuki Momose, Sourav Das, Ling Ren
2023年份
3被引次数
摘要
The constant-sized polynomial commitment scheme by Kate, Zaverucha, and Goldberg (Asiscrypt 2010), also known as the KZG commitment, is an essential component in designing bandwidth-efficient verifiable secret-sharing (VSS) protocols. We point out, however, that the KZG commitment is missing two important properties that are crucial for VSS protocols.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper，每个回答都会注明依据哪几篇。
相关 Paper
- Polynomial Commitment with a One-to-Many Prover and ApplicationsJiaheng Zhang, Tiancheng Xie, Thang Hoang, Elaine Shi 等USENIX Security 2022
- Revisiting Keyed-Verification Anonymous CredentialsMichele OrrùCCS 2025
- HydraProofs: Optimally Computing All Proofs in a Vector Commitment (With Applications to Efficient zkSNARKs Over Data from Multiple Users)Christodoulos Pappas, Dimitrios Papadopoulos, Charalampos PapamanthouS&P 2025
- hbACSS: How to Robustly Share Many SecretsThomas Yurek, Licheng Luo, Jaiden Fairoze, Aniket Kate 等NDSS 2022
- On Extractability of the KZG Family of Polynomial Commitment SchemesJuraj Belohorec, Pavel Dvorák, Charlotte Hoffmann, Pavel Hubácek 等CRYPTO 2025 · 被引用 3 次
