ZK-Value introduces a practical, scalable zero-knowledge system for calculating data valuations (Shapley values) in data marketplaces, significantly reducing proving time while maintaining high accura…

This paper advances the lightweight blockchain verification protocol, FlyClient, by addressing technical challenges, introducing a new adversary model, and providing practical implementations and opti…

This empirical study of Pearl's cuPOW protocol demonstrates that the network's Proof-of-Useful-Work mechanism generates zero useful AI computation, instead causing economic harm and displacing legitim…

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

The paper proposes ZK-Flex, a flexible software-hardware co-designed framework that significantly accelerates Zero-Knowledge Proof (ZKP) generation by efficiently handling diverse polynomial and ellip…

The paper proposes ZK-Flex, a flexible software-hardware co-designed framework that significantly accelerates Zero-Knowledge Proof (ZKP) generation by efficiently handling diverse polynomial and ellip…

The paper estimates the quantum resources required to break 256-bit ECC cryptography and warns that fast-clock quantum computers could enable on-spend attacks on modern cryptocurrencies, necessitating…

zk-X509 is a privacy-preserving identity system that uses zero-knowledge proofs to prove ownership of standard X.509 certificates on a public blockchain without revealing private keys or personal data…

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.

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…

The paper proposes a canonical, end-to-end validation framework to ensure secure integration of Alternative Data Availability (AltDA) systems with Ethereum Layer 2s, demonstrating that L2 integration…

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 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 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 proposes a hash-based commit-reveal alternative to minimize the infrastructural overhead associated with adopting large post-quantum signature schemes in blockchain transactions.

The paper introduces probabilistic swaps, a new cryptographic primitive that extends traditional atomic swaps to enable trustless, randomized exchanges with verifiable, fixed probabilities.

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…

SILMARILS presents a quantum-secure, information-theoretic designated-verifier (DV) signature scheme built on a minimal algebraic core, suitable for lightweight blockchain authentication.

This paper provides a comprehensive, system-level taxonomy for designing quantum-resistant network architectures, moving beyond simple protocol substitutions to address key distribution and management…

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…