The paper proposes a novel, unconditionally secure information-theoretic Authenticated Private Information Retrieval (itAPIR) scheme that upgrades existing, less secure itPIR-RV schemes without overhe…

The paper proposes a novel ring-based information-theoretic Private Information Retrieval (itED-PIR) scheme that overcomes the key size and communication overhead limitations of existing field-based A…

This paper proposes two approaches for applying two-server Private Information Retrieval (PIR) protocols to synthetic DNA-based data storage, addressing privacy, efficiency, and feasibility challenges…

The paper introduces local private information retrieval (local PIR), redefining user privacy in graph-replicated systems to focus on hiding the message index from servers, and demonstrates that local…

This paper proposes a Graph-based Weak Private Information Retrieval (G-WPIR) scheme for distributed storage systems with graph-based replication, identifying trade-offs between rate and privacy under…

This paper generalizes the definition of privacy in graph-replicated Private Information Retrieval (PIR) by allowing each server to have an arbitrary, specific set of message indices it must keep priv…

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…

GPIR is a GPU-accelerated Private Information Retrieval (PIR) system that significantly boosts throughput by introducing a stage-aware hybrid execution model and optimizing data layouts for modern GPU…

The paper introduces SPIDER, a novel single-server Private Information Retrieval (PIR) scheme that achieves state-of-the-art communication complexity without requiring specialized server cooperation o…

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.

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…

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

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

This paper provides the first comprehensive cryptanalysis of the Legendre Pseudorandom Function over extension fields, demonstrating key recovery attacks under both passive and active threat models.

This paper demonstrates that a proposed lightweight RFID authentication protocol is structurally insecure and susceptible to a multi-session algebraic attack, enabling full compromise of the secret ke…

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…

The paper proposes two new asymptotically ideal and secure Hierarchical Secret Sharing (HSS) schemes, disjunctive and conjunctive, utilizing the Chinese Remainder Theorem (CRT) over an integer ring an…