zkVC Optimizes Zero-Knowledge Proofs for Fast Verifiable Machine Learning
zkVC introduces Constraint-reduced Polynomial Circuits to optimize zkSNARKs for matrix multiplication, achieving a 12x speedup for private verifiable AI.
Formal Verification Quantifies Algorand Consensus Robustness and Adversarial Limitations
Researchers used a process algebraic model and noninterference framework to formally verify Algorand's consensus security, revealing precise adversarial limits.
Differential Privacy Guarantees Provable Transaction Ordering Fairness in Distributed Systems
By formally linking Differential Privacy to transaction ordering, this research provides a general, quantifiable cryptographic primitive to eliminate algorithmic bias and mitigate MEV.
Algorithm NECTAR Secures Distributed Systems against Byzantine Partition Attacks
NECTAR introduces a Byzantine-fault-tolerant partition detection primitive, fundamentally securing consensus protocols against network segmentation attacks and enhancing liveness.
Prioritized Broadcast Slashes Asynchronous Consensus Communication Complexity.
A committee-based prioritized broadcast protocol cuts Byzantine consensus communication costs by $O(n)$, unlocking scalable asynchronous state replication.
Accountable Byzantine Consensus Achieves Optimal Communication and Accountability Complexity
New Accountable Byzantine Consensus protocol, `abcopt`, delivers optimal communication complexity while guaranteeing provable validator accountability.
Quantum Signatures Break Byzantine Fault Tolerance Bound for Consensus
Quantum Signed Byzantine Agreement achieves near-optimal 50% fault tolerance, securing future decentralized systems against classical and quantum threats.
Reusable Formal Verification Framework Secures Complex DAG-Based Consensus Protocols
A compositional TLA+ framework enables reusable, mechanized safety proofs for complex DAG consensus, fundamentally securing the next generation of high-throughput distributed ledgers.
