Bit-Slice Auction Circuit

Kaoru Kurosawa; Wakaha Ogata

Paper 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.

Metadata

Available format(s): PS
Category: Cryptographic protocols
Publication info: Published elsewhere. Unknown where it was published
Keywords: distributed cryptography electronic commerce and payment
Contact author(s): kurosawa @ cis ibaraki ac jp
History: 2002-12-12: received
Short URL: https://ia.cr/2002/189
License: CC BY

BibTeX

@misc{cryptoeprint:2002/189,
      author = {Kaoru Kurosawa and Wakaha Ogata},
      title = {Bit-Slice Auction Circuit},
      howpublished = {Cryptology {ePrint} Archive, Paper 2002/189},
      year = {2002},
      url = {https://eprint.iacr.org/2002/189}
}