Peer-Ranked Consensus Secures Decentralized AI Swarm Inference.
Research introduces a peer-ranked consensus protocol using on-chain reputation and proof-of-capability to create a meritocratic, Sybil-resistant foundation for verifiable decentralized AI services.
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.
Shared Sequencers Mitigate Cross-Rollup MEV, Enabling Atomic L2 Transactions
A new shared sequencing mechanism uses decentralized consensus to enforce atomic transaction ordering across multiple rollups, neutralizing cross-rollup MEV.
Threshold Cryptography and Blockchain Secure Dual Location Query Privacy
A framework combining threshold cryptography and tokenized private chains achieves provably secure, dual-layer location and query privacy.
Linear-Complexity Secret Sharing Unlocks Scalable Decentralized Randomness Beacons
A novel Publicly Verifiable Secret Sharing scheme reduces complexity to $O(n)$, enabling highly scalable, unbiasable randomness for large-scale consensus.
Verifiable Shuffle Function Ensures Fair Transaction Ordering and MEV Neutrality
A Verifiable Shuffle Function cryptographically enforces random transaction ordering, fundamentally neutralizing MEV and securing decentralized sequencing.
Proactive Security with Offline Devices Enables Resilient Threshold Key Management
A novel cryptographic folding technique allows threshold wallets to refresh secret shares asynchronously, securing keys against long-term mobile adversaries.
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.
Constant-Time Publicly Verifiable Secret Sharing Unlocks Scalable Blockchain Primitives
This framework transforms Publicly Verifiable Secret Sharing from $O(n)$ to $O(1)$ complexity by leveraging CCA2-Secure Threshold Encryption and NIZK proofs, eliminating a critical scalability bottleneck.
