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

Beomjin Jin

dblp:222/0315 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
3since 2021 · last 2026
0000-0002-3237-0327ORCID · corroborated

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

Security and privacy · 2 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 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
Web and mobile security · 44% Security and privacy of machine learning · 16% Privacy and data protection · 16%
Computer networks
1 paper
Network management and operations · 100%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Web and mobile security › content blocking
ad and tracker blocking
1.012026
AdVersa: Adversarially-Robust and Practical Ad and Tracker Blocking in the Wild · WWW 2026
Security and privacy of machine learning
adversarial robustness
1.012026
AdVersa: Adversarially-Robust and Practical Ad and Tracker Blocking in the Wild · WWW 2026
Web and mobile security › content blocking
tracker blocking
1.012026
AdVersa: Adversarially-Robust and Practical Ad and Tracker Blocking in the Wild · WWW 2026
Privacy and data protection
web tracking
1.012026
AdVersa: Adversarially-Robust and Practical Ad and Tracker Blocking in the Wild · WWW 2026
Network management and operations
security operations
0.812024
Sharing cyber threat intelligence: Does it really help? · NDSS 2024
Network security › intrusion detection and prevention › intrusion detection › attack detection
machine learning-based detection
0.812024
AdFlush: A Real-World Deployable Machine Learning Solution for Effective Advertisement and Web Tracker Prevention · WWW 2024
Usable security › security operations › security analytics › cyber threat intelligence
threat intelligence sharing
0.812024
Sharing cyber threat intelligence: Does it really help? · NDSS 2024
Compilers and program optimization
decompilation
0.412019
Kerberoid: A Practical Android App Decompilation System with Multiple Decompilers · CCS 2019

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

adversarial robustness · 1.0machine learning · 0.8feature selection · 0.8multiple decompiler stitching · 0.4
YearPublicationVenuePosition
2026 AdVersa: Adversarially-Robust and Practical Ad and Tracker Blocking in the Wild
Chaejin Lim, Kiho Lee, Beomjin Jin, Heewon Baek, Hyoungshick Kim
WWW3
2024 Sharing cyber threat intelligence: Does it really help?
Beomjin Jin, Eunsoo Kim, Hyunwoo Lee 0001, Elisa Bertino, Doowon Kim, Hyoungshick Kim
NDSS1
2024 AdFlush: A Real-World Deployable Machine Learning Solution for Effective Advertisement and Web Tracker Prevention
abstract
Conventional ad blocking and tracking prevention tools often fall short in addressing web content manipulation. Machine learning approaches have been proposed to enhance detection accuracy, yet aspects of practical deployment have frequently been overlooked. This paper introduces AdFlush, a novel machine learning model for real-world browsers. To develop AdFlush, we evaluated the effectiveness of 883 features, ultimately selecting 27 key features for optimal performance. We tested AdFlush on a dataset of 10,000 real-world websites, achieving an F1 score of 0.98, thereby outperforming AdGraph (F1 score: 0.93), WebGraph (F1 score: 0.90), and WTAgraph (F1 score: 0.84). Additionally, AdFlush significantly reduces computational overhead, requiring 56% less CPU and 80% less memory than AdGraph. We also assessed AdFlush's robustness against adversarial manipulations, demonstrating superior resilience with F1 scores ranging from 0.89 to 0.98, surpassing the performance of AdGraph and WebGraph, which recorded F1 scores between 0.81 and 0.87. A six-month longitudinal study confirmed that AdFlush maintains a high F1 score above 0.97 without the need for retraining, underscoring its effectiveness.
Kiho Lee, Chaejin Lim, Beomjin Jin, Hyoungshick Kim
WWW3
2019 Kerberoid: A Practical Android App Decompilation System with Multiple Decompilers
abstract
Decompilation is frequently used to analyze binary programs. In Android, however, decompilers all perform differently with varying apps due to their own characteristics. Obviously, there is no universal solution in all conditions. Based on this observation, we present a practical Android app decompilation system (called Kerberoid) that automatically stitches the results from multiple decompilers together to maximize the coverage and the accuracy of decompiled codes. We evaluate the performance of Kerberoid with 151 Android apps in which their corresponding source codes are publicly available. Kerberoid fully recovered all functions for 17% of the apps tested and gained a similarity score over 50% for 40% of the apps tested, increased by 7% and 9%, respectively, compared with the best existing decompiler.
Heejun Jang, Beomjin Jin, Sangwon Hyun, Hyoungshick Kim
CCS2