The sub-group hiding assumption is a computational hardness assumption used in elliptic curve cryptography and pairing-based cryptography.
It was first introduced in[1] to build a 2-DNF homomorphic encryption scheme.
This cryptography-related article is a stub. You can help Wikipedia by expanding it.
Strategi Solo vs Squad di Free Fire: Cara Menang Mudah!