Author of the publication

SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE.

, , , and . STOC, page 708-721. ACM, (2021)

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

Interactive Error Correcting Codes: New Constructions and Impossibility Bounds., and . APPROX/RANDOM, volume 275 of LIPIcs, page 32:1-32:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Efficient Interactive Coding Achieving Optimal Error Resilience Over the Binary Channel., and . CoRR, (2022)The relation between composability and splittability of permutation classes.. Discret. Math., 344 (4): 112271 (2021)New Codes on High Dimensional Expanders., , and . Electron. Colloquium Comput. Complex., (2023)SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE., , , and . STOC, page 708-721. ACM, (2021)Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs., , and . TCC (1), volume 13042 of Lecture Notes in Computer Science, page 330-368. Springer, (2021)Binary Error-Correcting Codes with Minimal Noiseless Feedback., , and . STOC, page 1475-1487. ACM, (2023)Efficient Interactive Coding Achieving Optimal Error Resilience over the Binary Channel., and . STOC, page 1449-1462. ACM, (2023)The optimal error resilience of interactive communication over binary channels., and . STOC, page 948-961. ACM, (2022)Interactive error correcting codes over binary erasure channels resilient to > ½ adversarial corruption., , and . STOC, page 609-622. ACM, (2022)