Design and implementation of an efficient fair off-line E-cash system based on elliptic curve discrete logarithm problem

作     者：Lee, M Ahn, G Kim, J Park, J Lee, B Kim, K Lee, H 

作者机构：ICU Taejon South Korea 

出 版 物：《JOURNAL OF COMMUNICATIONS AND NETWORKS》 (J. Commun. Netw.)

年 卷 期：2002年第4卷第2期

页      面：81-89页

核心收录：

学科分类：0810[工学-信息与通信工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：electronic cash anonymity revocation atomicity elliptic curve discrete logarithm problem 

摘      要：In this paper, we design and implement an efficient fair off-line electronic cash system based on Elliptic Curve Discrete Logarithm Problem (ECDLP), in which the anonymity of coins is revocable by a trustee in case of dispute. To achieve this, we employ the Petersen and Poupard s electronic cash system [1] and extend it by using an elliptic curve over the finite field GF(2(n)). This naturally reduces message size by 85% compared with the original scheme and makes a smart card to store coins easily. Furthermore, we use the Baek et al. Is provably secure public key encryption scheme [2] to improve the security of electronic cash system. As an extension, we propose a method to add atomicity into new electronic cash system. To the best of our knowledge, this is the first result to implement a fair off-line electronic cash system based on ECDLP with provable security.