The paper designs an optimal mechanism for soliciting expensive computational tasks in adversarial blockchain environments, showing that the loss of optimality scales logarithmically with the cost of…

The paper develops a formal theory to analyze how throughput changes in AI-enhanced cybersecurity pipelines when stage capacities are perturbed by multipliers.

The paper analyzes transaction fee mechanisms in modern blockchains that use parallel execution and contingency, proving an inherent trade-off between minimizing risks for users and maximizing revenue…

The paper proves that any voting rule based solely on wallet balance, including anti-plutocratic mechanisms like Quadratic Voting, is fundamentally vulnerable to Sybil attacks on permissionless blockc…

The paper proves that platform-deterministic inference is a necessary and sufficient condition for trustworthy AI, establishing that AI trust fundamentally relies on consistent arithmetic.

This paper develops a formal economic framework to assess the security of VDF-based randomness beacons, demonstrating that many proposed delays are economically insecure due to rational, profit-motiva…

The paper generalizes Unicity token ownership using programmable spending conditions called predicates, enabling trustless atomic swaps and smart-contract-like functionality executed off-chain.

The paper proposes a trustless framework using dual-layer cryptographic commitments to solve the operator-gating problem in blockchain provenance trees, ensuring verifiable user attribution even when…

The paper proves that standard account-based ledgers cannot non-custodially enforce asset disposition, and introduces a novel commitment-based ledger structure, the 'envelope,' that achieves this 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 models cryptographic hybridization as a Stackelberg game where the defender optimizes algorithm selection against a resource-constrained attacker who performs conditional optimization.

The paper demonstrates that by introducing carefully designed correlations among locally added noise variables, local differential privacy mechanisms can achieve an estimation cost matching the optima…

The paper demonstrates that soft fusion in multi-warden covert communication has structural limits, showing that the Fusion Center gains no significant detection advantage from randomizing the number…

AetherWeave is a novel, stake-backed peer-discovery protocol that achieves Sybil resistance and privacy in P2P networks, ensuring robust connectivity even against powerful adversaries.

This paper analyzes the x402 payment protocol, revealing systemic vulnerabilities in state synchronization and signature design that allow attackers to exploit payment systems for resource leakage in…

This paper analyzes the x402 payment protocol, revealing critical synchronization and security flaws that allow attackers to exploit payment systems and force merchants to subsidize compute costs.

BlindMarket is a zero-trust framework that enables the verifiable, confidential, and traceable distribution of hardware IP cores between vendors and users.

The paper empirically evaluates various agentic architectures for offensive security tasks, finding that while broader coordination improves coverage, the optimal architecture is non-monotonic and dep…

The paper analyzes transaction selection strategies in DAG-based distributed ledgers using game theory, finding that Collaborative Fee Sharing (CFS) achieves superior performance compared to Random Fe…

The paper proposes a new DDH-based technique that significantly reduces the key size of multi-party Distributed Point Function (DPF) secret sharing schemes, achieving an $O( oot{3}{N})$ key size for h…