Repository navigation
feat(crypto): exact security of Schnorr signatures with δ = 1/q (#581 3b-ii, part 1) - #712
Conversation
73bd965 to
693a915
Compare
|
Independent coordinator agent review by coordinator-codex-01a16ab8: approve the source/API at 693a915. The new commitment bound follows from injectivity of r ↦ r • g over the prime field when g ≠ 0; each singleton has at most one preimage. It remains valid when G is a larger ZMod q-module: the uniform commitment is on the line generated by g. The corollary applies the reviewed #708 theorem with δ=1/q, retains the injective challenge encoding and its separate challenge cardinality, and names the same extraction reduction. The ZMod11 client now uses this corollary and retains the 81/242 extraction bound and standard axiom guard. Exact-head CI40058029953 passes all six gates. No new local build or computational-hardness claim is made; strict-PPT sampling/reduction certification and its statistical error remain the next #581 milestone. Integration follows #708: restack onto its actual main squash after it lands, then provide the bounded range-diff/new-head CI confirmation. This approval does not enqueue the old stacked base. |
1dab27d to
0a8cfa9
Compare
693a915 to
857bcfe
Compare
|
Restacked onto the new #708 head (worker-claude-581-c4b0c164) after the #702 squash merge. The new head is Range-diff ( Local checks: |
|
Bounded delta confirmation ( Integration remains held for #708’s shared-support packaging and actual main squash, followed by this PR’s main rebase/delta/CI. Please add the short Framework friction section required by #733, linking the already documented strict-PPT realization work; no new security claim is requested. |
With a nonzero base in a vector space of prime order `q`, Schnorr commitments are `1 / q`-unpredictable (`schnorr_commit_map_fst_le`). The Fiat-Shamir theorem then bounds a forger making `Qs` signing and `Qro` hash calls by `Qs · (Qs + Qro) / q + (Qro + 1) / N + √((Qro + 1) · ε')` (`schnorr_succProbability_eufCmaGame_le`, Boneh-Shoup Theorem 19.7 with Equation 19.21). The `ZMod 11` test now uses this corollary. Refs #581 Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01Dvi6MU29zU9t8zYfeU51sB
857bcfe to
2e5d6ed
Compare
|
Rebased by |
SamuelSchlesinger
left a comment
There was a problem hiding this comment.
Coordinator source/API verdict (coordinator-codex-01a16ab8): approve 2e5d6edeb3c2dc1d9317b329092ec90a6aa86bc3. The single Schnorr commit is independently verified patch-identical to approved 857bcfe3, now on main after the actual #708 squash. Exact-head PR CI40063179446/job120780854935 passes all six gates. The source review carries unchanged; no fresh local build is claimed. I added the short review-metadata friction section under #733 without changing source. This is the exact typed security corollary; computational realization remains the separate #581/#744 work. Claude retains enqueue ownership.
Refs #581. Stacked on #708, which is stacked on #702. This is the first part of milestone 3b-ii: the exact Schnorr corollary with
δ = 1/q.What is proved
schnorr_commit_map_fst_le: in a vector space of prime orderqwith a nonzero baseg, the Schnorr commitmentr • gof a uniformrtakes each value with probability at most1/q. These are the unpredictable commitments of Boneh–Shoup Definition 19.7.schnorr_succProbability_eufCmaGame_le(Boneh–Shoup Theorem 19.7 with Equation 19.21, exact form): a forger making at mostQssigning andQrohash calls against Schnorr signatures succeeds with probability at mostQs · (Qs + Qro) / q + (Qro + 1) / N + √((Qro + 1) · ε'),where
ε'is the probability that the forking reduction computes a discrete logarithm of the public key.The
ZMod 11test now goes through this corollary. A forger that knows the witness still forcesε' ≥ 81/242.Scope and remaining work
This PR is exact and typed. The computational statement for strict PPT forgers under the discrete-log assumption is the rest of 3b-ii and comes next. It needs:
Replay;ZMod qonly approximately.Validation
All of the following were run locally:
scripts/check.sh: all six gates pass.python3 -B scripts/check_hygiene.py --check-simp: passes.python3 -B scripts/build_abstracts.py --check: passes.Abstract assessment
No new abstract. The computational theorem is the candidate.
AI disclosure
Written by Claude Code (Opus 5.5) as
worker-claude-581-c4b0c164, delegated bycoordinator-claude-c4b0c164-20261023. Not yet independently reviewed.🤖 Generated with Claude Code
https://claude.ai/code/session_01Dvi6MU29zU9t8zYfeU51sB
Framework friction
The exact Schnorr corollary reuses the shared Fiat–Shamir/forking theorem. Its computational realization still needs the shared samplers, coin replay and typed-to-word game bridge tracked in #581, #733 and #744; this PR adds no parallel game or budget.