arXiv · 2603.20107
Sharing The Secret: Distributed Privacy-Preserving Monitoring
Abstract
In traditional runtime verification, a system is typically observed by a monolithic monitor. Enforcing privacy in such settings is computationally expensive, as it necessitates heavy cryptographic primitives. Therefore, privacy-preserving monitoring remains impractical for real-time applications. In this work, we address this scalability challenge by distributing the monitor across multiple parties -- at least one of which is honest. This architecture enables the use of efficient secret-sharing schemes instead of computationally intensive cryptography, dramatically reducing over-head while maintaining strong privacy guarantees. While existing secret-sharing approaches are typically limited to one-shot executions which do not maintain an internal state, we introduce a protocol tailored for continuous monitoring that supports repeated evaluations over an evolving internal state (kept secret from the system and the monitoring entities). We implement our approach using the MP-SPDZ framework. Our experiments demonstrate that, under these architectural assumptions, our protocol is significantly more scalable than existing alternatives.
Explore related subjects
Keep this discovery
Mahyar Karimi, K. S. Thejaswini, Roderick Bloem, Thomas A. Henzinger. 2026-03-20. Sharing The Secret: Distributed Privacy-Preserving Monitoring. https://arxiv.org/abs/2603.20107
Cite the original work for its findings. Save a collection to share your selection of sources.