Answers are grounded in this paper and cite their sources.
An argument system for NP is succinct, if its communication complexity is polylogarithmic the instance and witness sizes. The seminal works of Kilian '92 and Micali '94 show that such arguments can be constructed under standard cryptographic hardness assumptions with four rounds of interaction, and that they be made non-interactive in the random-oracle model. However, we currently do not have any construction of succinct non-interactive arguments (SNARGs) in the standard model with a proof of security under any simple cryptographic assumption.
No takes yet. Share an insight, caveat, or question.
Gentry et al. (2011) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: