scientific article; zbMATH DE number 7250164

DOI10.4230/LIPICS.CCC.2018.24zbMath1441.68035MaRDI QIDQ5121912

Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf

Publication date: 22 September 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Reed-Solomon codesproximity testingalgebraic coding complexity

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (6)

More efficient amortization of exact zero-knowledge proofs for LWE ⋮ Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier ⋮ Linear-size constant-query IOPs for delegating computation ⋮ Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes ⋮ Fiat-Shamir security of FRI and related SNARKs ⋮ BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes

Uses Software

• Ligero

Cites Work

• Unnamed Item
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• Improved low-degree testing and its applications
• Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
• Nearly-linear size holographic proofs
• Proof verification and the hardness of approximation problems
• Interactive Oracle Proofs
• The Knowledge Complexity of Interactive Proof Systems
• Probabilistic checking of proofs
• Algebraic methods for interactive proof systems
• Fast Reed-Solomon Interactive Oracle Proofs of Proximity
• Interactive proofs of proximity
• Small PCPs with low query complexity

This page was built for publication: