Skip to content
Preprint

Certified in Theory, Broken in Practice: Assumption Gaps in Cryptographic Model Certification

Jul 2026 · 0 citations · 55 references
Computer Science

TL;DR

This work formalizes rigorous cryptographic security notions tailored to CMC frameworks, introduces a generic protocol template, and proves that it satisfies these requirements, which offer both cautionary evidence about existing approaches and constructive guidance for designing secure, privacy-preserving ML auditing protocols.

Abstract

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. As we show, this gap allows a model provider to 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.

View source

Similar papers

Preprint Aug 2026

Manipulation-Proof Oblivious Audits against Deceptive Model Providers

A novel audit protocol designed to significantly increase the post-audit detectability of manipulations by enabling the auditor to query the model in an oblivious manner and providing theoretical guarantees showing that, under this protocol, a provider attempting to hide unfairness must falsify a significantly larger number of responses.

Augustin Godinot, Sofiane Azogagh, Julien Ferry et al. · 0 citations
#federated learning Open access Oct 2026

SoK: Verifiable Integrity Claims for Privacy-Preserving Federated Learning

This SoK model federated learning as an append-only transcript of submissions, admissions, aggregation, and finalization events, and formalize verifiability as a collection of integrity claims issued by clients and the aggregator, and checked by different verifier classes.

Andrea Rizzini, Marco Esposito, Tommaso Gagliardoni et al. · 0 citations
Conference Open access 2026

CT-Monitor++: Improving the Certificate Transparency Ecosystem with Cryptographic and Security Checks

This work presents the design of a CT monitor that goes beyond traditional domain-based tracking by performing systematic security analysis on all certificates recorded in public CT logs, and demonstrates that the monitor is capable of keeping up with the current certificate issuance rates while performing all security checks.

Simone Orlando, Alessandro Barenghi, Gerardo Pelosi · 0 citations
Open access Aug 2026

Migrating to Hybrid Cryptography in Practice: The TutaCrypt Protocol and Its Security

This work presents the hybrid key establishment protocol TutaCrypt in a form that enables rigorous cryptographic analysis and defines two Bellare–Rogaway-style security models that precisely characterize the provided security guarantees.

Christian Holler, Tibor Jager, Tom Neuschulten · 0 citations

On the Privacy-Preserving Capabilities of PAVE Specifications in Learnware ∗

This paper formalizes two specification-induced risks in the learnware paradigm and shows that the resulting DP guarantees control both disclosure risk and amplification risk, and analyzes the induced privacy–utility trade-off to guide effective learn-ware identification while preserving privacy.

Hao-Yi Lei, Jin-Hui Wu, Zhi-Hao Tan et al. · 0 citations
Open access 2026

Privacy-Preserving Conformance Checking Using Quantum-Safe Fully Homomorphic Encryption

This paper introduces a novel PPCC method based on post-quantum fully homomorphic encryption that enables token-based replay fitness computation entirely in the encrypted domain using post-quantum FHE, and is the first method that enables token-based replay fitness computation entirely in the encrypted domain using post-quantum FHE.

H. A. D. L. Fuente-Anaya, Miguel Morales-Sandoval, H. Marín-Castro · 0 citations