@inproceedings{95e0911226994e4cbfc5add5c4ec8fbe,
title = "Delegation with updatable unambiguous proofs and ppad-hardness",
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. The delegation scheme is for super-polynomial time deterministic computations and is publicly verifiable and non-interactive in the common reference string (CRS) model. It is updatable meaning that given a proof for the statement that a Turing machine reaches some configuration C in T steps, it is efficient to update it into a proof for the statement that the machine reaches the next configuration C' in T+1 steps. It is unambiguous meaning that it is hard to find two different proofs for the same statement.",
keywords = "Delegation, PPAD-hardness, Unambiguous proofs, Zero-testable encryption",
author = "Kalai, \{Yael Tauman\} and Omer Paneth and Lisa Yang",
note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2020.; 40th Annual International Cryptology Conference, CRYPTO 2020 ; Conference date: 17-08-2020 Through 21-08-2020",
year = "2020",
doi = "10.1007/978-3-030-56877-1\_23",
language = "الإنجليزيّة",
isbn = "9783030568764",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "652--673",
editor = "Daniele Micciancio and Thomas Ristenpart",
booktitle = "Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, Proceedings",
}