Efficient Implementation of Relative Bid Privacy in Auction
نویسندگان
چکیده
The concept of relative bid privacy in auction is proposed, which does not conceal the bids, but conceals the link between them and the corresponding bidders. Relative bid privacy leads to two advantages: the bidding values can be very precise and any auction rule can be applied. A new mix network is designed and applied to implement relative bid privacy efficiently. Two rounds of shuffling are employed in the mix network, so that fairness can be achieved in the auction without any trust and relative bid privacy is kept even in abnormal situations.
منابع مشابه
A Multiplicative Homomorphic Sealed-Bid Auction Based on Goldwasser-Micali Encryption
Instead of the costly encryption algorithms traditionally employed in auction schemes, efficient Goldwasser-Micali encryption is used to design a new sealed-bid auction. Multiplicative homomorphism instead of the traditional additive homomorphism is exploited to achieve security and high efficiency in the auction. The new scheme is the currently known most efficient non-interactive sealed-bid a...
متن کاملSealed-Bid Micro Auctions
In electronic auction applications, small-value merchandise is often distributed. We call this kind of auction micro auction. Compared to traditional general-purpose electronic auction, micro electronic auction has its own special requirements. Especially, micro auction must be very efficient: the cost of the auction protocol must not be over the cost of the merchandise for sale. Although the m...
متن کاملAn Efficient Sealed-bid Auction Protocol with Bid Privacy and Bidder Privacy
In this paper, a sealed-bid auction protocol which mainly focuses on security issues: bid privacy, bidder anonymity and fairness problem is presented. The new proposal is motivated by the conflict between bidder anonymity and DOS (denial-of-service) attack from insider. It utilizes an efficient LPN-based authentication method to accomplish lightweight authentication. In order to share the deter...
متن کاملFive Sealed-bid Auction Models
Published sealed-bid auction schemes are classi ed into four models according to how they deal with bid privacy. The properties of each model are introduced and possible improvements in these models are suggested. A new model is proposed and its implementation is discussed. Application of di erent models is discussed, based on a comparison of the models.
متن کاملSealed-Bid Auctions with Efficient Bids
Efficient general secure multiparty computation (MPC) protocols were previously proposed, and the combination with the efficient auction circuits achieves the efficient sealed-bid auctions with the full privacy and correctness. However, the combination requires that each bidder submits ciphertexts of bits representing his bid, and their zeroknowledge proofs. This cost amounts to about 80 multi-...
متن کامل