The paper establishes new hardness amplification results for Learning Parity with Noise (LPN) and its sparse variants, showing that solving the problem on a small fraction of instances implies solving…

The paper presents two new attacks on decisional $k$-sparse LWE and LPN problems for higher moduli $q$ by generalizing the Kikuchi method using graph theory.

This paper improves machine learning attacks against the Learning with Errors (LWE) problem by demonstrating that using larger, repeated datasets and a stepwise regression technique allows for the rec…

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 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 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 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 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 establishes a strong connection between scalable pseudorandom unitaries (PRUs) and the unitary synthesis problem, proving that any such PRU construction must require a classical oracle of si…

The paper demonstrates that encoding harmful prompts as genuine mathematical problems, rather than just using mathematical formatting, effectively bypasses the safety filters of large language models.

The paper introduces SB-ECC, a novel score-based decoder that models error correction as continuous-time denoising, achieving state-of-the-art performance across various code families and noise levels…

The paper constructs high-rate public-key pseudorandom codes (PRCs) robust against edit errors, providing the first such binary constructions under assumptions that yield Hamming-robust PRCs.

The paper establishes information-theoretic lower bounds for stochastic optimization using low-bit gradients by reducing the problem to compressed Gaussian mean estimation, yielding sharp bounds on co…

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 introduces a mathematical and cryptographic framework for exactly recovering a single, noisy, high-dimensional discrete path from aggregated and incomplete observable data.

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.

The paper provides the first theoretical convergence analysis for machine learning training under fully homomorphic encryption combined with differential privacy, improving efficiency and scalability.

The paper quantifies the cost of privacy in language identification and generation using differentially private (DP) methods, finding that the cost is surprisingly mild, particularly absent under appr…

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…

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…