期刊文献+

基于秘密共享的轻量级隐私保护ViT推理框架

Light weighted privacy protection ViT inference framework based on secret sharing
下载PDF
导出
摘要 针对广泛应用于图像处理的ViT推理框架存在泄露用户隐私数据的风险,而已有隐私保护推理框架存在计算效率较低、在线通信量较大等问题,提出了一种高效隐私保护推理框架SViT。该框架由2个边缘服务器协作执行基于秘密共享设计的安全计算协议SSoftmax、SLayerNorm、SGeLU,在保持ViT-B/16原始框架结构的情况下,解决了隐私保护框架推理开销大的问题。理论分析与实验表明,相比CrypTen,SViT在计算效率和在线通信开销方面分别提升了2~6倍和4~14倍。 The ViT(vision transformer)inference framework,which was widely used in image processing,was found to have a risk of leaking user privacy data.However,existing privacy protection inference frameworks had problems such as low computational efficiency and high online communication volume.To address this issue,a highly efficient privacy protection inference framework SViT was proposed.Two edge servers collaborated to execute secure computing protocols based on secret sharing design,such as SSoftmax,SLayerNorm,SGeLU,etc.While maintaining the original framework structure of ViT-B/16,the problem of large inference overhead in privacy protection framework was solved.Theoretical analysis and experiments show that compared to Crypton,SViT has improved computational efficiency by 2~6 times and online communication overhead by 4~14 times,respectively.
作者 马敏 付钰 黄凯 贾潇风 MA Min;FU Yu;HUANG Kai;JIA Xiaofeng(Department of Information Security,Naval University of Engineering,Wuhan 430033,China;School of Software Engineering,Hubei Open University,Wuhan 430074,China;College of Joint Operation,National Defense University,Shijiazhuang 050084,China;School of Computer Science and Technology,Zhejiang Gongshang University,Hangzhou 310018,China)
出处 《通信学报》 EI CSCD 北大核心 2024年第4期27-38,共12页 Journal on Communications
基金 国家自然科学基金资助项目(No.62102422)。
关键词 隐私保护 秘密共享 图像分类 安全计算协议 privacy protection secret sharing image classification secure computing protocol
  • 相关文献

参考文献4

二级参考文献95

  • 1CULNAN M J, ARMSTRONG P K. Information privacy concerns, procedural fairness, and impersonal trust: an empirical investigation[J]. Organization Science, 1999, 10(1): 104-115.
  • 2DINEV T, HART P. Privacy concems and intemet use-a model of trade-off factors[C]//,~cademy of Management. c2003:1-6.
  • 3LI H, SARATHY R, XU H. Understanding situational online informa- tion disclosure as a privacy calculus[J]. Journal of Computer Informa- tion Systems, 2010, 51(1): 62-71.
  • 4KEHR F, KOWATSCH T, WENTZEL D, et al. Blissfully ignorant: the effects of general privacy concerns, general institutional trust, and af- fect in the privacy calculus[J]. Information Systems Journal, 2015, 25(6): 607-635.
  • 5MACHANAVAJJHALA A, KIFER D, GEHRKE J, ~t al. /-diversity: privacy beyond k-anonymity[J]. ACM Transactions on Knowledge Discovery from Data (TKDD), 2007, 1(1): 3.
  • 6AGRAWAL D, AGGARWAL C C. On the design and quantification of privacy preserving data mining algorithms[C]//The 20th ACM SIG- MOD-SIGACT-SIGART Symposium on Principles of Database Sys- tems. ACM, c2001 : 247-255.
  • 7LIU K, KARGUPTA H, RYAN J. Random projection-based multipli- eative data perturbation for privacy preserving distributed data min- ing[J]. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(1): 92-106.
  • 8OLIVEIRA S R M, ZAIANE O R. Privacy preserving clustering by data transformation[C]//The 18th Brazilian Symposium on Databases. c2003:304-318.
  • 9OLIVEIRA S R M, ZAIANE O R. Privacy preserving clustering by object similarity-based representation and dimensionality reduction transformation[C]/Fl'he Workshop on Privacy and Security Aspects of Data Mining. e2004:21-30.
  • 10OLIVEIRA S R M, ZAIANE 0 R. Privacy preserving frequent itemsetmining[C]//The IEEE International Conference on Privacy, Security and Data Mining-Volume 14, Australian Computer Society. c2002: 43-54.

共引文献86

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部