Paper 2022/336
Batch Arguments for NP and More from Standard Bilinear Group Assumptions
Abstract
Non-interactive batch arguments for NP provide a way to amortize the cost of NP verification across multiple instances. They enable a prover to convince a verifier of multiple NP statements with communication much smaller than the total witness length and verification time much smaller than individually checking each instance.
In this work, we give the first construction of a non-interactive batch argument for NP from standard assumptions on groups with bilinear maps (specifically, from either the subgroup decision assumption in composite-order groups or from the
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A major revision of an IACR publication in CRYPTO 2022
- Keywords
- BARG non-interactive batch arguments delegation succinct arguments
- Contact author(s)
-
bwaters @ cs utexas edu
dwu4 @ cs utexas edu - History
- 2022-06-11: revised
- 2022-03-14: received
- See all versions
- Short URL
- https://ia.cr/2022/336
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/336, author = {Brent Waters and David J. Wu}, title = {Batch Arguments for {NP} and More from Standard Bilinear Group Assumptions}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/336}, year = {2022}, url = {https://eprint.iacr.org/2022/336} }