This paper shows that certain classical random access codes with private randomness can violate the conjectured bound for quantum random access codes, leading to order-optimal qubit scaling.

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…

This paper introduces a novel algorithm for generating k Hamming weight binary words in linear time while minimizing random bit consumption.

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 develops a new decoding algorithm for Desarguesian spread codes to uniquely decode in the presence of insertions and deletions, even when the sum of their dimensions exceeds half the minimu…

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 presents a lattice-based Ciphertext-Policy Attribute-Based Encryption (CP-ABE) scheme that supports $\mathsf{NC}^1$ access policies while maintaining constant-size ciphertexts.

This paper optimizes the arrangement of codewords transmitted over a binary symmetric channel to improve differential privacy guarantees without increasing utility cost or real-time computational over…

This paper presents a product coding scheme that converts bit-level reliability into block-level reliability, achieving the same asymptotic rate.

This paper proposes a deterministic framework for optimizing long protograph-based LDPC codes using gradient descent, operating directly on a relaxed protograph representation.

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

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 compares various strong secrecy capacities for Arbitrarily Varying and General Arbitrarily Varying Wiretap Channels, establishing equivalences under specific conditions and bounding the capa…

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 derives an explicit representation for the Euclidean dual of Hyperderivative Reed-Solomon codes and studies reverse self-dual HRS codes.