Quantum-Secure Zero-Knowledge Proofs via Extractable Homomorphic Commitments
A novel extractable homomorphic commitment primitive enables efficient lattice-based non-interactive zero-knowledge proofs provably secure against quantum adversaries.
Zero-Overhead Data Availability Protocol Enables Trustless Scalability
ZODA introduces a tensor code-based proof of encoding that eliminates sampler communication overhead, fundamentally democratizing data availability verification for light nodes.
Lattice-Based DKG Secures Asynchronous Systems against Quantum Threats
Research introduces LADKG, a post-quantum DKG protocol integrating AV3S and AACS to enable scalable, publicly verifiable threshold cryptography in asynchronous BFT networks.
Lattice-Based Inner Product Argument Unlocks Post-Quantum Transparent SNARKs
The Lattice-IPA primitive achieves a succinct, transparent, and quantum-resistant proof system, fundamentally securing verifiable computation against future quantum adversaries.
Zero-Knowledge Identity Framework Secures Private Data Sharing and Revocation
This new framework merges Decentralized Identity with zk-STARKs and cryptographic accumulators, enabling scalable, privacy-preserving credential verification and revocation.
Interactive Oracle Proofs Enable Trustless, Scalable, Post-Quantum Verifiable Computation
Interactive Oracle Proofs generalize PCPs, constructing transparent, quasi-linear proof systems that eliminate trusted setup for mass-scale verifiable computation.
Constant-Size Polynomial Commitments Unlock Scalable Zero-Knowledge Proof Systems
This cryptographic primitive allows a constant-size commitment to any polynomial, fundamentally decoupling proof size from computation complexity.
zk-STARKs Enable Scalable Private Identity and Verifiable Credential Revocation
A zk-STARKs-based framework uses cryptographic accumulators to resolve the privacy-transparency conflict, enabling scalable, anonymous credential revocation.
Linear-Time Post-Quantum SNARKs Achieve Optimal Prover Efficiency
Brakedown introduces the first built linear-time SNARK, achieving optimal O(N) prover complexity for large computations while eliminating trusted setup.
