Paper 2019/667
PPAD-Hardness via Iterated Squaring Modulo a Composite
Arka Rai Choudhuri, Pavel Hubacek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, and Guy N. Rothblum
Abstract
We show that, relative to a random oracle, solving the END-OF-LINE problem (which is PPAD-complete) is no easier than computing the function
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- TFNPPPADNash EquilibriumFiat-Shamir transformation
- Contact author(s)
-
achoud @ cs jhu edu
hubacek @ iuuk mff cuni cz
ckamath @ ist ac at
pietrzak @ ist ac at
alon rosen @ idc ac il
rothblum @ alum mit edu - History
- 2019-06-06: received
- Short URL
- https://ia.cr/2019/667
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/667, author = {Arka Rai Choudhuri and Pavel Hubacek and Chethan Kamath and Krzysztof Pietrzak and Alon Rosen and Guy N. Rothblum}, title = {{PPAD}-Hardness via Iterated Squaring Modulo a Composite}, howpublished = {Cryptology {ePrint} Archive, Paper 2019/667}, year = {2019}, url = {https://eprint.iacr.org/2019/667} }