PPAD is as Hard as LWE and Iterated Squaring

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]

Abstract

Abstract is missing.