Bit-Slice Auction Circuit

  • Authors:
  • Kaoru Kurosawa;Wakaha Ogata

  • Affiliations:
  • -;-

  • Venue:
  • ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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.