156 results on '"Lin, Hsuan-Yin"'
Search Results
2. Generalizing Quantum Tanner Codes
- Author
-
Mostad, Olai Å., Rosnes, Eirik, and Lin, Hsuan-Yin
- Subjects
Computer Science - Information Theory - Abstract
In this work, we present a generalization of the recently proposed quantum Tanner codes by Leverrier and Z\'emor, which contains a construction of asymptotically good quantum LDPC codes. Quantum Tanner codes have so far been constructed equivalently from groups, Cayley graphs, or square complexes constructed from groups. We show how to enlarge this to group actions on finite sets, Schreier graphs, and a family of square complexes which is the largest possible in a certain sense. Furthermore, we discuss how the proposed generalization opens up the possibility of finding other families of asymptotically good quantum codes., Comment: An extended version of a paper presented at the Quantum Information Knowledge (QuIK) Workshop of the 2024 IEEE International Symposium on Information Theory (ISIT)
- Published
- 2024
3. Age Aware Scheduling for Differentially-Private Federated Learning
- Author
-
Lin, Kuan-Yu, Lin, Hsuan-Yin, Hsu, Yu-Pin, and Huang, Yu-Chih
- Subjects
Computer Science - Machine Learning ,Computer Science - Cryptography and Security ,Computer Science - Distributed, Parallel, and Cluster Computing - Abstract
This paper explores differentially-private federated learning (FL) across time-varying databases, delving into a nuanced three-way tradeoff involving age, accuracy, and differential privacy (DP). Emphasizing the potential advantages of scheduling, we propose an optimization problem aimed at meeting DP requirements while minimizing the loss difference between the aggregated model and the model obtained without DP constraints. To harness the benefits of scheduling, we introduce an age-dependent upper bound on the loss, leading to the development of an age-aware scheduling design. Simulation results underscore the superior performance of our proposed scheme compared to FL with classic DP, which does not consider scheduling as a design factor. This research contributes insights into the interplay of age, accuracy, and DP in federated learning, with practical implications for scheduling strategies., Comment: Simulation parameters updated. Paper accepted for presentation at the 2024 IEEE International Symposium on Information Theory (ISIT 2024)
- Published
- 2024
4. On the Maximum Theta Series over Unimodular Lattices
- Author
-
Bollauf, Maiara F. and Lin, Hsuan-Yin
- Subjects
Mathematics - Metric Geometry ,Computer Science - Information Theory - Abstract
The theta series of a lattice has been extensively studied in the literature and is closely related to a critical quantity widely used in the fields of physical layer security and cryptography, known as the flatness factor, or equivalently, the smoothing parameter of a lattice. Both fields raise the fundamental question of determining the (globally) maximum theta series over a particular set of volume-one lattices, namely, the stable lattices. In this work, we present a property of unimodular lattices, a subfamily of stable lattices, to verify that the integer lattice $\mathbb{Z}^{n}$ achieves the largest possible value of theta series over the set of unimodular lattices. Such a result moves towards proving a conjecture recently stated by Regev and Stephens-Davidowitz: any unimodular lattice, except for those lattices isomorphic to $\mathbb{Z}^{n}$, has a strictly smaller theta series than that of $\mathbb{Z}^{n}$. Our techniques are mainly based on studying the ratio of the theta series of a unimodular lattice to the theta series of $\mathbb{Z}^n$, called the secrecy ratio. We relate the Regev and Stephens-Davidowitz conjecture with another conjecture for unimodular lattices, known in the literature as the Belfiore-Sol\'e conjecture. The latter assumes that the secrecy ratio of any unimodular lattice has a symmetry point, which is exactly where the global minimum of the secrecy ratio is achieved.
- Published
- 2024
5. Sustained Effectiveness of Transcatheter Arterial Microembolization for Refractory Ischiogluteal Bursitis
- Author
-
Lin, Hsuan-Yin, Shih, Ya-Chu, and Chai, Jyh-Wen
- Published
- 2024
- Full Text
- View/download PDF
6. Improved Capacity Outer Bound for Private Quadratic Monomial Computation
- Author
-
Dæhli, Karen M., Obead, Sarah A, Lin, Hsuan-Yin, and Rosnes, Eirik
- Subjects
Computer Science - Information Theory - Abstract
In private computation, a user wishes to retrieve a function evaluation of messages stored on a set of databases without revealing the function's identity to the databases. Obead \emph{et al.} introduced a capacity outer bound for private nonlinear computation, dependent on the order of the candidate functions. Focusing on private \emph{quadratic monomial} computation, we propose three methods for ordering candidate functions: a graph edge-coloring method, a graph-distance method, and an entropy-based greedy method. We confirm, via an exhaustive search, that all three methods yield an optimal ordering for $f < 6$ messages. For $6 \leq f \leq 12$ messages, we numerically evaluate the performance of the proposed methods compared with a directed random search. For almost all scenarios considered, the entropy-based greedy method gives the smallest gap to the best-found ordering., Comment: 7 pages, 6 figures, and 1 table. An extended version of a paper accepted for presentation at the 2024 International Zurich Seminar on Information and Communication (IZS)
- Published
- 2024
7. Challenges and complications and their management of the transarterial microembolization for chronic musculoskeletal pain
- Author
-
Lin, Hsuan-Yin, Liang, Keng-Wei, Wang, Bow, and Lee, Cheng-Chun
- Published
- 2024
- Full Text
- View/download PDF
8. On the Capacity of Private Nonlinear Computation for Replicated Databases
- Author
-
Obead, Sarah A., Lin, Hsuan-Yin, Rosnes, Eirik, and Kliewer, Jörg
- Subjects
Computer Science - Information Theory - Abstract
We consider the problem of private computation (PC) in a distributed storage system. In such a setting a user wishes to compute a function of $f$ messages replicated across $n$ noncolluding databases, while revealing no information about the desired function to the databases. We provide an information-theoretically accurate achievable PC rate, which is the ratio of the smallest desired amount of information and the total amount of downloaded information, for the scenario of nonlinear computation. For a large message size the rate equals the PC capacity, i.e., the maximum achievable PC rate, when the candidate functions are the $f$ independent messages and one arbitrary nonlinear function of these. When the number of messages grows, the PC rate approaches an outer bound on the PC capacity. As a special case, we consider private monomial computation (PMC) and numerically compare the achievable PMC rate to the outer bound for a finite number of messages., Comment: 5 pages, 1 figure, 1 table. Presented at the 2019 IEEE Information Theory Workshop (ITW). Figure 1 is updated as it contained incorrect data-points for $f=2$ and $g=3$. arXiv admin note: text overlap with arXiv:2003.10007
- Published
- 2023
- Full Text
- View/download PDF
9. Efficient Interpolation-Based Decoding of Reed-Solomon Codes
- Author
-
Kadir, Wrya K., Lin, Hsuan-Yin, and Rosnes, Eirik
- Subjects
Computer Science - Information Theory - Abstract
We propose a new interpolation-based error decoding algorithm for $(n,k)$ Reed-Solomon (RS) codes over a finite field of size $q$, where $n=q-1$ is the length and $k$ is the dimension. In particular, we employ the fast Fourier transform (FFT) together with properties of a circulant matrix associated with the error interpolation polynomial and some known results from elimination theory in the decoding process. The asymptotic computational complexity of the proposed algorithm for correcting any $t \leq \lfloor \frac{n-k}{2} \rfloor$ errors in an $(n,k)$ RS code is of order $\mathcal{O}(t\log^2 t)$ and $\mathcal{O}(n\log^2 n \log\log n)$ over FFT-friendly and arbitrary finite fields, respectively, achieving the best currently known asymptotic decoding complexity, proposed for the same set of parameters., Comment: Presented at the 2023 IEEE International Symposium on Information Theory (ISIT)
- Published
- 2023
10. Single-Server Pliable Private Information Retrieval With Side Information
- Author
-
Obead, Sarah A., Lin, Hsuan-Yin, and Rosnes, Eirik
- Subjects
Computer Science - Information Theory - Abstract
We study the problem of pliable private information retrieval with side information (PPIR-SI) for the single server case. In PPIR, the messages are partitioned into nonoverlapping classes and stored in a number of noncolluding databases. The user wishes to retrieve any one message from a desired class while revealing no information about the desired class identity to the databases. In PPIR-SI, the user has prior access to some side information in the form of messages from different classes and wishes to retrieve any one new message from a desired class, i.e., the message is not included in the side information set, while revealing no information about the desired class to the databases. We characterize the capacity of (linear) single-server PPIR-SI for the case where the user's side information is unidentified, i.e., the user is oblivious of the identities of its side information messages and the database structure. We term this case PPIR-USI. Surprisingly, we show that having side information, in PPIR-USI, is disadvantageous, in terms of the download rate, compared to PPIR., Comment: 9 pages, 3 figures, 1 table. An extended version of a paper accepted for presentation at the 2023 IEEE International Symposium on Information Theory (ISIT)
- Published
- 2023
- Full Text
- View/download PDF
11. Secrecy Gain of Formally Unimodular Lattices from Codes over the Integers Modulo 4
- Author
-
Bollauf, Maiara F., Lin, Hsuan-Yin, and Ytrehus, Øyvind
- Subjects
Computer Science - Information Theory - Abstract
Recently, a design criterion depending on a lattice's volume and theta series, called the secrecy gain, was proposed to quantify the secrecy-goodness of the applied lattice code for the Gaussian wiretap channel. To address the secrecy gain of Construction $\text{A}_4$ lattices from formally self-dual $\mathbb{Z}_4$-linear codes, i.e., codes for which the symmetrized weight enumerator (swe) coincides with the swe of its dual, we present new constructions of $\mathbb{Z}_4$-linear codes which are formally self-dual with respect to the swe. For even lengths, formally self-dual $\mathbb{Z}_4$-linear codes are constructed from nested binary codes and double circulant matrices. For odd lengths, a novel construction called odd extension from double circulant codes is proposed. Moreover, the concepts of Type I/II formally self-dual codes/unimodular lattices are introduced. Next, we derive the theta series of the formally unimodular lattices obtained by Construction $\text{A}_4$ from formally self-dual $\mathbb{Z}_4$-linear codes and describe a universal approach to determine their secrecy gains. The secrecy gain of Construction $\text{A}_4$ formally unimodular lattices obtained from formally self-dual $\mathbb{Z}_4$-linear codes is investigated, both for even and odd dimensions. Numerical evidence shows that for some parameters, Construction $\text{A}_4$ lattices can achieve a higher secrecy gain than the best-known formally unimodular lattices from the literature. Results concerning the flatness factor, another security criterion widely considered in the Gaussian wiretap channel, are also discussed., Comment: arXiv admin note: text overlap with arXiv:2202.09236; Paper accepted for publication in IEEE Transactions on Information Theory
- Published
- 2023
12. Straggler-Resilient Differentially-Private Decentralized Learning
- Author
-
Yakimenka, Yauhen, Weng, Chung-Wei, Lin, Hsuan-Yin, Rosnes, Eirik, and Kliewer, Jörg
- Subjects
Computer Science - Machine Learning ,Computer Science - Cryptography and Security ,Computer Science - Information Theory - Abstract
We consider the straggler problem in decentralized learning over a logical ring while preserving user data privacy. Especially, we extend the recently proposed framework of differential privacy (DP) amplification by decentralization by Cyffers and Bellet to include overall training latency--comprising both computation and communication latency. Analytical results on both the convergence speed and the DP level are derived for both a skipping scheme (which ignores the stragglers after a timeout) and a baseline scheme that waits for each node to finish before the training continues. A trade-off between overall training latency, accuracy, and privacy, parameterized by the timeout of the skipping scheme, is identified and empirically validated for logistic regression on a real-world dataset and for image classification using the MNIST and CIFAR-10 datasets., Comment: To appear in the IEEE Journal on Selected Areas in Information Theory (special issue on Information-Theoretic Methods for Trustworthy and Reliable Machine Learning)
- Published
- 2022
13. Formally Unimodular Packings for the Gaussian Wiretap Channel
- Author
-
Bollauf, Maiara F., Lin, Hsuan-Yin, and Ytrehus, Øyvind
- Subjects
Computer Science - Information Theory - Abstract
This paper introduces the family of lattice-like packings, which generalizes lattices, consisting of packings possessing periodicity and geometric uniformity. The subfamily of formally unimodular (lattice-like) packings is further investigated. It can be seen as a generalization of the unimodular and isodual lattices, and the Construction A formally unimodular packings obtained from formally self-dual codes are presented. Recently, lattice coding for the Gaussian wiretap channel has been considered. A measure called secrecy function was proposed to characterize the eavesdropper's probability of correctly decoding. The aim is to determine the global maximum value of the secrecy function, called (strong) secrecy gain. We further apply lattice-like packings to coset coding for the Gaussian wiretap channel and show that the family of formally unimodular packings shares the same secrecy function behavior as unimodular and isodual lattices. We propose a universal approach to determine the secrecy gain of a Construction A formally unimodular packing obtained from a formally self-dual code. From the weight distribution of a code, we provide a necessary condition for a formally self-dual code such that its Construction A formally unimodular packing is secrecy-optimal. Finally, we demonstrate that formally unimodular packings/lattices can achieve higher secrecy gain than the best-known unimodular lattices., Comment: Accepted for publication in IEEE Transactions on Information Theory. arXiv admin note: text overlap with arXiv:2111.01439
- Published
- 2022
14. On the Secrecy Gain of Formally Unimodular Construction $\text{A}_4$ Lattices
- Author
-
Bollauf, Maiara F., Lin, Hsuan-Yin, and Ytrehus, Øyvind
- Subjects
Computer Science - Information Theory - Abstract
Lattice coding for the Gaussian wiretap channel is considered, where the goal is to ensure reliable communication between two authorized parties while preventing an eavesdropper from learning the transmitted messages. Recently, a measure called secrecy gain was proposed as a design criterion to quantify the secrecy-goodness of the applied lattice code. In this paper, the theta series of the so-called formally unimodular lattices obtained by Construction $\text{A}_4$ from codes over $\mathbb{Z}_4$ is derived, and we provide a universal approach to determine their secrecy gains. Initial results indicate that Construction $\text{A}_4$ lattices can achieve a higher secrecy gain than the best-known formally unimodular lattices from the literature. Furthermore, a new code construction of formally self-dual $\mathbb{Z}_4$-linear codes is presented.
- Published
- 2022
15. Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval
- Author
-
Yakimenka, Yauhen, Lin, Hsuan-Yin, Rosnes, Eirik, and Kliewer, Jörg
- Subjects
Computer Science - Information Theory - Abstract
Private information retrieval protocols guarantee that a user can privately and losslessly retrieve a single file from a database stored across multiple servers. In this work, we propose to simultaneously relax the conditions of perfect retrievability and privacy in order to obtain improved download rates when all files are stored uncoded on a single server. Information leakage is measured in terms of the average success probability for the server of correctly guessing the identity of the desired file. The main findings are: i) The derivation of the optimal tradeoff between download rate, distortion, and information leakage when the file size is infinite. Closed-form expressions of the optimal tradeoff for the special cases of "no-leakage" and "no-privacy" are also given. ii) A novel approach based on linear programming (LP) to construct schemes for a finite file size and an arbitrary number of files. The proposed LP approach can be leveraged to find provably optimal schemes with corresponding closed-form expressions for the rate-distortion-leakage tradeoff when the database contains at most four bits. Finally, for a database that contains 320 bits, we compare two construction methods based on the LP approach with a nonconstructive scheme downloading subsets of files using a finite-length lossy compressor based on random coding., Comment: 14 pages, 3 figures. Accepted for publication in IEEE Journal on Selected Areas in Communications, Special Issue on Private Information Retrieval, Private Coded Computing over Distributed Servers, and Privacy in Distributed Learning
- Published
- 2021
16. The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel
- Author
-
Bollauf, Maiara F., Lin, Hsuan-Yin, and Ytrehus, Øyvind
- Subjects
Computer Science - Information Theory - Abstract
We consider lattice coding for the Gaussian wiretap channel, where the challenge is to ensure reliable communication between two authorized parties while preventing an eavesdropper from learning the transmitted messages. Recently, a measure called the secrecy function of a lattice coding scheme was proposed as a design criterion to characterize the eavesdropper's probability of correct decision. In this paper, the family of formally unimodular lattices is presented and shown to possess the same secrecy function behavior as unimodular and isodual lattices. Based on Construction A, we provide a universal approach to determine the secrecy gain, i.e., the maximum value of the secrecy function, for formally unimodular lattices obtained from formally self-dual codes. Furthermore, we show that formally unimodular lattices can achieve higher secrecy gain than the best-known unimodular lattices from the literature.
- Published
- 2021
17. Generative Adversarial User Privacy in Lossy Single-Server Information Retrieval
- Author
-
Weng, Chung-Wei, Yakimenka, Yauhen, Lin, Hsuan-Yin, Rosnes, Eirik, and Kliewer, Joerg
- Subjects
Computer Science - Machine Learning ,Computer Science - Information Theory - Abstract
We propose to extend the concept of private information retrieval by allowing for distortion in the retrieval process and relaxing the perfect privacy requirement at the same time. In particular, we study the trade-off between download rate, distortion, and user privacy leakage, and show that in the limit of large file sizes this trade-off can be captured via a novel information-theoretical formulation for datasets with a known distribution. Moreover, for scenarios where the statistics of the dataset is unknown, we propose a new deep learning framework by leveraging a generative adversarial network approach, which allows the user to learn efficient schemes from the data itself. We evaluate the performance of the scheme on a synthetic Gaussian dataset as well as on the MNIST, CIFAR-10, and LSUN datasets. For the MNIST, CIFAR-10, and LSUN datasets, the data-driven approach significantly outperforms a nonlearning-based scheme which combines source coding with the download of multiple files., Comment: Accepted for Publication in IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY (TIFS)
- Published
- 2020
- Full Text
- View/download PDF
18. Multi-Server Weakly-Private Information Retrieval
- Author
-
Lin, Hsuan-Yin, Kumar, Siddhartha, Rosnes, Eirik, Amat, Alexandre Graell i, and Yaakobi, Eitan
- Subjects
Computer Science - Information Theory - Abstract
Private information retrieval (PIR) protocols ensure that a user can download a file from a database without revealing any information on the identity of the requested file to the servers storing the database. While existing protocols strictly impose that no information is leaked on the file's identity, this work initiates the study of the tradeoffs that can be achieved by relaxing the perfect privacy requirement. We refer to such protocols as weakly-private information retrieval (WPIR) protocols. In particular, for the case of multiple noncolluding replicated servers, we study how the download rate, the upload cost, and the access complexity can be improved when relaxing the full privacy constraint. To quantify the information leakage on the requested file's identity we consider mutual information (MI), worst-case information leakage, and maximal leakage (MaxL). We present two WPIR schemes, denoted by Scheme A and Scheme B, based on two recent PIR protocols and show that the download rate of the former can be optimized by solving a convex optimization problem. We also show that Scheme A achieves an improved download rate compared to the recently proposed scheme by Samy et al. under the so-called $\epsilon$-privacy metric. Additionally, a family of schemes based on partitioning is presented. Moreover, we provide an information-theoretic converse bound for the maximum possible download rate for the MI and MaxL privacy metrics under a practical restriction on the alphabet size of queries and answers. For two servers and two files, the bound is tight under the MaxL metric, which settles the WPIR capacity in this particular case. Finally, we compare the performance of the proposed schemes and their gap to the converse bound., Comment: To appear in IEEE Transactions on Information Theory. arXiv admin note: text overlap with arXiv:1901.06730
- Published
- 2020
19. Optimal and Approximation Algorithms for Joint Routing and Scheduling in Millimeter-Wave Cellular Networks
- Author
-
Yuan, Dingwen, Lin, Hsuan-Yin, Widmer, Jörg, and Hollick, Matthias
- Subjects
Computer Science - Networking and Internet Architecture - Abstract
Millimeter-wave (mmWave) communication is a promising technology to cope with the exponential increase in 5G data traffic. Such networks typically require a very dense deployment of base stations. A subset of those, so-called macro base stations, feature high-bandwidth connection to the core network, while relay base stations are connected wirelessly. To reduce cost and increase flexibility, wireless backhauling is needed to connect both macro to relay as well as relay to relay base stations. The characteristics of mmWave communication mandates new paradigms for routing and scheduling. The paper investigates scheduling algorithms under different interference models. To showcase the scheduling methods, we study the maximum throughput fair scheduling problem. Yet the proposed algorithms can be easily extended to other problems. For a full-duplex network under the no interference model, we propose an efficient polynomial-time scheduling method, the {\em schedule-oriented optimization}. Further, we prove that the problem is NP-hard if we assume pairwise link interference model or half-duplex radios. Fractional weighted coloring based approximation algorithms are proposed for these NP-hard cases. Moreover, the approximation algorithm parallel data stream scheduling is proposed for the case of half-duplex network under the no interference model. It has better approximation ratio than the fractional weighted coloring based algorithms and even attains the optimal solution for the special case of uniform orthogonal backhaul networks., Comment: accepted for publish in the IEEE/ACM Transactions on Networking
- Published
- 2020
- Full Text
- View/download PDF
20. Private Function Computation for Noncolluding Coded Databases
- Author
-
Obead, Sarah A., Lin, Hsuan-Yin, Rosnes, Eirik, and Kliewer, Jörg
- Subjects
Computer Science - Information Theory - Abstract
Private computation in a distributed storage system (DSS) is a generalization of the private information retrieval (PIR) problem. In such setting a user wishes to compute a function of $f$ messages stored in $n$ noncolluding coded databases, i.e., databases storing data encoded with an $[n,k]$ linear storage code, while revealing no information about the desired function to the databases. We consider the problem of private polynomial computation (PPC). In PPC, a user wishes to compute a multivariate polynomial of degree at most $g$ over $f$ variables (or messages) stored in multiple databases. First, we consider the private computation of polynomials of degree $g=1$, i.e., private linear computation (PLC) for coded databases. In PLC, a user wishes to compute a linear combination over the $f$ messages while keeping the coefficients of the desired linear combination hidden from the database. For a linearly encoded DSS, we present a capacity-achieving PLC scheme and show that the PLC capacity, which is the ratio of the desired amount of information and the total amount of downloaded information, matches the maximum distance separable coded capacity of PIR for a large class of linear storage codes. Then, we consider private computation of higher degree polynomials, i.e., $g>1$. For this setup, we construct two novel PPC schemes. In the first scheme, we consider Reed-Solomon coded databases with Lagrange encoding, which leverages ideas from recently proposed star-product PIR and Lagrange coded computation. The second scheme considers the special case of coded databases with systematic Lagrange encoding. Both schemes yield improved rates, while asymptotically, as $f\rightarrow \infty$, the systematic scheme gives a significantly better computation retrieval rate compared to all known schemes up to some storage code rate that depends on the maximum degree of the candidate polynomials., Comment: 41 pages, 4 figures, 11 tables, submitted for publication. Some overlap with arXiv:1810.04230, arXiv:1901.10286
- Published
- 2020
21. The Capacity of Single-Server Weakly-Private Information Retrieval
- Author
-
Lin, Hsuan-Yin, Kumar, Siddhartha, Rosnes, Eirik, Amat, Alexandre Graell i, and Yaakobi, Eitan
- Subjects
Computer Science - Information Theory - Abstract
A private information retrieval (PIR) protocol guarantees that a user can privately retrieve files stored in a database without revealing any information about the identity of the requested file. Existing information-theoretic PIR protocols ensure perfect privacy, i.e., zero information leakage to the servers storing the database, but at the cost of high download. In this work, we present weakly-private information retrieval (WPIR) schemes that trade off perfect privacy to improve the download cost when the database is stored on a single server. We study the tradeoff between the download cost and information leakage in terms of mutual information (MI) and maximal leakage (MaxL) privacy metrics. By relating the WPIR problem to rate-distortion theory, the download-leakage function, which is defined as the minimum required download cost of all single-server WPIR schemes for a given level of information leakage and a fixed file size, is introduced. By characterizing the download-leakage function for the MI and MaxL metrics, the capacity of single-server WPIR is fully described., Comment: To appear in IEEE Journal of Selected Areas in Information Theory (JSAIT), Special Issue on Privacy and Security of Information Systems, 2021
- Published
- 2020
22. On the Capacity of Private Monomial Computation
- Author
-
Yakimenka, Yauhen, Lin, Hsuan-Yin, and Rosnes, Eirik
- Subjects
Computer Science - Information Theory - Abstract
In this work, we consider private monomial computation (PMC) for replicated noncolluding databases. In PMC, a user wishes to privately retrieve an arbitrary multivariate monomial from a candidate set of monomials in $f$ messages over a finite field $\mathbb F_q$, where $q=p^k$ is a power of a prime $p$ and $k \ge 1$, replicated over $n$ databases. We derive the PMC capacity under a technical condition on $p$ and for asymptotically large $q$. The condition on $p$ is satisfied, e.g., for large enough $p$. Also, we present a novel PMC scheme for arbitrary $q$ that is capacity-achieving in the asymptotic case above. Moreover, we present formulas for the entropy of a multivariate monomial and for a set of monomials in uniformly distributed random variables over a finite field, which are used in the derivation of the capacity expression., Comment: Accepted for 2020 International Zurich Seminar on Information and Communication
- Published
- 2020
23. Private Polynomial Computation for Noncolluding Coded Databases
- Author
-
Obead, Sarah A., Lin, Hsuan-Yin, Rosnes, Eirik, and Kliewer, Jörg
- Subjects
Computer Science - Information Theory - Abstract
We consider private polynomial computation (PPC) over noncolluding coded databases. In such a setting a user wishes to compute a multivariate polynomial of degree at most $g$ over $f$ variables (or messages) stored in multiple databases while revealing no information about the desired polynomial to the databases. We construct two novel PPC schemes, where the first is a generalization of our previous work in private linear computation for coded databases. In this scheme we consider Reed-Solomon coded databases with Lagrange encoding, which leverages ideas from recently proposed star-product private information retrieval and Lagrange coded computation. The second scheme considers the special case of coded databases with systematic Lagrange encoding. Both schemes yield improved rates compared to the best known schemes from the literature for a small number of messages, while in the asymptotic case the rates match., Comment: 5 pages, 2 tables, 1 figure, to be presented at 2019 IEEE International Symposium on Information Theory (ISIT)
- Published
- 2019
- Full Text
- View/download PDF
24. Weakly-Private Information Retrieval
- Author
-
Lin, Hsuan-Yin, Kumar, Siddhartha, Rosnes, Eirik, Amat, Alexandre Graell i, and Yaakobi, Eitan
- Subjects
Computer Science - Information Theory - Abstract
Private information retrieval (PIR) protocols make it possible to retrieve a file from a database without disclosing any information about the identity of the file being retrieved. These protocols have been rigorously explored from an information-theoretic perspective in recent years. While existing protocols strictly impose that no information is leaked on the file's identity, this work initiates the study of the tradeoffs that can be achieved by relaxing the requirement of perfect privacy. In case the user is willing to leak some information on the identity of the retrieved file, we study how the PIR rate, as well as the upload cost and access complexity, can be improved. For the particular case of replicated servers, we propose two weakly-private information retrieval schemes based on two recent PIR protocols and a family of schemes based on partitioning. Lastly, we compare the performance of the proposed schemes., Comment: To be presented at 2019 IEEE International Symposium on Information Theory (ISIT)
- Published
- 2019
25. Secrecy Gain of Formally Unimodular Lattices From Codes Over the Integers Modulo 4
- Author
-
Bollauf, Maiara F., primary, Lin, Hsuan-Yin, additional, and Ytrehus, Øyvind, additional
- Published
- 2024
- Full Text
- View/download PDF
26. Capacity of Private Linear Computation for Coded Databases
- Author
-
Obead, Sarah A., Lin, Hsuan-Yin, Rosnes, Eirik, and Kliewer, Jörg
- Subjects
Computer Science - Information Theory - Abstract
We consider the problem of private linear computation (PLC) in a distributed storage system. In PLC, a user wishes to compute a linear combination of $f$ messages stored in noncolluding databases while revealing no information about the coefficients of the desired linear combination to the databases. In extension of our previous work we employ linear codes to encode the information on the databases. We show that the PLC capacity, which is the ratio of the desired linear function size and the total amount of downloaded information, matches the maximum distance separable (MDS) coded capacity of private information retrieval for a large class of linear codes that includes MDS codes. In particular, the proposed converse is valid for any number of messages and linear combinations, and the capacity expression depends on the rank of the coefficient matrix obtained from all linear combinations., Comment: 8 pages. This work has been presented at the 56th Annual Allerton Conference on Communication, Control, and Computing, October 2018
- Published
- 2018
- Full Text
- View/download PDF
27. Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes
- Author
-
Kumar, Siddhartha, Lin, Hsuan-Yin, Rosnes, Eirik, and Amat, Alexandre Graell i
- Subjects
Computer Science - Information Theory - Abstract
We prove that a class of distance-optimal local reconstruction codes (LRCs), an important family of repair-efficient codes for distributed storage systems, achieve the maximum distance separable private information retrieval capacity for the case of noncolluding nodes. This particular class of codes includes Pyramid codes and other LRCs proposed in the literature., Comment: The contents of this manuscript is extracted from arXiv:1712.03898, and will be presented at the IEEE Information Theory Workshop (ITW), 2018
- Published
- 2018
28. On the Fundamental Limit of Private Information Retrieval for Coded Distributed Storage
- Author
-
Lin, Hsuan-Yin, Kumar, Siddhartha, Rosnes, Eirik, and Amat, Alexandre Graell i
- Subjects
Computer Science - Information Theory - Abstract
We consider private information retrieval (PIR) for distributed storage systems (DSSs) with noncolluding nodes where data is stored using a non maximum distance separable (MDS) linear code. It was recently shown that if data is stored using a particular class of non-MDS linear codes, the MDS-PIR capacity, i.e., the maximum possible PIR rate for MDS-coded DSSs, can be achieved. For this class of codes, we prove that the PIR capacity is indeed equal to the MDS-PIR capacity, giving the first family of non-MDS codes for which the PIR capacity is known. For other codes, we provide asymmetric PIR protocols that achieve a strictly larger PIR rate compared to existing symmetric PIR protocols., Comment: This work is the extended version of the paper at arXiv:1806.01342v1 [cs.IT]. Conference version of this paper will be presented at 2018 IEEE Information Theory Workshop
- Published
- 2018
29. Asymmetry Helps: Improved Private Information Retrieval Protocols for Distributed Storage
- Author
-
Lin, Hsuan-Yin, Kumar, Siddhartha, Rosnes, Eirik, and Amat, Alexandre Graell i
- Subjects
Computer Science - Information Theory - Abstract
We consider private information retrieval (PIR) for distributed storage systems (DSSs) with noncolluding nodes where data is stored using a non maximum distance separable (MDS) linear code. It was recently shown that if data is stored using a particular class of non-MDS linear codes, the MDS-PIR capacity, i.e., the maximum possible PIR rate for MDS-coded DSSs, can be achieved. For this class of codes, we prove that the PIR capacity is indeed equal to the MDS-PIR capacity, giving the first family of non-MDS codes for which the PIR capacity is known. For other codes, we provide asymmetric PIR protocols that achieve a strictly larger PIR rate compared to existing symmetric PIR protocols., Comment: To be presented at 2018 IEEE Information Theory Workshop (ITW'18). See arXiv:1808.09018 for its extended version
- Published
- 2018
30. An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS Linear Codes
- Author
-
Lin, Hsuan-Yin, Kumar, Siddhartha, Rosnes, Eirik, and Amat, Alexandre Graell i
- Subjects
Computer Science - Information Theory - Abstract
We propose a private information retrieval (PIR) protocol for distributed storage systems with noncolluding nodes where data is stored using an arbitrary linear code. An expression for the PIR rate, i.e., the ratio of the amount of retrieved data per unit of downloaded data, is derived, and a necessary and a sufficient condition for codes to achieve the maximum distance separable (MDS) PIR capacity are given. The necessary condition is based on the generalized Hamming weights of the storage code, while the sufficient condition is based on code automorphisms. We show that cyclic codes and Reed-Muller codes satisfy the sufficient condition and are thus MDS-PIR capacity-achieving., Comment: To be presented at 2018 IEEE International Symposium on Information Theory (ISIT). arXiv admin note: substantial text overlap with arXiv:1712.03898
- Published
- 2018
31. Optimal Joint Routing and Scheduling in Millimeter-Wave Cellular Networks
- Author
-
Yuan, Dingwen, Lin, Hsuan-Yin, Widmer, Joerg, and Hollick, Matthias
- Subjects
Computer Science - Networking and Internet Architecture - Abstract
Millimeter-wave (mmWave) communication is a promising technology to cope with the expected exponential increase in data traffic in 5G networks. mmWave networks typically require a very dense deployment of mmWave base stations (mmBS). To reduce cost and increase flexibility, wireless backhauling is needed to connect the mmBSs. The characteristics of mmWave communication, and specifically its high directional- ity, imply new requirements for efficient routing and scheduling paradigms. We propose an efficient scheduling method, so-called schedule-oriented optimization, based on matching theory that optimizes QoS metrics jointly with routing. It is capable of solving any scheduling problem that can be formulated as a linear program whose variables are link times and QoS metrics. As an example of the schedule-oriented optimization, we show the optimal solution of the maximum throughput fair scheduling (MTFS). Practically, the optimal scheduling can be obtained even for networks with over 200 mmBSs. To further increase the runtime performance, we propose an efficient edge-coloring based approximation algorithm with provable performance bound. It achieves over 80% of the optimal max-min throughput and runs 5 to 100 times faster than the optimal algorithm in practice. Finally, we extend the optimal and approximation algorithms for the cases of multi-RF-chain mmBSs and integrated backhaul and access networks., Comment: To appear in Proceedings of INFOCOM '18
- Published
- 2017
32. Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes
- Author
-
Kumar, Siddhartha, Lin, Hsuan-Yin, Rosnes, Eirik, and Amat, Alexandre Graell i
- Subjects
Computer Science - Information Theory - Abstract
We propose three private information retrieval (PIR) protocols for distributed storage systems (DSSs) where data is stored using an arbitrary linear code. The first two protocols, named Protocol 1 and Protocol 2, achieve privacy for the scenario with noncolluding nodes. Protocol 1 requires a file size that is exponential in the number of files in the system, while Protocol 2 requires a file size that is independent of the number of files and is hence simpler. We prove that, for certain linear codes, Protocol 1 achieves the maximum distance separable (MDS) PIR capacity, i.e., the maximum PIR rate (the ratio of the amount of retrieved stored data per unit of downloaded data) for a DSS that uses an MDS code to store any given (finite and infinite) number of files, and Protocol 2 achieves the asymptotic MDS-PIR capacity (with infinitely large number of files in the DSS). In particular, we provide a necessary and a sufficient condition for a code to achieve the MDS-PIR capacity with Protocols 1 and 2 and prove that cyclic codes, Reed-Muller (RM) codes, and a class of distance-optimal local reconstruction codes achieve both the finite MDS-PIR capacity (i.e., with any given number of files) and the asymptotic MDS-PIR capacity with Protocols 1 and 2, respectively. Furthermore, we present a third protocol, Protocol 3, for the scenario with multiple colluding nodes, which can be seen as an improvement of a protocol recently introduced by Freij-Hollanti et al.. Similar to the noncolluding case, we provide a necessary and a sufficient condition to achieve the maximum possible PIR rate of Protocol 3. Moreover, we provide a particular class of codes that is suitable for this protocol and show that RM codes achieve the maximum possible PIR rate for the protocol. For all three protocols, we present an algorithm to optimize their PIR rates., Comment: This work is the extension of the work done in arXiv:1612.07084v2. The current version introduces further refinement to the manuscript. Current version will appear in the IEEE Transactions on Information Theory
- Published
- 2017
33. Weak Flip Codes and their Optimality on the Binary Erasure Channel
- Author
-
Lin, Hsuan-Yin, Moser, Stefan M., and Chen, Po-Ning
- Subjects
Computer Science - Information Theory - Abstract
This paper investigates fundamental properties of nonlinear binary codes by looking at the codebook matrix not row-wise (codewords), but column-wise. The family of weak flip codes is presented and shown to contain many beautiful properties. In particular the subfamily fair weak flip codes, which goes back to Berlekamp, Gallager, and Shannon and which was shown to achieve the error exponent with a fixed number of codewords $M$, can be seen as a generalization of linear codes to an arbitrary number of codewords. Based on the column-wise approach, the $r$-wise Hamming distance is introduced as a generalization to the widely used (pairwise) Hamming distance. It is shown that the minimum $r$-wise Hamming distance satisfies a generalized $r$-wise Plotkin bound. The $r$-wise Hamming distance structure of the nonlinear fair weak flip codes is analyzed and shown to be superior to many codes. In particular, it is proven that the fair weak flip codes achieve the $r$-wise Plotkin bound with equality for all $r$. In the second part of the paper, these insights are applied to a binary erasure channel (BEC) with an arbitrary erasure probability. An exact formula for the average error probability of an arbitrary code using maximum likelihood decoding is derived and shown to be expressible using only the $r$-wise Hamming distance structure of the code. For a number of codewords $M\leq4$ and an arbitrary blocklength $n$, the globally optimal codes (in the sense of minimizing the average error probability) are found. For $M=5,6$ and an arbitrary blocklength $n$, the optimal codes are conjectured. For larger $M$, observations regarding the optimal design are presented, e.g., that good codes have a large $r$-wise Hamming distance structure for all $r$. Numerical results validate our code design criteria and show the superiority of our best found nonlinear weak flip codes compared to the best linear codes.
- Published
- 2017
34. Radiomic features derived from pretherapeutic MRI predict chemoradiation response in locally advanced rectal cancer
- Author
-
Chou, Yen, Peng, Szu-Hsiang, Lin, Hsuan-Yin, Lan, Tien-Li, Jiang, Jeng-Kae, Liang, Wen-Yih, Hu, Yu-Wen, and Wang, Ling-Wei
- Published
- 2023
- Full Text
- View/download PDF
35. Lengthening and Extending Binary Private Information Retrieval Codes
- Author
-
Lin, Hsuan-Yin and Rosnes, Eirik
- Subjects
Computer Science - Information Theory - Abstract
It was recently shown by Fazeli et al. that the storage overhead of a traditional $t$-server private information retrieval (PIR) protocol can be significantly reduced using the concept of a $t$-server PIR code. In this work, we show that a family of $t$-server PIR codes (with increasing dimensions and blocklengths) can be constructed from an existing $t$-server PIR code through lengthening by a single information symbol and code extension by at most $\bigl\lceil t/2\bigr\rceil$ code symbols. Furthermore, by extending a code construction notion from Steiner systems by Fazeli et al., we obtain a specific family of $t$-server PIR codes. Based on a code construction technique that lengthens and extends a $t$-server PIR code simultaneously, a basic algorithm to find good (i.e., small blocklength) $t$-server PIR codes is proposed. For the special case of $t=5$, we find provably optimal PIR codes for code dimensions $k\leq 6$, while for all $7\leq k\leq 32$ we find codes of smaller blocklength than the best known codes from the literature. Furthermore, in the case of $t = 8$, we also find better codes for $k = 5, 6, 11, 12$. Numerical results show that most of the best found $5$-server PIR codes can be constructed from the proposed family of codes connected to Steiner systems., Comment: The shorter version of this paper will appear in the proceedings of 2018 International Zurich Seminar on Information and Communication
- Published
- 2017
36. Weakly-Private Information Retrieval From MDS-Coded Distributed Storage
- Author
-
Orvedal, Asbjørn O., Lin, Hsuan-Yin, Rosnes, Eirik, Orvedal, Asbjørn O., Lin, Hsuan-Yin, and Rosnes, Eirik
- Abstract
We consider the problem of weakly-private information retrieval (WPIR) when data is encoded by a maximum distance separable code and stored across multiple servers. In WPIR, a user wishes to retrieve a piece of data from a set of servers without leaking too much information about which piece of data she is interested in. We study and provide the first WPIR protocols for this scenario and present results on their optimal trade-off between download rate and information leakage using the maximal leakage privacy metric., Comment: To be presented at the 2024 International Zurich Seminar on Information and Communication (IZS'24), Zurich, Switzerland
- Published
- 2024
37. Formally Unimodular Packings for the Gaussian Wiretap Channel
- Author
-
Bollauf, Maiara F., primary, Lin, Hsuan-Yin, additional, and Ytrehus, Øyvind, additional
- Published
- 2023
- Full Text
- View/download PDF
38. Transient Cortical Blindness Following Transarterial Embolization for Shoulder Adhesive Capsulitis.
- Author
-
Liang, Keng-Wei, Lin, Hsuan-Yin, Cheng, Kai-Lun, Wang, Bow, and Huang, Hsin-Hui
- Abstract
[Display omitted] [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
39. Challenges and complications and their management of the transarterial microembolization for chronic musculoskeletal pain
- Author
-
Lin, Hsuan-Yin, primary, Liang, Keng-Wei, additional, Wang, Bow, additional, and Lee, Cheng-Chun, additional
- Published
- 2023
- Full Text
- View/download PDF
40. On the Secrecy Gain of Isodual Lattices from Tail-Biting Convolutional Codes
- Author
-
Persson, Palma, primary, Bollauf, Maiara F., additional, Lin, Hsuan-Yin, additional, and Ytrehus, Øyvind, additional
- Published
- 2023
- Full Text
- View/download PDF
41. Is right-sided ligamentum teres hepatis always accompanied by left-sided gallbladder? Case reports and literature review
- Author
-
Lin, Hsuan-Yin and Lee, Rheun-Chuan
- Published
- 2018
- Full Text
- View/download PDF
42. Single-Server Pliable Private Information Retrieval With Side Information
- Author
-
Obead, Sarah A., primary, Lin, Hsuan-Yin, additional, and Rosnes, Eirik, additional
- Published
- 2023
- Full Text
- View/download PDF
43. Efficient Interpolation-Based Decoding of Reed-Solomon Codes
- Author
-
Kadir, Wrya K., primary, Lin, Hsuan-Yin, additional, and Rosnes, Eirik, additional
- Published
- 2023
- Full Text
- View/download PDF
44. Differentially-Private Collaborative Online Personalized Mean Estimation
- Author
-
Yakimenka, Yauhen, primary, Weng, Chung-Wei, additional, Lin, Hsuan-Yin, additional, Rosnes, Eirik, additional, and Kliewer, Jörg, additional
- Published
- 2023
- Full Text
- View/download PDF
45. Straggler-Resilient Differentially-Private Decentralized Learning
- Author
-
Yakimenka, Yauhen, primary, Weng, Chung-Wei, additional, Lin, Hsuan-Yin, additional, Rosnes, Eirik, additional, and Kliewer, Jorg, additional
- Published
- 2022
- Full Text
- View/download PDF
46. Challenges, Complications and Their Management during Transarterial Microembolization for Chronic Musculoskeletal Pain
- Author
-
Lin, Hsuan Yin
- Subjects
Inflammation ,Bones ,Geriatrics ,Vascular ,Fluoroscopy ,Arterial access ,Musculoskeletal joint ,Digital radiography ,Embolisation ,Athletic injuries ,Cone beam CT - Abstract
Purpose Methods and materials Results Conclusion Personal information and conflict of interest References, Purpose: Transarterial microembolization (TAME) is a new minimally invasive treatment option for musculoskeletal diseases that is becoming increasingly popular. The safety and effectiveness of TAME has been supported by bench study [1], animal study [2],...
- Published
- 2023
- Full Text
- View/download PDF
47. On the Secrecy Gain of Formally Unimodular Construction A4 Lattices
- Author
-
Bollauf, Maiara F., primary, Lin, Hsuan-Yin, additional, and Ytrehus, Oyvind, additional
- Published
- 2022
- Full Text
- View/download PDF
48. Private Linear Computation for Noncolluding Coded Databases
- Author
-
Obead, Sarah A., primary, Lin, Hsuan-Yin, additional, Rosnes, Eirik, additional, and Kliewer, Jorg, additional
- Published
- 2022
- Full Text
- View/download PDF
49. Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval
- Author
-
Yakimenka, Yauhen, primary, Lin, Hsuan-Yin, additional, Rosnes, Eirik, additional, and Kliewer, Jorg, additional
- Published
- 2022
- Full Text
- View/download PDF
50. Multi-Server Weakly-Private Information Retrieval
- Author
-
Lin, Hsuan-Yin, primary, Kumar, Siddhartha, additional, Rosnes, Eirik, additional, Graell i Amat, Alexandre, additional, and Yaakobi, Eitan, additional
- Published
- 2022
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.