Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2501.00824

Help | Advanced Search

Computer Science > Cryptography and Security

arXiv:2501.00824 (cs)
[Submitted on 1 Jan 2025 (v1) , last revised 20 Jun 2025 (this version, v7)]

Title: How Breakable Is Privacy: Probing and Resisting Model Inversion Attacks in Collaborative Inference

Title: 隐私有多脆弱:在协作推理中探测和抵抗模型反转攻击

Authors:Rongke Liu, Youwen Zhu, Dong Wang, Gaoning Pan, Xingyu He, Weizhi Meng
Abstract: Collaborative inference (CI) improves computational efficiency for edge devices by transmitting intermediate features to cloud models. However, this process inevitably exposes feature representations to model inversion attacks (MIAs), enabling unauthorized data reconstruction. Despite extensive research, there is no established criterion for assessing the difficulty of MIA implementation, leaving a fundamental question unanswered: \textit{What factors truly and verifiably determine the attack's success in CI?} Moreover, existing defenses lack the theoretical foundation described above, making it challenging to regulate feature information effectively while ensuring privacy and minimizing computational overhead. These shortcomings introduce three key challenges: theoretical gap, methodological limitation, and practical constraint. To overcome these challenges, we propose the first theoretical criterion to assess MIA difficulty in CI, identifying mutual information, entropy, and effective information volume as key influencing factors. The validity of this criterion is demonstrated by using the mutual information neural estimator. Building on this insight, we propose SiftFunnel, a privacy-preserving framework to resist MIA while maintaining usability. Specifically, we incorporate linear and non-linear correlation constraints alongside label smoothing to suppress redundant information transmission, effectively balancing privacy and usability. To enhance deployability, the edge model adopts a funnel-shaped structure with attention mechanisms, strengthening privacy while reducing computational and storage burdens. Experiments show that, compared to state-of-the-art defense, SiftFunnel increases reconstruction error by $\sim$30\%, lowers mutual and effective information metrics by $\geq$50\%, and reduces edge burdens by almost $20\times$, while maintaining comparable usability.
Abstract: 协作推理(CI)通过将中间特征传输到云模型,提高了边缘设备的计算效率。 然而,这一过程不可避免地使特征表示暴露于模型反转攻击(MIAs),从而允许未经授权的数据重建。 尽管已有大量研究,但尚无评估MIA实施难度的既定标准,留下了一个基本问题:\textit{哪些因素真正且可验证地决定了CI中的攻击成功?}此外,现有的防御措施缺乏上述理论基础,使得在确保隐私的同时有效调控特征信息变得困难。 这些不足带来了三个关键挑战:理论差距、方法限制和实际约束。 为克服这些挑战,我们提出了第一个用于评估CI中MIA难度的理论标准,确定互信息、熵和有效信息量作为关键影响因素。 该标准的有效性通过互信息神经估计器得到验证。 基于这一见解,我们提出了SiftFunnel,一种在保持可用性的前提下抵抗MIA的隐私保护框架。 具体而言,我们结合线性和非线性相关约束以及标签平滑来抑制冗余信息传输,有效地平衡了隐私和可用性。 为了提高可部署性,边缘模型采用带有注意力机制的漏斗结构,增强了隐私性同时减少了计算和存储负担。 实验表明,与最先进的防御方法相比,SiftFunnel使重建误差增加了$\sim$30%,互信息和有效信息指标分别降低了$\geq$50%,并几乎减少了$20\times$的边缘负担,同时保持了相当的可用性。
Comments: 15 pages, 5 figures, 6 tables. The experimental data have been corrected, and some explanations have been supplemented
Subjects: Cryptography and Security (cs.CR) ; Information Theory (cs.IT)
Cite as: arXiv:2501.00824 [cs.CR]
  (or arXiv:2501.00824v7 [cs.CR] for this version)
  https://doi.org/10.48550/arXiv.2501.00824
arXiv-issued DOI via DataCite

Submission history

From: Rongke Liu [view email]
[v1] Wed, 1 Jan 2025 13:00:01 UTC (11,989 KB)
[v2] Thu, 16 Jan 2025 02:38:55 UTC (12,244 KB)
[v3] Thu, 6 Mar 2025 06:30:00 UTC (12,963 KB)
[v4] Fri, 18 Apr 2025 02:06:06 UTC (3,713 KB)
[v5] Wed, 28 May 2025 02:15:54 UTC (3,845 KB)
[v6] Tue, 3 Jun 2025 01:32:37 UTC (3,717 KB)
[v7] Fri, 20 Jun 2025 14:59:56 UTC (3,722 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.CR
< prev   |   next >
new | recent | 2025-01
Change to browse by:
cs
cs.IT
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号