Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6 — the Section A.2 function is a perfectly correct secure TDHF

Open
TrapdoorHCF.CCA2.Supplement.theorem_6

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

cryptographyp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1public-key-encryptiontrapdoor-hardcore-functions

Let lll be a public polynomial length and let PPP be an efficient public-key encryption scheme with message space {0,1}l(λ)\{0,1\}^{l(\lambda)}{0,1}l(λ) that is perfectly correct and IND-CPA secure (Definitions 1 and 2). Let Fl(P)F_l(P)Fl​(P) be the Section A.2 function: its input is x=m∥rx=m\Vert rx=m∥r with mmm uniform in {0,1}l(λ)\{0,1\}^{l(\lambda)}{0,1}l(λ) and rrr uniform encryption randomness, Eval(pk,x)=Enc(pk,m;r)\mathrm{Eval}(pk,x)=\mathrm{Enc}(pk,m;r)Eval(pk,x)=Enc(pk,m;r), hEval(pk,x)=m\mathrm{hEval}(pk,x)=mhEval(pk,x)=m and pInv=Dec\mathrm{pInv}=\mathrm{Dec}pInv=Dec. Then

Fl(P) is an efficient TDHF with hardcore range {0,1}l(λ) that is perfectly correct and secure.F_l(P)\ \text{is an efficient TDHF with hardcore range }\{0,1\}^{l(\lambda)}\text{ that is perfectly correct and secure}.Fl​(P) is an efficient TDHF with hardcore range {0,1}l(λ) that is perfectly correct and secure.

This is the reverse direction of Theorem 1, given by an explicit construction.

Differences from the source:

  • reading: a message or hardcore length l(lambda), polynomially bounded → a public polynomial parameter l (RestrictedDec.PolyParam), computable in unary in uniform polynomial time; reason: base paper.md decision 4; the Section A.2/C.2 evaluation parses x = m||r at l(lambda) and the reduction samples m0, m1 from {0,1}^{l(lambda)}, which a polynomial-time machine can do only when it can compute l(lambda)
  • reading: Definition 8/12 syntax with efficiently recognizable D_lambda and R_lambda for the constructed function → IsScheme of the constructed function asserts efficiency, the uniform sampler and output lengths but no recognizability of D_lambda or R_lambda; reason: as in the base Theorem 8: the theorem claims correctness and security; pInv is total on strings, the PKE syntax gives no recognizable randomness space, and recognizability is never used
  • encoding: a PPT adversary (or pair of PPT algorithms) → one uniform reactive machine with polynomial coins, state, output and total activations (RestrictedDec.Adversary with Valid), run by the base runStage with no oracle; reason: base paper.md decision 7; either presentation simulates the other with a polynomial budget; no advice or unbounded adversaries are introduced
  • encoding: strings, pairs, inputs x = m||r, randomness and the failure symbol → bit strings, tuple-coded pairs, explicit uniform finite coin vectors, and Option for failure; reason: injective data codes; they change no instance of the source experiments
Preamble
import Mathlib
import Definitions.Def_TrapdoorHCF_CCA2_Supplement_CPA
open QAlgorithms.Complexity
set_option autoImplicit false
Formal statement
namespace TrapdoorHCF.CCA2.Supplement

open TrapdoorHCF.CCA2

/-- Theorem 6, p.35, for the Section A.2 construction, pp.34–35. -/
theorem theorem_6 :
    ∀ (l : ℕ → ℕ) (P : RestrictedDec.PKE), RestrictedDec.PolyParam l →
      P.IsScheme l → PKE.PerfectlyCorrect l P → INDCPA l P →
      (ofPKE l P).IsScheme l ∧ IsSecureTDHF l (ofPKE l P) := by sorry

end TrapdoorHCF.CCA2.Supplement
Source
Kanad Chakravarti, Shreyas Gupta, Bhavana Kanukurthi, Girisha Shankar, Trapdoors Beyond Inversion: Recoverable Information in Public-Key Cryptography, STOC 2027 submission #571 (October 2026; unrefereed), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/571.pdf, Theorem 6, p.35, for the construction of Section A.2, pp.34–35

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me