Verification of Anonymous Information Transfer under The Government Bidding System

• Main Authors: Wen-Pin Lin, 林文彬
• Other Authors: Yen-Lin Yin
• Format: Others
• Language: zh-TW
• Published: 2008
• Online Access: http://ndltd.ncl.edu.tw/handle/89318119805211226893

碩士 === 國防管理學院 === 國防資訊研究所 === 96 === The government has endeavored to push electronic-commerce into practice for many years, especially in the field of bidding system. However, the bidding data is very likely to be intercepted and modified to someone’s benefits when sent through network. Another problem is that the sender and the receiver of a bidding transaction are not anonymous so that they are also likely to be the target. So, how to build a safe and anonymous bidding system is a very important issue for the success of e-commerce. We implant ElGamal theory into the group digital signature to make factor program and discrete logarithms computations extremely hard to be solved. This mechanism can allow the bidding members share information anonymously but also, if necessary, allow the top administrator to identify from where or whom a message was sent. We compare our algorithm with N-th degree truncated polynomial ring (NTRU) cryptosystem and find that ours is more efficient in validating encryption and decryption signature.