Sub-exponential SXDH ⇒ SXDH

Fully-black-box reduction · standard model · folklore · security loss: none

Statement

Sub-exponentially hard SXDH is SXDH: an efficient adversary has size below $2^{{\lambda }^{\epsilon }}$ for large $\lambda$, so its advantage is at most $2^{-{\lambda }^{\epsilon }}$ — folklore.