Jberman / Kayaba / Koe have helped created a rough scope of initial work for the Seraphis papers which can be seen below.
- Read through the Seraphis papers (the paper describing the transaction protocol and its companion paper spec'ing its implementation)
- Link to Seraphis papers: https://github.com/UkoeHB/Seraphis/tree/master
- Establish a formal security model to prove Seraphis secure under.
- Section 1.2 in the Seraphis paper sketches a model but is light on details. Plausible path: rework section 1.2 such that it can be formalized in terms of algorithms and/or experiments.
- Formalize the respective algorithms in the instantiation of Seraphis and see if the Seraphis construction is amenable to proofs under the chosen security model.
- If the Seraphis construction is not amenable to a chosen security model, then it would still be useful to formalize security proofs for individual components of Seraphis (membership, ownership, unspentness, amounts balance).
- One researcher we've contacted suggested they would identify how to build an experiment based on the algorithms and suitable oracles in order to identify what a violation of membership or unspentness would look like.