(M+1)st-Price Auction Protocol
Summary :
This paper presents some new protocols for (M+1)st-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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.3 pp.676-683
- Publication Date
- 2002/03/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hiroaki KIKUCHI, "(M+1)st-Price Auction Protocol" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 3, pp. 676-683, March 2002, doi: .
Abstract: This paper presents some new protocols for (M+1)st-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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_3_676/_p
Copy
@ARTICLE{e85-a_3_676,
author={Hiroaki KIKUCHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={(M+1)st-Price Auction Protocol},
year={2002},
volume={E85-A},
number={3},
pages={676-683},
abstract={This paper presents some new protocols for (M+1)st-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.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - (M+1)st-Price Auction Protocol
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 676
EP - 683
AU - Hiroaki KIKUCHI
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2002
AB - This paper presents some new protocols for (M+1)st-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.
ER -
English
