<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Model procurement for industrial cyber-physical systems using cryptographic performance attestation</dc:title><dc:creator>Bojič Burgos,	Jay	(Avtor)
	</dc:creator><dc:creator>Sedlar,	Urban	(Avtor)
	</dc:creator><dc:creator>Pustišek,	Matevž	(Avtor)
	</dc:creator><dc:subject>zero knowledge proofs</dc:subject><dc:subject>smart contracts</dc:subject><dc:subject>cyber-physical systems</dc:subject><dc:subject>industrial IoT</dc:subject><dc:subject>IT/OT convergence</dc:subject><dc:subject>privacy-preserving</dc:subject><dc:description>Integrating third-party Machine Learning (ML) models into industrial Operational Technology (OT) creates a procurement deadlock: operators cannot verify vendor performance claims without sharing representative evaluation data with vendors, while vendors refuse to reveal proprietary model weights before purchase, rendering traditional safeguards such as Non-Disclosure Agreements technically unenforceable. This paper introduces a framework combining Zero-Knowledge Proofs (ZKPs) with smart contracts to enable trust-minimized, cryptographically verifiable competitive model procurement in Industrial Cyber-Physical Systems (ICPS). Vendors cryptographically prove that their model outperforms a legacy baseline without disclosing proprietary weights, a process we term cryptographic performance attestation, while the on-chain workflow automates escrow, proof verification, and best-vendor selection with arbiter-based dispute resolution. ZKP privacy is scoped to vendor model weights; operator-side evaluation-data confidentiality is managed separately via synthetic, de-identified, or public benchmark data. We analyze three ZKP workflow variations and evaluate them on consumer-grade hardware, achieving proving times of approximately three seconds and sub-dollar on-chain verification costs under Layer-2 fee assumptions for the recommended single-proof variation, while identifying computational trade-offs of recursive proof aggregation. The entire verification phase operates offline with no impact on real-time OT control paths, bridging the IT/OT pre-transaction trust gap while deferring artifact deployment to existing OT tooling.</dc:description><dc:date>2026</dc:date><dc:date>2026-03-23 13:49:35</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>181032</dc:identifier><dc:identifier>UDK: 004</dc:identifier><dc:identifier>ISSN pri članku: 1999-5903</dc:identifier><dc:identifier>DOI: 10.3390/fi18030146</dc:identifier><dc:identifier>COBISS_ID: 272668675</dc:identifier><dc:language>sl</dc:language></metadata>
