Blaze SNARK Achieves Linear Proving Time with Polylogarithmic Verification
Blaze introduces a coding-theoretic SNARK with $O(N)$ prover time and $O(log^2 N)$ verification, unlocking massive verifiable computation scaling.
Coded Byzantine Agreement Protocol Achieves Optimal Communication Complexity Bounds
New coded Byzantine Agreement protocol (COOL) achieves optimal resilience and asymptotically optimal communication complexity, fundamentally limiting distributed consensus costs.
On-The-Fly Coding Dramatically Improves Data Availability Security Assurance
Modularizing data availability by committing to uncoded data and using Random Linear Network Coding for stronger sampling assurance.
Code-Based Zero-Knowledge Proofs Enhance Post-Quantum Cryptographic Security
This research introduces novel code-based zero-knowledge proofs, including HammR and a syndrome decoding protocol, fundamentally advancing quantum-resilient cryptography and secure digital signatures.
Code-Based Zero-Knowledge Proofs for Post-Quantum Cryptographic Resilience
This research pioneers novel zero-knowledge proof protocols, including HammR and CROSS, leveraging coding theory to secure digital signatures against emerging quantum threats.
