A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A Secure M + 1st Price Auction Protocol Based on Bit Slice Circuits
[chapter]
2011
Lecture Notes in Computer Science
This paper presents an efficient secure auction protocol for M + 1st price auction. In our proposed protocol, bidding prices are represented as binary expression. Thus, if the bidding price is an integer up to p and the number of bidders is m, the complexity of our protocol is a polynomial of log p and m, while in previous secure M + 1st price auction protocols, the complexity is a polynomial of p and m. We apply the Boneh-Goh-Nissim encryption to the mix-and-match protocol to reduce the computation costs.
doi:10.1007/978-3-642-25141-2_4
fatcat:h7qaxjmuerfspcnflh4g5i4kx4