3 Commits

Author	SHA1	Message	Date
Cole Leavitt	50953c7007	docs: add formal security proof for VOLE-LWR OPRF ... Typst document covering: - Protocol description and notation - Ring-LWR and VOLE correlation definitions - Unlinkability theorem with proof - Obliviousness theorem with game-based proof - Output determinism theorem (LWR absorbs noise) - Security reductions to Ring-LWR and PCG - Parameter analysis and security estimates - Comparison with prior art (split-blinding, LEAP) - Constant-time implementation notes	2026-01-07 14:02:11 -07:00
Cole Leavitt	8d58a39c3b	feat(oprf): add LEAP-style truly unlinkable OPRF with commit-challenge protocol ... - Implement commit-challenge protocol to prevent fingerprint attack - Use Learning With Rounding (LWR) instead of reconciliation helpers - Add mathematical analysis document (docs/LEAP_ANALYSIS.md) - 8 new tests, 197 total tests passing - Benchmark: ~108µs (102x faster than OT-based, truly unlinkable) The key insight: client commits to r BEFORE server sends challenge ρ, so server cannot predict H(r||ρ) to extract A·s+e fingerprint.	2026-01-07 12:36:44 -07:00
Cole Leavitt	9be4bcaf7d	initial	2026-01-07 11:40:09 -07:00