Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

36

FC
2001
Springer

favoriteEmaildiscussreport

125views Cryptology» more FC 2001»

(M+1)st-Price Auction Protocol

14 years 3 months ago

(M+1)st-Price Auction Protocol

Download www.ep.u-tokai.ac.jp

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.

Hiroaki Kikuchi

Real-time Traffic

1st-price Auction | Cryptology | FC 2001 | Servers Collaborates | Uniform Price |

claim paper

Related Content

» ReceiptFree Electronic Auction Schemes Using Homomorphic Encryption

» Efficient Secure Auction Protocols Based on the BonehGohNissim Encryption

» Analysis of a ReceiptFree Auction Protocol in the Applied Pi Calculus

» Unconditionally Secure FirstPrice Auction Protocols Using a Multicomponent Commitment Sche...

» An Anonymous Auction Protocol Based on GDH Assumption

» Double Auction Protocols for Resource Allocation in Grids

» Auction protocol for camera active control

» Properties of Symmetric Incentive Compatible Auctions

» Secure Generalized Vickrey Auction Using Homomorphic Encryption

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	FC
Authors	Hiroaki Kikuchi

Comments (0)