Privacy-Preserving Visual Learning Using Doubly Permuted Homomorphic Encryption

2017 IEEE International Conference on Computer Vision (ICCV)(2017)

引用 72|浏览92
暂无评分
摘要
We propose a privacy-preserving framework for learning visual classifiers by leveraging distributed private image data. This framework is designed to aggregate multiple classifiers updated locally using private data and to ensure that no private information about the data is exposed during and after its learning procedure. We utilize a homomorphic cryptosystem that can aggregate the local classifiers while they are encrypted and thus kept secret. To overcome the high computational cost of homomorphic encryption of high-dimensional classifiers, we (1) impose sparsity constraints on local classifier updates and (2) propose a novel efficient encryption scheme named doubly-permuted homomorphic encryption (DPHE) which is tailored to sparse high-dimensional data. DPHE (i) decomposes sparse data into its constituent non-zero values and their corresponding support indices, (ii) applies homomorphic encryption only to the non-zero values, and (iii) employs double permutations on the support indices to make them secret. Our experimental evaluation on several public datasets shows that the proposed approach achieves comparable performance against state-of-the-art visual recognition methods while preserving privacy and significantly outperforms other privacy-preserving methods.
更多
查看译文
关键词
privacy-preserving visual learning,doubly permuted homomorphic encryption,privacy-preserving framework,visual classifiers,leveraging distributed private image data,multiple classifiers,private data,private information,learning procedure,homomorphic cryptosystem,novel efficient encryption scheme,high-dimensional data,sparse data,visual recognition methods,privacy-preserving methods
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要