Zobrazeno 1 - 10
of 100
pro vyhledávání: '"Zhu, Jinbao"'
We consider the problem of private multiple linear computation (PMLC) over a replicated storage system with colluding and unresponsive constraints. In this scenario, the user wishes to privately compute $P$ linear combinations of $M$ files from a set
Externí odkaz:
http://arxiv.org/abs/2404.09165
We consider a federated representation learning framework, where with the assistance of a central server, a group of $N$ distributed clients train collaboratively over their private data, for the representations (or embeddings) of a set of entities (
Externí odkaz:
http://arxiv.org/abs/2206.09097
We study two problems of private matrix multiplication, over a distributed computing system consisting of a master node, and multiple servers that collectively store a family of public matrices using Maximum-Distance-Separable (MDS) codes. In the fir
Externí odkaz:
http://arxiv.org/abs/2205.01505
We consider the problem of evaluating arbitrary multivariate polynomials over a massive dataset containing multiple inputs, on a distributed computing system with a master node and multiple worker nodes. Generalized Lagrange Coded Computing (GLCC) co
Externí odkaz:
http://arxiv.org/abs/2204.11168
Autor:
Zhu, Jinbao, Li, Songze
We consider the problems of Private and Secure Matrix Multiplication (PSMM) and Fully Private Matrix Multiplication (FPMM), for which matrices privately selected by a master node are multiplied at distributed worker nodes without revealing the indice
Externí odkaz:
http://arxiv.org/abs/2201.00646
The problem of Multi-user Blind $X$-secure $T$-colluding Symmetric Private Information Retrieval from Maximum Distance Separable (MDS) coded storage system with $B$ Byzantine and $U$ unresponsive servers (U-B-MDS-MB-XTSPIR) is studied in this paper.
Externí odkaz:
http://arxiv.org/abs/2111.00467
This paper investigates the problem of Secure Multi-party Batch Matrix Multiplication (SMBMM), where a user aims to compute the pairwise products $\mathbf{A}\divideontimes\mathbf{B}\triangleq(\mathbf{A}^{(1)}\mathbf{B}^{(1)},\ldots,\mathbf{A}^{(M)}\m
Externí odkaz:
http://arxiv.org/abs/2103.09592
This paper investigates reducing sub-packetization of capacity-achieving schemes for uncoded Storage Constrained Private Information Retrieval (SC-PIR) systems. In the SC-PIR system, a user aims to retrieve one out of $K$ files from $N$ servers while
Externí odkaz:
http://arxiv.org/abs/2102.08058
The problem of $X$-secure $T$-colluding symmetric Private Polynomial Computation (PPC) from coded storage system with $B$ Byzantine and $U$ unresponsive servers is studied in this paper. Specifically, a dataset consisting of $M$ files is stored acros
Externí odkaz:
http://arxiv.org/abs/2010.09326
In a distributed storage system, private information retrieval (PIR) guarantees that a user retrieves one file from the system without revealing any information about the identity of its interested file to any individual server. In this paper, we inv
Externí odkaz:
http://arxiv.org/abs/1903.06921