A Secure M + 1st Price Auction Protocol Based on Bit Slice Circuits
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E99-A No.8 pp.1591-1599
- Publication Date
- 2016/08/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E99.A.1591
- Type of Manuscript
- PAPER
- Category
- Cryptography and Information Security
Authors
Takuho MITSUNAGA
JPCERT/CC
Yoshifumi MANABE
Kogakuin University
Tatsuaki OKAMOTO
NTT Corporation
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Takuho MITSUNAGA, Yoshifumi MANABE, Tatsuaki OKAMOTO, "A Secure M + 1st Price Auction Protocol Based on Bit Slice Circuits" in IEICE TRANSACTIONS on Fundamentals,
vol. E99-A, no. 8, pp. 1591-1599, August 2016, doi: 10.1587/transfun.E99.A.1591.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.1591/_p
Copy
@ARTICLE{e99-a_8_1591,
author={Takuho MITSUNAGA, Yoshifumi MANABE, Tatsuaki OKAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Secure M + 1st Price Auction Protocol Based on Bit Slice Circuits},
year={2016},
volume={E99-A},
number={8},
pages={1591-1599},
abstract={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.},
keywords={},
doi={10.1587/transfun.E99.A.1591},
ISSN={1745-1337},
month={August},}
Copy
TY - JOUR
TI - A Secure M + 1st Price Auction Protocol Based on Bit Slice Circuits
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1591
EP - 1599
AU - Takuho MITSUNAGA
AU - Yoshifumi MANABE
AU - Tatsuaki OKAMOTO
PY - 2016
DO - 10.1587/transfun.E99.A.1591
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2016
AB - 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.
ER -
English
