Secure Multi-attribute Procurement Auction

In this paper, we develop a secure multi-attribute procurement auction, in which a sales item is defined by several attributes called qualities, the buyer is the auctioneer (e.g., a government), and the sellers are the bidders. We first present a Vickrey-type protocol that can be used for multi-attribute procurement auctions.Next, we show how this protocol can be executed securely.

[1]  Makoto Yokoo,et al.  Secure multi-agent dynamic programming based on homomorphic encryption and its application to combinatorial auctions , 2002, AAMAS '02.

[2]  Yeon-Koo Che.  Design competition through multidimensional auctions , 1993 .

[3]  Masayuki Abe,et al.  M+1-st Price Auction Using Homomorphic Encryption , 2002, Public Key Cryptography.

[4]  Esther David,et al.  Bidders' strategy for multi-attribute sequential english auction with a deadline , 2003, AAMAS '03.

[5]  Makoto Yokoo,et al.  Strategy/false-name proof protocols for combinatorial multi-attribute procurement auction: handling arbitrary utility of the buyer , 2005, AAMAS '05.

[6]  Martin Bichler,et al.  An experimental analysis of multi-attribute auctions , 2000, Decis. Support Syst..

[7]  Makoto Yokoo,et al.  Secure Generalized Vickrey Auction Using Homomorphic Encryption , 2003, Financial Cryptography.

[8]  Esther David,et al.  Protocols and strategies for automated multi-attribute auctions , 2002, AAMAS '02.

[9]  Markus Jakobsson,et al.  Mix and Match: Secure Function Evaluation via Ciphertexts , 2000, ASIACRYPT.

[10]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[11]  Kazue Sako,et al.  An Auction Protocol Which Hides Bids of Losers , 2000, Public Key Cryptography.

[12]  Makoto Yokoo,et al.  Secure Combinatorial Auctions by Dynamic Programming with Polynomial Secret Sharing , 2002, Financial Cryptography.

[13]  Felix Brandt,et al.  Fully Private Auctions in a Constant Number of Rounds , 2003, Financial Cryptography.

[14]  Ivan Damgård,et al.  Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols , 1994, CRYPTO.

[15]  Paul F. Syverson,et al.  Fair On-Line Auctions without Special Trusted Parties , 1999, Financial Cryptography.

[16]  Jacques Stern,et al.  Non-interactive Private Auctions , 2002, Financial Cryptography.

[17]  David Chaum,et al.  Wallet Databases with Observers , 1992, CRYPTO.

[18]  Makoto Yokoo,et al.  Strategy/False-name Proof Protocols for Combinatorial Multi-Attribute Procurement Auction , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[19]  Valtteri Niemi,et al.  Secure Vickrey Auctions without Threshold Trust , 2002, Financial Cryptography.

[20]  Ari Juels,et al.  A Two-Server, Sealed-Bid Auction Protocol , 2002, Financial Cryptography.

[21]  Christian Cachin,et al.  Efficient private bidding and auctions with an oblivious third party , 1999, CCS '99.

[22]  Moni Naor,et al.  Privacy preserving auctions and mechanism design , 1999, EC '99.

[23]  Hiroaki Kikuchi,et al.  Multi-round Anonymous Auction Protocols , 1999 .