Sub-group hiding
Jump to navigation
Jump to search
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.
See also
References
- ↑ Dan Boneh, Eu-Jin Goh, Kobbi Nissim: Evaluating 2-DNF Formulas on Ciphertexts. TCC 2005: 325–341
Script error: No such module "Navbox". Template:Computational hardness assumptions