![]() |
MoneroResearch.info |
|
Hall-Andersen, M. (2026). Formalization of Eagen's ECIP Proof. [Lean proof]. zkSecurity. Added by: Rucknium (18/11/2026, 15:43) |
| Resource type: Software BibTeX citation key: HallAndersen2026 View all bibliographic details |
Categories: Monero-focused Keywords: FCMP Creators: Hall-Andersen Publisher: zkSecurity |
Views: 3/3
|
| Attachments | URLs https://github.com ... isor-formalization |
| Abstract |
|
This repository formalizes the divisor techniques behind the Eagen/Bassa/Parker protocols in Lean 4. The primary references are Liam Eagen's Zero Knowledge Proofs of Elliptic Curve Inner Products from Principal Divisors and Weil Reciprocity, IACR ePrint 2022/596, and Mathias Hall-Andersen and Diego F. Aranha's Notes and Proofs for Divisor Techniques. The Lean proof differs slightly from the notes; in particular, ma_soundness uses explicit point-count hypotheses and does not rely on Hasse's theorem.
ma_soundness and ma_completeness are kernel-checked in Lean 4 using only Lean's standard classical foundation: propext, Classical.choice, and Quot.sound. The headline result is a soundness theorem for the discrete-log protocol: Fix an elliptic curve E, a public statement stmt, and any prover message msg : MAProverMsg E.q stmt.k. If the statement is well formed, the explicit counting hypotheses hold, and the verifier accepts msg with probability greater than the knowledge error, then maExtractor E stmt msg returns a witness which is valid for stmt. The word any matters. msg does not have to come from the honest prover; it does not have to come from a witness at all. Soundness is precisely the claim that a malicious message cannot be accepted too often unless the fixed recovery function turns it into a valid witness. Added by: Rucknium |