Fully private auctions for the highest bid

8Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

We present a secure auction scheme with affordable computations and communication complexity. In this scheme, we use blockchain to publish commitment and some public messages only. All bidders are forced to perform protocol honestly and are not permitted to change or retract their bids. To preserve privacy, we use insulated ciphertext comparison protocol to compare the bids. Our scheme is more efficient than traditional auctions using MPC/ZKP primitives. The total number of interaction rounds for N bidders is 3(N - 1). Furthermore, when the comparisons is performed in parallel, the number of rounds dramatically decreases to 3 log N.

Cite

CITATION STYLE

APA

Ma, J., Qi, B., & Lv, K. (2019). Fully private auctions for the highest bid. In ACM International Conference Proceeding Series. Association for Computing Machinery. https://doi.org/10.1145/3321408.3321570

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free