All proofs
Project-declaredLean 4.32.0 · mathlib@81a5d257

Cma H3Expected Loss le query Bounds

FiatShamir.Stateful.cmaH3ExpectedLoss_le_queryBounds

Plain-language statement

Expected H3 loss from direct signing and hash query bounds. If the adversary makes at most qS signing queries and at most qH random oracle queries, the accumulated state-dependent signing slack is bounded by the standard qS * ζ + qS * (qS + qH) * β expression.

Exact Lean statement

theorem cmaH3ExpectedLoss_le_queryBounds
    (σ : SigmaProtocol Stmt Wit Commit PrvState Chal Resp rel)
    (hr : GenerableRelation Stmt Wit rel)
    (ζ_zk β : ℝ≥0∞)
    {α : Type}
    (A : OracleComp (cmaSpec M Commit Chal Resp Stmt) α)
    {qS qH : ℕ}
    (h_qS : OracleComp.IsQueryBoundP A
      (cmaH3Costly (M := M) (Commit := Commit) (Chal := Chal)
        (Resp := Resp) (Stmt := Stmt)) qS)
    (h_qH : OracleComp.IsQueryBoundP A
      (IsHashQuery (M := M) (Commit := Commit) (Chal := Chal)
        (Resp := Resp) (Stmt := Stmt)) qH) :
    cmaH3ExpectedLoss M Commit Chal σ hr ζ_zk β A qS ≤
      (qS : ℝ≥0∞) * ζ_zk + (qS : ℝ≥0∞) * ((qS : ℝ≥0∞) + qH) * β

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem cmaH3ExpectedLoss_le_queryBounds    (σ : SigmaProtocol Stmt Wit Commit PrvState Chal Resp rel)    (hr : GenerableRelation Stmt Wit rel)    (ζ_zk β : 0∞)    {α : Type}    (A : OracleComp (cmaSpec M Commit Chal Resp Stmt) α)    {qS qH : }    (h_qS : OracleComp.IsQueryBoundP A      (cmaH3Costly (M := M) (Commit := Commit) (Chal := Chal)        (Resp := Resp) (Stmt := Stmt)) qS)    (h_qH : OracleComp.IsQueryBoundP A      (IsHashQuery (M := M) (Commit := Commit) (Chal := Chal)        (Resp := Resp) (Stmt := Stmt)) qH) :    cmaH3ExpectedLoss M Commit Chal σ hr ζ_zk β A qS       (qS : 0∞) * ζ_zk + (qS : 0∞) * ((qS : 0∞) + qH) * β := by  change expectedQuerySlack (cmaReal M Commit Chal σ hr)    (cmaH3Costly (M := M) (Commit := Commit) (Chal := Chal)      (Resp := Resp) (Stmt := Stmt))    (fun s : CmaData M Commit Chal Stmt Wit  ζ_zk + QueryCache.enncard s.2.1 * β)    A qS (cmaDataInit M Commit Chal Stmt Wit, false)  _  simpa [cmaDataInit, add_assoc] using    expectedQuerySlack_resource_le      (impl := cmaReal M Commit Chal σ hr)      (chargedQuery := cmaH3Costly (M := M) (Commit := Commit) (Chal := Chal)        (Resp := Resp) (Stmt := Stmt))      (growthQuery := IsHashQuery (M := M) (Commit := Commit) (Chal := Chal)        (Resp := Resp) (Stmt := Stmt))      (R := fun s : CmaData M Commit Chal Stmt Wit => QueryCache.enncard s.2.1):= ζ_zk) (β := β)      (h_growth := by        intro t p _ htg z hz        simpa [htg] using cmaReal_roCacheCount_step_le M Commit Chal σ hr t p z hz)      (h_free := by        intro t p _ hnotCostly hnotHash z hz        simpa [hnotCostly, hnotHash] using          cmaReal_roCacheCount_step_le M Commit Chal σ hr t p z hz)      (oa := A) (qS := qS) (qH := qH)      (h_qS := h_qS) (h_qH := h_qH)      (s := cmaDataInit M Commit Chal Stmt Wit)
Project
VCVio
License
Apache-2.0
Commit
2ceb2d825ee3
Source
VCVio/CryptoFoundations/FiatShamir/Sigma/Stateful/Hops.lean:364-402

Reuse this declaration

Bring the exact result into your workflow

The import identifies the source module. Your project still needs the pinned package dependency shown on this page.

What this badge means

This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.

Continue in this project

Related declarations

Project-declaredLean 4.32.0

Expected Cost Nat eq sum tail probs of pathwise Cost At Most

AddWriterT.expectedCostNat_eq_sum_tail_probs_of_pathwiseCostAtMost

Plain-language statement

Finite tail-sum formula for natural-valued writer cost under a pathwise upper bound. If every execution path of oa incurs cost at most n, then the tail probabilities vanish above n, so the infinite tail sum truncates to Finset.range n.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

IND CPA advantage to Real le sum step signed Advantage Real abs

AsymmEncAlg.IND_CPA_advantage_toReal_le_sum_step_signedAdvantageReal_abs

Plain-language statement

Planned generic one-time-to-many-time lift: bounded multi-query IND-CPA advantage is at most the sum of the extracted one-time signed advantages over the first q fresh LR queries.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record