Practical Distributed Broadcast Encryption Eliminates Centralized Key Escrow
This research introduces practical distributed broadcast encryption schemes, enabling secure group messaging without a trusted central authority.
Succinct Oblivious Tensor Evaluation Unlocks Efficient Adaptive Cryptographic Primitives
A novel succinct oblivious tensor evaluation primitive, secured by Learning With Errors, enables adaptively-secure laconic function evaluation and optimal trapdoor hashing, advancing private verifiable computation.
Decentralized Consensus Elevates Malware Detection beyond Centralized Trust
A novel two-tier blockchain architecture integrates diverse detection engines with Byzantine fault tolerance, creating a self-evolving, collaborative cybersecurity mesh.
Multi-Client Functional Encryption Secures Private Multi-Source Data Computation
A novel Multi-Client Functional Encryption scheme enables secure, privacy-preserving inner product computations over data from multiple independent sources.
Leaderless Asynchronous Consensus Achieves Optimal BFT Performance
This leaderless, asynchronous BFT protocol uses concurrent transaction processing and a novel threshold signature to achieve optimal two-round finality and linear communication.
Adaptive Byzantine Agreement Achieves Optimal Fault-Parameterized Communication
Foundational consensus theory bypasses the quadratic communication lower bound, proving scalability can be proportional to actual network faults.
Dynamic Slashing Secures Proof-of-Stake against Stake Centralization
A new mechanism dynamically scales slashing penalties by stake concentration, creating a self-regulating security equilibrium that disincentivizes validator centralization.
Adaptive Byzantine Agreement Achieves Optimal Communication Complexity Based on Actual Faults
This new consensus protocol introduces adaptive communication complexity, scaling its message load to the actual fault count, which is asymptotically optimal for large-scale BFT systems.
Ultra-Fast Asynchronous Consensus Achieves Optimal Resilience and Two-Round Finality
A new leaderless BFT protocol achieves optimal $n geq 3t+1$ resilience and two-round finality by concurrently processing transactions with a novel threshold signature scheme.
