|
|||
|
IMADA - Department of Mathematics and Computer Science |
|
A secure multiparty computation (SMC) is a type of communication protocol that allows a set of participants to agree on the value of a public function of their private data without disclosing the data itself. For example, the data can be voters' choices of candidate in an election and the value of the target function could be the winner. There are several generic solutions to SMC, but these tend to yield solutions that, although of polynomial complexity, are not practical. One such generic solution uses so-called discreet cryptographic proofs (DCP). These proofs are discreet in the sense that participants do not reveal private information. The main objective of this research is to show that DCPs can be used in practice even for fairly complex target functions. For this purpose, we have chosen to implement online sealed-bid Vickrey auctions. In these auctions the winner is the bidder with the highest bid. The price paid, however, is the value of the second highest bid. The discreetness property sought is that the winning bid and sale price can be computed without the losing bids becoming known to anybody (not even the auctioneer). Among the performance goals is to use small amount of scarce resources such as bandwidth, total number of bits communicated, computation time, memory use, randomness, and interaction (protocols with many rounds of communication are less practical than those with fewer rounds). Joint work with Jose A. Montenegro. Host: Joan Boyar SDU HOME | IMADA HOME | Previous Page Last modified: Tue Mar 25 13:32:50 CET 2008 Joan Boyar (joan@imada.sdu.dk) |