Yurun Chen 0002

dblp:387/5703-2 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2025
0009-0005-7088-7414ORCID · verified

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

Computer networks · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
4 papers
Cryptographic protocols and secure computation · 36% Security and privacy of machine learning · 12% Systems and software security · 12%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Storage systems · 68% Cloud and datacenter computing · 32%

Topics — the 12 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › distributed storage
decentralized storage
1.622025
DART: Distributed Zero Knowledge Data Auditing With Retrievability for Blockchain-Based Decentralized Storage Networks · IEEE Trans. Inf. Forensics Secur. 2025
EDCOMA: Enabling Efficient Double Compressed Auditing for Blockchain-Based Decentralized Storage · IEEE Trans. Serv. Comput. 2024
Security and privacy of machine learning
adversarial attack
0.912025
Evaluating the Robustness of Multimodal Agents Against Active Environmental Injection Attacks · ACM Multimedia 2025
Cryptographic protocols and secure computation › integrity auditing
cloud storage auditing
0.912025
S2A-P2FS: Secure Storage Auditing With Privacy-Preserving Flexible Data Sharing in Cloud-Assisted Industrial IoT · IEEE Trans. Mob. Comput. 2025
Cyber-physical and IoT security › industrial control system security
industrial iot security
0.912025
S2A-P2FS: Secure Storage Auditing With Privacy-Preserving Flexible Data Sharing in Cloud-Assisted Industrial IoT · IEEE Trans. Mob. Comput. 2025
Cryptographic primitives and cryptanalysis
message authentication codes
0.912025
S2A-P2FS: Secure Storage Auditing With Privacy-Preserving Flexible Data Sharing in Cloud-Assisted Industrial IoT · IEEE Trans. Mob. Comput. 2025
Systems and software security › operating system security
mobile OS security
0.912025
Evaluating the Robustness of Multimodal Agents Against Active Environmental Injection Attacks · ACM Multimedia 2025
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
0.912025
DART: Distributed Zero Knowledge Data Auditing With Retrievability for Blockchain-Based Decentralized Storage Networks · IEEE Trans. Inf. Forensics Secur. 2025
Cryptographic protocols and secure computation
provable data possession
0.812024
EDCOMA: Enabling Efficient Double Compressed Auditing for Blockchain-Based Decentralized Storage · IEEE Trans. Serv. Comput. 2024
Cloud and datacenter computing › cloud storage
storage auditing
0.812024
EDCOMA: Enabling Efficient Double Compressed Auditing for Blockchain-Based Decentralized Storage · IEEE Trans. Serv. Comput. 2024
Hardware security and side channels › hardware security primitives
physical unclonable function
0.312025
S2A-P2FS: Secure Storage Auditing With Privacy-Preserving Flexible Data Sharing in Cloud-Assisted Industrial IoT · IEEE Trans. Mob. Comput. 2025
Privacy and data protection
privacy-preserving data sharing
0.312025
S2A-P2FS: Secure Storage Auditing With Privacy-Preserving Flexible Data Sharing in Cloud-Assisted Industrial IoT · IEEE Trans. Mob. Comput. 2025
Blockchain and cryptocurrency security › blockchain data management
blockchain storage
0.212024
EDCOMA: Enabling Efficient Double Compressed Auditing for Blockchain-Based Decentralized Storage · IEEE Trans. Serv. Comput. 2024

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

