Paper 2024/850
Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions
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:
First, we construct a new argument system for batch-verification of
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published by the IACR in CRYPTO 2024
- Keywords
- Interactive ArgumentsDelegationOne-Way FunctionsBatch Verification
- Contact author(s)
-
nogamit @ berkeley edu
rothblum @ alum mit edu - History
- 2024-08-21: revised
- 2024-05-30: received
- See all versions
- Short URL
- https://ia.cr/2024/850
- License
-
CC BY-NC-ND
BibTeX
@misc{cryptoeprint:2024/850, author = {Noga Amit and Guy N. Rothblum}, title = {Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/850}, year = {2024}, url = {https://eprint.iacr.org/2024/850} }