Yet Another Strong Sealed-Bid Auctions

Abstract

In this paper, we propose two sealed-bid auction protocols that one is based on RSA problem and the other on Discrete Logarithm problem. The peculiar characteristics of new protocols are non-repudiation of bidders preserving their anonymity and the reduced computational complexity to log 2 P ), where n and P denote the number of bidders and the number of possible bidding prices, respectively. Our protocols have additional characteristics such as privacy, publicly verifiability, fairness and walk-awayness. We claim that this low complexity is preferable in a large scale auction.