Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
