The paper proposes that decoding random quantum stabilizer codes is a robust, novel post-quantum cryptographic assumption, demonstrating that its average-case hardness implies core primitives like PKE…

The paper proposes a quantum anonymous secret sharing scheme that achieves sender-anonymity by integrating permutation-invariant Quantum Error Correction (QEC) codes and anonymous quantum transmission…

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.

This paper develops and analyzes two differentially private methods for answering counting queries on quantum-encoded datasets, demonstrating improved privacy guarantees and a quantum-safe approach fo…

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…

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…

The paper proposes a unified, information-theoretic framework using universal hash functions to solve the bootstrapping of seedless QRNGs and to securely combine PQC and QKD keys against quantum adver…

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.

This paper demonstrates that Simple Power Analysis (SPA) can successfully extract secret session key bits from post-quantum cryptosystems, specifically during the key decapsulation phase, using only a…

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…

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…

The paper introduces a novel authentication-with-response scheme that halves the key consumption required for mutual authentication in Quantum Key Distribution (QKD) while maintaining unconditional se…

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…

The paper proposes a Quantitative Information Flow (QIF) framework to systematically and rigorously compare Local Differential Privacy (LDP) frequency estimation protocols, moving beyond simple $\vare…

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

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

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

The paper proposes a provably secure steganography scheme based on list decoding that significantly increases embedding capacity for Large Language Models (LLMs) compared to existing methods.

This paper identifies new, algebraically weak classes of instances for the Linear Equivalence Problem (LEP) by generalizing techniques from the Permutation Equivalence Problem (PEP) using power codes…

The paper presents a new worst-case to average-case reduction for the Learning Parity with Noise (LPN) problem, achieving hardness for inverse-polynomial noise rates previously unattainable.