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…

Ghost introduces a manifold-aligned framework to generate plausible, unlearnable synthetic check-in trajectories that significantly degrade an attacker's ability to predict future locations.

Ghost introduces a manifold-aligned framework to generate plausible yet unlearnable synthetic check-in trajectories, significantly degrading the accuracy of next-POI prediction models without sacrific…

The paper demonstrates that cryptographically undetectable backdoors can be embedded into modern, state-of-the-art neural networks by exploiting inherent, latent geometric properties of the learned re…

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 a novel public key encryption scheme with high security by leveraging the conjectured intractability of two types of highly corrupted constraint satisfaction problems (CSPs).

The paper establishes that the existence of many-time secure uncloneable encryption (UCE) can be shown to follow from relatively weak assumptions, such as the existence of many-time secure symmetric k…

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

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.

The paper reveals that predictable nonce reuse by Polygon MEV searchers creates a critical vulnerability in ECDSA signatures, allowing passive attackers to recover private keys using linear algebra.

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…

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 introduces a multi-surface evidence framework to provide comprehensive observability for post-quantum TLS migration, enabling robust measurement of session behavior and endpoint capabilities…

The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…

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…

The paper proposes a provably secure path validation protocol for large-scale Quantum Key Distribution (QKD) networks that allows receivers to verify network compliance without revealing sensitive top…

The paper introduces stronger cryptographic notions, quantum localization and trajectory verification, to robustly certify a quantum entity's position and movement through spacetime.

This paper enhances a genetic algorithm approach for solving the Shortest Vector Problem (SVP) in lattices by incorporating domain-informed representation, thereby extending its applicability to modul…

This paper enhances a genetic algorithm approach for solving the Shortest Vector Problem (SVP) in both integral and module lattices by incorporating domain-informed representation and crossover.