zero-knowledge proofs · 3.3risk assessment · 1.7adversarial instruction injection · 1.7polynomial commitment · 1.5data authenticator compression · 1.5physical unclonable function · 0.9message authentication code · 0.9
YearPublicationVenuePosition
2025 Evaluating the Robustness of Multimodal Agents Against Active Environmental Injection Attacks
abstract
As researchers continue to optimize AI agents for more effective task execution within operating systems, they often overlook a critical security concern: the ability of these agents to detect ''impostors'' within their environment. Through an analysis of the agents' operational context, we identify a significant threat-attackers can disguise malicious attacks as environmental elements, injecting active disturbances into the agents' execution processes to manipulate their decision-making. We define this novel threat as the Active Environment Injection Attack (AEIA). Focusing on the interaction mechanisms of the Android OS, we conduct a risk assessment of AEIA and identify two critical security vulnerabilities: (1) Adversarial content injection in multimodal interaction interfaces, where attackers embed adversarial instructions within environmental elements to mislead agent decision-making; and (2) Reasoning gap vulnerabilities in the agent's task execution process, which increase susceptibility to AEIA attacks during reasoning. To evaluate the impact of these vulnerabilities, we propose AEIA-MN, an attack scheme that exploits interaction vulnerabilities in mobile operating systems to assess the robustness of MLLM-based agents. Experimental results show that even advanced MLLMs are highly vulnerable to this attack, achieving a maximum attack success rate of 93% on the AndroidWorld benchmark by combining two vulnerabilities.
Yurun Chen 0002, Xueyu Hu, Keting Yin, Juncheng Li 0006, Shengyu Zhang 0001
ACM Multimedia1
2025 DART: Distributed Zero Knowledge Data Auditing With Retrievability for Blockchain-Based Decentralized Storage Networks
Haiyang Yu 0001, Yurun Chen 0002, Shen Su, Jian Su 0001, Yuwen Chen 0002, Zhen Yang 0004
IEEE Trans. Inf. Forensics Secur.2
2025 S2A-P2FS: Secure Storage Auditing With Privacy-Preserving Flexible Data Sharing in Cloud-Assisted Industrial IoT
abstract
The rapid development of the Industrial Internet of Things (IIoT) has led to an explosion of industrial data. Due to computing and storage capacity limitations, IIoT devices often outsource the collected data to remote cloud servers. Unfortunately, cloud storage and cloud sharing services are not as reliable as they claim to be. Existing schemes aim to check data integrity in the cloud through cloud auditing. However, they suffer from a number of security and privacy vulnerabilities. The challenge of designing a secure storage auditing framework for industrial IoT comes from two aspects: 1) lack of physical protection of data owner IIoT devices; 2) privacy issues due to auditing of sensitive shared data. Inspired by the aforementioned challenges, we design the secure storage audit framework to support flexible cloud data sharing in IIoT: S2A-P2FS. The first contribution in our work is the Polynomial Prefix Message Authentication Code(P2MAC) design. We design an innovative P2MAC data structure as a label, which can simultaneously achieve efficient data verification in cloud data storage and privacy protection in flexible cloud data sharing for cloud auditing. The second contribution is the design of a unique Physical Unclonable Function(PUF) for IIoT. Harsh industrial conditions hinder the stable operation of PUFs. To protect the trustness of IIoT data owners, we propose a robust PUF-based physical protection mechanism for IIoT devices. The key point is that the required key is not stored in the memory of IIoT but hidden within its physical structure. A security analysis was conducted to demonstrate the robustness of S2A-P2FS against known vulnerabilities. A prototype was implemented in a real-world IIoT scenario. Experimental results indicate that, compared to state-of-the-art schemes, S2A-P2FS achieves over a 3x speedup in computational time and requires only 67.5% of the communication cost.
Xiaohu Shan, Haiyang Yu 0001, Yurun Chen 0002, Yuwen Chen 0002, Zhen Yang 0004
IEEE Trans. Mob. Comput.3
2024 EDCOMA: Enabling Efficient Double Compressed Auditing for Blockchain-Based Decentralized Storage
abstract
Blockchain technology, known for its decentralized and immutable nature, serves as the foundation for various applications. As a prominent application of blockchain, decentralized storage is powered by blockchain technology and is expected to provide a reliable and cost-effective alternative to traditional centralized storage. A major challenge in blockchain-powered decentralized storage is how to guarantee the quality of storage services in decentralized storage nodes (DSNs). Storage auditing can ensure the integrity and security of the stored data. Unfortunately, it incurs additional computational costs for data owners and extra storage overheads for DSNs, which thereby cannot be directly applied to decentralized storage networks consisting of nodes with various computation and storage capacity. In this article, we overcome these problems and minimize additional burdens in storage auditing. We propose EDCOMA, a computation and storage efficient auditing scheme for blockchain-based decentralized storage, in which a double compression method is designed to compress data authenticators using both data and polynomial commitment. To prevent replay attacks on double compression launched by DSNs, we introduce zero knowledge proof and design a compression arithmetic circuit to guarantee the execution of compression operations in DSNs. We analyze the security of EDCOMA under the random oracle model and conduct extensive experiments to evaluate the performance of EDCOMA. Experimental results affirm that EDCOMA outperforms state-of-the-art approaches in both computational and storage efficiency.
Haiyang Yu 0001, Yurun Chen 0002, Zhen Yang 0004, Yuwen Chen 0002, Shui Yu 0001
IEEE Trans. Serv. Comput.2