Batch Verification

Proving many statements at once more cheaply than proving each separately, while preserving the proof system’s guarantees.

Status	Statement	Tags
	SZK Batch Verification Named by the source as the most pressing open question its work leaves. Its Theorem 1.1 gives the NISZK analogue: communication and CRS length poly(n, log k) for k up to 2⁽ⁿ0.01). A poly(n) dependence is unavoidable even at k = 1 under a sub-exponential hardness assumption, so log k is the aggressive part of the bound. The source also offers a weaker fallback target: any sub-linear dependence on k. 5 open	Batch Verification Direct Product Theorems Limited Independence Randomness Extractioncharacterization