Sublinear Zero-Knowledge Proofs Democratize Verifiable Computation on Constrained Devices
A novel space-efficient tree algorithm reduces ZKP memory complexity from linear to square-root, unlocking verifiable computation on all resource-constrained devices.
Efficient Lattice Polynomial Commitments Secure Post-Quantum ZK Systems
A novel lattice-based polynomial commitment scheme achieves post-quantum security with 8000x smaller proofs, enabling practical, scalable ZK-rollups.
Zero-Knowledge Proof of Training Secures Private Decentralized Federated Consensus
ZKPoT is a new cryptographic primitive using zk-SNARKs to verify model contribution without revealing private data, unlocking decentralized AI.
Cryptographic Proof Systems Decouple Computation and Trustless Verification
Cryptographic proof systems enable trustless outsourcing of complex computation, drastically reducing verification cost for resource-constrained clients.
Silently Verifiable Proofs Enable Constant Communication Batch ZKP Verification
Silently verifiable proofs introduce a cryptographic primitive that reduces batch verification communication overhead to a single field element, unlocking truly scalable private computation.
Zero-Knowledge Proof of Training Secures Federated Consensus
The Zero-Knowledge Proof of Training consensus mechanism uses zk-SNARKs to prove model performance without revealing private data, solving the privacy-utility conflict in decentralized computation.
