A new boosting algorithm that strong learns concept classes closed under O(log 1/γ)-XOR using O(log 1/ε) calls to a γ-advantage weak learner and additional samples, by connecting boosting with list-de…

The paper introduces List Privacy Amplification (LPA) and proves the Quantum List Leftover Hash Lemma (QLLHL), demonstrating that it can significantly increase the achievable key length in Quantum Key…

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 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 establishes a Coding Theorem in the context of symmetry groups and develops a connection between subgroups of a group and subsets of binary strings.

This paper proves that random linear codes have nearly optimal discrepancy properties in various regimes, extending classical results and enabling new applications.

This paper proves that for any finite abelian group, there exists a spectral sparsifier for its Cayley graph with log(|G|) generators. This result improves upon previous work for constructing code spa…

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 provides distinguishers for McEliece type cryptosystems with larger row and column weights, and presents a framework to turn distinguishers into key-recovery attacks. It successfully attacks…

The paper introduces 'abliteration,' a weight editing technique that successfully bypasses the refusal mechanism of safety-aligned Code LLMs, enabling scalable synthesis of vulnerable code from safe i…

This paper proposes the first constant-time decoding algorithm for Augmented Gabidulin (AG) codes, a variation of Gabidulin codes used in efficient rank-based cryptosystems.

This paper introduces a structural theorem for the sparsifiability of real-valued codes, which generalizes both combinatorial and continuous notions of sparsification.

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

This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.

This paper introduces and studies the block tensor rank of sum-rank metric codes, showing its additive decomposition and deriving lower bounds.