arXiv subjects

Hua Sun

Publications and source records attributed to Hua Sun.

At least 73 records · Page 4Linked to original sources

arXiv2020

Expand-and-Randomize: An Algebraic Approach to Secure Computation

We consider the secure computation problem in a minimal model, where Alice and Bob each holds an input and wish to securely compute a function of their inputs at Carol without revealing any additional information about the inputs. For this minimal secure computation problem, we propose a novel coding scheme built from two steps. First, the function to be computed is expanded such that it can be recovered while additional information might be leaked. Second, a randomization step is applied to the expanded function such that the leaked information is protected. We implement this expand-and-randomize coding scheme with two algebraic structures - the finite field and the modulo ring of integers, where the expansion step is realized with the addition operation and the randomization step is realized with the multiplication operation over the respective algebraic structures.

cs.IT↗

arXiv2019

A class of prime fusion categories of dimension $2^N$

We study a class of strictly weakly integral fusion categories $\mathfrak{I}_{N, ζ}$, where $N \geq 1$ is a natural number and $ζ$ is a $2^N$th root of unity, that we call $N$-Ising fusion categories. An $N$-Ising fusion category has Frobenius-Perron dimension $2^{N+1}$ and is a graded extension of a pointed fusion category of rank 2 by the cyclic group of order $\mathbb Z_{2^N}$. We show that every braided $N$-Ising fusion category is prime and also that there exists a slightly degenerate $N$-Ising braided fusion category for all $N > 2$. We also prove a structure result for braided extensions of a rank 2 pointed fusion category in terms of braided $N$-Ising fusion categories.

math.QA↗

arXiv2019

Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding

The capacity of private information retrieval (PIR) from databases coded using maximum distance separable (MDS) codes has been previously characterized by Banawan and Ulukus, where it was assumed that the messages are encoded and stored separably into the databases. This assumption was also usually taken in other related works in the literature, and this capacity is usually referred to as the MDS-PIR capacity colloquially. In this work, we considered the question if and when this capacity barrier can be broken through joint encoding and storing of the messages. Our main results are two classes of novel code constructions which allow joint encoding as well as the corresponding PIR protocols, which indeed outperform the separate MDS-coded systems. Moreover, we show that a simple but novel expansion technique allows us to generalize these two classes of codes, resulting in a wider range of the cases where this capacity barrier can be broken.

cs.IT↗

arXiv2019

Private Information Delivery

We introduce the problem of private information delivery (PID), comprised of $K$ messages, a user, and $N$ servers (each holds $M\leq K$ messages) that wish to deliver one out of $K$ messages to the user privately, i.e., without revealing the delivered message index to the user. The information theoretic capacity of PID, $C$, is defined as the maximum number of bits of the desired message that can be privately delivered per bit of total communication to the user. For the PID problem with $K$ messages, $N$ servers, $M$ messages stored per server, and $N \geq \lceil \frac{K}{M} \rceil$, we provide an achievable scheme of rate $1/\lceil \frac{K}{M} \rceil$ and an information theoretic converse of rate $M/K$, i.e., the PID capacity satisfies $1/\lceil \frac{K}{M} \rceil \leq C \leq M/K$. This settles the capacity of PID when $\frac{K}{M}$ is an integer. When $\frac{K}{M}$ is not an integer, we show that the converse rate of $M/K$ is achievable if $N \geq \frac{K}{\gcd(K,M)} - (\frac{M}{\gcd(K,M)}-1)(\lfloor \frac{K}{M} \rfloor -1)$, and the achievable rate of $1/\lceil \frac{K}{M} \rceil$ is optimal if $N = \lceil \frac{K}{M} \rceil$. Otherwise if $\lceil \frac{K}{M} \rceil < N < \frac{K}{\gcd(K,M)} - (\frac{M}{\gcd(K,M)}-1)(\lfloor \frac{K}{M} \rfloor -1)$, we give an improved achievable scheme and prove its optimality for several small settings.

cs.IT↗

arXiv2019

On the Capacity of Computation Broadcast

