Author of the publication

Succinct Classical Verification of Quantum Computation.

, , , , , , , and . CRYPTO (2), volume 13508 of Lecture Notes in Computer Science, page 195-211. Springer, (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

Characterizing Parallel Repetition of Non-Signaling Games: Counterexamples and a Dichotomy Theorem., and . Electron. Colloquium Comput. Complex., (2018)Quantum Advantage from Any Non-local Game., , , and . STOC, page 1617-1628. ACM, (2023)Quantum Advantage from Any Non-Local Game., , , and . IACR Cryptol. ePrint Arch., (2022)Succinct Classical Verification of Quantum Computation., , , , , , , and . CRYPTO (2), volume 13508 of Lecture Notes in Computer Science, page 195-211. Springer, (2022)On Publicly Verifiable Delegation From Standard Assumptions., , and . IACR Cryptology ePrint Archive, (2018)How to delegate computations publicly., , and . STOC, page 1115-1124. ACM, (2019)Urban Roads Network Detection from High Resolution Remote Sensing., , and . IGARSS, page 7431-7434. IEEE, (2019)The Diameter and Automorphism Group of Gelfand-Tsetlin Polytopes., , and . Discret. Comput. Geom., 62 (1): 209-238 (2019)The parallel repetition of non-signaling games: counterexamples and dichotomy., and . STOC, page 185-192. ACM, (2019)Delegation with Updatable Unambiguous Proofs and PPAD-Hardness., , and . CRYPTO (3), volume 12172 of Lecture Notes in Computer Science, page 652-673. Springer, (2020)