Demo Data from SIGIR 2026 / reviewers in the wild / expert
Hodaya Binyamini
dblp:272/4350
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 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 · 42% Usable security · 37% Systems and software security · 21% | |
| Artificial intelligence
1 paper |
Knowledge representation and reasoning · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Usable security › security operations › security analytics
cyber threat intelligence |
0.9 | 1 | 2025 | SoK: Automated TTP Extraction from CTI Reports - Are We There Yet? · USENIX Security Symposium 2025 |
Network security › attack modeling
attack graph generation |
0.5 | 1 | 2021 | A Framework for Modeling Cyber Attack Techniques from Security Vulnerability Descriptions · KDD 2021 |
Network security
attack modeling |
0.5 | 1 | 2021 | A Framework for Modeling Cyber Attack Techniques from Security Vulnerability Descriptions · KDD 2021 |
Systems and software security
vulnerability analysis |
0.5 | 1 | 2021 | A Framework for Modeling Cyber Attack Techniques from Security Vulnerability Descriptions · KDD 2021 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge-based systems › rule-based systems
rule-based reasoning |
0.1 | 1 | 2021 | A Framework for Modeling Cyber Attack Techniques from Security Vulnerability Descriptions · KDD 2021 |
Methods — techniques the papers use, named apart from their topics
transition probability matrix · 1.0recurrent neural network · 1.0natural language processing · 1.0logistic regression · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | SoK: Automated TTP Extraction from CTI Reports - Are We There Yet?
Marvin Büchel, Tommaso Paladini, Stefano Longari, Michele Carminati, Stefano Zanero, Hodaya Binyamini, Gal Engelberg, Daniel Klein 0003, Giancarlo Guizzardi, Marco Caselli, Andrea Continella, Maarten van Steen, Andreas Peter 0001, Thijs van Ede |
USENIX Security Symposium | 6 |
| 2022 | HateVersarial: Adversarial Attack Against Hate Speech Detection Algorithms on TwitterabstractMachine learning (ML) models are commonly used to detect hate speech, which is considered one of the main challenges of online social networks. However, ML models have been shown to be vulnerable to well-crafted input samples referred to as adversarial examples. In this paper, we present an adversarial attack against hate speech detection models and explore the attack’s ability to: (1) prevent the detection of a hateful user, which should result in termination of the user’s account, and (2) classify normal users as hateful, which may lead to the termination of a legitimate user’s account. The attack is targeted at ML models that are trained on tabular, heterogeneous datasets (such as the datasets used for hate speech detection) and attempts to determine the minimal number of the most influential mutable features that should be altered in order to create a successful adversarial example. To demonstrate and evaluate the attack, we used the open and publicly available “Hateful Users on Twitter” dataset. We show that under a black-box assumption (i.e., the attacker does not have any knowledge on the attacked model), the attack has a 75% success rate, whereas under a white-box assumption (i.e., the attacker has full knowledge on the attacked model), the attack has an 88% success rate. Edita Grolman, Hodaya Binyamini, Asaf Shabtai, Yuval Elovici, Ikuya Morikawa, Toshiya Shimizu |
UMAP | 2 |
| 2021 | A Framework for Modeling Cyber Attack Techniques from Security Vulnerability DescriptionsabstractAttack graphs are one of the main techniques used to automate the cybersecurity risk assessment process. In order to derive a relevant attack graph, up-to-date information on known cyber attack techniques should be represented as interaction rules. However, designing and creating new interaction rules is a time consuming task performed manually by security experts. We present a novel, end-to-end, automated framework for modeling new attack techniques from the textual description of security vulnerabilities. Given a description of a security vulnerability, the proposed framework first extracts the relevant attack entities required to model the attack, completes missing information on the vulnerability, and derives a new interaction rule that models the attack; this new rule is then integrated within the MulVal attack graph tool. The proposed framework implements a novel data science pipeline that includes a dedicated cybersecurity linguistic model trained on the NVD repository, a recurrent neural network model used for attack entity extraction, a logistic regression model used for completing the missing information, and a transition probability matrix for automatically generating new interaction rule. We evaluated the performance of each of the individual algorithms, as well as the complete framework, and demonstrated its effectiveness. Hodaya Binyamini, Ron Biton, Masaki Inokuchi, Tomohiko Yagyu, Yuval Elovici, Asaf Shabtai |
KDD | 1 |