Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions

Download PDF
Open Webpage

Noga Amit, Guy N. Rothblum

Published: 01 Jan 2024, Last Modified: 16 May 2025CRYPTO (10) 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: What are the minimal cryptographic assumptions that suffice for constructing efficient argument systems, and for which tasks? Recently, Amit and Rothblum [STOC 2023] showed that one-way functions suffice for constructing constant-round arguments for bounded-depth computations. In this work we ask: what other tasks have efficient argument systems based only on one-way functions? We show two positive results: