Practical secrecy-preserving, verifiably correct and trustworthy auctions

Abstract

A system and method for conducting verifiably correct auctions that preserves the secrecy of the bids while providing for verifiable correctness and trustworthiness of the auction is disclosed. Some of the elements of the method and apparatus are that the auction operator accepts all bids submitted and follows the published rules of the auction. In one embodiment, the bids are maintained secret from the auctioneer and all bidders until the auction closes and no bidder is able to change or repudiate her bid. In another embodiment, the auction operator computes the auction results and publishes proofs of the results' correctness. In yet another embodiment, any party can check these proofs of correctness via publicly verifiable to computations on encrypted bids.

Description

CROSS REFERENCE TO RELATED APPLICATIONS[0001]This application is a continuation of and claims priority under 35 U.S.C §120 to U.S. application Ser. No. 12 / 299,522, which entered national stage on Nov. 4, 2008, entitled “PRACTICAL SECRECY-PRESERVING, VERIFIABLY CORRECT AND TRUSTWORTHY AUCTIONS,” which application is a US national phase entry under 35 U.S.C. §371 of PCT / US2007 / 068373 filed May 7, 2007, which claims the benefit of priority of U.S. Provisional Application Ser. No. 60 / 798,121 filed May 5, 2006, which applications are incorporated herein by reference in their entirety.FEDERALLY SPONSORED RESEARCH[0002]This invention was made with government support under CCR-0205423 awarded by the National Science Foundation. The Government has certain rights in the invention.BACKGROUND OF INVENTION[0003]1. Field of Invention[0004]Method and apparatus for facilitating verifiably correct auctions.[0005]2. Discussion of Related Art[0006]In recent years, auctions and electronic marketplaces ...

AI Technical Summary

Benefits of technology

[0011]In one embodiment, we preserve secrecy by keeping bid information secret from everyone except the auctioneer, and keeping bid information secret even from the auctioneer until the auction closes. The only information revealed to the public is that implied by the outcome of the auction, that is, that implied by the identity of the winner or the payment made by the winner. In a certain embodiment, a secrecy-preserving verification protocol allows anyone, including bidders and third parties, to verify that the auction was correct: the auctioneer correctly determined the winner(s) and associated payment(s) according to published rules. Trustworthiness may be supported by carefully ensuring that all bidders must follow through with information about bids of pre-committed value and quantity after an auction closes, and the auctioneer must accept and respect all bids in determining the outcome.

[0013]According to one aspect of the invention, our auction process ensures verifiable correctness and trustworthiness. Although an auctioneer learns the values of bids submitted after an auction closes, an auctioneer is not able to use this information to change the outcome in the auction or provide an advantage to any bidder. Thus, we prevent a “bad apple” within the auctioneer's organization from being able to profitably leak information during the course of an auction. On the other hand, and at a considerable gain in simplicity, in one embodiment we have chosen not to algorithmically protect against an auctioneer revealing bid values and quantities after an auction has closed and the outcome has been announced. Our process and system does not provide any algorithmic enforcement for this additional privacy protection. In solving what we view as the first-order problem of trustworthiness during the execution of an auction, we choose to push these secondary considerations into the realm of contractual to obligations and the auctioneer's business reputation. An additional benefit, in addition to simplicity and practicality, is that this architecture will also allow for extensions to combinatorial auctions for which fully-private computational techniques cannot scale.

[0014]We observe that complete secrecy by the auctioneer can be provided, in cases where it is deemed absolutely essential, by appeal to hardware solutions. Trusted servers, with specially designed hardware and software audited by third parties for correctness, and installed in physically secure locations with ongoing monitoring and auditing, can prevent the leaking of information with high assurance. In fact, with such deliberately opaque servers it is of the utmost import that an auction participant can independently verify the correctness of the outcome of an auction and be assured that there is no fraud. Thus, such technological methods to eliminate secrecy leaks are very well complemented by our processes and systems for verifiable correctness.

[0015]To demonstrate the scalability of our technology, we have conducted preliminary timing tests (discussed further below), on a certain embodiment. In this exemplary illustration, we show that for acceptable strength of the cryptographic security key, single or multi-item auctions with 100 bidders can be prepared in around two hours of computation and verified in less than half an hour, all on a standard (2.8 GHz Pentium 4) PC. We also show that the computations scale linearly with the number of bidders. Because our method and apparatus is easily parallelizable, it is possible to accommodate even tens of thousands of bidders in at most a day of computation on a 64-node network.

Problems solved by technology

To achieve this we focus on proofs of correctness rather than secure to computation.

Images