Efficient Verifiable Secret Sharing Secures Byzantine Fault Tolerant Systems
EByFTVeS integrates BFT with VSS to guarantee consistency and efficiency, fundamentally securing decentralized services operating on private state.
Temporal Correlation Deanonymizes RPC Users, Compromising Blockchain Network Privacy
A new temporal correlation attack links user IP addresses to blockchain pseudonyms by exploiting transaction confirmation query timestamps, exposing a critical network-layer privacy failure.
Democratic Randomness Protocol Eliminates Leader Bottlenecks for Scalability
Kleroterion, a democratic random beacon using Pinakion PVSS, achieves linear complexity by distributing input sharing, enabling scalable, bias-resistant randomness.
Prefix Consensus Unifies BFT Latency Throughput Robustness
Raptr's prefix consensus integrates leader-based low latency with DAG-based high throughput, resolving a core BFT trade-off for scalable systems.
Simplified Verifiable Secret Sharing Achieves Optimal Fault Tolerance and Efficiency
New VSS protocols fundamentally simplify the cryptographic primitive, enabling optimally fault-tolerant, publicly verifiable distributed systems with 90% less bandwidth.
Probabilistic Leader Election Enforces Cryptographic Fairness in Transaction Ordering
FairSort uses Verifiable Random Functions to probabilistically elect ephemeral sequencers, cryptographically guaranteeing transaction ordering fairness and mitigating MEV.
Optimal Prover Time Succinct Zero-Knowledge Proofs Redefine Scalability
The Libra proof system achieves optimal linear prover time, solving the primary bottleneck of ZKPs to unlock practical, large-scale verifiable computation.
Decentralized Coin-Weighted Checkpointing Foils Proof-of-Stake History Rewrites
Winkle introduces a decentralized checkpointing primitive, leveraging the entire coin supply to cryptographically secure PoS history against long-range attacks.
Formal Compiler Proof Secures Distributed Cryptographic Applications Synthesis
A new compiler security proof unifies four formalisms to automatically synthesize complex, secure distributed protocols from simple sequential programs, guaranteeing end-to-end security.
