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

~ similar to 2604.23490v1· 20 results

cs.CRRecentApr 21, 2026

Efficient Arithmetic-and-Comparison Homomorphic Encryption with Space Switching

Erwin Eko Wahyudi, Yan Solihin, Qian Lou

The paper proposes a novel space switching method to efficiently unify arithmetic and comparison operations within Fully Homomorphic Encryption (FHE) schemes, achieving significant performance improve…

View →
cs.ARcs.CRRecentMay 29, 2026

HE^2: A Communication-Light Heterogeneous Architecture for Efficient Fully Homomorphic Encryption

Shangyi Shi, Husheng Han, Zhaoxuan Kan, Yinghao Yang +7 more

The paper proposes $HE^2$, a novel communication-light heterogeneous accelerator architecture that significantly improves the efficiency of Fully Homomorphic Encryption (FHE) by optimizing dataflow an…

View →
cs.ARcs.CRRecentMay 29, 2026

HE^2: A Communication-Light Heterogeneous Architecture for Efficient Fully Homomorphic Encryption

Shangyi Shi, Husheng Han, Zhaoxuan Kan, Yinghao Yang +7 more

The paper proposes $HE^2$, a novel communication-light heterogeneous accelerator architecture that significantly improves the efficiency of Fully Homomorphic Encryption (FHE) by optimizing dataflow an…

View →
cs.CRquant-phRecentMay 16, 2026

quantum-safe: Bridging the Post-Quantum Production Gap with a Hybrid-by-Default Python Cryptography Library

Animesh Shaw

The paper introduces 'quantum-safe,' a Python library that addresses the remaining 'production gap' in post-quantum cryptography (PQC) by providing robust, easy-to-use hybrid implementations and compr…

View →
cs.CRRecentMay 5, 2026

Quantum-Resistant Networks: A Review of Primitives, Protocols and Best Practices

Elisa Bertino, Ramana Kompella, Ashish Kundu, Cristina Nita-Rotaru +2 more

This paper provides a comprehensive, system-level taxonomy for designing quantum-resistant network architectures, moving beyond simple protocol substitutions to address key distribution and management…

View →
quant-phcs.CRmath.CORecentMay 17, 2026

Module Lattice Security (Part IV): Probabilistic Polynomial Quantum Attack on Module-LWE over 2-Power Cyclotomics

Ming-Xing Luo

This paper presents a quantum attack on Module-LWE based lattice schemes like ML-KEM, demonstrating a polynomial-time quantum algorithm with a high success probability.

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 →
quant-phcs.CRRecentMay 6, 2026

Fundamental Limitations of Post-Quantum Cryptographic Architectures

Jiho Jung, Donghwa Ji, Mingyu Lee, Kabgyun Jeong

The paper argues that current lattice-based post-quantum cryptography, which relies on injecting noise, is not unconditionally secure because advanced quantum error correction and learning techniques…

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 →
quant-phcs.CRRecentApr 7, 2026

PQC-Enhanced QKD Networks: A Layered Approach

Paul Spooren, Andreas Neuhold, Sebastian Ramacher, Thomas Hühn

The paper proposes a layered, modular network architecture combining Quantum Key Distribution (QKD) and Post-Quantum Cryptography (PQC) to achieve scalable, end-to-end post-quantum security in multi-h…

View →
cs.CRcs.LGRecentMay 15, 2026

Public-Decay Homomorphic State Space Models for Private Sequence Inference

Luis Brito

The paper introduces public-decay Homomorphic State Space Models (HSSMs) that enable efficient, high-accuracy sequence inference directly on encrypted data, significantly outperforming existing encryp…

View →
cs.CRRecentApr 20, 2026

From Finite Enumeration to Universal Proof: Ring-Theoretic Foundations for PQC Hardware Masking Verification

Ray Iskander, Khaled Kirah

The paper provides the first machine-checked universal proof, using ring theory, that value-independence implies identical marginal distributions for arithmetic masking, thereby extending the verifica…

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.CRRecentMar 18, 2026

Data Obfuscation for Secure Use of Classical Values in Quantum Computation

Amal Raj, Vivek Balachandran

This paper introduces the first explicit data obfuscation technique to protect classical sensitive values during the execution phase of quantum computation.

View →
quant-phcs.CRRecentMar 30, 2026

Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations

Ryan Babbush, Adam Zalcman, Craig Gidney, Michael Broughton +5 more

The paper estimates the quantum resources required to break 256-bit ECC cryptography and warns that fast-clock quantum computers could enable on-spend attacks on modern cryptocurrencies, necessitating…

View →
cs.CRcs.SEquant-phRecentApr 8, 2026

Broken Quantum: A Systematic Formal Verification Study of Security Vulnerabilities Across the Open-Source Quantum Computing Simulator Ecosystem

Dominik Blain

The paper presents Broken Quantum, a comprehensive formal security audit that identifies 547 security vulnerabilities across 45 open-source quantum computing simulators, revealing critical flaws in me…

View →
cs.CRRecentMay 15, 2026

Beyond Controlled Noise: Achieving Symmetric FHE through Dynamic Position Shifting

Mostefa Kara

The paper proposes a novel symmetric Fully Homomorphic Encryption (FHE) scheme that manages noise growth and computational overhead by fragmenting the plaintext and using a dual-regulator system for m…

View →
cs.CRRecentMay 19, 2026

A Survey on Security with Quantum Computing

Manik Kumar Sangala, Robin Naira, Akhirul Islam, Sudip Biswas +1 more

This survey provides a comprehensive review of the security challenges, threats, and mitigation strategies associated with the rapid advancement of quantum computing.

View →
cs.CRRecentMay 3, 2026

Plausible Deniability in Fully Homomorphic Computation

Shahzad Ahmad, Stefan Rass, Zahra Seyedi

The paper introduces a framework, PD-FHC, that allows users to outsource Boolean computations to an untrusted cloud while guaranteeing both computational privacy and plausible deniability against coer…

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 →