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

~ similar to 2604.20793v2· 20 results

cs.CRRecentApr 28, 2026

Prime-Field PINI: Machine-Checked Composition Theorems for Post-Quantum NTT Masking

Ray Iskander, Khaled Kirah

The paper establishes the first machine-checked composition theorems for arithmetic masking over prime fields, demonstrating that fresh random masking between pipeline stages completely erases securit…

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 4, 2026

The 1-Bit Barrier is Universal: k-Stage Pipeline Composition and Unified Leakage Bounds for Standard Modular Reductions in PQC Hardware

Ray Iskander, Khaled Kirah

This paper proves that the per-observation leakage bound for deep, multi-stage masked Number Theoretic Transform (NTT) pipelines remains constant and low ($2/q$), regardless of the pipeline's depth ($…

View →
cs.CRRecentApr 16, 2026

Structural Dependency Analysis for Masked NTT Hardware: Scalable Pre-Silicon Verification of Post-Quantum Cryptographic Accelerators

Ray Iskander, Khaled Kirah

The paper introduces a four-stage structural dependency analysis hierarchy that enables scalable, sound first-order masking verification for large, production-level post-quantum cryptographic accelera…

View →
cs.CRRecentApr 27, 2026

Machine-Checked Cardinality Bounds for Masked Barrett Reduction: A 1-Bit Side-Channel Leakage Barrier in Post-Quantum Cryptographic Hardware

Ray Iskander, Khaled Kirah

The paper establishes a universal, machine-checked 1-Bit Barrier for the internal wire map of masked Barrett reduction, providing a strong side-channel leakage bound for post-quantum cryptography.

View →
cs.CRRecentApr 4, 2026

Partial Number Theoretic Transform Masking in Post-Quantum Cryptography (PQC) Hardware: A Security Margin Analysis

Ray Iskander, Khaled Kirah

The paper analyzes the security of a partially masked hardware accelerator for Number Theoretic Transform (NTT) in PQC, demonstrating that the claimed security margins are significantly overestimated…

View →
quant-phcs.CRRecentMay 13, 2026

QCIVET: A Quantum--Classical Pipeline Integrity Framework with Contract-Based Subtype Verification and Hash-Chained Audit Traces

Esra Yeniaras, Muhammad Amin Karimov

QCIVET introduces a novel contract-based framework to ensure the integrity of hybrid quantum-classical pipelines by verifying both the structure (syntactic) and the behavior (semantic) of quantum stag…

View →
cs.CRRecentMar 19, 2026

Controller Datapath Aware Verification of Masked Hardware Generated via High Level Synthesis

Nilotpola Sarma, Vaishali Ghanshyam Chaudhuri, Chandan Karfa

The paper proposes MaskedHLSVerif, a novel formal verification toolflow that accurately verifies the Power Side Channel Attack (PSCA) security of masked hardware generated by High Level Synthesis (HLS…

View →
cs.ARcs.CLcs.CRRecentApr 20, 2026

Enabling AI ASICs for Zero Knowledge Proof

Jianming Tong, Jingtian Dang, Simon Langowski, Tianhao Huang +5 more

The paper introduces MORPH, a framework that reformulates Zero-Knowledge Proof (ZKP) computations to efficiently utilize AI ASICs like TPUs, achieving up to 10x higher throughput on NTT.

View →
cs.CRcs.ITcs.LGRecentApr 8, 2026

Evaluating PQC KEMs, Combiners, and Cascade Encryption via Adaptive IND-CPA Testing Using Deep Learning

Simon Calderon, Niklas Johansson, Onur Günlü

The paper proposes using deep learning to empirically test the indistinguishability of various post-quantum and hybrid cryptographic schemes, finding that no tested combination showed a significant ad…

View →
cs.CRcs.SCmath.NTRecentMay 17, 2026

Explicit cost analysis of Toom-4 multiplication for incomplete NTT in lattice-based cryptography

Sakura Oku, Momonari Kudo

This paper provides an explicit cost analysis of Toom-4 multiplication specifically tailored for the incomplete Number Theoretic Transform (NTT) framework, offering a concrete cost model for hybrid la…

View →
cs.CRRecentJun 3, 2026

What Can Verifiable Decapsulation Tests Certify? Pass Bounds and Fault-Recognition Limits for FO-Based KEMs

José Luis Delgado Jiménez

The paper analyzes the security limits of verifiable decapsulation tests for Key Encapsulation Mechanisms (KEMs), establishing that the list-hit event is the primary black-box obstruction and deriving…

View →
cs.CRcs.LOcs.SERecentApr 4, 2026

Optimal Circuit Synthesis of Linear Codes for Error Detection and Correction

Xi Yang, Taolue Chen, Yuqi Chen, Fu Song +2 more

This paper introduces a novel algorithm, CiSC, to efficiently and optimally synthesize circuit implementations of linear codes for hardware security, significantly outperforming existing state-of-the-…

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 →
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.LOcs.CRRecentMay 22, 2026

Formal Verification of Probing Security via Conditional Independence

Satoshi Kura, Katsuyuki Takashima

The paper proposes a novel formal verification method for proving the probing security of masked cryptosystems by connecting the noninterference property to conditional independence and utilizing prob…

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.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.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.CRRecentJun 2, 2026

ZK-Flex: A Flexible and Scalable Framework for Accelerating Zero-Knowledge Proofs

Adiwena Putra, Cuong Manh Duong, Anh Quang Pham, Joo-Young Kim

The paper proposes ZK-Flex, a flexible software-hardware co-designed framework that significantly accelerates Zero-Knowledge Proof (ZKP) generation by efficiently handling diverse polynomial and ellip…

View →