We provide new insights into an open problem recently posed by Yuan-Sun [ISIT 2025], concerning the minimum individual key rate required in the vector linear secure aggregation problem. Consider a distributed system with $K$ users, where each user $k\in [K]$ holds a data stream $W_k$ and an individual key $Z_k$. A server aims to compute a linear function $\mathbf{ F}[W_1;\ldots;W_K]$ without learning any information about another linear function $\mathbf{ G}[W_1;\ldots;W_K]$, where $[W_1;\ldots;W_K]$ denotes the row stack of $W_1,\ldots,W_K$. The open problem is to determine the minimum required length of $Z_k$, denoted as $R_k$, $k\in [K]$. In this paper, we characterize a new achievable region for the rate tuple $(R_1,\ldots,R_K)$. The region is polyhedral, with vertices characterized by a binary rate assignment $(R_1,\ldots,R_K) = (\mathbf{ 1}(1 \in \mathcal{ I}),\ldots,\mathbf{ 1}(K\in \mathcal{ I}))$, where $\mathcal{ I}\subseteq [K]$ satisfies the \textit{ rank-increment condition}: $\mathrm{ rank}\left(\bigl[\mathbf{ F}_{ \mathcal{ I}};\mathbf{ G}_{ \mathcal{ I}}\bigr]\right) =\mathrm{ rank}\bigl(\mathbf{ F}_{ \mathcal{ I}}\bigr)+N$. Here, $\mathbf{ F}_\mathcal{ I}$ and $\mathbf{ G}_\mathcal{ I}$ are the submatrices formed by the columns indexed by $\mathcal{ I}$. Our results uncover the novel fact that it is not necessary for every user to hold a key, thereby strictly enlarging the best-known achievable region in the literature. Furthermore, we provide a converse analysis to demonstrate its optimality when minimizing the number of users that hold keys.
Categories: cs.IT cs.CR cs.NI eess.SP math.IT