Proving as fast as computing: succinct arguments with constant prover overhead
From MaRDI portal
Publication:6083591
DOI10.1145/3519935.3519956MaRDI QIDQ6083591
No author found.
Publication date: 8 December 2023
Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Related Items (4)
Oblivious transfer with constant computational overhead ⋮ Succinct arguments for RAM programs via projection codes ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification
This page was built for publication: Proving as fast as computing: succinct arguments with constant prover overhead
