Name
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 group assumption and any hard language that is decidable in quasi-polynomial time and polynomial space. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/978-3-030-56877-1_23 | CRYPTO (3) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yael Tauman Kalai | 1 | 2502 | 104.65 |
| Omer Paneth | 2 | 535 | 22.42 |
| Lisa Yang | 3 | 0 | 0.34 |