Researcher profile

Wenyuan Yang

Wenyuan Yang contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
7works
0followers
5topics
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

7 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.

preprint2023arXiv

Counting double cosets with application to generic 3-manifolds

We study the growth of double cosets in the class of groups with contracting elements, including relatively hyperbolic groups, CAT(0) groups and mapping class groups among others. Generalizing a recent work of Gitik and Rips about hyperbolic groups, we prove that the double coset growth of two Morse subgroups of infinite index is comparable with the orbital growth function. The same result is further obtained for a more general class of subgroups whose limit sets are proper subsets in the entire limit set of the ambient group. As an application, we confirm a conjecture of Maher that hyperbolic 3-manifolds are exponentially generic in the set of 3-manifolds built from Heegaard splitting using complexity in Teichmüller metric.

preprint2022arXiv

A Secure and Efficient Data Deduplication Scheme with Dynamic Ownership Management in Cloud Computing

Encrypted data deduplication is an important technique for saving storage space and network bandwidth, which has been widely used in cloud storage. Recently, a number of schemes that solve the problem of data deduplication with dynamic ownership management have been proposed. However, these schemes suffer from low efficiency when the dynamic ownership changes a lot. To this end, in this paper, we propose a novel server-side deduplication scheme for encrypted data in a hybrid cloud architecture, where a public cloud (Pub-CSP) manages the storage and a private cloud (Pri-CSP) plays a role as the data owner to perform deduplication and dynamic ownership management. Further, to reduce the communication overhead we use an initial uploader check mechanism to ensure only the first uploader needs to perform encryption, and adopt an access control technique that verifies the validity of the data users before they download data. Our security analysis and performance evaluation demonstrate that our proposed server-side deduplication scheme has better performance in terms of security, effectiveness, and practicability compared with previous schemes. Meanwhile, our method can efficiently resist collusion attacks and duplicate faking attacks.

preprint2021arXiv

Croke-Kleiner admissible groups: Property (QT) and quasiconvexity

Croke-Kleiner admissible groups firstly introduced by Croke-Kleiner belong to a particular class of graph of groups which generalize fundamental groups of $3$--dimensional graph manifolds. In this paper, we show that if $G$ is a Croke-Kleiner admissible group, acting geometrically on a CAT(0) space $X$, then a finitely generated subgroup of $G$ has finite height if and only if it is strongly quasi-convex. We also show that if $G \curvearrowright X$ is a flip CKA action then $G$ is quasi-isometric embedded into a finite product of quasi-trees. With further assumption on the vertex groups of the flip CKA action $G \curvearrowright X$, we show that $G$ satisfies property (QT) that is introduced by Bestvina-Bromberg-Fujiwara.

preprint2020arXiv

BDTF: A Blockchain-Based Data Trading Framework with Trusted Execution Environment

The need for data trading promotes the emergence of data market. However, in conventional data markets, both data buyers and data sellers have to use a centralized trading platform which might be dishonest. A dishonest centralized trading platform may steal and resell the data seller's data, or may refuse to send data after receiving payment from the data buyer. It seriously affects the fair data transaction and harm the interests of both parties to the transaction. To address this issue, we propose a novel blockchain-based data trading framework with Trusted Execution Environment (TEE) to provide a trusted decentralized platform for fair data trading. In our design, a blockchain network is proposed to realize the payments from data buyers to data sellers, and a trusted exchange is built by using a TEE for the first time to achieve fair data transmission. With these help, data buyers and data sellers can conduct transactions directly. We implement our proposed framework on Ethereum and Intel SGX, security analysis and experimental results have demonstrated that the framework proposed can effectively guarantee the fair completion of data tradings.

preprint2020arXiv

Large quotients of group actions with a contracting element

For any proper action of a non-elementary group $G$ on a proper geodesic metric space, we show that if $G$ contains a contracting element, then there exists a sequence of proper quotient groups whose growth rate tends to the growth rate of $G$. Similar statements are obtained for a product of proper actions with contracting elements. The tools involved in this paper include the extension lemma for the construction of large tree, the theory of rotating families developed by F. Dahmani, V. Guirardel and D. Osin, and the construction of a quasi-tree of metric spaces introduced by M. Bestvina, K. Bromberg and K. Fujiwara. Several applications are given to CAT(0) groups and mapping class groups.

preprint2020arXiv

Quasiconvexity in $3$-manifold groups

In this paper, we study strongly quasiconvex subgroups in a finitely generated $3$--manifold group $π_1(M)$. We prove that if $M$ is a compact, orientable $3$--manifold that does not have a summand supporting the Sol geometry in its sphere-disc decomposition then a finitely generated subgroup $H \le π_1(M)$ has finite height if and only if $H$ is strongly quasiconvex. On the other hand, if $M$ has a summand supporting the Sol geometry in its sphere-disc decomposition then $π_1(M)$ contains finitely generated, finite height subgroups which are not strongly quasiconvex. We also characterize strongly quasiconvex subgroups of graph manifold groups by using their finite height, their Morse elements, and their actions on the Bass-Serre tree of $π_1(M)$. This result strengthens analogous results in right-angled Artin groups and mapping class groups. Finally, we characterize hyperbolic strongly quasiconvex subgroups of a finitely generated $3$--manifold group $π_1(M)$ by using their undistortedness property and their Morse elements.