Onion Routing Secures Proof-of-Stake Leader Election against Denial-Of-Service
Integrating native onion routing into PoS leader election cryptographically conceals the block proposer's identity, ensuring network liveness against DoS attacks.
Constant-Cost Randomness Beacons Decouple Security from Network Scale
A new cryptographic protocol achieves constant *O(1)* on-chain gas cost for decentralized randomness, making leader election and sharding truly scalable.
Sequential Proof-of-Work Enables Competitive Decentralized Randomness Beacons
RandChain introduces Sequential Proof-of-Work to mandate non-parallelizable mining, securing public randomness and democratizing validator election.
ZKPoT Consensus Secures Federated Learning by Verifying Model Performance Privately
ZKPoT consensus leverages zk-SNARKs to prove model performance without revealing data, creating a privacy-preserving, performance-based leader election mechanism.
Proof-of-Sequential-Work Secures Low-Latency Randomness and Optimal Time-Lock Security
A new Proof-of-Sequential-Work primitive fundamentally optimizes Verifiable Delay Functions, enabling robust, low-latency on-chain randomness.
Distributed Verifiable Random Function Secures Decentralized Randomness Beacons
Implementing a Distributed VRF with zk-SNARKs and NI-DKG creates a publicly verifiable, unbiased, and unmanipulable source of network randomness.
Differential Privacy Enforces Transaction Ordering Fairness, Securing Decentralized Systems
Researchers established that any Differential Privacy mechanism can enforce fair transaction ordering, transforming a privacy tool into a core mechanism design primitive for decentralized systems.
Weighted Verifiable Random Functions Scale Proof-of-Stake Randomness
Cryptographers introduce Weighted VRFs to provide cost-independent, autonomous, and fresh on-chain randomness for weighted Proof-of-Stake systems, solving a critical scalability bottleneck.
Verifiable Delay Functions Secure Consensus Randomness with Provable Delay
VDFs are sequential cryptographic timekeepers that make randomness manipulation computationally prohibitive, enhancing Proof-of-Stake security and finality.
