Adaptively-Sound Succinct Arguments for NP from Indistinguishability Obfuscation
Authors: 
Brent Waters and 
David J. WuAuthors Info & Claims
Brent Waters and David J. WuAuthors Info & ClaimsJune 2024
Pages 387 - 398
Abstract
A succinct non-interactive argument (SNARG) for NP allows a prover to convince a verifier that an NP statement x is true with a proof of size o(|x| + |w|), where w is the associated NP witness. A SNARG satisfies adaptive soundness if the malicious prover can choose the statement to prove after seeing the scheme parameters. In this work, we provide the first adaptively-sound SNARG for NP in the plain model assuming sub-exponentially-hard indistinguishability obfuscation, sub-exponentially-hard one-way functions, and either the (polynomial) hardness of the discrete log assumption or the (polynomial) hardness of factoring. This gives the first adaptively-sound SNARG for NP from falsifiable assumptions. All previous SNARGs for NP in the plain model either relied on non-falsifiable cryptographic assumptions or satisfied a weak notion of non-adaptive soundness (where the adversary has to choose the statement it proves before seeing the scheme parameters).
References
[1]
Martin R. Albrecht, Valerio Cini, Russell W. F. Lai, Giulio Malavolta, and Sri Aravinda Krishnan Thyagarajan. 2022. Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable - (Extended Abstract). In CRYPTO. 102–132.
[2]
Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, and Ke Yang. 2001. On the (Im)possibility of Obfuscating Programs. In CRYPTO. 1–18.
[3]
Boaz Barak and Rafael Pass. 2004. On the Possibility of One-Message Weak Zero-Knowledge. In TCC. 121–132.
[4]
Nir Bitansky, Ran Canetti, Alessandro Chiesa, Shafi Goldwasser, Huijia Lin, Aviad Rubinstein, and Eran Tromer. 2017. The Hunting of the SNARK. J. Cryptol., 30, 4 (2017), 989–1066.
[5]
Nir Bitansky, Ran Canetti, Alessandro Chiesa, and Eran Tromer. 2012. From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In ITCS. 326–349.
[6]
Nir Bitansky, Ran Canetti, Omer Paneth, and Alon Rosen. 2014. On the existence of extractable one-way functions. In STOC. 505–514.
[7]
Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, and Omer Paneth. 2013. Succinct Non-interactive Arguments via Linear Interactive Proofs. In TCC. 315–333.
[8]
Dan Boneh, Yuval Ishai, Amit Sahai, and David J. Wu. 2017. Lattice-Based SNARGs and Their Application to More Efficient Obfuscation. In EUROCRYPT. 247–277.
[9]
Dan Boneh, Yuval Ishai, Amit Sahai, and David J. Wu. 2018. Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs. In EUROCRYPT. 222–255.
[10]
Dan Boneh and Brent Waters. 2013. Constrained Pseudorandom Functions and Their Applications. In ASIACRYPT. 280–300.
[11]
Elette Boyle, Shafi Goldwasser, and Ioana Ivan. 2014. Functional Signatures and Pseudorandom Functions. In PKC. 501–519.
[12]
Zvika Brakerski, Maya Farber Brodsky, Yael Tauman Kalai, Alex Lombardi, and Omer Paneth. 2023. SNARGs for Monotone Policy Batch NP. In CRYPTO. 252–283.
[13]
Zvika Brakerski, Justin Holmgren, and Yael Tauman Kalai. 2017. Non-interactive delegation and batch NP verification from standard computational assumptions. In STOC. 474–482.
[14]
Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, and Janno Siim. 2023. Impossibilities in Succinct Arguments: Black-Box Extraction and More. In AFRICACRYPT. 465–489.
[15]
Arka Rai Choudhuri, Sanjam Garg, Abhishek Jain, Zhengzhong Jin, and Jiaheng Zhang. 2023. Correlation Intractability and SNARGs from Sub-exponential DDH. In CRYPTO. 635–668.
[16]
Arka Rai Choudhuri, Abhishek Jain, and Zhengzhong Jin. 2021. Non-interactive Batch Arguments for NP from Standard Assumptions. In CRYPTO. 394–423.
[17]
Arka Rai Choudhuri, Abhishek Jain, and Zhengzhong Jin. 2021. SNARGs for P from LWE. In FOCS. 68–79.
[18]
Valerio Cini, Russell W. F. Lai, and Giulio Malavolta. 2023. Lattice-Based Succinct Arguments from Vanishing Polynomials - (Extended Abstract). In CRYPTO. 72–105.
[19]
Ivan Damgård, Sebastian Faust, and Carmit Hazay. 2012. Secure Two-Party Computation with Low Communication. In TCC. 54–74.
[20]
Cody Freitag, Brent Waters, and David J. Wu. 2023. How to Use (Plain) Witness Encryption: Registered ABE, Flexible Broadcast, and More. In CRYPTO. 498–531.
[21]
Rosario Gennaro, Craig Gentry, Bryan Parno, and Mariana Raykova. 2013. Quadratic Span Programs and Succinct NIZKs without PCPs. In EUROCRYPT. 626–645.
[22]
Craig Gentry and Brent Waters. 2009. Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts). In EUROCRYPT. 171–188.
[23]
Craig Gentry and Daniel Wichs. 2011. Separating succinct non-interactive arguments from all falsifiable assumptions. In STOC. 99–108.
[24]
Oded Goldreich, Shafi Goldwasser, and Silvio Micali. 1984. On the Cryptographic Applications of Random Functions. In CRYPTO. 276–288.
[25]
Jens Groth. 2010. Short Pairing-Based Non-interactive Zero-Knowledge Arguments. In ASIACRYPT. 321–340.
[26]
Abhishek Jain and Zhengzhong Jin. 2022. Indistinguishability Obfuscation via Mathematical Proofs of Equivalence. In FOCS. 1023–1034.
[27]
Aayush Jain, Huijia Lin, and Amit Sahai. 2021. Indistinguishability obfuscation from well-founded assumptions. In STOC. 60–73.
[28]
Aayush Jain, Huijia Lin, and Amit Sahai. 2022. Indistinguishability Obfuscation from LPN over F_p, DLIN, and PRGs in NC^0. In EUROCRYPT. 670–699.
[29]
Ruta Jawale, Yael Tauman Kalai, Dakshita Khurana, and Rachel Yun Zhang. 2021. SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE. In STOC. 708–721.
[30]
Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, and Daniel Wichs. 2023. Boosting Batch Arguments and RAM Delegation. In STOC. 1545–1552.
[31]
Yael Tauman Kalai, Alex Lombardi, and Vinod Vaikuntanathan. 2023. SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption. In EUROCRYPT. 470–498.
[32]
Yael Tauman Kalai and Omer Paneth. 2016. Delegating RAM Computations. In TCC. 91–118.
[33]
Yael Tauman Kalai, Omer Paneth, and Lisa Yang. 2019. How to delegate computations publicly. In STOC. 1115–1124.
[34]
Yael Tauman Kalai and Ran Raz. 2009. Probabilistically Checkable Arguments. In CRYPTO. 143–159.
[35]
Yael Tauman Kalai, Vinod Vaikuntanathan, and Rachel Yun Zhang. 2021. Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs. In TCC. 330–368.
[36]
Jonathan Katz and Nan Wang. 2003. Efficiency improvements for signature schemes with tight security reductions. In ACM CCS. 155–164.
[37]
Aggelos Kiayias, Stavros Papadopoulos, Nikos Triandopoulos, and Thomas Zacharias. 2013. Delegatable pseudorandom functions and applications. In ACM CCS. 669–684.
[38]
Joe Kilian. 1992. A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract). In STOC. 723–732.
[39]
Helger Lipmaa. 2013. Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes. In ASIACRYPT. 41–60.
[40]
Silvio Micali. 1994. CS Proofs (Extended Abstracts). In FOCS. 436–453.
[41]
Michael Rabin. 1979. Digitalized Signatures and Public-Key Functions as Intractable as Factorization.
[42]
Amit Sahai and Brent Waters. 2014. How to use indistinguishability obfuscation: deniable encryption, and more. In STOC. 475–484.
[43]
Brent Waters and David J. Wu. 2022. Batch Arguments for NP and More from Standard Bilinear Group Assumptions. In CRYPTO. 433–463.
[44]
Brent Waters and David J. Wu. 2024. Adaptively-Sound Succinct Arguments for NP from Indistinguishability Obfuscation. Cryptology ePrint Archive, Paper 2024/165. Available at https://eprint.iacr.org/2024/165
[45]
Hoeteck Wee. 2005. On Round-Efficient Argument Systems. In ICALP. 140–152.
Index Terms
- Adaptively-Sound Succinct Arguments for NP from Indistinguishability Obfuscation
Recommendations
How to use indistinguishability obfuscation: deniable encryption, and more
STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computingWe introduce a new technique, that we call punctured programs, to apply indistinguishability obfuscation towards cryptographic problems. We use this technique to carry out a systematic study of the applicability of indistinguishability obfuscation to a ...
Keyed-Fully Homomorphic Encryption Without Indistinguishability Obfuscation
Applied Cryptography and Network SecurityAbstract(Fully) homomorphic encryption ((F)HE) allows users to publicly evaluate circuits on encrypted data. Although public homomorphic evaluation property has various applications, (F)HE cannot achieve security against chosen ciphertext attacks (CCA2) ...
On Succinct Non-interactive Arguments in Relativized Worlds
Advances in Cryptology – EUROCRYPT 2022AbstractSuccinct non-interactive arguments of knowledge (SNARKs) are cryptographic proofs with strong efficiency properties. Applications of SNARKs often involve proving computations that include the SNARK verifier, a technique called recursive ...
Comments
Information & Contributors
Information
Published In
June 2024
2049 pages
ISBN:9798400703836
DOI:10.1145/3618260
- General Chairs:
- Bojan Mohar,
- Igor Shinkar,
- Program Chair:
- Ryan O'Donnell
Copyright © 2024 Owner/Author.
This work is licensed under a Creative Commons Attribution International 4.0 License.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 11 June 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- National Science Foundation
- Simons Foundation
- Microsoft
Conference
STOC '24
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,389 of 4,261 submissions, 33%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 30Total Downloads
- Downloads (Last 12 months)30
- Downloads (Last 6 weeks)30
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in