Git-Mirrors/monero-ccs-proposals
1
0
Fork 0
mirror of https://repo.getmonero.org/monero-project/ccs-proposals.git synced 2024-12-24 06:59:23 -05:00
Code Issues Packages Projects Releases Wiki Activity

update bulletproofs++ peer review scope

Browse Source
This commit is contained in:
plowsoff 2023-12-30 21:39:00 +00:00 committed by luigi1111
parent 98e3fd31a0
commit b96518112e
1 changed files with 12 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
bulletproofs-pp-peer-review.md
View File

@ -19,17 +19,25 @@ This CCS will provide funding for the first step towards Bulletproofs++ implemen
## Scope / Deliverables
A full peer review of the eprint version [[link]](https://moneroresearch.info/index.php?action=resource_RESOURCEVIEW_CORE&id=83&browserTabID=) of the paper. Note that at the time of writing this proposal, the paper is not yet published in a peer-reviewed conference/journal.
A full peer review of the eprint version [[link]](https://eprint.iacr.org/archive/2022/510/20230717:163509) of the paper. Note that at the time of writing this proposal, the paper is not yet published in a peer-reviewed conference/journal.
The deliverable is a write-up which will include recommendations, notes, weaknesses, and issues (if any) of the BP++ paper touching on:
- The soundness, completeness, and zero knowledge portions of the paper.
- Efficiency. Aggregation. Batching. MPC compatibility.
- Efficiency* Aggregation. ~~Batching. MPC compatibility.~~
- Making sure it fits neatly and completely into the place that BP+ currently sits by checking the correctness of proofs.
## Out of scope
- Multiparty computation. There are no specific protocols presented for this, and no corresponding security model of proofs of security.
- Batch verification. While the preprint mentions that BP++ supports batch verification, it provides no details on the corresponding algebra.
- Multi-asset transactions. The preprint discusses multi-asset transactions in the context of its protocols, but these are not required for range proofs.
- Optimized binary range proofs. The protocol proposed for optimized binary range proofs has only an informal and vague security proof that is insufficient to assert the claims of the corresponding theorem.
## Funding
- $16,500 + 20% buffer = $19800 gives 130XMR @ 152.30USD
The latest version of the paper is now greatly expanded. CypherStack has given a new quote for this paper of $32,000. Core will decide how the shortfall is handled.
- Funds are released by Core to a third party and converted.
- $16,500 will be paid directly to [CypherStack](https://cypherstack.com/).
- $32,000 will be paid directly to [CypherStack](https://cypherstack.com/).
- Excess XMR after conversion will be donated to the next Bp++ CCS.
- Any shortfalls from volatility will be paid by the Monero General Fund.