The two-user computation broadcast problem is introduced as the setting where User $1$ wants message $W_1$ and has side-information $W_1'$, User $2$ wants message $W_2$ and has side-information $W_2'$, and $(W_1, W_1', W_2, W_2')$ may have arbitrary dependencies. The rate of a computation broadcast scheme is defined as the ratio $H(W_1,W_2)/H(S)$, where $S$ is the information broadcast to both users to simultaneously satisfy their demands. The supremum of achievable rates is called the capacity of computation broadcast $C_{CB}$. It is shown that $C_{CB}\leq H(W_1,W_2)/\left[H(W_1|W_1')+H(W_2|W_2')-\min\Big(I(W_1; W_2, W_2'|W_1'), I(W_2; W_1, W_1'|W_2')\Big)\right]$. For the linear computation broadcast problem, where $W_1, W_1', W_2, W_2'$ are comprised of arbitrary linear combinations of a basis set of independent symbols, the bound is shown to be tight. For non-linear computation broadcast, it is shown that this bound is not tight in general. Examples are provided to prove that different instances of computation broadcast that have the same entropic structure, i.e., the same entropy for all subsets of $\{W_1,W_1',W_2,W_2'\}$, can have different capacities. Thus, extra-entropic structure matters even for two-user computation broadcast. The significance of extra-entropic structure is further explored through a class of non-linear computation broadcast problems where the extremal values of capacity are shown to correspond to minimally and maximally structured problems within that class.

cs.IT↗

arXiv2019

Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost

We propose a new capacity-achieving code for the private information retrieval (PIR) problem, and show that it has the minimum message size (being one less than the number of servers) and the minimum upload cost (being roughly linear in the number of messages) among a general class of capacity-achieving codes, and in particular, among all capacity-achieving linear codes. Different from existing code constructions, the proposed code is asymmetric, and this asymmetry appears to be the key factor leading to the optimal message size and the optimal upload cost. The converse results on the message size and the upload cost are obtained by a strategic analysis of the information theoretic proof of the PIR capacity, from which a set of critical properties of any capacity-achieving code in the code class of interest is extracted. The symmetry structure of the PIR problem is then analyzed, which allows us to construct symmetric codes from asymmetric ones, yielding a meaningful bridge between the proposed code and existing ones in the literature.

cs.IT↗

arXiv2019

Cross Subspace Alignment and the Asymptotic Capacity of $X$-Secure $T$-Private Information Retrieval

$X$-secure and $T$-private information retrieval (XSTPIR) is a form of private information retrieval where data security is guaranteed against collusion among up to $X$ servers and the user's privacy is guaranteed against collusion among up to $T$ servers. The capacity of XSTPIR is characterized for arbitrary number of servers $N$, and arbitrary security and privacy thresholds $X$ and $T$, in the limit as the number of messages $K\rightarrow\infty$. Capacity is also characterized for any number of messages if either $N=3, X=T=1$ or if $N\leq X+T$. Insights are drawn from these results, about aligning versus decoding noise, dependence of PIR rate on field size, and robustness to symmetric security constraints. In particular, the idea of cross subspace alignment, i.e., introducing a subspace dependence between Reed-Solomon code parameters, emerges as the optimal way to align undesired terms while keeping desired terms resolvable.

cs.IT↗

arXiv2018

On the Capacity of Locally Decodable Codes

A locally decodable code (LDC) maps $K$ source symbols, each of size $L_w$ bits, to $M$ coded symbols, each of size $L_x$ bits, such that each source symbol can be decoded from $N \leq M$ coded symbols. A perfectly smooth LDC further requires that each coded symbol is uniformly accessed when we decode any one of the messages. The ratio $L_w/L_x$ is called the symbol rate of an LDC. The highest possible symbol rate for a class of LDCs is called the capacity of that class. It is shown that given $K, N$, the maximum value of capacity of perfectly smooth LDCs, maximized over all code lengths $M$, is $C^*=N\left(1+1/N+1/N^2+\cdots+1/N^{K-1}\right)^{-1}$. Furthermore, given $K, N$, the minimum code length $M$ for which the capacity of a perfectly smooth LDC is $C^*$ is shown to be $M = N^K$. Both of these results generalize to a broader class of LDCs, called universal LDCs. The results are then translated into the context of PIR$_{\max}$, i.e., Private Information Retrieval subject to maximum (rather than average) download cost metric. It is shown that the minimum upload cost of capacity achieving PIR$_{\max}$ schemes is $(K-1)\log N$. The results also generalize to a variation of the PIR problem, known as Repudiative Information Retrieval (RIR).

cs.IT↗

arXiv2018

The Capacity of Private Information Retrieval with Eavesdroppers

