The paper introduces a systematic, executable taxonomy of security properties to bridge the gap between theoretical security definitions and their practical implementation in formal verification tools…

The paper addresses the vulnerability of zero-knowledge proximity proofs in stateful systems by proposing Zairn-ZKP, a method that embeds operational context (like drop identity and policy version) di…

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 establishes an unconditional barrier for AC0-natural proofs, showing that they cannot prove lower bounds greater than $2^{n^{7/(d-5)}}$ against depth-$d$ circuits.

The paper models cryptographic hybridization as a Stackelberg game where the defender optimizes algorithm selection against a resource-constrained attacker who performs conditional optimization.

This paper provides the first unconditional proof for Weber's Conjecture for the case $k ext{ up to } 12$, which is crucial for lattice-based cryptography.

The paper systematically explores a vast design space of cryptographic Boolean networks by formalizing six structural constraints, finding that optimal designs result from sparse, mutually compatible…

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 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 provides a formal proof that a single C program can contain a countably infinite number of distinct, independently assignable software vulnerabilities, suggesting the set of all software vul…

The paper provides a mechanized proof in Isabelle/HOL guaranteeing both the safety (state preservation) and liveness (progress) of regulatory state transitions across multiple, heterogeneous blockchai…

The paper investigates the relationship between optimal proof systems and recursive jump operators, showing that while the existence of a jump operator rules out optimality, the converse is provably h…

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…

This paper establishes a complexity hierarchy for shuffle operations used in card-based cryptography, classifying them by implementation difficulty and proving separations between these levels.

The paper introduces SecGoal, a benchmark dataset and framework, demonstrating that fine-tuning smaller LLMs on this dataset significantly improves the precision of extracting formalizable security go…

The paper introduces a graded symbolic verification method that models cumulative side-channel leakage, demonstrating that protocols safe under traditional binary attacker models can fail when continu…

The paper introduces Search-Bound Proximity Proofs (SBPP) to close an authorization provenance gap in encrypted geographic search by binding zero-knowledge proofs to specific search sessions for audit…

The paper introduces formal patterns to enhance and compose security components (lingos and dialects) for network protocols, providing generic, verifiable methods for hardening distributed systems.

The paper introduces a lightweight, sampling-based cryptographic protocol for verifiable AI inference that drastically reduces proving overhead from minutes to milliseconds by leveraging statistical p…

This paper provides the first unified, security-focused survey that rigorously maps Layer-2 (L2) blockchain architecture to its underlying cryptographic security assumptions.