Elliptic Curve Paillier Schemes
By Steven D. Galbraith. 2001
99 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Geometry and Topology, Information Systems
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Praneeth Vepakomma
- Ramesh Raskar
- Hidayet Aksu
- Abbas Acar
- Mauro Conti
- Selcuk Uluagac
- Sai Sri Sathya
- Santanu Bhattacharya
In Geometry and Topology
In Information Systems
- Ramesh Raskar
- Mauro Conti
- Fabien Galand
- Hidayet Aksu
- Abbas Acar
- Yan-Cheng Chang
- Caroline Fontaine
- Selcuk Uluagac
Citations in the corpus
- A Review of Homomorphic Encryption Libraries for Secure Computation (2018, background): “Partially Homomorphic Encryption (PHE) schemes such as [9,10,11,12,13,14,15,16,17,18,19] allow only one type of operation any number of times - either addition or multiplication on encrypted data as compared to Somewhat Homomorphic schemes that support both.”
- A Survey on Homomorphic Encryption Schemes (2017, methodology): “Finally, Galbraith [Galbraith 2002] introduced a more natural generalization of Paillier’s cryptosystem applying it on elliptic curves while still preserving the homomorphic property of the Paillier’s cryptosystem.”
- Single Database Private Information Retrieval with Logarithmic Communication (2004, methodology): “Because Paillier’s cryptosystem along with its variants have drawn extensive studies in recent cryptographic researches [3,4,8,9] (just to cite a few), and have many important applications (e.”
- A Survey of Homomorphic Encryption for Nonspecialists (2007, background): “(vii) Galbraith proposed in [58] an adaptation of the previous scheme in the context of elliptic curves.”