Earticle

초록

영어

With the recent popularity of shopping online, on-line electronic check (OLEC) as low-risk and low-cost way to perform payment has become an important component in e-commerce. Recently, Chang et al. propose an OLEC by using hash chain to represent the maximum face value and the face amount on an e-check. However, these values of Chang et al.’s OLEC cannot be arbitrary, and it is infeasible to compute hash operations for too large values. In this paper, we adopt a decimal based hash chain to design an enhanced OLEC (EOLEC). Our EOLEC significantly reduces the hash operations in Chang et al.’s OLEC to provide a much faster transaction, and meanwhile retains its original characteristics. Also, our EOLEC with arbitrary maximum face value and face amount on a check is more like the traditional paper check.

목차

Abstract
 1. Introduction
 2. Previous Works
  2.1. Chang et al.’s OLEC
  2.2. Chen et al.’s OLEC
 3. The Enhanced On-line Electronic Check
  3.1. Observation
  3.1. Design Concept
  3.2. Our EOLEC
 4. Security Analysis and Comparison
  4.1. Security Analysis
  4.2. Discussion and Comparison
 5. Conclusion
 References

키워드

저자

• Zhili Zhou [ Jiangsu Engineering Center of Network Monitoring & School of Computer and Software, Nanjing University of Information Science and Technology, Nanjing, Jiangsu, China ]
• Ching-Nung Yang [ Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan ]
• Chih-Fei Chen [ Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605