An Identification Scheme Based on the Elliptic Curve Discrete Logarithm Problem

Authors:
Constantin Popescu
Affiliations:
-
Venue:
HPC '00 Proceedings of the The Fourth International Conference on High-Performance Computing in the Asia-Pacific Region-Volume 2 - Volume 2
Year:
2000

Citing 0
Cited 3

A New Identification Scheme Based on the Bilinear Diffie-Hellman Problem

ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Digital multi-signature scheme based on the elliptic curve cryptosystem

Journal of Computer Science and Technology
An improved popescu's authenticated key agreement protocol

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a three-move interactive identification scheme based on the elliptic curve discrete logarithm problem. Our identification scheme is as efficient as the elliptic curve version of Schnorr identification scheme. The scheme inherits almost all of the merits of the Schnorr identification scheme and the elliptic curve version of Schnorr identification scheme.