How does match-fixing inform computer game security?

Jeff Yan

doi:10.1007/978-3-030-03251-7_19

How does match-fixing inform computer game security?

Jeff Yan^*

^*Corresponding author for this work

Computer And Information Sciences

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

1 Citation (Scopus)

Abstract

Match fixing is an increasingly popular phenomenon in e-Sports, namely competitive computer gaming between professional players. We first revisit the notion of security for computer games in the context of match fixing, which was never considered before. Then we offer a security economics analysis, and discuss potential countermeasures for addressing this threat. We propose a novel crowd-sourcing method for match-fixing detection. Our approach is incentive-compatible and it works for both traditional sports and eSports. We expect to raise awareness of these new issues and encourage further academic research.

Original language	English
Title of host publication	Security Protocols XXVI
Subtitle of host publication	26th International Workshop, Cambridge, UK, March 19–21, 2018, Revised Selected Papers
Editors	Vashek Matyáš, Petr Švenda, Frank Stajano, Bruce Christianson, Jonathan Anderson
Place of Publication	Cham, Switzerland
Publisher	Springer
Pages	166-170
Number of pages	5
ISBN (Electronic)	9783030032517
ISBN (Print)	9783030032500
DOIs	https://doi.org/10.1007/978-3-030-03251-7_19
Publication status	Published - 24 Nov 2018
Event	26th International Workshop on Security Protocols, 2018 - Cambridge, United Kingdom Duration: 19 Mar 2018 → 21 Mar 2018

Publication series

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

Conference

Conference	26th International Workshop on Security Protocols, 2018
Country/Territory	United Kingdom
City	Cambridge
Period	19/03/18 → 21/03/18

Funding

Acknowledgements. I thank Ross Anderson, John Chuang, Dah Ming Chiu and the workshop attendees for their input and stimulating discussions. This work was supported by the Knut and Alice Wallenberg Foundation.

Keywords

crowd-sourcing for fraud detection
incentives
online game security
security economics
security notions

Access to Document

10.1007/978-3-030-03251-7_19

Cite this

Yan, J. (2018). How does match-fixing inform computer game security? In V. Matyáš, P. Švenda, F. Stajano, B. Christianson, & J. Anderson (Eds.), Security Protocols XXVI: 26th International Workshop, Cambridge, UK, March 19–21, 2018, Revised Selected Papers (pp. 166-170). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11286 LNCS). Springer. https://doi.org/10.1007/978-3-030-03251-7_19

Yan, Jeff. / How does match-fixing inform computer game security?. Security Protocols XXVI: 26th International Workshop, Cambridge, UK, March 19–21, 2018, Revised Selected Papers. editor / Vashek Matyáš ; Petr Švenda ; Frank Stajano ; Bruce Christianson ; Jonathan Anderson. Cham, Switzerland : Springer, 2018. pp. 166-170 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{c57c677266ab49af9c63006f4129ab9c,

title = "How does match-fixing inform computer game security?",

abstract = "Match fixing is an increasingly popular phenomenon in e-Sports, namely competitive computer gaming between professional players. We first revisit the notion of security for computer games in the context of match fixing, which was never considered before. Then we offer a security economics analysis, and discuss potential countermeasures for addressing this threat. We propose a novel crowd-sourcing method for match-fixing detection. Our approach is incentive-compatible and it works for both traditional sports and eSports. We expect to raise awareness of these new issues and encourage further academic research.",

keywords = "crowd-sourcing for fraud detection, incentives, online game security, security economics, security notions",

author = "Jeff Yan",

year = "2018",

month = nov,

day = "24",

doi = "10.1007/978-3-030-03251-7_19",

language = "English",

isbn = "9783030032500",

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

publisher = "Springer",

pages = "166--170",

editor = "Vashek Maty{\'a}{\v s} and Petr {\v S}venda and Frank Stajano and Bruce Christianson and Jonathan Anderson",

booktitle = "Security Protocols XXVI",

note = "26th International Workshop on Security Protocols, 2018 ; Conference date: 19-03-2018 Through 21-03-2018",

}

Yan, J 2018, How does match-fixing inform computer game security? in V Matyáš, P Švenda, F Stajano, B Christianson & J Anderson (eds), Security Protocols XXVI: 26th International Workshop, Cambridge, UK, March 19–21, 2018, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11286 LNCS, Springer, Cham, Switzerland, pp. 166-170, 26th International Workshop on Security Protocols, 2018, Cambridge, United Kingdom, 19/03/18. https://doi.org/10.1007/978-3-030-03251-7_19

How does match-fixing inform computer game security? / Yan, Jeff.
Security Protocols XXVI: 26th International Workshop, Cambridge, UK, March 19–21, 2018, Revised Selected Papers. ed. / Vashek Matyáš; Petr Švenda; Frank Stajano; Bruce Christianson; Jonathan Anderson. Cham, Switzerland: Springer, 2018. p. 166-170 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11286 LNCS).

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