Can PPAD Hardness be Based on Standard Cryptographic Assumptions?

Alon Rosen; Gil Segev; Ido Shahaf

Paper 2016/375

Can PPAD Hardness be Based on Standard Cryptographic Assumptions?

Alon Rosen, Gil Segev, and Ido Shahaf

Abstract

We consider the question of whether PPAD hardness can be based on standard cryptographic assumptions, such as the existence of one-way functions or public-key encryption. This question is particularly well-motivated in light of new devastating attacks on obfuscation candidates and their underlying building blocks, which are currently the only known source for PPAD hardness. Central in the study of obfuscation-based PPAD hardness is the sink-of-verifiable-line (SVL) problem, an intermediate step in constructing instances of the PPAD-complete problem source-or-sink. Within the framework of black-box reductions we prove the following results: -- Average-case PPAD hardness (and even SVL hardness) does not imply any form of cryptographic hardness (not even one-way functions). Moreover, even when assuming the existence of one-way functions, average-case PPAD hardness (and, again, even SVL hardness) does not imply any public-key primitive. Thus, strong cryptographic assumptions (such as obfuscation-related ones) are not essential for average-case PPAD hardness. -- Average-case SVL hardness cannot be based either on standard cryptographic assumptions or on average-case PPAD hardness. In particular, average-case SVL hardness is not essential for average-case PPAD hardness. -- Any attempt for basing the average-case hardness of the PPAD-complete problem source-or-sink on standard cryptographic assumptions must result in instances with a nearly-exponential number of solutions. This stands in striking contrast to the obfuscation-based approach, which results in instances having a unique solution. Taken together, our results imply that it may still be possible to base PPAD hardness on standard cryptographic assumptions, but any such black-box attempt must significantly deviate from the obfuscation-based approach: It cannot go through the SVL problem, and it must result in source-or-sink instances with a nearly-exponential number of solutions.

Metadata

Available format(s): PDF
Publication info: A major revision of an IACR publication in TCC 2017
Contact author(s): segev @ cs huji ac il
History: 2020-10-26: last of 3 revisions; 2016-04-14: received; See all versions
Short URL: https://ia.cr/2016/375
License: CC BY

BibTeX

@misc{cryptoeprint:2016/375,
      author = {Alon Rosen and Gil Segev and Ido Shahaf},
      title = {Can {PPAD} Hardness be Based on Standard Cryptographic Assumptions?},
      howpublished = {Cryptology {ePrint} Archive, Paper 2016/375},
      year = {2016},
      url = {https://eprint.iacr.org/2016/375}
}