Recursive Transparent Arguments Enable Trustless Logarithmic Data Availability Sampling
New recursive transparent argument achieves near-constant verification time without a trusted setup, fundamentally unlocking scalable, trustless data availability.
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.
Post-Quantum Signatures Eliminate Trapdoors Using Zero-Knowledge Proofs
Lattice-based non-interactive zero-knowledge proofs secure digital signatures against quantum adversaries by removing exploitable trapdoor functions.
Post-Quantum Succinct Arguments Secure Verifiable Computation against Quantum Adversaries
This work proves a foundational succinct argument is secure in the Quantum Random Oracle Model, guaranteeing long-term security for verifiable computation.
Fiat-Shamir Transformation Unsoundness Enables Practical Zero-Knowledge False Proofs
The Fiat-Shamir heuristic fails a class of succinct arguments, allowing false statements to be proven, demanding new security models.
Post-Quantum Verifiable Delay Functions Eliminate Trusted Setup
Isogeny-based Verifiable Delay Functions leverage endomorphism rings for quantum-secure, trustless, and efficiently verifiable sequential computation.
Lattice-Based Zero-Knowledge Signatures Eliminate Cryptographic Trapdoors
A new post-quantum signature framework converts non-trapdoor zero-knowledge proofs into digital signatures, fundamentally enhancing long-term security assurances.