Abstract
This paper presents a new protocol for M + 1st-price auction, a style of auction in which the highest M bidders win and pay a uniform price, determined by the (M +1)st price. A set of distributed servers collaborates to resolve the (M +1)st price without revealing any information in terms of bids including the winners’ bids. A new trick to jointly and securely compute the highest value as a degree of distributed polynomials is introduced. The building block requires just one round for bidders to cast bids and one round for auctioneers to determine the winners.
Cite
CITATION STYLE
Kikuchi, H. (2002). (M + 1)st-price auction protocol. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2339, pp. 351–363). Springer Verlag. https://doi.org/10.1007/3-540-46088-8_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
