Monte Carlo execution time estimation for Privacy-preserving Distributed Function Evaluation protocols

TL;DR

This paper explores the use of Monte Carlo methods to estimate execution times of privacy-preserving distributed function evaluation protocols, aiming to improve practical efficiency assessments over traditional asymptotic analysis.

Contribution

It introduces Monte Carlo-based estimation techniques for more accurate execution time predictions in privacy-preserving protocols, addressing limitations of asymptotic complexity analysis.

Findings

Monte Carlo methods provide better execution time estimates for small datasets.

Improved estimation can lead to more efficient protocol design.

Potential for enhanced practical deployment of privacy-preserving ML systems.

Abstract

Recent developments in Machine Learning and Deep Learning depend heavily on cloud computing and specialized hardware, such as GPUs and TPUs. This forces those using those models to trust private data to cloud servers. Such scenario has prompted a large interest on Homomorphic Cryptography and Secure Multi-Party Computation protocols that allow the use of cloud computing power in a privacy-preserving manner. When comparing the efficiency of such protocols, most works in literature resort to complexity analysis that gives asymptotic higher-bounding limits of computational cost when input size tends to infinite. These limits may be very different from the actual cost or execution time, when performing such computations over small, or average-sized datasets. We argue that Monte Carlo methods can render better computational cost and time estimates, fostering better design and implementation decisions for complex systems, such as Privacy-Preserving Machine Learning Frameworks.