.png){kind=icon}
返回
Quantile estimation for encrypted data
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-023-04837-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
As data-based studies continue to increase, the need for privacy protection has become a crucial issue. One proposed solution to address this obstacle is homomorphic encryption (HE); however, the complexity of handling ciphertexts used in HE poses a serious challenge due to the extended calculation time of elementary operations. As a result, it has much more complex than handling plaintexts, limiting various subsequent data analyses. This paper proposes a quantile estimation method for encrypted data, where quantiles are core statistics for understanding the data distribution in statistical analysis. We developed an HE-friendly method for large homomorphic encrypted data using an approximate quantile loss function. Numerical studies show that the proposed method significantly improves the calculation time for simulated and real homomorphically encrypted data. Specifically, the proposed method takes approximately 26 minutes for calculating a dataset of four million, which is about 14 times faster than the sorting method. Furthermore, we applied the proposed method to construct boxplots for homomorphically encrypted data.
Keyword:
Full homomorphically encrypted data
Median
Optimization
Boxplot
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
Privacy-Preserving Machine Learning With Fully Homomorphic Encryption for Deep Neural Network.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏分享收藏Low-Latency Multiuser Two-Way Wireless Relaying for Spectral and Energy Efficiencies低延迟多用户双向无线中继，实现频谱和能量效率
OAAI
OAAI分享收藏Micro/nano-scaled carbon spheres based on hydrothermal carbonization of agarose基于琼脂糖水热碳化的微/纳米级碳球
PREAI
分享收藏
查看更多内容