Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead

Noga Ron-Zewi, Ron D. Rothblum. Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead. IACR Cryptology ePrint Archive, 2021:1673, 2021. [doi]

@article{Ron-ZewiR21-0,
  title = {Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead},
  author = {Noga Ron-Zewi and Ron D. Rothblum},
  year = {2021},
  url = {https://eprint.iacr.org/2021/1673},
  researchr = {https://researchr.org/publication/Ron-ZewiR21-0},
  cites = {0},
  citedby = {0},
  journal = {IACR Cryptology ePrint Archive},
  volume = {2021},
  pages = {1673},
}