Searcharxiv⌕ Search

arXiv subjects

Jiejing Wen

Publications and source records attributed to Jiejing Wen.

7 recordsLinked to original sources

Beyond Vector Hiding: Breaking and Mitigating Shared-Direction Weight Obfuscation in TEE-Offloaded Large Language Models

Trusted Execution Environment (TEE)-shielded partitioning of Large Language Models (LLMs) accelerates on-device inference by offloading obfuscated linear layers to an untrusted accelerator while retaining only a small correction inside the TEE. However, earlier lightweight obfuscation schemes preserved weight-vector directions and were broken by ArrowMatch. To defend against this attack, ArrowCloak injects scalar multiples of the same hidden direction into all weight vectors, enabling lightweight trusted correction. We show that this reuse leaves a rank-one relation across the complete accelerator-visible matrix. For the released real-valued scheme, we propose SpectralLeak, which estimates and removes the shared component. Across 12 task settings, its surrogates achieve $87.98\%$ mean accuracy versus $89.85\%$ for the victims. In our defense-favorable mod-$Q$ realization of ArrowCloak's published modular security formulation, mod-$Q$ arithmetic suppresses this spectral signal but retains the algebraic rank-one relation modulo $Q$. We therefore propose LatticeLeak, which exploits the resulting hidden lattice. In our BERT-Base and GPT2-Base experiments, it reconstructs every protected fixed-point parameter exactly; across all evaluated architectures, the reconstructed models retain victim-level task accuracy without victim queries, labels, or fine-tuning. These findings identify shared rank-one reuse as the root cause of the leakage exploited by our attacks. Guided by this insight, we design ButterflyCloak, a keyed maximal-rank butterfly mask that replaces the reused direction with distinct mask rows while retaining fast trusted correction...

cs.CR↗

New $X$-Secure $T$-Private Information Retrieval Schemes via Rational Curves and Hermitian Curves

$X$-secure and $T$-private information retrieval (XSTPIR) is a variant of private information retrieval where data security is guaranteed against collusion among up to $X$ servers and the user's retrieval privacy is guaranteed against collusion among up to $T$ servers. Recently, researchers have constructed XSTPIR schemes through the theory of algebraic geometry codes and algebraic curves, with the aim of obtaining XSTPIR schemes that have higher maximum PIR rates for fixed field size and $X,T$ (the number of servers $N$ is not restricted). The mainstream approach is to employ curves of higher genus that have more rational points, evolving from rational curves to elliptic curves to hyperelliptic curves and, most recently, to Hermitian curves. In this paper, we propose a different perspective: with the shared goal of constructing XSTPIR schemes with higher maximum PIR rates, we move beyond the mainstream approach of seeking curves with higher genus and more rational points. Instead, we aim to achieve this goal by enhancing the utilization efficiency of rational points on curves that have already been considered in previous work. By introducing a family of bases for the polynomial space $\text{span}_{\mathbb{F}_q}\{1,x,\dots,x^{k-1}\}$ as an alternative to the Lagrange interpolation basis, we develop two new families of XSTPIR schemes based on rational curves and Hermitian curves, respectively. Parameter comparisons demonstrate that our schemes achieve superior performance. Specifically, our Hermitian-curve-based XSTPIR scheme provides the largest known maximum PIR rates when the field size $q^2\geq 14^2$ and $X+T\geq 4q$. Moreover, for any field size $q^2\geq 28^2$ and $X+T\geq 4$, our two XSTPIR schemes collectively provide the largest known maximum PIR rates.

cs.IT↗

Constructions on Real Approximate Mutually Unbiased Bases

Mutually unbiased bases (MUB) have many applications in quantum information processing and quantum cryptography. Several complex MUB's in $\mathbb{C}^d$ for some dimension $d$ and with larger size have been constructed. On the other hand, real MUB's with larger size are rare which lead to consider constructing approximate MUB (AMUB). In this paper we present a general and useful way to get real AMUB in $\mathbb{R}^{2d}$ from any complex AMUB in $\mathbb{C}^d$. From this method we present many new series of real AMUB's with parameters better than previous results.

quant-ph↗

Linear Codes Of 2-Designs As Subcodes Of The Extended Generalized Reed-Muller Codes

This paper is concerned with the affine-invariant ternary codes which are defined by Hermitian functions. We compute the incidence matrices of 2-designs that are supported by the minimum weight codewords of these ternary codes. The linear codes generated by the rows of these incidence matrix are subcodes of the extended codes of the 4-th order generalized Reed-Muller codes and they also hold 2-designs. Finally, we give the dimensions and lower bound of the minimum weights of these linear codes.

cs.IT↗

Cyclotomic Construction of Strong External Difference Families in Finite Fields

Strong external difference family (SEDF) and its generalizations GSEDF, BGSEDF in a finite abelian group $G$ are combinatorial designs raised by Paterson and Stinson [7] in 2016 and have applications in communication theory to construct optimal strong algebraic manipulation detection codes. In this paper we firstly present some general constructions of these combinatorial designs by using difference sets and partial difference sets in $G$. Then, as applications of the general constructions, we construct series of SEDF, GSEDF and BGSEDF in finite fields by using cyclotomic classes.

cs.IT↗

The $(n,m,k,λ)$-Strong External Difference Family with $m \geq 5$ Exists

The notion of strong external difference family (SEDF) in a finite abelian group $(G,+)$ is raised by M. B. Paterson and D. R. Stinson [5] in 2016 and motivated by its application in communication theory to construct $R$-optimal regular algebraic manipulation detection code. A series of $(n,m,k,λ)$-SEDF's have been constructed in [5, 4, 2, 1] with $m=2$. In this note we present an example of (243, 11, 22, 20)-SEDF in finite field $\mathbb{F}_q$ $(q=3^5=243).$ This is an answer for the following problem raised in [5] and continuously asked in [4, 2, 1]: if there exists an $(n,m,k,λ)$-SEDF for $m\geq 5$.

cs.IT↗