Adaptively Secure BLS Threshold Signatures from Standard Cryptographic Assumptions
A new threshold signature scheme achieves adaptive security with standard assumptions, fundamentally hardening distributed trust primitives for decentralized systems.
Auditor-Only Linkability Resolves Privacy-Accountability Deadlock
A novel cryptographic primitive, Auditor-Only Linkability, uses zero-knowledge proofs and specialized encryption to enable verifiable tracing of anonymous transactions under due process, resolving the foundational conflict between on-chain privacy and regulatory accountability.
Sublinear Zero-Knowledge Proofs Democratize Verifiable Computation on Constrained Devices
A novel proof system reduces ZKP memory from linear to square-root scaling, fundamentally unlocking privacy-preserving computation for all mobile and edge devices.
Proof of Quantum Work Secures Blockchain Consensus from Classical Attack
A novel Proof of Quantum Work consensus leverages quantum supremacy to create a quantum-safe, energy-efficient mining mechanism, fundamentally securing the blockchain against future classical attacks.
Linear Prover Time Unlocks Optimal Succinct Argument Efficiency
This new Interactive Oracle Proof system resolves the prover-verifier efficiency trade-off, achieving linear prover time and polylogarithmic verification complexity.
Unifying Threshold Cryptography Services for Distributed Trust Systems
A new distributed service architecture unifies diverse threshold cryptographic schemes, simplifying deployment of robust solutions for frontrunning and key management.
Recursive Zero-Knowledge Proofs Unlock Unbounded Computational Compression
Recursive proof composition enables constant-time verification of infinite computation, fundamentally solving the scalability limit of verifiable systems.
Vector Commitments Enable Modular Blockchain Scalability and Asynchronous Security
A new Probabilistically Verifiable Vector Commitment scheme secures Data Availability Sampling, decoupling execution from data and enabling massive asynchronous scalability.
Optimal Byzantine Agreement Protocol Minimizes Communication Complexity Adaptively
New authenticated Byzantine agreement protocol achieves optimal $O(ft+t)$ communication complexity by adapting to the actual number of failures, significantly boosting SMR efficiency.
