| Summary: | 碩士 === 國立高雄第一科技大學 === 資訊管理所 === 98 === With the rapid development of the Internet technology and the use of the information technology, people would change their shopping behavior from the traditional transactions to the e-commerce related activities which is conducted through the Internet environment. Since the Internet environment is not secure, there are many security concerns in the Internet environment. The malicious attacker will try to falsify, forge or eavesdrop the information sent through the network. For the customers, they hope their e-cash can not be stolen, forged to carry out other illegitimate action. Also they do not want the others can learn their true identities from the electronic cash. Thus, to solve these problems, many electronic cash schemes have been proposed. Most of the previous e-cash schemes only have a single bank, and they assumed the customer and the merchant belong to the same bank. However, there are many banks in our real life. For the merchants, they hope the used e-cash can store in their corresponding banks, and the e-cash is able to be verified for its correctness.
In 2008, an electronic cash scheme based on group signatures was proposed. The scheme used the group blind signature scheme based on bilinear pairings and the ID-based group signature scheme to generate an electronic cash for multiple banks. Also the bilinear pairings was used to verify the correctness of the electronic cash in the proposed protocols. However, we find some security problems in the proposed scheme. Also, the cost of communication and computation of the proposed scheme can be improved. In this thesis, we propose an efficient and secure e-cash scheme for multiple banks from bilinear pairings. Our proposed scheme can solve all the wellknown security problems. Also, compared with other related schemes, our proposed scheme provide lower computation and communication cost.
|
|---|
