Cryptographic Liveness Proofs Secure Proof-of-Stake against Long-Range Attacks
A new Verifiable Liveness Proof primitive enables non-interactive, cryptographic slashing for censorship and downtime, hardening PoS finality.
Falcon Protocol Achieves Low Latency Asynchronous Byzantine Consensus
A novel BFT protocol, Falcon, uses Graded Broadcast to bypass costly agreement stages, fundamentally improving decentralized system throughput and latency.
Lattice-Based Ring Signatures Achieve Post-Quantum Anonymity and Verification Efficiency
ChipmunkRing introduces Acorn Verification, a lattice-based zero-knowledge primitive, to deliver quantum-safe, anonymous transactions with 17x faster validation.
Novel Merklized AVL Tree Halves Blockchain State Synchronization Time
Introducing the AVL* tree, a Byzantine-fault-tolerant Merklized structure that enables secure, concurrent state chunk downloading, drastically improving node synchronization speed and liveness.
Differential Privacy Enforces Transaction Ordering Fairness Mitigating MEV
Foundational research establishes Differential Privacy as a primitive for enforcing transaction ordering fairness, fundamentally mitigating algorithmic bias and MEV.
Temporal Correlation Links User IP Addresses to Blockchain Pseudonyms
A passive network attack exploits the time difference between transaction confirmation and RPC query packets to deanonymize over 95% of users.
New Accumulator Definitions Enable Delegated Stateless Verification
New cryptographic accumulator definitions introduce delegatable proofs, enabling light clients to securely verify state without full synchronization or storage.
Validated Strong Consensus Enables Efficient Asynchronous Leader-Based Blockchain State Replication
A new validated strong BFT model allows asynchronous blockchains to use leader-based coordination, achieving HotStuff-level efficiency and linear view changes.
Decentralizing Attribute Encryption Eliminates Single Authority Trust Risk
A blockchain-based mechanism distributes key generation for CP-ABE, resolving the centralized trusted authority problem and securing outsourced data access.
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.