Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dongwon Shin

dblp:71/5158 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
5since 2021 · last 2026
0000-0002-4234-6830ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 3 · 1 first-author · 3 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 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
3 papers
Security and privacy of machine learning · 43% Web and mobile security · 41% Systems and software security · 12%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Artificial intelligence
1 paper
Language models and text generation · 100%

Topics — the 7 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Web and mobile security
browser security
1.012026
Site Isolation is Dead: How Site Isolation is Broken in Agentic Browsers and Extensions · SP 2026
Web and mobile security › browser security
site isolation
1.012026
Site Isolation is Dead: How Site Isolation is Broken in Agentic Browsers and Extensions · SP 2026
Security and privacy of machine learning › model privacy
language model privacy
0.912025
Private Investigator: Extracting Personally Identifiable Information from Large Language Models Using Optimized Prompts · USENIX Security Symposium 2025
Security and privacy of machine learning › privacy attack
personally identifiable information extraction
0.912025
Private Investigator: Extracting Personally Identifiable Information from Large Language Models Using Optimized Prompts · USENIX Security Symposium 2025
Security and privacy of machine learning
adversarial defense
0.712023
RICC: Robust Collective Classification of Sybil Accounts · WWW 2023
Web and mobile security › browser security
browser extension security
0.312026
Site Isolation is Dead: How Site Isolation is Broken in Agentic Browsers and Extensions · SP 2026
Digital forensics and information hiding › digital forensics
data extraction
0.312025
Private Investigator: Extracting Personally Identifiable Information from Large Language Models Using Optimized Prompts · USENIX Security Symposium 2025

Methods — techniques the papers use, named apart from their topics

text classification · 2.0ensemble detection · 2.0prompt optimization · 0.9large language model · 0.9ensemble learning · 0.7collective classification · 0.7
YearPublicationVenuePosition
2026 Site Isolation is Dead: How Site Isolation is Broken in Agentic Browsers and Extensions
Suyoung Lee, Seongho Keum, Changoo Lee, Dongwon Shin, Sanghyun Hong 0001, Byoungyoung Lee, Sooel Son
SP4
2026 LLMs Killed Q&A Stars? Analyzing the Impact of LLM-Generated Answers on an Online Q&A Platform
abstract
Online question-and-answer (Q&A) platforms facilitate knowledge exchange through posted questions and answers. Recent advances in large language models (LLMs) have shown their strong capability in generating high-quality answers, leading to a recent surge in LLM-generated answers (LGAs) on Q&A platforms. In this paper, we conduct an in-depth analysis of how LGAs affect Naver Knowledge iN, the most popular Q&A platform in South Korea. To this end, we implement nine state-of-the-art LLM-generated text (LGT) detection methods and evaluate their performance on answers collected from Naver Knowledge iN. We then build an ensemble detector by stacking the three best-performing LGT detection methods, achieving an AUC of 0.9987 with a false positive rate below 1%. Using this LGA detector, we identify 75,558 LGAs among 1.46M answers. We find that LGAs tend to be longer, use more punctuation marks, and exhibit higher lexical diversity. However, LGAs do not show clear differences in user reactions, such as upvotes, downvotes, or selection rates by questioners. We also find that LGAs are primarily intended for knowledge sharing rather than personal experiences sharing. Finally, we observe a shift in the Q&A platform: questions increasingly move from simple fact-seeking to those involving complex contexts and seeking personal opinions or past experiences.
Dongwon Shin, Sooel Son
WWW1
2025 Private Investigator: Extracting Personally Identifiable Information from Large Language Models Using Optimized Prompts
Seongho Keum, Dongwon Shin, Leo Marchyok, Sanghyun Hong 0001, Sooel Son
USENIX Security Symposium2
2024 You Only Perturb Once: Bypassing (Robust) Ad-Blockers Using Universal Adversarial Perturbations
abstract
Extensive academic effort has been put into the development of effective machine learning models that block advertising and tracking service (ATS) content. These ATS blockers leverage various features from websites, such as structural, content, flow, and JavaScript features, to develop accurate and robust models. However, establishing the robustness of these ATS blockers to evasion attacks is largely understudied, particularly in practical scenarios in which an adversary generates a single and cost-effective universal perturbation that renders ATS detection across websites ineffective at scale.In this paper, we show that recent ATS blockers using machine learning are not robust to a universal adversarial attack. Specifically, we propose an auditing framework (YOPO) that enables one to generate a single adversarial perturbation in a cost-effective manner. Our framework casts the generation of a universal perturbation into an optimization problem in a principled way; it enables an adversary to minimize the cost of manipulating various features in HTML content and to thwart ATS classification while constraining the perturbation size for each feature. We demonstrate that YOPO is capable of generating a universal perturbation that enables bypassing four seminal ATS blockers: AdGraph, WebGraph, AdFlush, and PageGraph, attaining success rates of up to 92.27%, 71.50%, 61.91%, and 85.81%, respectively. We also propose a practical and effective countermeasure against YOPO that only requires preprocessing training instances without large performance drops in ATS blocking.
Dongwon Shin, Suyoung Lee, Sanghyun Hong 0001, Sooel Son
ACSAC1
2023 RICC: Robust Collective Classification of Sybil Accounts
abstract
A Sybil attack is a critical threat that undermines the trust and integrity of web services by creating and exploiting a large number of fake (i.e., Sybil) accounts. To mitigate this threat, previous studies have proposed leveraging collective classification to detect Sybil accounts. Recently, researchers have demonstrated that state-of-the-art adversarial attacks are able to bypass existing collective classification methods, posing a new security threat. To this end, we propose RICC, the first robust collective classification framework, designed to identify adversarial Sybil accounts created by adversarial attacks. RICC leverages the novel observation that these adversarial attacks are highly tailored to a target collective classification model to optimize the attack budget. Owing to this adversarial strategy, the classification results for adversarial Sybil accounts often significantly change when deploying a new training set different from the original training set used for assigning prior reputation scores to user accounts. Leveraging this observation, RICC achieves robustness in collective classification by stabilizing classification results across different training sets randomly sampled in each round. RICC achieves false negative rates of 0.01, 0.11, 0.00, and 0.01 in detecting adversarial Sybil accounts for the Enron, Facebook, Twitter_S, and Twitter_L datasets, respectively. It also attains respective AUCs of 0.99, 1.00, 0.89, and 0.74 for these datasets, achieving high performance on the original task of detecting Sybil accounts. RICC significantly outperforms all existing Sybil detection methods, demonstrating superior robustness and efficacy in the collective classification of Sybil accounts.
Dongwon Shin, Suyoung Lee, Sooel Son
WWW1