Streaming Random Beacons Secure Consensus with Minimal Cryptographic Overhead
STROBE introduces an NIZK-free, history-generating threshold beacon, solving the randomness scalability problem with constant-size state verification.
Fractal Commitments Enable Universal Logarithmic-Size Verifiable Computation
This new fractal commitment scheme recursively compresses polynomial proofs, achieving truly logarithmic verification costs for universal computation without a trusted setup.
Logarithmic-Cost Data Availability Sampling Vector Commitments
Introducing a novel vector commitment scheme that reduces data availability proof size from linear to logarithmic, fundamentally unlocking scalable decentralized rollups.
Homomorphic Sortition Secures Proof-of-Stake Leader Election Liveness
Homomorphic Sortition uses Threshold FHE to create the first asynchronous, non-expiring secret leader election, securing PoS liveness.
Federated Distributed Key Generation Enables Robust Threshold Cryptography for Open Networks
FDKG introduces optional participation and heterogeneous trust to DKG, resolving the impracticality of key generation in large, dynamic validator sets.
zk-STARKs Secure Scalable Decentralized Identity and Private Data Sharing
Integrating zk-STARKs with W3C DID standards enables selective credential disclosure and scalable revocation, securing user data sovereignty.
Weighted VRFs Achieve Constant Communication for Stake-Weighted Randomness
A new weighted VRF primitive and DKG protocol decouple randomness generation from stake size, solving the efficiency problem for PoS security.
Selective Batched IBE Enables Constant-Cost Threshold Key Issuance
This new cryptographic primitive enables distributed authorities to generate a single, succinct decryption key for an arbitrary batch of identities at a cost independent of the batch size, fundamentally solving key management scalability in threshold systems.
Linear Prover Time ZK Proofs Unlock Universal Verifiable Computation
A new argument system achieves linear-time proof generation with succinct proof size, eliminating the primary computational bottleneck for ZK-rollups and verifiable computation.
