Obserwuj
Divesh Aggarwal
Divesh Aggarwal
NUS
Zweryfikowany adres z nus.edu.sg - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Quantum attacks on Bitcoin, and how to protect against them
D Aggarwal, GK Brennen, T Lee, M Santha, M Tomamichel
arXiv preprint arXiv:1710.10377, 2017
2302017
Solving the shortest vector problem in 2 n time using discrete Gaussian sampling
D Aggarwal, D Dadush, O Regev, N Stephens-Davidowitz
STOC 2015, 2015
2132015
Non-malleable codes from additive combinatorics
D Aggarwal, Y Dodis, S Lovett
STOC, 2014 and SIAM Journal on Computing, 2018, 2018
191*2018
Breaking RSA generically is equivalent to factoring
D Aggarwal, U Maurer
Eurocrypt 2009, and IEEE Transactions on Information Theory, 2016, 2016
145*2016
Non-malleable reductions and applications
D Aggarwal, Y Dodis, T Kazana, M Obremski
STOC 2015, 2015
1192015
Solving the Closest Vector Problem in 2^ n Time--The Discrete Gaussian Strikes Again!
D Aggarwal, D Dadush, N Stephens-Davidowitz
FOCS 2015, 2015
1012015
Stronger leakage-resilient and non-malleable secret-sharing schemes for general access structures
D Aggarwal, I Damgard, JB Nielsen, M Obremski, E Purwanto, J Ribeiro, ...
CRYPTO 2019, 2019
832019
Optimal computational split-state non-malleable codes
D Aggarwal, S Agrawal, D Gupta, HK Maji, O Pandey, M Prabhakaran
TCC 2016, 2016
762016
A new public-key cryptosystem via Mersenne numbers
D Aggarwal, A Joux, A Prakash, M Santha
CRYPTO 2018, 2018
672018
Leakage-resilient non-malleable codes
D Aggarwal, S Dziembowski, T Kazana, M Obremski
TCC 2015, 2015
622015
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
512020
Just Take the Average! An Embarrassingly Simple -Time Algorithm for SVP (and CVP)
D Aggarwal, N Stephens-Davidowitz
SOSA 2018, 2018
452018
Continuous non-malleable codes in the 8-split-state model
D Aggarwal, N Döttling, JB Nielsen, M Obremski, E Purwanto
EUROCRYPT 2019, 2019
40*2019
Affine-evasive sets modulo a prime
D Aggarwal
Information Processing Letters 2015, 2015
392015
Inception makes non-malleable codes stronger
D Aggarwal, T Kazana, M Obremski
TCC 2017, 2017
382017
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
37*2020
(Gap/S) ETH Hardness of SVP
D Aggarwal, N Stephens-Davidowitz
STOC 2018, 2018
362018
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
312021
A note on discrete gaussian combinations of lattice vectors
D Aggarwal, O Regev
Chicago Journal of Theoretical Computer Science 2016, 2016
292016
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
212020
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20