Name
Abstract | ||
|---|---|---|
We present a cryptographically t-private protocol for electronic auctions whose low resource demands make it viable for practical use. Our construction is based on Yao's garbled circuits and pseudorandom number generators (PRNGs). Our protocol involves a field of (t + 1)2 parties for the generation of the garbled circuit and permits an arbitrary large number of bidders. The computational requirements are low: Only t + 1 parties of the field have to use the PRNG, the remaining parties execute only primitive computations (XOR, permutations and sharing). The bidders have to stay active for one round of communication, independent of each other. Each bidder has to compute only t + 1 XOR-operations. We present an implementation and evaluate its performance. The observed running time of our protocol is linear in the size of the auction circuit and the number of bidders and, as expected, grows quadratically in the parameter t. Copyright © 2010 John Wiley & Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1002/cpe.1684 | Concurrency and Computation: Practice and Experience |
Keywords | DocType | Volume |
computational requirement,practical use,cryptographically t-private auction system,low resource demand,garbled circuit,arbitrary large number,John Wiley,cryptographically t-private protocol,auction circuit,electronic auction,pseudorandom number generator | Conference | 23 |
Issue | ISSN | Citations |
12 | 1532-0626 | 2 |
PageRank | References | Authors |
0.37 | 13 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Markus Hinkelmann | 1 | 10 | 1.93 |
| Andreas Jakoby | 2 | 141 | 17.68 |
| Nina Moebius | 3 | 123 | 8.30 |
| Tiark Rompf | 4 | 743 | 45.86 |
| Peer Stechert | 5 | 30 | 7.98 |