SKEMA BLIND SIGNATURE BERBASIS ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEM

Is Esti Firmanesa

Abstract


Some blind signature schemes proposed previously are based on the Integer Faktorization Problem (IFP), such as RSA and Discrete Logarithm Problem (DLP), such as ElGamal, but both these schemes have not met the two properties as stated by Chaum, that every blind signature protocol should hold two fundamental properties, namely blindness and intractableness. For this reason, researchers made a blind signature scheme based on Elliptic Curve Cryptography (ECC) that its security depends on the Elliptic Curve Discrete Logarithm Problem (ECDLP). This scheme utilizes the inherent advantages in terms of the ECC key size is smaller than RSA and ElGamal with the same level of security. This scheme has proved to be robust and very difficult to trace. This scheme can be proposed for use in various applications such as e-voting, digital cash, and others.

Full Text:

A45-A53

Refbacks

  • There are currently no refbacks.



Konferensi Nasional Teknologi Informasi & Aplikasinya
Jurusan Sistem Informasi | Fakultas Ilmu Komputer
Universitas Sriwijaya