Efficient Verifiable Secret Sharing Secures Byzantine Fault Tolerant Systems
EByFTVeS integrates BFT with VSS to guarantee consistency and efficiency, fundamentally securing decentralized services operating on private state.
Decentralized Key Reveal Protocol Mitigates Front-Running with Minimal Latency
A new architecture for transaction encryption, F3B, uses a decentralized secret-management committee to reveal keys post-finality, eliminating front-running without high latency.
Lightweight Asynchronous Verifiable Secret Sharing Achieves Optimal Resilience
New AVSS protocols use only hash functions to achieve optimal $t
Efficient Byzantine Verifiable Secret Sharing Secures Decentralized Systems Foundationally
EByFTVeS introduces an Adaptive Share Delay Provision strategy to resolve consistency and efficiency burdens in BFT-based Verifiable Secret Sharing, strengthening core cryptographic primitives.
Collaborative Zero-Knowledge Proofs Secure Distributed Secrets Efficiently
This research introduces Collaborative zk-SNARKs, a cryptographic primitive allowing distributed parties to prove a statement about their collective secret data without centralization, achieving near-single-prover efficiency.
Federated Distributed Key Generation Enables Robust Threshold Cryptography for Open Networks
FDKG introduces optional participation and heterogeneous trust to DKG, resolving the impracticality of key generation in large, dynamic validator sets.
Selective Batched IBE Enables Constant-Cost Threshold Key Issuance
This new cryptographic primitive enables distributed authorities to generate a single, succinct decryption key for an arbitrary batch of identities at a cost independent of the batch size, fundamentally solving key management scalability in threshold systems.
