ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

~ similar to 2607.18342· 20 results

cs.CRcs.LGRecentApr 18, 2026

Towards Deep Encrypted Training: Low-Latency, Memory-Efficient, and High-Throughput Inference for Privacy-Preserving Neural Networks

Nges Brian Njungle, Eric Jahns, Michel A. Kinsy

This paper develops optimized algorithms and a pipeline architecture for high-throughput, memory-efficient batch processing of encrypted neural network inference, significantly improving performance o…

View →
cs.CRcs.LGRecentMay 21, 2026

Encrypted Neural Networks without Overflows

Philipp Kern, Lorenzo Rovida, Samuel Teuber, Edoardo Manino +2 more

The paper addresses the vulnerability of CKKS-based Fully Homomorphic Encryption (FHE) to overflow attacks by proposing a formal verification technique that guarantees certified bounds on all neuron r…

View →
cs.CRcs.ARRecentApr 6, 2026

GPU Acceleration of TFHE-Based High-Precision Nonlinear Layers for Encrypted LLM Inference

Guoci Chen, Xiurui Pan, Qiao Li, Bo Mao +4 more

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

View →
cs.CRRecentMay 6, 2026

A Pragmatic Comparison of Cryptographic Computation Technologies for Machine Learning

Marcus Taubert, Adam Skuta, Thomas Loruenser

This paper provides a comparative analysis and benchmarking of Secure Multi-Party Computation (SMPC) and Fully Homomorphic Encryption (FHE) for machine learning, finding that the optimal choice depend…

View →
cs.AREmpiricalRecentJul 21, 2026

An Efficient Fault-Tolerance Scheme for CKKS Computation on CPUs

Jianan Mu, Ge Yu, Tenghui Hua, Liang Kong +5 more

This paper presents an efficient fault-tolerance scheme for CPU-based fully homomorphic encryption (FHE) that reduces protection overhead and achieves 100 percent detection rate under random single-bi…

View →
cs.CRcs.AIRecentApr 16, 2026

SecureRouter: Encrypted Routing for Efficient Secure Inference

Yukuan Zhang, Mengxin Zheng, Qian Lou

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…

View →
cs.CRcs.ARRecentMar 24, 2026

On the Vulnerability of FHE Computation to Silent Data Corruption

Jianan Mu, Ge Yu, Zhaoxuan Kan, Song Bian +5 more

This paper evaluates the vulnerability of Fully Homomorphic Encryption (FHE) computation to silent data corruption (SDC) using large-scale fault-injection experiments and theoretical analysis.

View →
cs.CRcs.LGRecentMar 19, 2026

Towards Verifiable AI with Lightweight Cryptographic Proofs of Inference

Pranay Anchuri, Matteo Campanelli, Paul Cesaretti, Rosario Gennaro +3 more

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…

View →
cs.ARcs.LGEmpiricalRecentJul 21, 2026

From Bit-Position Sensitivity to Unequal Error Protection for DNN Inference Memory

Muhammad Husnain Mubarik, Karthik Mohan Kumar, Pedro Antonio Pena, Keshavan Varadarajan +1 more

This paper characterizes per-bit-position fault sensitivity in machine learning inference across various workloads and floating-point formats, identifying a sharp bit-sensitivity transition and derivi…

View →
cs.CRRecentMar 31, 2026

Beyond Latency: A System-Level Characterization of MPC and FHE for PPML

Pengzhi Huang, Kiwan Maeng, G. Edward Suh

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…

View →
cs.CRcs.LGRecentMay 21, 2026

Decision-Aware Quadratic ReLU Replacement for HE-Friendly Inference

Rui Li, Wenyuan Wu, Weijie Miao

The paper proposes a decision-aware quadratic replacement for the ReLU activation function, enabling low-degree, calibration-lossless polynomial approximations for neural network inference under Fully…

View →
cs.CReess.SYRecentMay 14, 2026

On the (non-)resilience of encrypted controllers to covert attacks

Philipp Binfet, Janis Adamek, Moritz Schulze Darup

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…

View →
cs.CRcs.AIRecentMar 20, 2026

Meeting in the Middle: A Co-Design Paradigm for FHE and AI Inference

Bernardo Magri, Benjamin Marsh, Paul Gebheim

The paper proposes a co-design paradigm, 'Meeting in the Middle,' to make Fully Homomorphic Encryption (FHE) practical for AI inference by optimizing both the cryptographic schemes and the underlying…

View →
cs.LOcs.AIRecentMay 28, 2026

Neural Network Verification using Partial Multi-Neuron Relaxation

Ido Shmuel, Guy Katz

The paper introduces partial multi-neuron relaxation, a novel verification technique that selectively computes tight linear bounds for a small subset of neurons to improve the efficiency and tightness…

View →
cs.CRRecentApr 11, 2026

EncFormer: Secure and Efficient Transformer Inference over Encrypted Data

Yufan Zhu, Chao Jin, Khin Mi Mi Aung, Xiaokui Xiao

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)…

View →
cs.CRRecentJun 4, 2026

SecRL-Prune: Structured Reinforcement Learning-Based Pruning of CodeLLMs for Preserving Adversarial Code Mutation

Parsa Memarzadehsaghezi, Pooria Madani, Khalil El-Khatib

The paper introduces SecRL-Prune, a structured reinforcement learning framework that effectively prunes CodeLLMs while preserving their critical ability to generate adversarial, functionality-preservi…

View →
cs.CRcs.LGRecentApr 6, 2026

Fine-Tuning Integrity for Modern Neural Networks: Structured Drift Proofs via Norm, Rank, and Sparsity Certificates

Zhenhang Shang, Kani Chen

The paper introduces Fine-Tuning Integrity (FTI), a security goal that uses Succinct Model Difference Proofs (SMDPs) to cryptographically prove that a fine-tuned model update adheres to specific struc…

View →
cs.CRRecentMay 8, 2026

TENNOR: Trustworthy Execution for Neural Networks through Obliviousness and Retrievals

Zifan Qu, Vasileios P. Kemerlis, Giuseppe Ateniese, Evgenios M. Kornaropoulos

TENNOR is a system that enables efficient and private training of wide neural networks in untrusted cloud environments by using doubly oblivious primitives and a novel memory-efficient hashing scheme.

View →
cs.CRcs.AIcs.DCRecentApr 3, 2026

AEGIS: Scaling Long-Sequence Homomorphic Encrypted Transformer Inference via Hybrid Parallelism on Multi-GPU Systems

Zhaoting Gong, Ran Ran, Fan Yao, Wujie Wen

AEGIS is a novel system that significantly improves the scalability of running large, long-sequence Transformer models under Fully Homomorphic Encryption (FHE) on multi-GPU systems by optimizing data…

View →
cs.CRRecentApr 12, 2026

Public Key Encryption from High-Corruption Constraint Satisfaction Problems

Isaac M Hair, Amit Sahai

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).

View →