Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Wang, Zhusheng"'
Autor:
Wang, Zhusheng, Ulukus, Sennur
We consider the federated submodel learning (FSL) problem in a distributed storage system. In the FSL framework, the full learning model at the server side is divided into multiple submodels such that each selected client needs to download only the r
Externí odkaz:
http://arxiv.org/abs/2306.05402
Private information retrieval (PIR) is a privacy setting that allows a user to download a required message from a set of messages stored in a system of databases without revealing the index of the required message to the databases. PIR was introduced
Externí odkaz:
http://arxiv.org/abs/2304.14397
Autor:
Wang, Zhusheng, Ulukus, Sennur
We consider the federated submodel learning (FSL) problem and propose an approach where clients are able to update the central model information theoretically privately. Our approach is based on private set union (PSU), which is further based on mult
Externí odkaz:
http://arxiv.org/abs/2301.07686
Autor:
Wang, Zhusheng, Ulukus, Sennur
We introduce the problem of random symmetric private information retrieval (RSPIR). In canonical PIR, a user downloads a message out of $K$ messages from $N$ non-colluding and replicated databases in such a way that no database can know which message
Externí odkaz:
http://arxiv.org/abs/2205.07828
Autor:
Wang, Zhusheng, Ulukus, Sennur
We consider the total (upload plus download) communication cost of two-database symmetric private information retrieval (SPIR) through its relationship to conditional disclosure of secrets (CDS). In SPIR, a user wishes to retrieve a message out of $K
Externí odkaz:
http://arxiv.org/abs/2201.12327
Autor:
Wang, Zhusheng, Ulukus, Sennur
We consider the problem of symmetric private information retrieval (SPIR) with user-side common randomness. In SPIR, a user retrieves a message out of $K$ messages from $N$ non-colluding and replicated databases in such a way that no single database
Externí odkaz:
http://arxiv.org/abs/2105.05807
We investigate the problem of multi-party private set intersection (MP-PSI). In MP-PSI, there are $M$ parties, each storing a data set $\mathcal{p}_i$ over $N_i$ replicated and non-colluding databases, and we want to calculate the intersection of the
Externí odkaz:
http://arxiv.org/abs/2008.07504
We study the problem of private set intersection (PSI). In this problem, there are two entities $E_i$, for $i=1, 2$, each storing a set $\mathcal{P}_i$, whose elements are picked from a finite field $\mathbb{F}_K$, on $N_i$ replicated and non-colludi
Externí odkaz:
http://arxiv.org/abs/1912.13501
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.