We consider the problem of private information retrieval (PIR) with colluding servers and eavesdroppers (abbreviated as ETPIR). The ETPIR problem is comprised of $K$ messages, $N$ servers where each server stores all $K$ messages, a user who wants to retrieve one of the $K$ messages without revealing the desired message index to any set of $T$ colluding servers, and an eavesdropper who can listen to the queries and answers of any $E$ servers but is prevented from learning any information about the messages. The information theoretic capacity of ETPIR is defined to be the maximum number of desired message symbols retrieved privately per information symbol downloaded. We show that the capacity of ETPIR is $C = \left( 1- \frac{E}{N} \right) \left(1 + \frac{T-E}{N-E} + \cdots + \left( \frac{T-E}{N-E} \right)^{K-1} \right)^{-1}$ when $E < T$, and $C = \left( 1 - \frac{E}{N} \right)$ when $E \geq T$. To achieve the capacity, the servers need to share a common random variable (independent of the messages), and its size must be at least $\frac{E}{N} \cdot \frac{1}{C}$ symbols per message symbol. Otherwise, with less amount of shared common randomness, ETPIR is not feasible and the capacity reduces to zero. An interesting observation is that the ETPIR capacity expression takes different forms in two regimes. When $E < T$, the capacity equals the inverse of a sum of a geometric series with $K$ terms and decreases with $K$; this form is typical for capacity expressions of PIR. When $E \geq T$, the capacity does not depend on $K$, a typical form for capacity expressions of SPIR (symmetric PIR, which further requires data-privacy, {\it i.e.,} the user learns no information about other undesired messages); the capacity does not depend on $T$ either. In addition, the ETPIR capacity result includes multiple previous PIR and SPIR capacity results as special cases.

cs.IT↗

arXiv2018

The $ε$-error Capacity of Symmetric PIR with Byzantine Adversaries

The capacity of symmetric private information retrieval with $K$ messages, $N$ servers (out of which any $T$ may collude), and an omniscient Byzantine adversary (who can corrupt any $B$ answers) is shown to be $1 - \frac{T+2B}{N}$ [1], under the requirement of zero probability of error. In this work, we show that by weakening the adversary slightly (either providing secret low rate channels between the servers and the user, or limiting the observation of the adversary), and allowing vanishing probability of error, the capacity increases to $1 - \frac{T+B}{N}$.

cs.IT↗

arXiv2018

Opportunistic Treating Interference as Noise

We consider a $K$-user interference network with $M$ states, where each transmitter has $M$ messages and over State $m$, Receiver $k$ wishes to decode the first $π_k(m) \in \{1,2,\cdots,M\}$ messages from its desired transmitter. This problem of channel with states models opportunistic communications, where more messages are sent for better channel states. The first message from each transmitter has the highest priority as it is required to be decoded regardless of the state of the receiver; the second message is opportunistically decoded if the state allows a receiver to decode 2 messages; and the $M$-th message has the lowest priority as it is decoded if and only if the receiver wishes to decode all $M$ messages. For this interference network with states, we show that if any possible combination of the channel states satisfies a condition under which power control and treating interference as noise (TIN) are sufficient to achieve the entire generalized degrees of freedom (GDoF) region of this channel state by itself, then a simple layered superposition encoding scheme with power control and a successive decoding scheme with TIN achieves the entire GDoF region of the network with $M$ states for all $KM$ messages.

cs.IT↗

arXiv2018

Braided extensions of a rank $2$ fusion category

We classify braided extensions $C$ of a rank $2$ fusion category. The result shows that $C$ is tensor equivalent to a Deligne's tensor product of some known categories, except $C$ is slightly degenerate and generated by a $\sqrt{2}$-dimensional simple object. To start with, we describe the fusion rules, universal grading group, and the Frobenius-Perron dimensions of simple objects of $C$ without the restriction that $C$ is braided.

math.QA↗

arXiv2018

Green ring of the category of weight modules over the Hopf-Ore extensions of group algebras

In this paper, we continue our study of the tensor product structure of category $\mathcal W$ of weight modules over the Hopf-Ore extensions $kG(χ^{-1}, a, 0)$ of group algebras $kG$, where $k$ is an algebraically closed field of characteristic zero. We first describe the tensor product decomposition rules for all indecomposable weight modules under the assumption that the orders of $χ$ and $χ(a)$ are different. Then we describe the Green ring $r(\mathcal W)$ of the tensor category $\mathcal W$. It is shown that $r(\mathcal W)$ is isomorphic to the polynomial algebra over the group ring $\mathbb{Z}\hat{G}$ in one variable when $|χ(a)|=|χ|=\infty$, and that $r(\mathcal W)$ is isomorphic to the quotient ring of the polynomial algebra over the group ring $\mathbb{Z}\hat{G}$ in two variables modulo a principle ideal when $|χ(a)|<|χ|=\infty$. When $|χ(a)|\le|χ|<\infty$, $r(\mathcal W)$ is isomorphic to the quotient ring of a skew group ring $\mathbb{Z}[X]\sharp\hat{G}$ modulo some ideal, where $\mathbb{Z}[X]$ is a polynomial algebra over $\mathbb{Z}$ in infinitely many variables.

