This paper presents efficient secure auction protocols for first price auction and second price auction. Previous auction protocols are based on a generally secure multi-party protocol called mix-and-match protocol based on plaintext equality tests. However, the time complexity of the plaintext equality tests is large, although the mix-and-match protocol can securely calculate any logical circuits. The proposed protocols reduce the number of times the plaintext equality tests is used by replacing them with the Boneh-Goh-Nissim encryption, which enables calculation of 2-DNF of encrypted data.
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.
Copy
Takuho MITSUNAGA, Yoshifumi MANABE, Tatsuaki OKAMOTO, "Efficient Secure Auction Protocols Based on the Boneh-Goh-Nissim Encryption" in IEICE TRANSACTIONS on Fundamentals,
vol. E96-A, no. 1, pp. 68-75, January 2013, doi: 10.1587/transfun.E96.A.68.
Abstract: This paper presents efficient secure auction protocols for first price auction and second price auction. Previous auction protocols are based on a generally secure multi-party protocol called mix-and-match protocol based on plaintext equality tests. However, the time complexity of the plaintext equality tests is large, although the mix-and-match protocol can securely calculate any logical circuits. The proposed protocols reduce the number of times the plaintext equality tests is used by replacing them with the Boneh-Goh-Nissim encryption, which enables calculation of 2-DNF of encrypted data.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E96.A.68/_p
Copy
@ARTICLE{e96-a_1_68,
author={Takuho MITSUNAGA, Yoshifumi MANABE, Tatsuaki OKAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Secure Auction Protocols Based on the Boneh-Goh-Nissim Encryption},
year={2013},
volume={E96-A},
number={1},
pages={68-75},
abstract={This paper presents efficient secure auction protocols for first price auction and second price auction. Previous auction protocols are based on a generally secure multi-party protocol called mix-and-match protocol based on plaintext equality tests. However, the time complexity of the plaintext equality tests is large, although the mix-and-match protocol can securely calculate any logical circuits. The proposed protocols reduce the number of times the plaintext equality tests is used by replacing them with the Boneh-Goh-Nissim encryption, which enables calculation of 2-DNF of encrypted data.},
keywords={},
doi={10.1587/transfun.E96.A.68},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Efficient Secure Auction Protocols Based on the Boneh-Goh-Nissim Encryption
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 68
EP - 75
AU - Takuho MITSUNAGA
AU - Yoshifumi MANABE
AU - Tatsuaki OKAMOTO
PY - 2013
DO - 10.1587/transfun.E96.A.68
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E96-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2013
AB - This paper presents efficient secure auction protocols for first price auction and second price auction. Previous auction protocols are based on a generally secure multi-party protocol called mix-and-match protocol based on plaintext equality tests. However, the time complexity of the plaintext equality tests is large, although the mix-and-match protocol can securely calculate any logical circuits. The proposed protocols reduce the number of times the plaintext equality tests is used by replacing them with the Boneh-Goh-Nissim encryption, which enables calculation of 2-DNF of encrypted data.
ER -