Proving as fast as computing: succinct arguments with constant prover overhead

DOI10.1145/3519935.3519956MaRDI QIDQ6083591zbMATH OpenFDO

Authors

Publication date 8 December 2023

Published in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

zbMATH Keywords

succinct argumentsinteractive oracle proofsIOP

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Faster sounder succinct arguments and \textsf{IOP}s
• Linear-time arguments with sublinear verification from tensor codes
• Succinct arguments from multi-prover interactive proofs and their efficiency benefits
• Barriers for succinct arguments in the random oracle model
• Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance

Cited in

(16)

• Oblivious transfer with constant computational overhead
• Brakedown: linear-time and field-agnostic SNARKs for R1CS
• Lattice-based succinct arguments for NP with polylogarithmic-time verification
• Succinct arguments for RAM programs via projection codes
• Faster sounder succinct arguments and \textsf{IOP}s
• Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
• Accelerating tableaux proofs using compact representations
• Approximate lower bound arguments
• Probabilistically checkable arguments for all NP
• Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
• Fast DQBF Refutation
• STIR: Reed-Solomon proximity testing with fewer queries
• Using Abduction to Compute Efficient Proofs
• More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
• On the virtue of succinct proofs
• Zero-knowledge IOPs approaching witness length

This page was built for publication: Proving as fast as computing: succinct arguments with constant prover overhead

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