Erasure Code Commitments Achieve Poly-Logarithmic Data Availability Sampling Efficiency
A new compiler translates Interactive Oracle Proofs into erasure code commitments, enabling trustless, poly-logarithmic data availability for modular architectures.
Quantum Rewinding Secures Succinct Arguments against Quantum Adversaries
A novel quantum rewinding strategy proves IOP-based succinct arguments secure in the post-quantum era, ensuring long-term cryptographic integrity.
Verifiable Computation for Approximate Homomorphic Encryption Secures Private AI
New HE-IOP primitive solves the integrity problem for approximate homomorphic encryption, enabling verifiable, private, outsourced computation for AI models.
Opening-Consistent IOPs Enable Trustless Erasure Code Commitments
This research introduces Erasure Code Commitments, a new primitive constructed via a novel IOP compiler, solving data availability without a trusted setup or high overhead.
STARKs: Scalable, Transparent, Post-Quantum Secure Computational Integrity
This research introduces Scalable Transparent ARguments of Knowledge (STARKs), a cryptographic primitive enabling verifiable computation without trusted setups, ensuring post-quantum security.