5 Commits

Author	SHA1	Message	Date
Cole Leavitt	d8b4ed9c2d	feat(oprf): add revolutionary VOLE-LWR helper-less unlinkable OPRF ... Implements a novel post-quantum OPRF combining: - VOLE-based masking (prevents fingerprint attacks) - LWR finalization (no reconciliation helpers transmitted) - PCG pre-processing (amortized communication cost) - NTT-friendly q=65537 (WASM performance) Key fixes during implementation: - LWR parameters: p=16, β=1 ensures 2nβ²=512 < q/(2p)=2048 - Password element must be UNIFORM (not small) for LWR to work - Server subtracts v=u·Δ+noise, client just rounds (no addition) Performance: ~82µs full protocol (vs 60µs fast, 99µs unlinkable) Security: UC-unlinkable, helper-less, post-quantum (Ring-LWR) All 206 tests passing.	2026-01-07 12:59:20 -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	f022aeefd6	feat(oprf): add split-blinding unlinkable OPRF (partial unlinkability) ... - Implement split-blinding protocol with C, C_r dual evaluation - Add 7 security proof tests for unlinkability properties - Add benchmarks: ~101µs (109x faster than OT-based) - Note: Server can compute C - C_r fingerprint (documented limitation)	2026-01-07 12:29:15 -07:00
Cole Leavitt	acc8dde789	Fixed reconciliation bug - Peikert-style reconciliation now achieves 100% accuracy (was 50% with broken XOR)	2026-01-06 15:57:16 -07:00
Cole Leavitt	dfa968ec7d	initial	2026-01-06 12:49:26 -07:00