Author of the publication

Delegation for Search Problems.

, , and . ICALP, volume 229 of LIPIcs, page 73:1-73:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Non-interactive delegation and batch NP verification from standard computational assumptions., , and . STOC, page 474-482. ACM, (2017)A Parallel Repetition Theorem for the GHZ Game., and . Electron. Colloquium Comput. Complex., (2020)(A Counterexample to) Parallel Repetition for Non-Signaling Multi-Player Games., and . Electron. Colloquium Comput. Complex., (2017)Delegation for Search Problems., , and . ICALP, volume 229 of LIPIcs, page 73:1-73:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Locally Covert Learning., and . ITC, volume 267 of LIPIcs, page 14:1-14:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Fiat-Shamir: from practice to theory., , , , , , and . STOC, page 1082-1090. ACM, (2019)Cryptographic Hashing from Strong One-Way Functions (Or: One-Way Product Functions and Their Applications)., and . FOCS, page 850-858. IEEE Computer Society, (2018)On the Plausibility of Fully Homomorphic Encryption for RAMs., , , and . CRYPTO (1), volume 11692 of Lecture Notes in Computer Science, page 589-619. Springer, (2019)Counterexamples to the Low-Degree Conjecture., and . ITCS, volume 185 of LIPIcs, page 75:1-75:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads., , , , and . TCC (2), volume 12551 of Lecture Notes in Computer Science, page 168-197. Springer, (2020)