会议专题

Fully Private Auctions for the Highest Bid

  We present a secure auction scheme with affordable com-putations 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.

Blockchain Auction Commitment Integer Comparison Pro-tocol

Jie Ma Bin Qi Kewei Lv

School of Cyber Security,University of Chinese Academy of Sciences,State Key Laboratory of Information Security,Institute of Information Engineering,Data Assurance and Communication Security Research Center,Chinese Academy of Sciences,Beijing,100093,P.R.China

国际会议

2019国图灵大会(ACM Turing Celebration conference-China 2019 )

成都

英文

619-624

2019-05-17(万方平台首次上网日期,不代表论文的发表时间)