![]() |
MoneroResearch.info |
|
Goodell, B. (2026). Generalized Bulletproofs for Opening Vector Commitments. Unpublished manuscript. Added by: Rucknium (18/11/2026, 15:11) Last edited by: Rucknium (18/11/2026, 15:12) |
| Resource type: Manuscript BibTeX citation key: Goodell2026 View all bibliographic details |
Categories: Monero-focused Keywords: FCMP Creators: Goodell Collection: Cypher Stack |
Views: 3/4
|
|
Attachments
generalized_bulletproofs_fix.pdf |
URLs https://github.com ... lletproofs_fix.pdf |
| Abstract |
|
This report reviews changes made to the Generalized Bulletproofs construction and corresponding security proofs, and is a continuation of the previous work in \cite{aaron} by a different author.
We describe a generalization of Bulletproofs which supports proving the openings of some Pedersen scalar commitments and Pedersen vector commitments \cite{pedersen1991non} satisfy an arithmetic circuit, and prove our generalization secure. The original Bulletproofs protocol in \cite{bp} supports only Pedersen scalar commitments. In \cite{curvetrees}, a generalization of Bulletproofs supporting vector commitments was first described; see also \cite{repo}. A problem with the extractor was identified and a proposed fix was presented in \cite{aaron}, but that proposal had problems with the security proofs. In fact, the correction was such that a verifier could not even be convinced an arithmetic circuit is satisfied without external verification.
Added by: Rucknium Last edited by: Rucknium |