On the Security of KZG Commitment for VSS
Atsuki Momose, Sourav Das, Ling Ren
2023Year
3Citations
Abstract
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.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get d33c1dbc-9f3c-4cbb-bd0c-b265548ec80dRelated papers
- Polynomial Commitment with a One-to-Many Prover and ApplicationsJiaheng Zhang, Tiancheng Xie, Thang Hoang, Elaine Shi et al.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 et al.NDSS 2022
- On Extractability of the KZG Family of Polynomial Commitment SchemesJuraj Belohorec, Pavel Dvorák, Charlotte Hoffmann, Pavel Hubácek et al.CRYPTO 2025 · 3 citations
