NIST Lightweight Cryptography Standard Secures Resource-Constrained Decentralized Systems
The Ascon cryptographic primitive standardizes low-power security, enabling robust, side-channel-resistant data integrity for mass-market IoT and edge-node DLT.
Winkle Foils Proof-of-Stake Long-Range Attacks with Decentralized Coin Holder Checkpoints
Winkle introduces a decentralized checkpointing primitive, leveraging coin holder transaction-based votes to cryptoeconomically secure PoS history against long-range attacks.
Decoupling Data Commitment from Coding Enhances Sampling Security
A new Data Availability Sampling paradigm commits to uncoded data, enabling on-the-fly coding for verification, which drastically strengthens light client security guarantees.
Differential Privacy Ensures Fair Transaction Ordering in State Machine Replication
Foundational research links Differential Privacy to equal opportunity in transaction ordering, providing a mathematically rigorous framework to eliminate algorithmic bias and mitigate MEV.
Constant-Cost Batch Verification with Silently Verifiable Proofs
Silently Verifiable Proofs introduce a new zero-knowledge primitive that achieves constant verifier-to-verifier communication for arbitrarily large proof batches, drastically cutting overhead for private computation.
Lattice-Based Polynomial Commitments Achieve Post-Quantum Succinctness and Sublinear Verification
Greyhound is the first concretely efficient lattice-based polynomial commitment scheme, enabling post-quantum secure zero-knowledge proofs with sublinear verifier time.
Asynchronous Verifiable Random Functions Achieve Optimal Leaderless BFT Consensus
AVRFs enable every node to verifiably compute the next proposer locally, eliminating leader election latency and achieving optimal asynchronous speed.
Epochless Batched Threshold Encryption Secures Practical Private Transaction Ordering
BEAT-MEV introduces a novel, epochless Batched Threshold Encryption scheme, eliminating costly MPC setup to enable practical, front-running-resistant private mempools.
Constant-Cost Batch Verification for Private Computation over Secret-Shared Data
New silently verifiable proofs achieve constant-size verifier communication for batch ZKPs over secret shares, unlocking scalable private computation.
