In this paper we analyse the ECIES encryption algorithm in the generic group model of computation. This allows us to remove the non-standard interactive intractability assumption of the proof of security given in the literature. This is done at the expense of requiring the generic group model of computation.
CITATION STYLE
Smart, N. P. (2001). The exact security of ECIES in the generic group model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2260, pp. 73–84). Springer Verlag. https://doi.org/10.1007/3-540-45325-3_8
Mendeley helps you to discover research relevant for your work.