TY - GEN
T1 - Privacy preserving auctions and mechanism design
AU - Naor, Moni
AU - Pinkas, Benny
AU - Sumner, Reuban
PY - 1999
Y1 - 1999
N2 - 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 efficiency. 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 efficiency is very reasonable. This architecture can be used to implement any mechanism design where the important factor is the complexity of the decision procedure.
AB - 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 efficiency. 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 efficiency is very reasonable. This architecture can be used to implement any mechanism design where the important factor is the complexity of the decision procedure.
UR - http://www.scopus.com/inward/record.url?scp=84883898504&partnerID=8YFLogxK
U2 - 10.1145/336992.337028
DO - 10.1145/336992.337028
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84883898504
SN - 1581131763
SN - 9781581131765
T3 - ACM International Conference Proceeding Series
SP - 129
EP - 139
BT - Proceedings of the 1st ACM Conference on Electronic Commerce, EC 1999
T2 - 1st ACM Conference on Electronic Commerce, EC 1999
Y2 - 3 November 1999 through 5 November 1999
ER -