Source author record

Yujie Gu

Explore this author’s publications, collaborators and research topics. This catalog record has not been claimed by its author.

ResearcherUnclaimed source record

Catalog footprint

Research overview

3works
5topics
4close collaborators

Published work

3 publications

preprint2026arXiv

Vol-Mark: A Watermark for 3D Medical Volume Data Via Cubic Difference Expansion and Contrastive Learning

Today, advances in medical technology extensively utilize 3D volume data for accurate and efficient diagnostics. However, sharing these data across networks in telemedicine poses significant security risks of data tampering and unauthorized copying. To address these challenges, this paper proposes a novel reversible-zero watermarking approach, termed Vol-Mark, for medical volume data to protect their ownership and authenticity in telemedicine. The proposed Vol-Mark method offers two key benefits: 1) it designs a volume data feature extractor that leverages contrastive learning to efficiently extract discriminative and stable volumetric features, ensuring robustness against 3D attacks; 2) it introduces the cubic difference expansion (c-DE) technique, which leverages the 3D integer wavelet transform to embed watermark bits into neighboring voxels within cubes at low-frequency coefficients. The voxel differences within each cube are expanded to create embedding space, and a majority voting mechanism is employed during extraction to enhance reliability. The embedding process incurs low distortion and supports lossless removal, thereby preserving the integrity and diagnostic accuracy of medical volume data. Through these two benefits, Vol-Mark enables both integrity verification and ownership verification. Integrity verification is first performed, and ownership verification through hypothesis testing is further conducted to enhance reliability, particularly under data tampering or watermark removal attacks. Comprehensive experimental results show the effectiveness of the proposed method and its superior robustness against conventional, geometric, and hybrid attacks on medical volume data. In particular, through multiple tasks evaluations, Vol-Mark consistently achieves an ACC above 0.90 in most attack scenarios, outperforming existing methods by a clear margin.

preprint2020arXiv

On 22-parent-identifying set systems of block size 44

Parent-identifying set system is a kind of combinatorial structures with applications to broadcast encryption. In this paper we investigate the maximum number of blocks I2(n,4)I_2(n,4) in a 22-parent-identifying set system with ground set size nn and block size 44. The previous best known lower bound states that I2(n,4)=Ω(n4/3+o(1))I_2(n,4)=Ω(n^{4/3+o(1)}). We improve this lower bound by showing that I2(n,4)=Ω(n3/2−o(1))I_2(n,4)= Ω(n^{3/2-o(1)}) using techniques in additive number theory.

preprint2016arXiv

Bounds on Traceability Schemes

The Stinson-Wei traceability scheme (known as traceability scheme) was proposed for broadcast encryption as a generalization of the Chor-Fiat-Naor traceability scheme (known as traceability code). Cover-free family was introduced by Kautz and Singleton in the context of binary superimposed code. In this paper, we find a new relationship between a traceability scheme and a cover-free family, which strengthens the anti-collusion strength from tt to t2t^2, that is, a tt-traceability scheme is a t2t^2-cover-free family. Based on this interesting discovery, we derive new upper bounds for traceability schemes. By using combinatorial structures, we construct several infinite families of optimal traceability schemes which attain our new upper bounds. We also provide a constructive lower bound for traceability schemes, the size of which has the same order with our general upper bound. Meanwhile, we consider parent-identifying set system, an anti-collusion key-distributing scheme requiring weaker conditions than traceability scheme but stronger conditions than cover-free family. A new upper bound is also given for parent-identifying set systems.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

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