InstaHide's Sample Complexity When Mixing Two Private Images
University of California, Berkeley(加州大学伯克利分校);Adobe Research(奥多比研究院);Columbia University(哥伦比亚大学);Boston University(波士顿大学);Simons Institute for the Theory of Computing(西蒙斯理论计算研究所);Duke University(杜克大学)
Training neural networks usually require large numbers of sensitive training data, and how to protect the privacy of training data has thus become a critical topic in deep learning research. InstaHide is a state-of-the-art scheme to protect training data privacy with only minor effects on test accuracy, and its security has become a salient question. In this paper, we systematically study recent attacks on InstaHide and present a unified framework to understand and analyze these attacks. We find that existing attacks either do not have a provable guarantee or can only recover a single private image. On the current InstaHide challenge setup, where each InstaHide image is a mixture of two private images, we present a new algorithm to recover all the private images with a provable guarantee and optimal sample complexity. In addition, we also provide a computational hardness result on retrieving all InstaHide images. Our results demonstrate that InstaHide is not information-theoretically secure but computationally secure in the worst case, even when mixing two private images.
On the Tradeoff between Privacy Preservation and Byzantine-Robustness in Decentralized Learning
School of Computer Science and Engineering, Sun Yat-Sen University(中山大学计算机科学与工程学院);Department of Electrical and Computer Engineering, University of California, San Diego(加利福尼亚大学圣地亚哥分校电气与计算机工程系)
Differentially Private Decentralized Dataset Synthesis Through Randomized Mixing with Correlated Noise
School of Data and Sciences(数据与科学学院);BRAC University(布拉克大学);Electrical and Computer Engineering(电气与计算机工程);University of California, Santa Barbara(加州大学圣巴巴拉分校);Electrical and Electronic Engineering(电气与电子工程);Bangladesh University Engineering and Technology(孟加拉工程与技术大学)
Near-Optimal Private Linear Regression via Iterative Hessian Mixing
Department of EECS, Massachusetts Institute of Technology, US(麻省理工学院电子工程与计算机科学系);School of Computer Science and Engineering, The Hebrew University of Jerusalem, IL(耶路撒冷希伯来大学计算机科学与工程学院)
Deep Learning under Fractional-Order Differential Privacy
MESA Lab, Dept. of EECS University of California, Merced(加州大学默塞德分校电子工程与计算机科学系MESA实验室);Dept. of Applied Mathematics University of California, Merced(加州大学默塞德分校应用数学系)
Fraunhofer SIT at CheckThat! 2023: Mixing Single-Modal Classifiers to Estimate the Check-Worthiness of Multi-Modal Tweets
Fraunhofer Institute for Secure Information Technology SIT(弗劳恩霍夫安全信息技术研究所);ATHENE - National Research Center for Applied Cybersecurity(ATHENE——国家应用网络安全研究中心)