A Secure M + 1st Price Auction Protocol Based on Bit Slice Circuits

Takuho MITSUNAGA  Yoshifumi MANABE  Tatsuaki OKAMOTO  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E99-A   No.8   pp.1591-1599
Publication Date: 2016/08/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E99.A.1591
Type of Manuscript: PAPER
Category: Cryptography and Information Security
secure auction protocol,  M+1st price auction,  Boneh-Goh-Nissim encryption,  mix-and-match protocol,  

Full Text: PDF(757.8KB)>>
Buy this Article

This paper presents an efficient secure auction protocol for M+1st price auction. In our proposed protocol, a bidding price of a player is represented as a binary expression, while in the previous protocol it is represented as an integer. Thus, when the number of players is m and the bidding price is an integer up to p, compared to the complexity of the previous protocol which is a polynomial of m and p, the complexity of our protocol is a polynomial of m and log p. We apply the Boneh-Goh-Nissim encryption to the mix-and-match protocol to reduce the computation costs.