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 in [1] to build a 2-DNF homomorphic encryption scheme.

See also

References

  1. Dan Boneh, Eu-Jin Goh, Kobbi Nissim: Evaluating 2-DNF Formulas on Ciphertexts. TCC 2005: 325341


This article is issued from Wikipedia - version of the Friday, April 13, 2012. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.