Documentation

CatCryptCore.Examples.ElGamalUCConcrete

ElGamal IND-CPA as Concrete UC Emulation from DDH #

The ElGamal IND-CPA game pair, indexed by the message pair (m₀, m₁), as a concrete UC emulation whose bound is the DDH advantage of explicit reductions. For every adversary A and environment Z, the gap is at most

DDH_Advantage (Reduction m₀ (envReduction A Z)) + DDH_Advantage (Reduction m₁ (envReduction A Z))

where (m₀, m₁) = Z.input, envReduction A Z runs A and then Z's distinguisher, and Reduction embeds a DDH triple as public key and ciphertext (ElGamalDDH.Reduction).

Main results #

DDH bound of a distinguisher D on messages m: the DDH advantages of the two reductions embedding m₀ and m₁.

Equations
  • One or more equations did not get rendered due to their size.
Instances For

    The real IND-CPA game does not read the heap.

    Concrete game bound: IND-CPA advantage of D on (m₀, m₁) is at most the DDH advantages of the reductions built from D.

    ElGamal IND-CPA as concrete UC emulation from DDH (composition plumbing, simulator S = A): the bound of adversary A and environment Z is the DDH advantage of the reductions of envReduction A Z.