SXDH, LWE and LPN over a common prime ⇒ Sub-exponential SXDH
Statement
If SXDH, LWE and LPN are sub-exponentially hard over a common prime for a bilinear group generator, with constant , then SXDH is sub-exponentially hard for the same generator with : the first of its three problems is DDH in each source group, with size bound and advantage bound , by definition — folklore.