A Novel Electronic Cash System

In this book, three recent electronic cash (e-cash) systems, Juang-Liaw s divisible e-cash, Juang s D- cash, and Chen-Jan-Chen s deposit delegation scheme, are first reviewed. Then, a novel e-cash system based on bilinear pairing is designed to attain a more secure and efficient level which has the function of anonymity revocation. To achieve the anonymity revocation function, we construct a new ID- based blind signature scheme where the blindly signed message contains a trustee-approved token which is embedded with user s identity. Moreover, to efficiently implement the function, we evoke a trustee to perform the task by simply using one symmetric encryption and one exclusive-or operation. Besides, we incorporate mutual authentication and key agreement into our design to get rid of the necessity of running under a pre-established secure channel as usually needed in previous studies. This can reduce the communicational overhead. After security analyses and comparisons, we conclude that our scheme is not only more secure but also more efficient than the ones reviewed in this book.

Autorentext

Dr.Chou received Ph.D.Deg.in Dept.of Comp.Sci. and Info.Engr. from Natl.Chiao Tung Univ. in Taiwan and is a Prof. at Dept.of Info. Management of Nanhua Univ. His interests are secure protocol, authentication. Dr.Chen received Ph.D.Deg. in Inst. of Info.Sys. and Appl. of Natl.Tsing Hua Univ., working for bank over 10 years. jschou@mail.nhu.edu.tw

Klappentext

In this book, three recent electronic cash (e-cash) systems, Juang-Liaw's divisible e-cash, Juang's D- cash, and Chen-Jan-Chen's deposit delegation scheme, are first reviewed. Then, a novel e-cash system based on bilinear pairing is designed to attain a more secure and efficient level which has the function of anonymity revocation. To achieve the anonymity revocation function, we construct a new ID- based blind signature scheme where the blindly signed message contains a trustee-approved token which is embedded with user's identity. Moreover, to efficiently implement the function, we evoke a trustee to perform the task by simply using one symmetric encryption and one exclusive-or operation. Besides, we incorporate mutual authentication and key agreement into our design to get rid of the necessity of running under a pre-established secure channel as usually needed in previous studies. This can reduce the communicational overhead. After security analyses and comparisons, we conclude that our scheme is not only more secure but also more efficient than the ones reviewed in this book.