A Novel Construction of Two-Party Private Bidding Protocols from Yao's Millionaires Problem

摘要

In this paper, a new bidding protocol (in essence, it is Yao's millionaires problem) is implemented. We show that our implementation is provably secure in the common reference string model assuming that a static adversary corrupts one of the players.