Secure generalized vickrey auction using homomorphic encryption

Koutarou Suzuki; Makoto Yokoo

doi:10.1007/978-3-540-45126-6_17

Secure generalized vickrey auction using homomorphic encryption

Koutarou Suzuki, Makoto Yokoo

Research output: Chapter in Book/Report/Conference proceeding › Chapter

46 Citations (Scopus)

Abstract

Combinatorial auctions have recently attracted the interest of many researchers due to their promising applications such as the spectrum auctions recently held by the FCC. In a combinatorial auction, multiple items with interdependent values are sold simultaneously and bidders are allowed to bid on any combination of items. The Generalized Vickrey Auction (GVA) can handle combinatorial auctions and has several good theoretical characteristics. However, GVA has not yet widely used in practice due to its vulnerability to fraud by the auctioneers. In this paper, to prevent such fraud, we propose a secure Generalized Vickrey Auction scheme where the result of the auction can be computed while the actual evaluation values of each bidder are kept secret.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Rebecca N. Wright
Publisher	Springer Verlag
Pages	239-249
Number of pages	11
ISBN (Print)	9783540406631
DOIs	https://doi.org/10.1007/978-3-540-45126-6_17
Publication status	Published - 2003
Externally published	Yes

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2742
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-45126-6_17

Cite this

Suzuki, K., & Yokoo, M. (2003). Secure generalized vickrey auction using homomorphic encryption. In R. N. Wright (Ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 239-249). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2742). Springer Verlag. https://doi.org/10.1007/978-3-540-45126-6_17

Secure generalized vickrey auction using homomorphic encryption. / Suzuki, Koutarou; Yokoo, Makoto.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Rebecca N. Wright. Springer Verlag, 2003. p. 239-249 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2742).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Suzuki, K & Yokoo, M 2003, Secure generalized vickrey auction using homomorphic encryption. in RN Wright (ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2742, Springer Verlag, pp. 239-249. https://doi.org/10.1007/978-3-540-45126-6_17

Suzuki K, Yokoo M. Secure generalized vickrey auction using homomorphic encryption. In Wright RN, editor, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2003. p. 239-249. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-45126-6_17

Suzuki, Koutarou ; Yokoo, Makoto. / Secure generalized vickrey auction using homomorphic encryption. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Rebecca N. Wright. Springer Verlag, 2003. pp. 239-249 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{7d23adc8be8941348225f5efadafe608,

title = "Secure generalized vickrey auction using homomorphic encryption",

abstract = "Combinatorial auctions have recently attracted the interest of many researchers due to their promising applications such as the spectrum auctions recently held by the FCC. In a combinatorial auction, multiple items with interdependent values are sold simultaneously and bidders are allowed to bid on any combination of items. The Generalized Vickrey Auction (GVA) can handle combinatorial auctions and has several good theoretical characteristics. However, GVA has not yet widely used in practice due to its vulnerability to fraud by the auctioneers. In this paper, to prevent such fraud, we propose a secure Generalized Vickrey Auction scheme where the result of the auction can be computed while the actual evaluation values of each bidder are kept secret.",

author = "Koutarou Suzuki and Makoto Yokoo",

year = "2003",

doi = "10.1007/978-3-540-45126-6_17",

language = "English",

isbn = "9783540406631",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "239--249",

editor = "Wright, {Rebecca N.}",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "Germany",

}

TY - CHAP

T1 - Secure generalized vickrey auction using homomorphic encryption

AU - Suzuki, Koutarou

AU - Yokoo, Makoto

PY - 2003

Y1 - 2003

N2 - Combinatorial auctions have recently attracted the interest of many researchers due to their promising applications such as the spectrum auctions recently held by the FCC. In a combinatorial auction, multiple items with interdependent values are sold simultaneously and bidders are allowed to bid on any combination of items. The Generalized Vickrey Auction (GVA) can handle combinatorial auctions and has several good theoretical characteristics. However, GVA has not yet widely used in practice due to its vulnerability to fraud by the auctioneers. In this paper, to prevent such fraud, we propose a secure Generalized Vickrey Auction scheme where the result of the auction can be computed while the actual evaluation values of each bidder are kept secret.

AB - Combinatorial auctions have recently attracted the interest of many researchers due to their promising applications such as the spectrum auctions recently held by the FCC. In a combinatorial auction, multiple items with interdependent values are sold simultaneously and bidders are allowed to bid on any combination of items. The Generalized Vickrey Auction (GVA) can handle combinatorial auctions and has several good theoretical characteristics. However, GVA has not yet widely used in practice due to its vulnerability to fraud by the auctioneers. In this paper, to prevent such fraud, we propose a secure Generalized Vickrey Auction scheme where the result of the auction can be computed while the actual evaluation values of each bidder are kept secret.

UR - http://www.scopus.com/inward/record.url?scp=35248879821&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35248879821&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-45126-6_17

DO - 10.1007/978-3-540-45126-6_17

M3 - Chapter

AN - SCOPUS:35248879821

SN - 9783540406631

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 239

EP - 249

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Wright, Rebecca N.

PB - Springer Verlag

ER -

Secure generalized vickrey auction using homomorphic encryption

Abstract

Publication series

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this