Zobrazeno 1 - 10
of 108
pro vyhledávání: '"KARPUK, DAVID"'
Private information retrieval (PIR) considers the problem of retrieving a data item from a database or distributed storage system without disclosing any information about which data item was retrieved. Secure PIR complements this problem by further r
Externí odkaz:
http://arxiv.org/abs/2408.00542
A new framework for interference alignment in secure and private information retrieval (PIR) from colluding servers is proposed, generalizing the original cross-subspace alignment (CSA) codes proposed by Jia, Sun, and Jafar. The general scheme is bui
Externí odkaz:
http://arxiv.org/abs/2405.18052
Autor:
Cartor, Ryann, D'Oliveira, Rafael G. L., Rouayheb, Salim El, Heinlein, Daniel, Karpuk, David, Sprintson, Alex
We consider the problem of secure distributed matrix multiplication in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. We show how to construct polynomial schemes for the outer product par
Externí odkaz:
http://arxiv.org/abs/2405.06121
Autor:
Karpuk, David, Tajeddine, Razane
We present Modular Polynomial (MP) Codes for Secure Distributed Matrix Multiplication (SDMM). The construction is based on the observation that one can decode certain proper subsets of the coefficients of a polynomial with fewer evaluations than is n
Externí odkaz:
http://arxiv.org/abs/2305.03465
We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. We construct polynomial codes for SDMM by studying a recently
Externí odkaz:
http://arxiv.org/abs/2106.09816
Autor:
Bogart, Tristram, Horlemann-Trautmann, Anna-Lena, Karpuk, David, Neri, Alessandro, Velasco, Mauricio
We propose reducible algebraic curves as a mechanism to construct Partial MDS (PMDS) codes geometrically. We obtain new general existence results, new explicit constructions and improved estimates on the smallest field sizes over which such codes can
Externí odkaz:
http://arxiv.org/abs/2007.14829
We consider the problem of secure distributed matrix multiplication in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. In this paper, we answer the following question: Is it beneficial to
Externí odkaz:
http://arxiv.org/abs/2001.05568
Private information retrieval (PIR) is the problem of privately retrieving one out of $M$ original files from $N$ severs, i.e., each individual server learns nothing about the file that the user is requesting. Usually, the $M$ files are replicated or
Externí odkaz:
http://arxiv.org/abs/1909.10289
We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. We construct polynomial codes for SDMM by studying a combinato
Externí odkaz:
http://arxiv.org/abs/1812.09962
Autor:
Raviv, Netanel, Karpuk, David A.
Private computation is a generalization of private information retrieval, in which a user is able to compute a function on a distributed dataset without revealing the identity of that function to the servers. In this paper it is shown that Lagrange e
Externí odkaz:
http://arxiv.org/abs/1812.04142