Threshold Cryptography Secures Byzantine Consensus with Strong Order-Fairness
Themis introduces a threshold-encrypted commit-and-reveal scheme to enforce transaction order based on submission time, mitigating front-running with optimal linear complexity.
Data Availability Encoding Yields Zero-Overhead Polynomial Commitments
By unifying data availability encoding with multilinear polynomial commitments, this research eliminates a major proving bottleneck, enabling faster verifiable computation.
Zero-Knowledge Proof of Training Secures Decentralized Federated Learning Consensus
ZKPoT uses zk-SNARKs to verify decentralized model accuracy without revealing private data, solving the efficiency-privacy trade-off in federated learning.
Recursive Structure-Preserving Commitments Enable Constant-Size Universal SNARK Setup
Fractal Commitment Schemes introduce a recursive commitment primitive that compresses the universal trusted setup into a constant size, dramatically accelerating verifiable computation deployment.
Sublinear Memory ZKPs Democratize Verifiable Computation and Privacy
A new proof system reduces ZKP memory from linear to square-root complexity, unlocking verifiable computation on resource-constrained edge devices.
Expander Signatures Enable Efficient Constant-Size Verification on Resource-Limited Devices
Expander Signature decouples heavy key generation from verification, enabling resource-limited devices to achieve constant-size, efficient, and forward-secure authentication.
Hyper-Efficient Universal SNARKs Decouple Proving Cost from Setup
HyperPlonk introduces a new polynomial commitment scheme, achieving a universal and updatable setup with dramatically faster linear-time proving, enabling mass verifiable computation.
Incremental Vector Commitments Enable Practical Trustless AI Model Verification
We introduce Incremental Vector Commitments, a new primitive that decouples LLM size from ZK-proving cost, unlocking verifiable AI inference.
Optimal Linear-Time ZK Proofs Unlock Mass Verifiable Computation
Achieving optimal linear prover time for zero-knowledge proofs fundamentally solves the scalability bottleneck for verifiable computation and ZK-Rollups.
