Artykuły udostępnione publicznie: - Divesh AggarwalWięcej informacji
Dostępne w jakimś miejscu: 23
Optimal computational split-state non-malleable codes
D Aggarwal, S Agrawal, D Gupta, HK Maji, O Pandey, M Prabhakaran
TCC 2016, 2016
Upoważnienia: US National Science Foundation
A new public-key cryptosystem via Mersenne numbers
D Aggarwal, A Joux, A Prakash, M Santha
CRYPTO 2018, 2018
Upoważnienia: European Commission
Slide reduction, revisited—filling the gaps in SVP approximation
D Aggarwal, J Li, PQ Nguyen, N Stephens-Davidowitz
Annual International Cryptology Conference, 274-295, 2020
Upoważnienia: UK Engineering and Physical Sciences Research Council, European Commission
Just Take the Average! An Embarrassingly Simple -Time Algorithm for SVP (and CVP)
D Aggarwal, N Stephens-Davidowitz
SOSA 2018, 2018
Upoważnienia: US National Science Foundation, US Department of Defense
Inception makes non-malleable codes stronger
D Aggarwal, T Kazana, M Obremski
TCC 2017, 2017
Upoważnienia: European Commission
A constant rate non-malleable code in the split-state model
D Aggarwal, M Obremski
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
Upoważnienia: National Research Foundation, Singapore
(Gap/S) ETH Hardness of SVP
D Aggarwal, N Stephens-Davidowitz
STOC 2018, 2018
Upoważnienia: National Research Foundation, Singapore
Fine-grained hardness of CVP (P)—Everything that we can prove (and nothing else)
D Aggarwal, H Bennett, A Golovnev, N Stephens-Davidowitz
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
Upoważnienia: US National Science Foundation
How to extract useful randomness from unreliable sources
D Aggarwal, M Obremski, J Ribeiro, L Siniscalchi, I Visconti
Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference …, 2020
Upoważnienia: European Commission, Government of Italy
Revisiting the Sanders-Bogolyubov-Ruzsa theorem in F p n and its application to non-malleable codes
D Aggarwal, J Briët
ISIT 2016, 2016
Upoważnienia: Netherlands Organisation for Scientific Research
Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
D Aggarwal, Y Chen, R Kumar, Y Shen
SIAM Journal on Computing 54 (2), 233-278, 2025
Upoważnienia: UK Engineering and Physical Sciences Research Council, Agence Nationale de …
A -Time Algorithm for -SVP and -Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP
D Aggarwal, Z Li, N Stephens-Davidowitz
Advances in Cryptology–EUROCRYPT 2021: 40th Annual International Conference …, 2021
Upoważnienia: US National Science Foundation, National Research Foundation, Singapore
Lattice problems beyond polynomial time
D Aggarwal, H Bennett, Z Brakerski, A Golovnev, R Kumar, Z Li, S Peters, ...
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1516-1526, 2023
Upoważnienia: US National Science Foundation, US Department of Defense, European Commission
Privacy amplification with tamperable memory via non-malleable two-source extractors
D Aggarwal, M Obremski, J Ribeiro, M Simkin, L Siniscalchi
IEEE Transactions on Information Theory 68 (8), 5475-5495, 2022
Upoważnienia: National Research Foundation, Singapore
Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms
D Aggarwal, Y Chen, R Kumar, Z Li, N Stephens-Davidowitz
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
Upoważnienia: National Research Foundation, Singapore
Algebraic restriction codes and their applications
D Aggarwal, N Döttling, J Dujmovic, M Hajiabadi, G Malavolta, ...
Algorithmica 85 (12), 3602-3648, 2023
Upoważnienia: Helmholtz Association
Why we couldn’t prove SETH hardness of the Closest Vector Problem for even norms!
D Aggarwal, R Kumar
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
Upoważnienia: European Commission
Quantum measurement adversary
D Aggarwal, NG Boddu, R Jain, M Obremski
IEEE Transactions on Information Theory 70 (1), 318-335, 2023
Upoważnienia: Department of Science & Technology, India
Leakage-Resilient Algebraic Manipulation Detection Codes with Optimal Parameters
D Aggarwal, T Kazana, M Obremski
ISIT 2018, 2018
Upoważnienia: European Commission
Extractor lower bounds, revisited
D Aggarwal, S Guo, M Obremski, J Ribeiro, N Stephens-Davidowitz
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020
Upoważnienia: National Research Foundation, Singapore
Informacje na temat publikacji i finansowania automatycznie określa program komputerowy