Author of the publication

On the Hardness of Learning with Rounding over Small Modulus.

, , , , and . TCC (A1), volume 9562 of Lecture Notes in Computer Science, page 209-224. 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

Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources., , , and . APPROX-RANDOM, volume 116 of LIPIcs, page 30:1-30:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Negation-Limited Formulas., and . APPROX-RANDOM, volume 40 of LIPIcs, page 850-866. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Rational Sumchecks., , , and . TCC (A2), volume 9563 of Lecture Notes in Computer Science, page 319-351. Springer, (2016)Extractor Lower Bounds, Revisited., , , , and . APPROX-RANDOM, volume 176 of LIPIcs, page 1:1-1:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Rational arguments: single round delegation with sublinear verification., , , and . ITCS, page 523-540. ACM, (2014)Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange., , , and . J. Cryptol., 35 (1): 1 (2022)Candidate weak pseudorandom functions in AC0 ○ MOD2., , , , and . ITCS, page 251-260. ACM, (2014)Data structures meet cryptography: 3SUM with preprocessing., , , , and . STOC, page 294-307. ACM, (2020)On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions., , , and . TCC (3), volume 14371 of Lecture Notes in Computer Science, page 237-270. Springer, (2023)Non-Malleable Codes for Decision Trees., , and . IACR Cryptol. ePrint Arch., (2019)