Author of the publication

Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else).

, , , and . SODA, page 1816-1835. SIAM, (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

A Note on Discrete Gaussian Combinations of Lattice Vectors., and . Chic. J. Theor. Comput. Sci., (2016)Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding., , , and . CoRR, (2020)Non-Malleable Code in the Split-State Model., , and . Entropy, 24 (8): 1038 (2022)Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification., , and . Electron. Colloquium Comput. Complex., (2015)Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract., , , and . STOC, page 733-742. ACM, (2015)Algebraic Restriction Codes and Their Applications., , , , , and . ITCS, volume 215 of LIPIcs, page 2:1-2:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding., , , and . STACS, volume 187 of LIPIcs, page 4:1-4:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures., , , , , , and . CRYPTO (2), volume 11693 of Lecture Notes in Computer Science, page 510-539. Springer, (2019)Lattice Problems beyond Polynomial Time., , , , , , , , and . STOC, page 1516-1526. ACM, (2023)Engineering an Efficient Approximate DNF-Counter., , , , and . IJCAI, page 2031-2038. ijcai.org, (2023)