Researcher profile

Zhen Sun

Zhen Sun contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 19 - UnverifiedVerification L1Unclaimed author
5works
0followers
8topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

5 published item(s)

preprint2026arXiv

Stego Battlefield: Evaluating Image Steganography Attacks and Steganalysis Defenses

Image steganography is widely used to protect user privacy and enable covert communication. However, it can also be abused by the adversary as a covert channel to bypass content moderation, disseminate harmful semantics, and even hide malicious instructions in images to elicit dangerous outputs from large models, posing a practical security risk that continues to evolve. To address the lack of a unified and systematic evaluation framework, we propose SADBench, a systematic benchmark that assesses the adversary's ability to inject harmful secrets via steganography and the defender's ability to detect such threats through steganalysis. Crucially, SADBench comprises $4$ core tasks, namely steganography attack capability evaluation, steganalysis defense capability evaluation, efficiency evaluation, and transferability evaluation. It evaluates both image-payload and text-payload steganography across diverse cover distributions, utilizing harmful visual semantics and toxic instructions to simulate malicious attacks. Across a broad set of attacks and detectors, SADBench reveals that (i) INN and autoencoder-based methods demonstrate superior stability compared to other architectures, (ii) in-domain detection is near-perfect and cheaper than generation, (iii) a critical asymmetry exists in transferability where attacks robustly generalize to new distributions while detectors fail to adapt, and (iv) real-world threats persist on social media, where payloads either survive minimal compression or effectively adapt to aggressive compression via simulated training. Overall, SADBench establishes a systematic, reproducible, and extensible framework to quantify risks, paving the way for measurable and security-driven advancements in steganography defense.

preprint2020arXiv

Attention-SLAM: A Visual Monocular SLAM Learning from Human Gaze

This paper proposes a novel simultaneous localization and mapping (SLAM) approach, namely Attention-SLAM, which simulates human navigation mode by combining a visual saliency model (SalNavNet) with traditional monocular visual SLAM. Most SLAM methods treat all the features extracted from the images as equal importance during the optimization process. However, the salient feature points in scenes have more significant influence during the human navigation process. Therefore, we first propose a visual saliency model called SalVavNet in which we introduce a correlation module and propose an adaptive Exponential Moving Average (EMA) module. These modules mitigate the center bias to enable the saliency maps generated by SalNavNet to pay more attention to the same salient object. Moreover, the saliency maps simulate the human behavior for the refinement of SLAM results. The feature points extracted from the salient regions have greater importance in optimization process. We add semantic saliency information to the Euroc dataset to generate an open-source saliency SLAM dataset. Comprehensive test results prove that Attention-SLAM outperforms benchmarks such as Direct Sparse Odometry (DSO), ORB-SLAM, and Salient DSO in terms of efficiency, accuracy, and robustness in most test cases.

preprint2020arXiv

Experimental free-space quantum secure direct communication and its security analysis

We report an experimental implementation of free-space quantum secure direct communication based on single photons. The quantum communication scheme uses phase encoding, and the asymmetric Mach-Zehnder interferometer is optimized so as to automatically compensate phase drift of the photons during their transitions over the free-space medium. An information transmission rate of 500 bps over a 10-meter free space with a mean quantum bit error rate of 0.49%$\pm$0.27% is achieved. The security is analyzed under the scenario that Eve performs collective attack and photon number splitting collective attack. Our results show that quantum secure direct communication is feasible in free space.

preprint2020arXiv

Similarity and delay between two non-narrow-band time signals

Correlation coefficient is usually used to measure the correlation degree between two time signals. However, its performance will drop or even fail if the signals are noised. Based on the time-frequency phase spectrum (TFPS) provided by normal time-frequency transform (NTFT), similarity coefficient is proposed to measure the similarity between two non-narrow-band time signals, even if the signals are noised. The basic idea of the similarity coefficient is to translate the interest part of signal f1(t)'s TFPS along the time axis to couple with signal f2(t)'s TFPS. Such coupling would generate a maximum if f1(t)and f2(t) are really similar to each other in time-frequency structure. The maximum, if normalized, is called similarity coefficient. The location of the maximum indicates the time delay between f1(t) and f2(t). Numerical results show that the similarity coefficient is better than the correlation coefficient in measuring the correlation degree between two noised signals. Precision and accuracy of the time delay estimation (TDE) based on the similarity analysis are much better than those based on cross-correlation (CC) method and generalized CC (GCC) method under low SNR.

preprint2019arXiv

An Adaptive Moving Finite Element Method for Steady Low Mach Number Compressible Combustion Problems

This work surveys an r-adaptive moving mesh finite element method for the numerical solution of premixed laminar flame problems. Since the model of chemically reacting flow involves many different modes with diverse length scales, the computation of such a problem is often extremely time-consuming. Importantly, to capture the significant characteristics of the flame structure when using detailed chemistry, a much more stringent requirement on the spatial resolution of the interior layers of some intermediate species is necessary. Here, we propose a moving mesh method in which the mesh is obtained from the solution of so-called moving mesh partial differential equations. Such equations result from the variational formulation of a minimization problem for a given target functional that characterizes the inherent difficulty in the numerical approximation of the underlying physical equations. Adaptive mesh movement has emerged as an area of intense research in mesh adaptation in the last decade. With this approach points are only allowed to be shifted in space leaving the topology of the grid unchanged. In contrast to methods with local refinement, data structure hence is unchanged and load balancing is not an issue as grid points remain on the processor where they are. We will demonstrate the high potential of moving mesh methods for effectively optimizing the distribution of grid points to reach the required resolution for chemically reacting flows with extremely thin boundary layers.