Theorem 6.23 — batched IBE gives bounded-set robust PPS
OpenPPSLattice.Supplement.theorem_6_23cryptographyidentity-based-encryptionp2o-gran-per-chapterp2o-plan-paperp2o-v1
A selectively secure batched IBE scheme makes Construction 6.22 robustly payload hiding for every queried set of size at most the batch bound , retaining set-key queries both before and after the challenge.
Differences from the source:
- encoding: The source leaves the identity family and oracle transcript implicit → Lean supplies the family as a predicate containing and makes every pre- and post-challenge target-exclusion and cardinality check explicit; reason: this is the literal selective-security game of Definition 6.21.
Preamble
import Mathlib import Definitions.Def_PPSLattice_Supplement_BIBE set_option autoImplicit false
Formal statement
namespace PPSLattice.Supplement
/-- **Theorem 6.23**, Goyal--Yadugiri, STOC 2027 submission (manuscript sha256 7f9c493f...),
p.57. Selective security of batched IBE implies robust payload hiding of Construction 6.22 for
key sets of cardinality at most the setup batch bound `B`.
**Formalization Note.** The BIBE game and the resulting RPPS game retain key queries both before
and after the challenge. The identity space contains `[2^λ]`. -/
theorem theorem_6_23 (E : BIBE) (Identity : ℕ → Set ℕ) (B : ℕ)
(hB : 1 ≤ B) (hE : E.IsScheme Identity) :
(construction622 B E).RobustPayloadHidingUpTo B := by sorry
end PPSLattice.Supplement
Source
Goyal–Yadugiri, STOC 2027 submission (manuscript sha256 7f9c493f…), Theorem 6.23, p.57