Cryptology ePrint Archive: Report 2021/201

DAUnTLeSS: Data Augmentation and Uniform Transformation for Learning with Scalability and Security

Hanshen Xiao and Srinivas Devadas

Abstract: We revisit private optimization and learning from an information processing view. The main contribution of this paper is twofold. First, different from the classic cryptographic framework of operation-by-operation obfuscation, a novel private learning and inference framework via either random or data-dependent transformation on the sample domain is proposed. Second, we propose a novel security analysis framework, termed probably approximately correct (PAC) inference resistance, which bridges the information loss in data processing and prior knowledge. Using the entropy of private data, we develop an information theoretical security amplifier with a foundation of PAC security.

We study the applications of such a framework from generalized linear regression models to modern learning techniques, such as deep learning. On the information theoretical privacy side, we compare three privacy interpretations: ambiguity, statistical indistinguishability (Differential Privacy) and PAC inference resistance, and precisely describe the information leakage of our framework. We show the advantages of this new random transform approach with respect to underlying privacy guarantees, computational efficiency and utility for fully-connected neural networks.

Category / Keywords: foundations / Information-theoretical security, Private machine learning, Probably approximately correct inference, Differential Privacy,

Date: received 24 Feb 2021, last revised 25 May 2021

Contact author: hsxiao at mit edu, devadas at mit edu

Available format(s): PDF | BibTeX Citation

Version: 20210525:144530 (All versions of this report)

Short URL: ia.cr/2021/201