Data Availability Encoding Becomes a Zero-Overhead Polynomial Commitment Scheme
Reusing data availability encoding as a multilinear polynomial commitment scheme drastically reduces prover work for light client succinct verification, resolving a core scalability paradox.
Aggregatable Key-Evolving VRFs Secure Proof-of-Stake with Constant-Size Proofs
A-KE-VRFs unify proof aggregation and forward security for Verifiable Random Functions, radically improving PoS scalability and historical security.
Multi-Curve Single-Root Identity Primitive Secures Post-Quantum Decentralization
MSCIKDF is a new cryptographic identity primitive that enables cryptographically isolated identity streams across diverse protocols, securing the transition to post-quantum cryptography.
Zero-Knowledge Mechanisms Decouple Commitment from Disclosure in Protocol Design
Research pioneers a cryptographic primitive that proves a mechanism's incentive properties and execution correctness without revealing its secret rules.
zkVC Optimizes Zero-Knowledge Proofs for Fast Verifiable Machine Learning
zkVC introduces Constraint-reduced Polynomial Circuits to optimize zkSNARKs for matrix multiplication, achieving a 12x speedup for private verifiable AI.
Succinct Lattice Polynomial Commitments Secure Zero-Knowledge against Quantum Threat
This new lattice-based polynomial commitment scheme achieves post-quantum security and polylogarithmic efficiency, future-proofing all succinct proof systems.
Optimal Prover Time and Succinct Zero-Knowledge Proofs Simultaneously Achieved
Libra achieves linear prover complexity with polylogarithmic verification time, unlocking practical, scalable zero-knowledge computation.
Decentralized Trapdoor VDF Enables Accountable, Consistent Redactable Blockchains
Introducing the Decentralized Trapdoor VDF, this primitive resolves the immutability-redaction conflict, unlocking regulatory-compliant blockchain architectures.
Constant-Time Vector Commitment Decouples Prover Work from Circuit Size
This new Constant-Time Vector Commitment scheme shifts prover complexity to pre-processing, enabling $O(1)$ online proofs for massive circuits.
