Delegation with Updatable Unambiguous Proofs and PPAD-Hardness
international cryptology conference, pp. 652-673, 2020.
In this work, we construct an updatable and unambiguous delegation scheme based on the decisional assumption on bilinear groups introduced by Kalai, Paneth and Yang [STOC 2019]. Using this delegation scheme, we show PPAD-hardness (and hence the hardness of computing Nash equilibria) based on the quasi-polynomial hardness of this bilinear ...More
Full Text (Upload PDF)
PPT (Upload PPT)