Corpus ID: 17822566

Linearly Homomorphic Encryption from DDH

@article{Castagnos2015LinearlyHE,
  title={Linearly Homomorphic Encryption from DDH},
  author={Guilhem Castagnos and Fabien Laguillaumie},
  journal={IACR Cryptol. ePrint Arch.},
  year={2015},
  volume={2015},
  pages={47}
}
We design a linearly homomorphic encryption scheme whose security relies on the hardness of the decisional Diffie-Hellman problem. Our approach requires some special features of the underlying group. In particular, its order is unknown and it contains a subgroup in which the discrete logarithm problem is tractable. Therefore, our instantiation holds in the class group of a non maximal order of an imaginary quadratic field. Its algebraic structure makes it possible to obtain such a linearly… Expand
Homomorphic Secret Sharing for Low Degree Polynomials
On the Weakness of Fully Homomorphic Encryption
New Ideas to Build Noise-Free Homomorphic Cryptosystems
Non-zero Inner Product Encryptions: Strong Security under Standard Assumptions
A Geometric Approach to Homomorphic Secret Sharing
Encryption Switching Protocols Revisited: Switching Modulo p
The Paillier's Cryptosystem and Some Variants Revisited
Advances in Cryptology – CRYPTO 2017
...
1
2
3
...

References

SHOWING 1-10 OF 49 REFERENCES
A New Public-Key Cryptosystem over a Quadratic Order with Quadratic Decryption Time
A new public key cryptosystem based on higher residues
A New Public-Key Cryptosystem as Secure as Factoring
...
1
2
3
4
5
...