Lattice Functional Commitment Secures Post-Quantum Verifiable Computation
A new lattice-based functional commitment for circuits enables post-quantum secure, succinct, and general-purpose private verifiable computation.
Sublinear Space Zero-Knowledge Proofs Democratize Verifiable Computation on Constrained Devices
New sublinear memory ZKPs shift resource constraints from linear to square-root complexity, unlocking verifiable computation on mobile and edge devices.
Cryptographic Accountability Breaks Privacy Deadlock for Decentralized Systems
This novel system employs zero-knowledge and threshold cryptography to enable transaction privacy with a governance-gated, auditable de-anonymization mechanism.
Optimal Prover Time and Succinct Proof Size for Universal Zero-Knowledge
This new ZKP argument system achieves optimal linear prover time and polylogarithmic proof size, fundamentally unlocking verifiable computation at scale.
Lattice-Based Zero-Knowledge Proofs Secure Computation against Quantum Threat
The research introduces quantum-resistant zero-knowledge proof systems leveraging hard lattice problems, ensuring long-term privacy and verifiability for decentralized architectures.
Erasure Code Commitments Secure Data Availability Sampling Consistency
This new cryptographic primitive guarantees a commitment binds to a valid erasure codeword, solving data inconsistency in modular blockchain scaling.
Silently Verifiable Proofs Achieve Constant Communication Batch Zero-Knowledge Verification
Silently Verifiable Proofs introduce a zero-knowledge primitive that enables constant-cost batch verification, unlocking massive private data aggregation and rollup scaling.
Transparent Zero-Knowledge Proofs Achieve Optimal Prover Computation and Succinct Verification
The Libra proof system introduces a transparent zero-knowledge scheme achieving optimal linearithmic prover time, unlocking universally scalable private computation.
Data Availability Sampling Secures Modular Blockchain Scalability
Modular architecture decouples core functions, using Data Availability Sampling and erasure coding to enable trust-minimized, mass-scale rollups.
