loading...
An Efficient Method for Finding Minmum Hash Chain of Multi-Payword Chains in Micropayment
Newport Beach, California June 24-June 27
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/COEC.2003.12102312003 IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ching-Nung Yang, National Dong Hwa University
Hsu-Tun Teng, National Dong Hwa University
In recent years, e-commerce grows rapidly and therefore a secure and efficient shopping and payment scheme is an important issue today. The micropayment scheme is safe, easy and quick and can be used in some e-commerce applications such as mobile commerce services or web-based interactive video services that require the small amounts of money in transaction. In [1], Rivest and Shamir proposed a micropayment system that use hash function to generate a sequence of paywords for making small amount of purchases. They use the low-cost hash operations to reduce the usage of high-cost public key operations to enhance efficiency. However, in Rivest and Shamir?s scheme, only one single payword chain is generated and used. If users are able to spend distinct values of paywords on shopping, the system would be more efficient in computation and storage cost due to the different denominations of multi-payword chains. In this paper, two using modes of the multi-payword chains are proposed based on new partition problems for finding minimal multi-payword chains in the transaction process such that the hash operations can be reduced.
Citation:
Ching-Nung Yang, Hsu-Tun Teng, "An Efficient Method for Finding Minmum Hash Chain of Multi-Payword Chains in Micropayment," cec, pp.45, 2003 IEEE International Conference on E-Commerce Technology (CEC'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.