Certified in Theory, Broken in Practice: Assumption Gaps in Cryptographic Model Certification
Carter Luck, Olive Franzese-McLaughlin, Elisaweta Masserova, Akira Takahashi, Antigoni Polychroniadou, Nicolas Papernot
摘要
Privacy-preserving machine learning auditing protocols allow auditors to assess models for properties such as accuracy or fairness, without revealing their internals or training data. This makes them especially attractive for auditing models deployed in sensitive domains such as healthcare or finance. For these protocols to be meaningful in real-world audit settings, though, their guarantees must reflect how the model will behave once deployed, rather than merely certifying its behavior during an audit. Existing security definitions often miss this mark: most certify model behavior only on a fixed audit dataset, without ensuring that the same guarantees generalize to other datasets drawn from the same distribution. We show that a model provider can attack many cryptographic model certification (CMC) schemes built on secure zero knowledge proofs (ZKP) by carefully engineering training data, resulting in models that exhibit benign behavior during an audit, but pathological behavior in practice. For example, we empirically demonstrate that an attacker can certify that a model achieves over 99% accuracy on an audit dataset, but less than 30% accuracy on fresh samples from the same distribution. To address this gap, we formalize rigorous cryptographic security notions tailored to CMC frameworks, introduce a generic protocol template, and prove that it satisfies these requirements. Our results thus offer both cautionary evidence about existing approaches and constructive guidance for designing secure, privacy-preserving ML auditing protocols.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper14
- Deep Learning with Differential PrivacyMartín Abadi, Andy Chu, Ian J. Goodfellow, H. Brendan McMahan 等CCS 2016 · 被引用 7,620 次
- Retiring Adult: New Datasets for Fair Machine LearningFrances Ding, Moritz Hardt, John Miller, Ludwig SchmidtNeurIPS 2021 · 被引用 671 次
- Zero Knowledge Proofs for Decision Tree Predictions and AccuracyJiaheng Zhang, Zhiyong Fang, Yupeng Zhang, Dawn SongCCS 2020 · 被引用 72 次
- Experimenting with Zero-Knowledge Proofs of TrainingSanjam Garg, Aarushi Goel, Somesh Jha, Saeed Mahloujifar 等CCS 2023 · 被引用 31 次
- How Benchmark Prediction from Fewer Data Misses the MarkGuanhua Zhang, Florian E. Dorner, Moritz HardtNeurIPS 2025 · 被引用 26 次
相关 Paper
- Trustless Audits without Revealing Data or ModelsSuppakit Waiwitlikhit, Ion Stoica, Yi Sun, Tatsunori Hashimoto 等ICML 2024 · 被引用 20 次
- Secure and Confidential Certificates of Online FairnessOlive Franzese, Ali Shahin Shamsabadi, Carter Luck, Hamed HaddadiNeurIPS 2025 · 被引用 10 次
- Confidential-PROFITT: Confidential PROof of FaIr Training of TreesAli Shahin Shamsabadi, Sierra Calanda Wyllie, Nicholas Franzese, Natalie Dullerud 等ICLR 2023
- FairProof : Confidential and Certifiable Fairness for Neural NetworksChhavi Yadav, Amrita Roy Chowdhury, Dan Boneh, Kamalika ChaudhuriICML 2024 · 被引用 20 次
- Confidential-DPproof: Confidential Proof of Differentially Private TrainingAli Shahin Shamsabadi, Gefei Tan, Tudor Cebere, Aurélien Bellet 等ICLR 2024 · 被引用 24 次
