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 refutes Steurer's conjecture regarding the existence of large constant-separated sets within families of unit-norm vectors with low average correlation, using high-dimensional expanders to s…

The paper proposes a novel method using random walks and equitable partitions to derive an inequality for the total variation distance of codes, generalizing existing bounds for finite abelian groups.

The paper analyzes subcodes of lambda-Gabidulin codes to construct highly efficient McEliece-like and Niederreiter-like cryptosystems, demonstrating that random subcodes of classical Gabidulin codes y…

The paper introduces Search-Bound Proximity Proofs (SBPP) to close an authorization provenance gap in encrypted geographic search by binding zero-knowledge proofs to specific search sessions for audit…

The paper analyzes the security of the post-quantum signature scheme CROSS by showing that the underlying Restricted Syndrome Decoding problem can be reduced to both code-based and lattice-based probl…

The paper proves that generalized skew and linearized Reed-Solomon (GSRS and GLRS) codes, while promising for cryptosystems, are structurally weak and can be efficiently distinguished from random code…

The paper presents a lattice-based Ciphertext-Policy Attribute-Based Encryption (CP-ABE) scheme that supports $\mathsf{NC}^1$ access policies while maintaining constant-size ciphertexts.

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

This paper provides the first unconditional proof for Weber's Conjecture for the case $k ext{ up to } 12$, which is crucial for lattice-based cryptography.

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 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 ($…

The paper addresses the vulnerability of zero-knowledge proximity proofs in stateful systems by proposing Zairn-ZKP, a method that embeds operational context (like drop identity and policy version) di…

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 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 systematically analyzes binomial functions over $\mathbb{F}_{p^n}$ in characteristic 3, providing a classification and rigorous proof of specific classes of exponents that yield extremely l…

The paper develops a formal theory to analyze how throughput changes in AI-enhanced cybersecurity pipelines when stage capacities are perturbed by multipliers.

This paper presents a cryptanalytic attack demonstrating that a specific code-based Private Information Retrieval (PIR) scheme can be broken, allowing the server to efficiently determine the requested…

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…