Abstract
A fundamental result dating to Ligero (Des. Codes Cryptogr. '23) establishes that each fixed linear block code exhibits proximity gaps with respect to the collection of affine subspaces, in the sense that each given subspace either resides entirely close to the code, or else contains only a small portion which resides close to the code. In particular, any given subspace's failure to reside entirely close to the code is necessarily witnessed, with high probability, by a uniformly randomly sampled element of that subspace. We investigate a variant of this phenomenon in which the witness is not sampled uniformly from the subspace, but rather from a much smaller subset of it. We show that a logarithmic number of random field elements (in the dimension of the subspace) suffice to effect an analogous proximity test, with moreover only a logarithmic (multiplicative) loss in the possible prevalence of false witnesses. We discuss applications to recent noninteractive proofs based on linear codes, including Brakedown (CRYPTO '23).
Publisher
International Association for Cryptologic Research
Reference12 articles.
1. Ligero: lightweight sublinear arguments without a trusted
setup;Scott Ames;Designs, Codes and Cryptography,2023
2. Brakedown: Linear-Time and Field-Agnostic SNARKs for
R1CS;Alexander Golovnev,2023
3. Orion: Zero Knowledge Proof With Linear Prover Time;Tiancheng Xie,2022
4. Proximity Gaps for Reed–Solomon Codes;Eli Ben-Sasson;Journal of the ACM,2023
5. Worst-Case to Average Case Reductions for the Distance to a
Code;Eli Ben-Sasson,2018
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献