🤖 AI Summary
To address security and development efficiency bottlenecks of secure multi-party computation (MPC) protocols in modern networked applications, this paper introduces a novel type system tailored for low-level MPC protocols. Our approach pioneers an SMT-based (Z3) finite-field type inference mechanism, enabling compositional and extensible security verification over arbitrary prime fields. By integrating finite-field algebraic theory with the Prelude/Overture language framework, we achieve fully automated, high-precision formal verification of protocol correctness, confidentiality, and integrity. Compared to prior methods, our system significantly improves security verification coverage and developer trustworthiness—bridging theoretical rigor with engineering practicality. This work establishes a new paradigm for privacy-preserving computation that simultaneously ensures strong formal guarantees and real-world deployability.
📝 Abstract
Secure Multi-Party Computation (MPC) is an important enabling technology for data privacy in modern distributed applications. We develop a new type theory to automatically enforce correctness,confidentiality, and integrity properties of protocols written in the emph{Prelude/Overture} language framework. Judgements in the type theory are predicated on SMT verifications in a theory of finite fields, which supports precise and efficient analysis. Our approach is automated, compositional, scalable, and generalizes to arbitrary prime fields for data and key sizes.