(2026-03) Succinct Verification of Lattice-Based Compressed -Sigma-Protocols via Delegated Proofs of Correct Folding of Cryptographically Generated Public Parameters
2026-03-19
Inner product arguments are a widely used primitive in cryptography. The bulletproofs framework and subsequently compressed protocols provide a powerful folding technique that allows for succinct communication complexity of these. However, their verification complexity remains linear. The linear part of the verification is the folding computation of the CRS for the given vector commitment scheme. We explore a new avenue by which to delegate this folding to the prover via an interactive proof that incorporates the setup function of the commitment scheme in the setting where the CRS is constructed cryptographically from a small seed. We use this proof to construct a succinctly verifiable compressed protocol for structured linear forms in the lattice setting.