Divesh Aggarwal

Available identifiers

zbMath Open aggarwal.diveshMaRDI QIDQ477695

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6126222	2024-04-09	Paper
Extractors: low entropy requirements colliding with non-malleability	2024-02-02	Paper
https://portal.mardi4nfdi.de/entity/Q6147364	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6147401	2024-01-15	Paper
Algebraic restriction codes and their applications	2023-12-13	Paper
Rate one-third non-malleable codes	2023-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q6084344	2023-10-31	Paper
On secret sharing, randomness, and random-less reductions for secret sharing	2023-08-14	Paper
Slide reduction, revisited -- filling the gaps in SVP approximation	2022-11-09	Paper
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors	2022-08-19	Paper
https://portal.mardi4nfdi.de/entity/Q5091027	2022-07-21	Paper
A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP	2021-12-08	Paper
How to extract useful randomness from unreliable sources	2021-12-01	Paper
A note on the concrete hardness of the shortest independent vector in lattices	2021-03-11	Paper
A new public-key cryptosystem via Mersenne numbers	2020-06-30	Paper
Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures	2020-03-09	Paper
A quantum-proof non-malleable extractor. With application to privacy amplification against active quantum adversaries	2020-02-06	Paper
Continuous non-malleable codes in the 8-split-state model	2020-02-04	Paper
https://portal.mardi4nfdi.de/entity/Q5240427	2019-10-25	Paper
(Gap/S)ETH hardness of SVP	2019-08-22	Paper
An improved constant in Banaszczyk's transference theorem	2019-07-21	Paper
Non-Malleable Codes from Additive Combinatorics	2018-04-26	Paper
Inception makes non-malleable codes stronger	2018-01-19	Paper
Breaking RSA Generically Is Equivalent to Factoring	2017-04-28	Paper
A Note on Discrete Gaussian Combinations of Lattice Vectors	2016-08-16	Paper
Improved hardness results for unique shortest vector problem	2016-07-07	Paper
Optimal Computational Split-state Non-malleable Codes	2016-04-08	Paper
Non-malleable Reductions and Applications	2015-08-21	Paper
Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling	2015-08-21	Paper
Leakage-Resilient Non-malleable Codes	2015-07-06	Paper
Non-malleable codes from additive combinatorics	2015-06-26	Paper
Affine-evasive sets modulo a prime	2014-12-09	Paper
Amplifying Privacy in Privacy Amplification	2014-08-07	Paper
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy	2011-12-02	Paper
Breaking RSA Generically Is Equivalent to Factoring	2009-05-12	Paper
Algorithms on Graphs with Small Dominating Targets	2008-04-24	Paper
Graph-Theoretic Concepts in Computer Science	2006-11-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Divesh Aggarwal