Reducing Computations in Chang et al.'s on-line Electronic Check

被引:0
|
作者
Zhou, Zhili [1 ,2 ]
Yang, Ching-Nung [3 ]
Chen, Chih-Fei [3 ]
机构
[1] Nanjing Univ Informat Sci & Technol, Jiangsu Engn Ctr Network Monitoring, Nanjing 210044, Jiangsu, Peoples R China
[2] Nanjing Univ Informat Sci & Technol, Sch Comp & Software, Nanjing 210044, Jiangsu, Peoples R China
[3] Natl Dong Hwa Univ, Dept Comp Sci & Informat Engn, Hualien 974, Taiwan
基金
中国国家自然科学基金;
关键词
E-check; E-commerce; One-way hash function; Decimal representation; Hash chain;
D O I
10.14257/ijsia.2016.10.10.25
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:271 / 288
页数:18
相关论文
共 50 条