I agree that this site is using cookies. You can find further informations here.
X
Aggarwal, Divesh
78  results:
Search for persons X
?
1

Quantum Secure Non-Malleable Codes in the Split-State Model:

Aggarwal, Divesh ; Boddu, Naresh Goud ; Jain, Rahul
IEEE Transactions on Information Theory.  70 (2024)  1 - p. 349-371 , 2024
Link: https://doi.org/10.1109/..
 
?
2

Quantum Measurement Adversary:

Aggarwal, Divesh ; Boddu, Naresh Goud ; Jain, Rahul.
IEEE Transactions on Information Theory.  70 (2024)  1 - p. 318-335 , 2024
Link: https://doi.org/10.1109/..
 
?
3

Algebraic Restriction Codes and Their Applications:

Aggarwal, Divesh ; Döttling, Nico ; Dujmovic, Jesko...
Algorithmica.  85 (2023)  12 - p. 3602-3648 , 2023
Link: https://doi.org/10.1007/..
 
?
4

Why we couldn't prove SETH hardness of the Closest Vector P..:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Aggarwal, Divesh ; Kumar, Rajendra - p. 2213-2230 , 2023
Link: https://doi.org/10.1109/..
 
?
5

Extractors: Low Entropy Requirements Colliding with Non-mal..:

, In: Advances in Cryptology – CRYPTO 2023; Lecture Notes in Computer Science,
Aggarwal, Divesh ; Chung, Eldon ; Obremski, Maciej - p. 580-610 , 2023
Link: https://doi.org/10.1007/..
 
?
6

Lattice Problems beyond Polynomial Time:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Aggarwal, Divesh ; Bennett, Huck ; Brakerski, Zvika... - p. 1516-1526 , 2023
Link: https://dl.acm.org/doi/1..
 
?
7

Unforgeability in Stochastic Gradient Descent:

, In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security,
Baluta, Teodora ; Nikolic, Ivica ; Jain, Racchit.. - p. 1138-1152 , 2023
Link: https://dl.acm.org/doi/1..
 
?
8

On Secret Sharing, Randomness, and Random-less Reductions f..:

, In: Theory of Cryptography; Lecture Notes in Computer Science,
Aggarwal, Divesh ; Chung, Eldon ; Obremski, Maciej. - p. 327-354 , 2022
Link: https://doi.org/10.1007/..
 
?
9

Rate one-third non-malleable codes:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Aggarwal, Divesh ; Kanukurthi, Bhavana ; Obbattu, Sai Lakshmi Bhavana.. - p. 1364-1377 , 2022
Link: https://dl.acm.org/doi/1..
 
?
10

Privacy Amplification With Tamperable Memory via Non-Mallea..:

Aggarwal, Divesh ; Obremski, Maciej ; Ribeiro, Joao..
IEEE Transactions on Information Theory.  68 (2022)  8 - p. 5475-5495 , 2022
Link: https://doi.org/10.1109/..
 
?
11

Non-Malleable Code in the Split-State Model:

Aggarwal, Divesh ; Ball, Marshall ; Obremski, Maciej
Entropy.  24 (2022)  8 - p. 1038 , 2022
Link: https://doi.org/10.3390/..
 
?
12

Dimension-preserving reductions between SVP and CVP in diff..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Aggarwal, Divesh ; Chen, Yanlin ; Kumar, Rajendra.. - p. 2444-2462 , 2021
Link: https://dl.acm.org/doi/1..
 
?
13

Fine-grained hardness of CVP(P) : everything that we can..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Aggarwal, Divesh ; Bennett, Huck ; Golovnev, Alexander. - p. 1816-1835 , 2021
Link: https://dl.acm.org/doi/1..
 
?
14

A note on the concrete hardness of the shortest independent..:

Aggarwal, Divesh ; Chung, Eldon
Information Processing Letters.  167 (2021)  - p. 106065 , 2021
Link: https://doi.org/10.1016/..
 
?
15

Dimension-Preserving Reductions Between SVP and CVP in Diff..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Aggarwal, Divesh ; Chen, Yanlin ; Kumar, Rajendra.. - p. 2444-2462 , 2021
Link: https://doi.org/10.1137/..
 
1-15