Proximity testing with logarithmic randomness

DOI10.62056/AKSDKP10MaRDI QIDQ7318549zbMATH OpenFDO

Authors Benjamin E. Diamond, Jim Posen

Publication date 25 August 2026

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/AKSDKP10

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05)

Cites work

• Brakedown: linear-time and field-agnostic SNARKs for R1CS
• Efficient secure two-party protocols. Techniques and constructions
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Interactive oracle proofs
• Ligero: lightweight sublinear arguments without a trusted setup
• Linear-time arguments with sublinear verification from tensor codes
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Orion: zero knowledge proof with linear prover time
• Proximity gaps for Reed-Solomon codes
• Spartan: efficient and general-purpose zkSNARKs without trusted setup

Cited in

(2)

• Polylogarithmic proofs for multilinears over binary towers
• Proximity gaps in interleaved codes

This page was built for publication: Proximity testing with logarithmic randomness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318549)