Formal Security Comparison: Proof-of-Work Outperforms Proof-of-Stake
This research systematically compares the formal security properties of Proof-of-Work and Proof-of-Stake, clarifying their inherent guarantees and trade-offs.
Reputation-Based Byzantine Consensus Enhances IoT Blockchain Efficiency and Security
This research introduces a novel reputation-based Byzantine consensus mechanism, fundamentally improving IoT blockchain scalability and security by reimagining node trust.
Pod: Optimal-Latency, Censorship-Free, Accountable Generalized Consensus Layer
A novel consensus primitive eliminates inter-replica communication, achieving physically optimal latency and enabling high-speed, accountable decentralized applications.
Dynamic Committee Rotation Enhances Asynchronous Consensus Security and Scalability
This research introduces a novel dynamic committee rotation mechanism, proactively mitigating collusion risks in asynchronous Byzantine fault-tolerant protocols.
Incentivizing Multiple Proposers for Robust Blockchain Censorship Resistance
This research designs transaction fee mechanisms to economically incentivize multiple block proposers, fundamentally countering censorship and bribery in decentralized networks.
AI Optimizes Blockchain Consensus for Dynamic, Secure, and Efficient Networks
This research introduces a hybrid AI model that dynamically optimizes blockchain consensus mechanisms, significantly enhancing network scalability, security, and efficiency by learning and adapting to real-time conditions.
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.
Bullshark on Narwhal Achieves High-Performance Byzantine Fault-Tolerant DAG Consensus
This work meticulously analyzes Bullshark on Narwhal, revealing how round-based DAGs deliver optimal Byzantine fault-tolerant consensus for scalable decentralized systems.
Merkle-CRDTs Enable Verifiable, Scalable, Conflict-Free Decentralized State Management
A novel data structure merges Conflict-Free Replicated Data Types with Merkle trees, offering efficient, verifiable state synchronization for decentralized applications.
