Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum. PPAD is as Hard as LWE and Iterated Squaring. In Eike Kiltz, Vinod Vaikuntanathan, editors, Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part II. Volume 13748 of Lecture Notes in Computer Science, pages 593-622, Springer, 2022. [doi]
@inproceedings{BitanskyCHKLPR22-0,
title = {PPAD is as Hard as LWE and Iterated Squaring},
author = {Nir Bitansky and Arka Rai Choudhuri and Justin Holmgren and Chethan Kamath and Alex Lombardi and Omer Paneth and Ron D. Rothblum},
year = {2022},
doi = {10.1007/978-3-031-22365-5_21},
url = {https://doi.org/10.1007/978-3-031-22365-5_21},
researchr = {https://researchr.org/publication/BitanskyCHKLPR22-0},
cites = {0},
citedby = {0},
pages = {593-622},
booktitle = {Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part II},
editor = {Eike Kiltz and Vinod Vaikuntanathan},
volume = {13748},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-031-22365-5},
}