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

From Obfuscation to the Security of Fiat-Shamir for Proofs., , and . CRYPTO (2), volume 10402 of Lecture Notes in Computer Science, page 224-251. Springer, (2017)Fiat-Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)., , and . STOC, page 750-760. ACM, (2021)Arguments of Proximity - Extended Abstract., and . CRYPTO (2), volume 9216 of Lecture Notes in Computer Science, page 422-442. Springer, (2015)Statistical Difference Beyond the Polarizing Regime., , , and . TCC (2), volume 11892 of Lecture Notes in Computer Science, page 311-332. Springer, (2019)A Hierarchy Theorem for Interactive Proofs of Proximity., and . ITCS, volume 67 of LIPIcs, page 39:1-39:43. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Relaxed Locally Correctable Codes., , and . ITCS, volume 94 of LIPIcs, page 27:1-27:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)PPAD is as Hard as LWE and Iterated Squaring., , , , , , and . TCC (2), volume 13748 of Lecture Notes in Computer Science, page 593-622. Springer, (2022)Reusable Designated-Verifier NIZKs for all NP from CDH., , and . EUROCRYPT (2), volume 11477 of Lecture Notes in Computer Science, page 593-621. Springer, (2019)Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract)., , , , , , and . CRYPTO (2), volume 8043 of Lecture Notes in Computer Science, page 185-202. Springer, (2013)From Laconic Zero-Knowledge to Public-Key Cryptography - Extended Abstract., , , and . CRYPTO (3), volume 10993 of Lecture Notes in Computer Science, page 674-697. Springer, (2018)