Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Luo, Qiyao"'
We present LINQ, the first join protocol with linear complexity (in both running time and communication) under the secure multi-party computation model (MPC). It can also be extended to support all free-connex queries, a large class of select-join-ag
Externí odkaz:
http://arxiv.org/abs/2403.13492
Almost Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy
Differentially private mechanisms achieving worst-case optimal error bounds (e.g., the classical Laplace mechanism) are well-studied in the literature. However, when typical data are far from the worst case, \emph{instance-specific} error bounds -- w
Externí odkaz:
http://arxiv.org/abs/2403.10116
We present a protocol in the shuffle model of differential privacy (DP) for the \textit{frequency estimation} problem that achieves error $\omega(1)\cdot O(\log n)$, almost matching the central-DP accuracy, with $1+o(1)$ messages per user. This exhib
Externí odkaz:
http://arxiv.org/abs/2111.06833
A closer integration of machine learning and relational databases has gained steam in recent years due to the fact that the training data to many ML tasks is the results of a relational query (most often, a join-select query). In a federated setting,
Externí odkaz:
http://arxiv.org/abs/2109.14806
Autor:
Luo, Qiyao1, Zhao, Liang1, Hu, Jianxing1, Jin, Hongwei1, Liu, Zhenming1 zmliu@bjmu.edu.cn, Zhang, Liangren1 liangren@bjmu.edu.cn
Publikováno v:
PLoS ONE. 2/14/2017, Vol. 12 Issue 2, p1-19. 19p.