Demo Data from EDBT 2026 / reviewers in the wild / expert
Gihyuk Ko
dblp:200/8331
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
2 papers |
Network security · 41% Security and privacy of machine learning · 41% Privacy and data protection · 18% | |
| Software engineering, system software, and programming languages
1 paper |
Program analysis · 100% | |
| Artificial intelligence
1 paper |
Trustworthy machine learning · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Security and privacy of machine learning
adversarial robustness |
0.7 | 1 | 2023 | BotScreen: Trust Everybody, but Cut the Aimbots Yourself · USENIX Security Symposium 2023 |
Network security › intrusion detection and prevention
bot detection |
0.7 | 1 | 2023 | BotScreen: Trust Everybody, but Cut the Aimbots Yourself · USENIX Security Symposium 2023 |
Program analysis
static analysis |
0.3 | 1 | 2017 | Use Privacy in Data-Driven Systems: Theory and Experiments with Machine Learnt Programs · CCS 2017 |
Machine learning › Trustworthy machine learning
fairness |
0.1 | 1 | 2017 | Use Privacy in Data-Driven Systems: Theory and Experiments with Machine Learnt Programs · CCS 2017 |
Methods — techniques the papers use, named apart from their topics
program analysis · 0.9normative judgment oracle · 0.9model repair · 0.9machine learning · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | BotScreen: Trust Everybody, but Cut the Aimbots Yourself
Minyeop Choi, Gihyuk Ko, Sang Kil Cha |
USENIX Security Symposium | 2 |
| 2017 | Use Privacy in Data-Driven Systems: Theory and Experiments with Machine Learnt ProgramsabstractThis paper presents an approach to formalizing and enforcing a class of use privacy properties in data-driven systems. In contrast to prior work, we focus on use restrictions on proxies (i.e. strong predictors) of protected information types. Our definition relates proxy use to intermediate computations that occur in a program, and identify two essential properties that characterize this behavior: 1) its result is strongly associated with the protected information type in question, and 2) it is likely to causally affect the final output of the program. For a specific instantiation of this definition, we present a program analysis technique that detects instances of proxy use in a model, and provides a witness that identifies which parts of the corresponding program exhibit the behavior. Recognizing that not all instances of proxy use of a protected information type are inappropriate, we make use of a normative judgment oracle that makes this inappropriateness determination for a given witness. Our repair algorithm uses the witness of an inappropriate proxy use to transform the model into one that provably does not exhibit proxy use, while avoiding changes that unduly affect classification accuracy. Using a corpus of social datasets, our evaluation shows that these algorithms are able to detect proxy use instances that would be difficult to find using existing techniques, and subsequently remove them while maintaining acceptable classification performance. Anupam Datta, Matt Fredrikson, Gihyuk Ko, Piotr Mardziel, Shayak Sen |
CCS | 3 |