Bit-Slice Auction Circuit

@article{Kurosawa2002BitSliceAC,
  title={Bit-Slice Auction Circuit},
  author={Kaoru Kurosawa and Wakaha Ogata},
  journal={IACR Cryptology ePrint Archive},
  year={2002},
  volume={2002},
  pages={189}
}
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. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

Efficient Multiparty Computation for Comparator Networks

The Second International Conference on Availability, Reliability and Security (ARES'07) • 2007
View 3 Excerpts
Highly Influenced

Towards Practical Privacy for Genomic Computation

2008 IEEE Symposium on Security and Privacy (sp 2008) • 2008
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-2 of 2 references

\ Completeness theorems fornonryptographi fault - tolerant distributed omputation , " Pro eedings ofthe twentieth annual ACM Symp

J. B. Nielsen
Theory of Computing , STOC

\ How to play any mental game , " In Pro eedings of the nineteenth annual ACM Symp

S. Mi ali O. Goldrei h, A. Wigderson.
Theory of Computing , STOC

Similar Papers

Loading similar papers…