The paper experimentally validates a novel secure two-party computation protocol for running dynamic controllers over secret sharing, demonstrating its feasibility for real-time control systems despit…

This paper provides a comprehensive, system-level comparison of MPC and FHE for Privacy-Preserving Machine Learning (PPML) across various models and environments, moving beyond single-metric latency a…

The paper proposes a provably secure, single-round two-party computation protocol for approximate matrix multiplication using lattice-based cryptography, demonstrated for secure control law implementa…

The paper demonstrates that standard homomorphic encryption (HE) schemes are insufficient to guarantee integrity in networked control systems (NCS) against covert attacks, proposing instead a verifiab…

This paper proposes CertifiedCacheMPC, a caching system for Model Predictive Control in hierarchical quadruped controllers, ensuring primal feasibility and cost suboptimality.

SecureRouter is an encrypted routing and inference framework that accelerates secure transformer inference by adaptively selecting the optimal model size based on the encrypted input, achieving a 1.95…

EncFormer is a novel two-party framework that significantly improves the efficiency and scalability of private Transformer inference by optimizing the combination of Fully Homomorphic Encryption (FHE)…

The paper proposes a novel framework combining evolutionary algorithms and Secure Multi-Party Computation (MPC) to enable privacy-preserving distributed optimization that meets strict time deadlines.

The paper proposes PPRoute, a privacy-preserving LLM routing framework that significantly speeds up secure model selection while maintaining high performance comparable to non-private methods.

The paper introduces a lightweight, sampling-based cryptographic protocol for verifiable AI inference that drastically reduces proving overhead from minutes to milliseconds by leveraging statistical p…

The paper introduces a novel public key encryption scheme with high security by leveraging the conjectured intractability of two types of highly corrupted constraint satisfaction problems (CSPs).

The paper proposes a Public/Private Hybrid Head-VFL (PPHH-VFL) architecture that significantly accelerates secure time-series inference by splitting the model head into efficient public and secure pri…

The paper uses majorization theory to analyze lattice reduction, showing that local swaps smooth the Gram-Schmidt profile and deriving variational and telescoping identities for the worst-case profile…

The paper introduces TIGER, a GPU-accelerated framework that significantly speeds up high-precision evaluation of nonlinear layers for encrypted LLM inference using TFHE.

This paper introduces Polynomial-Sensitivity-Aware Pruning (PSAP), a reliability-aware structured pruning method for neural networks under homomorphic encryption, reducing catastrophic layer vulnerabi…

The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…

This paper studies a variant of the quantum XOR game model, called tilted XOR games, and shows that approximating their quantum value to constant precision is RE-complete.

The paper proposes a Secure Parallel Determinant Computation (SPDC) framework that enables efficient, privacy-preserving, and scalable matrix determinant calculation across multiple untrusted edge ser…