Sub-group hiding
The sub-group hiding assumption is a computational hardness assumption used in elliptic curve cryptography and pairing-based cryptography.
It was first introduced inDan Boneh, Eu-Jin Goh, Kobbi Nissim: Evaluating 2-DNF Formulas on Ciphertexts. TCC 2005: 325–341 to build a 2-DNF homomorphic encryption scheme.
See also
References
{{Cryptography navbox | public-key}}
{{Computational hardness assumptions}}
Category:Computational hardness assumptions
Category:Elliptic curve cryptography
Category:Pairing-based cryptography
{{crypto-stub}}