Privacy preserving auctions and mechanism design

We suggest an architecture for executing protocols for auctions and, more generally, mechanism design. Our goal is to preserve the privacy of the inputs of the participants (so that no nonessential information about them is divulged, even a posteriori) while maintaining communication and computational e ciency. We achieve this goal by adding another party the auction issuer that generates the programs for computing the auctions but does not take an active part in the protocol. The auction issuer is not a trusted party, but is assumed not to collude with the auctioneer. In the case of auctions, barring collusion between the auctioneer and the auction issuer, neither party gains any information about the bids, even after the auction is over. Moreover, bidders can verify that the auction was performed correctly. The protocols do not require any communication between the bidders and the auction issuer and the computational e ciency is very reasonable. This architecture can be used to implement any mechanism design where the important factor is the complexity of the decision procedure.

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

[2]  Silvio Micali,et al.  The round complexity of secure protocols , 1990, STOC '90.

[3]  J. Doug Tygar,et al.  Electronic Auctions with Private Bids , 1998, USENIX Workshop on Electronic Commerce.

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

[5]  Oded Goldreich,et al.  A randomized protocol for signing contracts , 1985, CACM.

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

[7]  A. Yao,et al.  Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.

[8]  Matthew K. Franklin,et al.  The Design and Implementation of a Secure Auction Service , 1996, IEEE Trans. Software Eng..

[9]  Jeffrey K. MacKie-Mason,et al.  Generalized Vickrey Auctions , 1994 .

[10]  Hal R. Varian,et al.  Economic Mechanism Design for Computerized Agents , 1995, USENIX Workshop on Electronic Commerce.

[11]  Moni Naor,et al.  A minimal model for secure computation (extended abstract) , 1994, STOC '94.

[12]  Alvin E. Roth,et al.  Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .

[13]  Ariel Rubinstein,et al.  Motives and Implementation: On the Design of Mechanisms to Elicit Opinions , 1998 .

[14]  Manoj Kumar,et al.  Internet Auctions , 1998, USENIX Workshop on Electronic Commerce.

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

[16]  Ronald Cramer,et al.  A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack , 1998, CRYPTO.

[17]  Noam Nisan,et al.  Algorithmic Mechanism Design , 2001, Games Econ. Behav..

[18]  Moshe Tennenholtz,et al.  Mechanism design for resource bounded agents , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[19]  Robert W. Irving,et al.  The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.

[20]  Russell Impagliazzo,et al.  Limits on the Provable Consequences of One-way Permutations , 1988, CRYPTO.

[21]  AuctionsMichael,et al.  Real Time Issues for Internet , 1998 .

[22]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[23]  Moshe Tennenholtz,et al.  k-Price Auctions , 2000, Games Econ. Behav..

[24]  Richard Engelbrecht-Wiggans,et al.  Protecting the winner: Second-price versus oral auctions , 1991 .

[25]  Noam Nisan,et al.  Algorithmic mechanism design (extended abstract) , 1999, STOC '99.

[26]  Rami Zwick,et al.  Auction on the internet - a preliminary study , 1999 .

[27]  Mihir Bellare,et al.  Relations among Notions of Security for Public-Key Encryption Schemes , 1998, IACR Cryptol. ePrint Arch..

[28]  Moni Naor,et al.  Non-malleable cryptography , 1991, STOC '91.

[29]  Michael Luby,et al.  Pseudorandomness and cryptographic applications , 1996, Princeton computer science notes.

[30]  Michael P. Wellman,et al.  Flexible double auctions for electronic commerce: theory and implementation , 1998, Decis. Support Syst..

[31]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[32]  W. K. Vickery,et al.  Counter-Speculation Auctions and Competitive Sealed Tenders , 1961 .

[33]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[34]  E. H. Clarke.  Multipart pricing of public goods , 1971 .

[35]  Silvio Micali,et al.  Non-Interactive Oblivious Transfer and Applications , 1989, CRYPTO.

[36]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[37]  Michael P. Wellman,et al.  Auction Protocols for Decentralized Scheduling , 2001, Games Econ. Behav..