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 three advantages: high efficiency, 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 achieved even in abnormal situations. © Springer-Verlag 2004.
CITATION STYLE
Peng, K., Boyd, C., Dawson, E., & Viswanathan, K. (2004). Efficient implementation of relative bid privacy in sealed-bid auction. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2908, 244–256. https://doi.org/10.1007/978-3-540-24591-9_19
Mendeley helps you to discover research relevant for your work.