Game Theory Secures Verifiable Secret Sharing against Rational Collusion
A new mechanism design framework embeds a parameterized payment rule into Verifiable Secret Sharing, strategically disincentivizing rational collusion for enhanced decentralized security.
Deterministic Bounds Secure Committee Selection, Strengthening Decentralization and Scalability
By replacing probabilistic committee selection with deterministic bounds, this new sortition mechanism guarantees an honest majority, enhancing consensus security and network scalability.
DAG-Based BFT Protocol Achieves Optimal Latency without Common Primitives
This novel DAG-based BFT protocol achieves optimal three-round latency by eliminating reliable broadcast and common coin primitives, paving the way for hyper-efficient decentralized systems.
Financial Fairness Redefines Security for On-Chain Multi-Party Computation
Research introduces Financial Fairness, a new property for cryptographic penalty protocols, ensuring equal net present cost for all honest participants to secure economic rigor.
Multi-Party Computation Enables Fairer Incentive-Compatible Transaction Fee Mechanisms
Cryptography, via Multi-Party Computation among block producers, circumvents game-theoretic impossibility results to design non-trivial, incentive-compatible fee mechanisms.
Lightweight Asynchronous Secret Sharing Achieves Optimal Resilience and Efficiency
New protocols for Asynchronous Verifiable Secret Sharing (AVSS) leverage lightweight primitives to achieve optimal resilience and amortized linear communication, fundamentally accelerating BFT consensus.