Efficient Robust Threshold Signatures for Decentralized Applications
This research pioneers a robust, highly efficient threshold ECDSA protocol, dramatically reducing communication and verification costs for securing decentralized systems.
Lattice-Based Non-Interactive Distributed Key Generation for Post-Quantum Security
This research introduces a novel lattice-based non-interactive distributed key generation protocol, enabling quantum-resistant, secure key management for future decentralized systems.
Threshold Signatures Enhance Blockchain Security, Decentralization, and Fault Tolerance
A novel cryptographic primitive distributes signing authority across multiple parties, fundamentally mitigating single points of failure and bolstering decentralized system resilience.
Blockchain-Native Distributed Key Generation Enables On-Chain Verification
A novel Distributed Key Generation protocol leverages blockchain consensus to make public keys verifiable on-chain, enhancing decentralized security and trust minimization.
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.
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.
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.
Threshold Cryptography Enforces Fair Transaction Ordering Mitigating MEV
A distributed threshold cryptosystem decouples transaction ordering from content knowledge, mathematically eliminating frontrunning risk and centralizing MEV incentives.
Rondo Protocol Achieves Optimal Linear Complexity for Decentralized Randomness Beacon Sharing
Rondo introduces batched asynchronous verifiable secret sharing with partial output, cutting message complexity to linear for scalable, reconfigurable randomness beacons.
