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

~ similar to 2603.21694v1· 20 results

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.CRRecentApr 9, 2026

Anamorphic Encryption with CCA Security: A Standard Model Construction

Shujun Wang, Jianting Ning, Qinyi Li, Leo Yu Zhang

The paper proposes a generic, standard model construction for Anamorphic Key Encapsulation Mechanisms (AKEM) that achieves strong IND-CCA security, addressing a major gap in covert communication crypt…

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 →
math.CTcs.CRRecentMar 17, 2026

From Torsors to Topoi: An Introduction with a View Toward $Σ$-Protocols in Cryptography

Takao Inoué

This paper provides a focused, preparatory introduction to sheaves and topoi, establishing the necessary structural background to understand the advanced sheaf-theoretic framework used in cryptographi…

View →
cs.CRRecentMay 28, 2026

Bridging Theory and Practice: An Executable Taxonomy of Security Properties for ProVerif and Tamarin

Leonard Tudorache, Ivan Kurtev, Mark van den Brand

The paper introduces a systematic, executable taxonomy of security properties to bridge the gap between theoretical security definitions and their practical implementation in formal verification tools…

View →
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.CRRecentApr 30, 2026

SBN Explorer: An Empirical Study of Cryptographic Boolean Networks

Arnaud Valence

The paper systematically explores a vast design space of cryptographic Boolean networks by formalizing six structural constraints, finding that optimal designs result from sparse, mutually compatible…

View →
cs.CRRecentMar 27, 2026

Towards Privacy-Preserving Federated Learning using Hybrid Homomorphic Encryption

Ivan Costa, Pedro Correia, Ivone Amorim, Eva Maia +1 more

This paper enhances Federated Learning privacy by integrating two key protection mechanisms—masking and RSA encapsulation—into Hybrid Homomorphic Encryption (HHE) to secure against malicious clients.

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.CRcs.CYRecentApr 22, 2026

Layer 2 Blockchains Simplified: A Survey of Vector Commitment Schemes, ZKP Frameworks, Layer-2 Data Structures and Verkle Trees

Ekleen Kaur, Marko Suvajdzic

This paper provides the first unified, security-focused survey that rigorously maps Layer-2 (L2) blockchain architecture to its underlying cryptographic security assumptions.

View →
cs.CRcs.ITquant-phRecentApr 24, 2026

Module Lattice Security (Part II): Module Lattice Reduction via Optimal Sign Selection

Ming-Xing Luo

This paper extends quantum lattice reduction techniques (CDPR) from ideal to module lattices over cyclotomic rings, achieving a constant module reduction factor and providing a rigorous, bounded-preci…

View →
cs.CRcs.ITRecentMar 24, 2026

Canonical Byte-String Encoding for Finite-Ring Cryptosystems

Kyrylo Riabov, Serhii Kryvyi

The paper introduces the base-m length codec, a canonical and robust encoding scheme that maps byte strings to lists of residues modulo m, essential for finite-ring cryptosystems.

View →
cs.CRRecentMay 20, 2026

Graph Structure of Chebyshev Permutation Polynomials over Binary and Ternary Adic Rings

Xiaoxiong Lu, Yuling Dai, Chengqing Li

This paper characterizes the graph structure, including cycle and path lengths, of Chebyshev permutation polynomials over the ring $\mathbb{Z}_{2^{k_1}3^{k_2}}$, demonstrating strong regularities desp…

View →
cs.CRcs.DSRecentApr 6, 2026

Packing Entries to Diagonals for Homomorphic Sparse-Matrix Vector Multiplication

Kemal Mutluergil, Deniz Elbek, Kamer Kaya, Erkay Savaş

This paper proposes methods to optimally permute the rows and columns of a sparse matrix to minimize the number of cyclic diagonals required for homomorphic sparse-matrix vector multiplication, signif…

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.CRRecentMay 26, 2026

Analyzing Linear Layers in Related-Differential Cryptanalysis

Yogesh Kumar, Akshay Ankush Yadav, Susanta Samanta

The paper systematically investigates the conditions under which linear layers in AES-like ciphers avoid related-differential structures, proving that the MDS property is necessary and identifying spe…

View →
quant-phcs.CRRecentApr 26, 2026

Efficient Quantum Fully Homomorphic Encryption

Fengxia Liu, Zixian Gong, Kun Tian, Yi Zhang +2 more

The paper introduces a unified framework for Quantum Fully Homomorphic Encryption (QFHE) that achieves exponential efficiency improvements by integrating a novel modular arithmetic program (MAP) tailo…

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