The following pages link to Divesh Aggarwal (Q477695):
Displayed 37 items.
- Affine-evasive sets modulo a prime (Q477696) (← links)
- A new public-key cryptosystem via Mersenne numbers (Q775988) (← links)
- Inception makes non-malleable codes stronger (Q1690274) (← links)
- How to extract useful randomness from unreliable sources (Q2055615) (← links)
- A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP (Q2056696) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- Continuous non-malleable codes in the 8-split-state model (Q2292659) (← links)
- A quantum-proof non-malleable extractor. With application to privacy amplification against active quantum adversaries (Q2292881) (← links)
- Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures (Q2304992) (← links)
- Improved hardness results for unique shortest vector problem (Q2629774) (← links)
- A note on the concrete hardness of the shortest independent vector in lattices (Q2656338) (← links)
- Optimal Computational Split-state Non-malleable Codes (Q2799103) (← links)
- Amplifying Privacy in Privacy Amplification (Q2874537) (← links)
- Non-malleable Reductions and Applications (Q2941538) (← links)
- Solving the Shortest Vector Problem in 2 <sup>n</sup> Time Using Discrete Gaussian Sampling (Q2941568) (← links)
- The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy (Q3102216) (← links)
- A Note on Discrete Gaussian Combinations of Lattice Vectors (Q3187176) (← links)
- Non-Malleable Codes from Additive Combinatorics (Q4637777) (← links)
- (Q5091027) (← links)
- Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors (Q5097003) (← links)
- (Gap/S)ETH hardness of SVP (Q5230292) (← links)
- (Q5240427) (← links)
- Non-malleable codes from additive combinatorics (Q5259613) (← links)
- Leakage-Resilient Non-malleable Codes (Q5261638) (← links)
- Algorithms on Graphs with Small Dominating Targets (Q5459110) (← links)
- Breaking RSA Generically Is Equivalent to Factoring (Q5892390) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897541) (← links)
- Breaking RSA Generically Is Equivalent to Factoring (Q5901923) (← links)
- Algebraic restriction codes and their applications (Q6066762) (← links)
- Rate one-third non-malleable codes (Q6083592) (← links)
- (Q6084344) (← links)
- On secret sharing, randomness, and random-less reductions for secret sharing (Q6114236) (← links)
- (Q6126222) (← links)
- Extractors: low entropy requirements colliding with non-malleability (Q6145926) (← links)
- (Q6147364) (← links)
- (Q6147401) (← links)
- An improved constant in Banaszczyk's transference theorem (Q6322447) (← links)