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]

Authors

Nir Bitansky

This author has not been identified. Look up 'Nir Bitansky' in Google

Arka Rai Choudhuri

This author has not been identified. Look up 'Arka Rai Choudhuri' in Google

Justin Holmgren

This author has not been identified. Look up 'Justin Holmgren' in Google

Chethan Kamath

This author has not been identified. Look up 'Chethan Kamath' in Google

Alex Lombardi

This author has not been identified. Look up 'Alex Lombardi' in Google

Omer Paneth

This author has not been identified. Look up 'Omer Paneth' in Google

Ron D. Rothblum

This author has not been identified. Look up 'Ron D. Rothblum' in Google