Paper 2024/933
A Pure Indistinguishability Obfuscation Approach to Adaptively-Sound SNARGs for NP
Abstract
We construct an adaptively-sound succinct non-interactive argument (SNARG) for NP in the CRS model from sub-exponentially-secure indistinguishability obfuscation ($i\mathcal{O}$) and sub-exponentially-secure one-way functions. Previously, Waters and Wu (STOC 2024), and subsequently, Waters and Zhandry (CRYPTO 2024) showed how to construct adaptively-sound SNARGs for NP by relying on sub-exponentially-secure indistinguishability obfuscation, one-way functions, and an additional algebraic assumption (i.e., discrete log, factoring, or learning with errors). In this work, we show that no additional algebraic assumption is needed and vanilla (sub-exponentially-secure) one-way functions already suffice in combination with $i\mathcal{O}$.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- succinct non-interactive argumentsSNARGadaptive soundnessindistinguishability obfuscation
- Contact author(s)
-
bwaters @ cs utexas edu
dwu4 @ cs utexas edu - History
- 2024-07-03: revised
- 2024-06-11: received
- See all versions
- Short URL
- https://ia.cr/2024/933
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/933, author = {Brent Waters and David J. Wu}, title = {A Pure Indistinguishability Obfuscation Approach to Adaptively-Sound {SNARGs} for {NP}}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/933}, year = {2024}, url = {https://eprint.iacr.org/2024/933} }