Author of the publication

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

Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else)., , , and . SODA, page 1816-1835. SIAM, (2021)Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms!, and . FOCS, page 2213-2230. IEEE, (2023)Affine-evasive sets modulo a prime.. Inf. Process. Lett., 115 (2): 382-385 (2015)Improved hardness results for unique shortest vector problem, and . CoRR, (2011)A New Public-Key Cryptosystem via Mersenne Numbers., , , and . CRYPTO (3), volume 10993 of Lecture Notes in Computer Science, page 459-482. Springer, (2018)Quantum Measurement Adversary., , , and . CoRR, (2021)Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm., and . ISAAC, volume 123 of LIPIcs, page 35:1-35:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Quantum-Proof Non-malleable Extractor - With Application to Privacy Amplification Against Active Quantum Adversaries., , , and . EUROCRYPT (2), volume 11477 of Lecture Notes in Computer Science, page 442-469. Springer, (2019)Engineering an Efficient Approximate DNF-Counter., , , , , and . CoRR, (2024)Extractor Lower Bounds, Revisited., , , , and . APPROX-RANDOM, volume 176 of LIPIcs, page 1:1-1:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)