Author of the publication

Homomorphic Evaluation Requires Depth.

, and . TCC (A1), volume 9562 of Lecture Notes in Computer Science, page 365-371. Springer, (2016)

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

More on Bounded Independence Plus Noise: Pseudorandom Generators for Read-Once Polynomials., and . Theory Comput., (2020)Fractional Pseudorandom Generators from Any Fourier Level., , , , and . CCC, volume 200 of LIPIcs, page 10:1-10:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Polynomial-time trace reconstruction in the low deletion rate regime., , , , and . CoRR, (2020)Some Limitations of the Sum of Small-Bias Distributions., and . Theory of Computing, 13 (1): 1-23 (2017)Approximate Trace Reconstruction from a Single Trace., , , , and . SODA, page 605-637. SIAM, (2023)Fourier Growth of Regular Branching Programs., , and . APPROX/RANDOM, volume 245 of LIPIcs, page 2:1-2:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Bounded Independence vs. Moduli., , , and . APPROX-RANDOM, volume 60 of LIPIcs, page 24:1-24:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the Power of Regular and Permutation Branching Programs., , and . APPROX/RANDOM, volume 275 of LIPIcs, page 44:1-44:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Fourier Bounds and Pseudorandom Generators for Product Tests.. CCC, volume 137 of LIPIcs, page 7:1-7:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Homomorphic encryption from codes., and . IACR Cryptology ePrint Archive, (2011)