A Note on the Concrete Hardness of the Shortest Independent Vectors Problem in Lattices. - Divesh Aggarwal; Eldon Chung (CoRR, 2020)

On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. - Divesh Aggarwal; Eldon Chung; Maciej Obremski; João Ribeiro 002 (Electron. Colloquium Comput. Complex., 2021)

Extractors: Low Entropy Requirements Colliding With Non-Malleability. - Eldon Chung; Maciej Obremski; Divesh Aggarwal (Electron. Colloquium Comput. Complex., 2021)

A note on the concrete hardness of the shortest independent vector in lattices. - Divesh Aggarwal; Eldon Chung (Inf. Process. Lett., 2021)

Stronger 3SUM-Indexing Lower Bounds. - Eldon Chung; Kasper Green Larsen (SODA, 2023)

On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity. - Eldon Chung; Alexander Golovnev; Zeyong Li; Maciej Obremski; Sidhant Saraogi; Noah Stephens-Davidowitz (Electron. Colloquium Comput. Complex., 2023)

Thinking Inside The Box: Privacy Against Stronger Adversaries. - Eldon Chung (CoRR, 2024)