Author of the publication

Brakedown: Linear-Time and Field-Agnostic SNARKs for R1CS.

, , , , and . CRYPTO (2), volume 14082 of Lecture Notes in Computer Science, page 193-226. Springer, (2023)

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

On the limits of gate elimination., , , and . J. Comput. Syst. Sci., (2018)Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else)., , , and . CoRR, (2019)Collapsing Superstring Conjecture., , , and . CoRR, (2018)Gate elimination: Circuit size lower bounds and #SAT upper bounds., , , and . Theor. Comput. Sci., (2018)Families with Infants: A General Approach to Solve Hard Partition Problems., , and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 551-562. Springer, (2014)A note on lower bounds for non-interactive message authentication using weak keys., and . ITW Fall, page 249-251. IEEE, (2015)Improving 3N Circuit Complexity Lower Bounds., , , and . Comput. Complex., 32 (2): 13 (December 2023)Classification of the streaming approximability of Boolean CSPs., , , and . CoRR, (2021)String Matching: Communication, Circuits, and Learning., , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 56:1-56:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Circuit Depth Reductions., , and . ITCS, volume 185 of LIPIcs, page 24:1-24:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)