Demo Data from SIGIR 2026 / reviewers in the wild / expert
Tianli Yang
dblp:384/1886
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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
1 paper |
Security and privacy of machine learning · 50% Network security · 50% | |
| Artificial intelligence
1 paper |
Vision and language · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Vision and language › vision-language model
vision-language model efficiency |
1.0 | 1 | 2026 | Hidden Tail: Adversarial Attack for Stealthy Resource Consumption Against Vision-Language Models · IEEE Trans. Dependable Secur. Comput. 2026 |
Security and privacy of machine learning
adversarial attack |
1.0 | 1 | 2026 | Hidden Tail: Adversarial Attack for Stealthy Resource Consumption Against Vision-Language Models · IEEE Trans. Dependable Secur. Comput. 2026 |
Network security › attack strategy › denial-of-service attack
resource exhaustion attack |
1.0 | 1 | 2026 | Hidden Tail: Adversarial Attack for Stealthy Resource Consumption Against Vision-Language Models · IEEE Trans. Dependable Secur. Comput. 2026 |
Methods — techniques the papers use, named apart from their topics
composite loss function · 2.0adversarial image optimization · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Hidden Tail: Adversarial Attack for Stealthy Resource Consumption Against Vision-Language ModelsabstractVision-Language Models (VLMs) are increasingly deployed in real-world applications, but their high inference cost makes them vulnerable to resource consumption attacks. Prior attacks attempt to extend VLM output sequences by optimizing adversarial images, thereby increasing inference costs. However, these extended outputs often introduce irrelevant abnormal content, compromising attack stealthiness. This trade-off between effectiveness and stealthiness poses a major limitation for existing attacks. To address this challenge, we proposeHidden Tail, a stealthy resource consumption attack that crafts prompt-agnostic adversarial images, inducing VLMs to generate maximum-length outputs by appending special tokens invisible to users. Our method employs a composite loss function that balances semantic preservation, repetitive special token induction, and suppression of the end-of-sequence (EOS) token, optimized via a dynamic weighting strategy. Extensive experiments show thatHidden Tailoutperforms existing attacks, increasing output length by up to 19.2× and reaching the maximum token limit, while preserving attack stealthiness. These results highlight the urgent need to improve the robustness of VLMs against efficiency-oriented adversarial threats. Our code is available athttps://github.com/zhangrui4041/Hidden_Tail. Rui Zhang 0086, Tianli Yang, Wenbo Jiang 0001, Rui Zhang 0090, Qingchuan Zhao, Hongwei Li 0001, Yang Liu 0003, Guowen Xu |
IEEE Trans. Dependable Secur. Comput. | 3 |
| 2024 | Attack Risk Analysis in Data Anonymization in Internet of ThingsabstractAn enormous volume of data is generated in the Internet of Things (IoT), which needs to be anonymized before sharing with public or third parties to minimize reidentification risk and protect sensitive information. Data anonymization techniques can remove information capable of identifying individuals. However, inappropriate data anonymization can increase the risk of reidentification. This work focuses on potential attack risks of anonymized data by evaluating the potential attack risks. Specifically, we analyzed the attack risks over anonymized data with both randomization and generalization techniques. We also analyzed the risk of reidentification for five commonly used data anonymization techniques. The experimental results demonstrate that the proposed solution can well evaluate the potential attack risks. Tianli Yang, Shancang Li, Muddesar Iqbal, Dhafer Al-Makhles |
IEEE Trans. Comput. Soc. Syst. | 1 |