Abstract
In 1999, Paillier proposed an elegant cryptosystem from the integers modulo N 2 where N is an RSA modulus. Paillier public-key encryption scheme enjoys a number of interesting properties, including a homomorphic property: the encryption of two messages allows anyone to derive the encryption of their sum. This reveals useful in cryptographic applications such as electronic voting.In this talk we review several generalizations of the original Paillier scheme to the elliptic curve setting. Using similar ideas, we then present a new elliptic curve scheme which is semantically secure in the standard model. Interestingly, the new encryption scheme does not require to encode messages as points on an elliptic curve and features a partial homomorphic property.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joye, M. (2013). On Elliptic Curve Paillier Schemes. In: Muntean, T., Poulakis, D., Rolland, R. (eds) Algebraic Informatics. CAI 2013. Lecture Notes in Computer Science, vol 8080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40663-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-40663-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40662-1
Online ISBN: 978-3-642-40663-8
eBook Packages: Computer ScienceComputer Science (R0)