Cryptology ePrint Archive: Report 2002/189

Bit-Slice Auction Circuit

Kaoru Kurosawa and Wakaha Ogata

Abstract: In this paper, we introduce a bit-slice approach for auctions and present a more efficient circuit than the normal approach for the highest-price auction. Our circuit can be combined with any auction protocol based on general circuit evaluation. Especially, if we combine with the mix and match technique, then we can obtain a highest-price auction protocol which is at least seven times faster. A second-price auction protocol is also easily constructed from our circuit.

Category / Keywords: cryptographic protocols / distributed cryptography, electronic commerce and payment

Date: received 11 Dec 2002

Contact author: kurosawa at cis ibaraki ac jp

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation

Version: 20021212:094433 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]