Delegation with Updatable Unambiguous Proofs and PPAD-Hardness

international cryptology conference, pp. 652-673, 2020.

Cited by: 0|Bibtex|Views1|DOI:https://doi.org/10.1007/978-3-030-56877-1_23
Other Links: academic.microsoft.com

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments