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 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 proves that random linear codes have nearly optimal discrepancy properties in various regimes, extending classical results and enabling new applications.

Minor, single-character perturbations to prompts can significantly degrade the security of code generated by LLMs, suggesting that prompt fragility is a major security concern beyond simple prompt inj…

The paper establishes an information-theoretic upper bound on the combined functional capacity and perturbation retention of code LLMs, quantifying the security budget available for code generation.

The paper presents a highly optimized, low-stack implementation of the HAETAE signature scheme, reducing peak stack usage significantly to enable its use on severely memory-constrained microcontroller…

The paper introduces PINSIGHT, a novel methodology that rigorously assesses Wi-Fi PIN code inference attacks by separating environmental effects from typing effects, concluding that current state-of-t…

The paper proposes a RADIUS-based framework to maintain persistent device identity for Network Access Control (NAC) despite modern operating system MAC address randomization, ensuring regulatory compl…

This paper evaluates the security of authentication code generated by five AI coding assistants using static code analysis and dynamic penetration testing, revealing inconsistent compliance with NIST…

This paper introduces a new protection code design for Content Addressable Memory (CAM) to ensure reliability.

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

Researchers investigated the impact of cognitive heuristics on Large Language Models in code vulnerability detection, finding all models susceptible with highest susceptibility to framing.

The paper proposes a lightweight Zero-Knowledge authentication protocol using QR codes, enhancing the Schnorr protocol with nonces and timestamps for secure, efficient, and replay-attack-resistant aut…

This paper replicates and extends a study on Java security API misuse in LLMs, finding that while newer models improve performance, the misuse risk persists and is significantly mitigated by external…

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.

The paper studies the resources required to batch verify Boolean functions and provides lower bounds on the witness-query tradeoff based on approximate degree.

This paper investigates the vulnerability of semantic communication systems in shared-access wireless networks to selective over-the-air backdoor attacks and proposes a defense mechanism.

The paper introduces a large, consensus-labeled prompt bank that reliably distinguishes between requests for executable malicious code and requests for harmful security knowledge, providing a standard…

This paper identifies the 'Format-Reliability Gap'—where LLMs know about code vulnerabilities but generate insecure code anyway—and proposes a localized, per-vulnerability steering vector fix that sig…