In this paper, we shall propose an efficient multi-round anonymous auction protocol. In the many literatures concerned, when more than one party bidding the same highest price for merchandise, all the bidders must re-participate in the auction again. It is inefficient. In this paper, the proposed protocol can make the auction easier. In our system, we first pick out the bidders offering the same highest price as the winners of the first round. Then, all the bidders need not re-participate in the auction again; only the winners of the first round have to come back for the second round.
Relation:
Journal of Discrete Mathematical Sciences & Cryptography 10(4):547–557
