A Robust Double Auction Protocol Based on a Hybrid Trust Model

Abstract

AbstractRecently, Wang and Leung proposed a set of double auction protocols with full privacy protection based on distributed ElGamal encryption. Unfortunately, their protocols are expensive in computation and are not robust in dealing with system malfunction or user misbehavior. In this paper, we propose a secure and practical double auction protocol based on a hybrid trust model, where computation load is distributed to buyers and sellers while a semi-trusted manager handles the registration phase. A prominent feature of the proposed protocol is its high robustness, achieved by using a publicly verifiable secret sharing scheme with threshold access structure.KeywordsDiscrete LogarithmBulletin BoardSecret Sharing SchemeDiscrete Logarithm ProblemDouble AuctionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.