An Auction Protocol Preserving Privacy of Losing Bids with a Secure Value Comparison Scheme

Koji CHIDA; Kunio KOBAYASHI; Hikaru MORITA

An Auction Protocol Preserving Privacy of Losing Bids with a Secure Value Comparison Scheme

Koji CHIDA, Kunio KOBAYASHI, Hikaru MORITA

Full Text Views

0

Share
Cite this

Summary :

A new approach for electronic sealed-bid auctions that preserve the privacy of losing bids is presented. It reduces the number of operations performed by the auctioneers to O(log ); previous protocols require O(N ) or O(N log ) where the number of bidders is N and that of available bidding prices is . Namely, the number of auctioneers' operations in our auction protocol is independent of the number of bidders. This feature offers strong advantages in massive auctions. We also propose a new scheme that checks the equality of two values without disclosing them. The scheme enhances our basic auction protocol, in terms of security and communication costs.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.1 pp.173-181

Publication Date: 2004/01/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category: Applications

Cite this

Copy

Koji CHIDA, Kunio KOBAYASHI, Hikaru MORITA, "An Auction Protocol Preserving Privacy of Losing Bids with a Secure Value Comparison Scheme" in IEICE TRANSACTIONS on Fundamentals, vol. E87-A, no. 1, pp. 173-181, January 2004, doi: .
Abstract: A new approach for electronic sealed-bid auctions that preserve the privacy of losing bids is presented. It reduces the number of operations performed by the auctioneers to O(log ); previous protocols require O(N ) or O(N log ) where the number of bidders is N and that of available bidding prices is . Namely, the number of auctioneers' operations in our auction protocol is independent of the number of bidders. This feature offers strong advantages in massive auctions. We also propose a new scheme that checks the equality of two values without disclosing them. The scheme enhances our basic auction protocol, in terms of security and communication costs.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e87-a_1_173/_p

Copy

@ARTICLE{e87-a_1_173,
author={Koji CHIDA, Kunio KOBAYASHI, Hikaru MORITA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Auction Protocol Preserving Privacy of Losing Bids with a Secure Value Comparison Scheme},
year={2004},
volume={E87-A},
number={1},
pages={173-181},
abstract={A new approach for electronic sealed-bid auctions that preserve the privacy of losing bids is presented. It reduces the number of operations performed by the auctioneers to O(log ); previous protocols require O(N ) or O(N log ) where the number of bidders is N and that of available bidding prices is . Namely, the number of auctioneers' operations in our auction protocol is independent of the number of bidders. This feature offers strong advantages in massive auctions. We also propose a new scheme that checks the equality of two values without disclosing them. The scheme enhances our basic auction protocol, in terms of security and communication costs.},
keywords={},
doi={},
ISSN={},
month={January},}

Copy

TY - JOUR
TI - An Auction Protocol Preserving Privacy of Losing Bids with a Secure Value Comparison Scheme
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 173
EP - 181
AU - Koji CHIDA
AU - Kunio KOBAYASHI
AU - Hikaru MORITA
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2004
AB - A new approach for electronic sealed-bid auctions that preserve the privacy of losing bids is presented. It reduces the number of operations performed by the auctioneers to O(log ); previous protocols require O(N ) or O(N log ) where the number of bidders is N and that of available bidding prices is . Namely, the number of auctioneers' operations in our auction protocol is independent of the number of bidders. This feature offers strong advantages in massive auctions. We also propose a new scheme that checks the equality of two values without disclosing them. The scheme enhances our basic auction protocol, in terms of security and communication costs.
ER -