math.RA↗

arXiv2018

Tensor product decomposition rules for weight modules over the Hopf-Ore extensions of group algebras

In this paper, we investigate the tensor structure of the category of finite dimensional weight modules over the Hopf-Ore extensions $kG(χ^{-1}, a, 0)$ of group algebras $kG$. The tensor product decomposition rules for all indecomposable weight modules are explicitly given under the assumptions that $k$ is an algebraically closed field of characteristic zero, and the orders of $χ$ and $χ(a)$ are the same.

math.RT↗

arXiv2018

A new class of refined Eulerian polynomials

In this note we introduce a new class of refined Eulerian polynomials defined by $$A_n(p,q)=\sum_{π\in\mathfrak{S}_n}p^{{\rm odes}(π)}q^{{\rm edes}(π)},$$ where ${\rm odes}(π)$ and ${\rm edes}(π)$ enumerate the number of descents of permutation $π$ in odd and even positions, respectively. We show that the refined Eulerian polynomials $A_{2k+1}(p,q),k=0,1,2,\ldots,$ and $(1+q)A_{2k}(p,q),k=1,2,\ldots,$ have a nice symmetry property.

math.CO↗

arXiv2018

The Capacity of Anonymous Communications

We consider the communication scenario where K transmitters are each connected to a common receiver with an orthogonal noiseless link. One of the transmitters has a message for the receiver, who is prohibited from learning anything in the information theoretic sense about which transmitter sends the message (transmitter anonymity is guaranteed). The capacity of anonymous communications is the maximum number of bits of desired information that can be anonymously communicated per bit of total communication. For this anonymous communication problem over a parallel channel with K transmitters and 1 receiver, we show that the capacity is 1/K, i.e., to communicate 1 bit anonymously, each transmitter must send a 1 bit signal. Further, it is required that each transmitter has at least 1 bit correlated randomness (that is independent of the messages) per message bit and the size of correlated randomness at all K transmitters is at least K-1 bits per message bit.

cs.IT↗

arXiv2018

Optical tristability and ultrafast Fano switching in nonlinear magneto-plasmonic nanoparticles

We consider light scattering by a coated magneto-plasmonic nanoparticle (MPNP) with a Kerr-type nonlinear plasmonic shell and a magneto-optic core. Such structure features two plasmon dipole modes, associated with electronic oscillations on the inner and outer surfaces of the shell. Driven in a nonlinear regime, each mode exhibits a bistable response. Bistability of an inner plasmon leads to switching between this state and a Fano resonance (Fano switching). Once the external light intensity exceeds the critical value, the bistability zones of both eigen modes overlap yielding optical tristability characterized by three stable steady states for a given wavelength and light intensity. We develop a dynamic theory of transitions between nonlinear steady states and estimate the characteristic switching time as short as 0.5 ps. We also show that the magneto-optical (MO) effect allows red- and blue- spectral shift of the Fano profile for right- and left- circular polarizations of the external light, rendering Fano switching sensitive to the light polarization. Specifically, one can reach Fano switching for the right circular polarization while cancelling it for the left circular polarization. Our results point to a novel class of ultrafast Fano switchers tunable by magnetic field for applications in nanophotonics.

physics.optics↗

arXiv2017

The Capacity of Private Computation

We introduce the problem of private computation, comprised of $N$ distributed and non-colluding servers, $K$ independent datasets, and a user who wants to compute a function of the datasets privately, i.e., without revealing which function he wants to compute, to any individual server. This private computation problem is a strict generalization of the private information retrieval (PIR) problem, obtained by expanding the PIR message set (which consists of only independent messages) to also include functions of those messages. The capacity of private computation, $C$, is defined as the maximum number of bits of the desired function that can be retrieved per bit of total download from all servers. We characterize the capacity of private computation, for $N$ servers and $K$ independent datasets that are replicated at each server, when the functions to be computed are arbitrary linear combinations of the datasets. Surprisingly, the capacity, $C=\left(1+1/N+\cdots+1/N^{K-1}\right)^{-1}$, matches the capacity of PIR with $N$ servers and $K$ messages. Thus, allowing arbitrary linear computations does not reduce the communication rate compared to pure dataset retrieval. The same insight is shown to hold even for arbitrary non-linear computations when the number of datasets $K\rightarrow\infty$.

cs.IT↗