New Asynchronous Key Generation Protocol Boosts Decentralized Security Efficiency
A novel Asynchronous Distributed Key Generation protocol drastically lowers the computational cost of threshold cryptosystems, enabling robust, fast decentralized key management.
Distributed Service Architecture Unifies and Benchmarks Threshold Cryptography Schemes
Thetacrypt proposes a unified, distributed service for threshold cryptography, enabling rigorous performance evaluation of diverse schemes under real-world network conditions.
Threshold Cryptography Secures Byzantine Consensus with Strong Order-Fairness
Themis introduces a threshold-encrypted commit-and-reveal scheme to enforce transaction order based on submission time, mitigating front-running with optimal linear complexity.
Cryptographic Whistleblowing Secures Protocols against Smart Collusion Incentives
This research introduces Cryptographic Whistleblowing, a mechanism design primitive that uses provable on-chain penalties to enforce honesty against financially rational colluders.
Adaptive Threshold Schnorr Signatures Achieve Tight Security Proofs
New three-round Schnorr threshold scheme, Sparkle+, achieves the first tight, fully adaptive security proof, fundamentally strengthening decentralized key management.
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.
Delivery-Fairness Secures Decentralized Randomness Beacons against Time-Advantage Attacks
Introducing delivery-fairness, a new formal property, rigorously quantifies and mitigates the time-advantage vulnerability in randomness beacons, ensuring protocol-level fairness.
Threshold Encryption Enables Provably Fair Transaction Ordering Minimizing MEV
Integrating threshold encryption into the mempool decouples transaction submission from ordering, structurally eliminating frontrunning and centralizing MEV.
Distributed Verifiable Randomness Secures Consensus and On-Chain Fairness
A Distributed Verifiable Random Function, built with threshold cryptography and zk-SNARKs, creates a publicly-verifiable, un-biasable randomness primitive essential for secure leader election and MEV mitigation.
