With the Internet developing quickly, Internet security has been a hot topic.Electronic commerce was an affected field. Electronic auction is one of the important of electronic commerce. The protection of the bidder privacy and the prevention of bidder default are the key to the designing of the electronic auction scheme, and problems that need to be urgently solved in electronic auction activities. According to analyze the existing electronic auction scheme, the following problems still exist:(1) Only an auction manager takes charge of electronic auction in existing electronic auction scheme, it leads to revealing the bid.(2) Most of the electronic auction scheme is based on knowledge group signature which is relatively low efficiency and complex in form and calculation.To solve the above problems. This thesis proposes a secure and efficient auction scheme which applies a group blind signature based on bilinear map and a provable secret sharing protocol. A based on group blind signature is able to protect bidder anonymity,achieve bid undeniability and non-repudiation of the winner, etc. This scheme utilizes secret sharing protocol to achieve bid secrecy. Bilinear map group blind signature is relatively easy in form and calculation. In addition, it has some other characteristics: low cost of communications and computation, convenient construction, concurrent join and fast revocation. |