Eldon Chung

13 papers A* 1Journal 10Unranked 2
YearRankTypeTitle / Venue / Authors
2024 J jnl
Thinking Inside The Box: Privacy Against Stronger Adversaries.
CoRR
Eldon Chung
2023 — conf
Extractors: Low Entropy Requirements Colliding with Non-malleability.
CRYPTO (2)
Divesh Aggarwal, Eldon Chung, Maciej Obremski
2023 J jnl
On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity.
Electron. Colloquium Comput. Complex.
Eldon Chung, Alexander Golovnev, Zeyong Li, Maciej Obremski, Sidhant Saraogi, Noah Stephens-Davidowitz
2023 A* conf
Stronger 3SUM-Indexing Lower Bounds.
SODA
Eldon Chung, Kasper Green Larsen
2022 — conf
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing.
TCC (1)
Divesh Aggarwal, Eldon Chung, Maciej Obremski, João Ribeiro
2022 J jnl
Stronger 3SUM-Indexing Lower Bounds.
CoRR
Eldon Chung, Kasper Green Larsen
2021 J jnl
A note on the concrete hardness of the shortest independent vector in lattices.
Inf. Process. Lett.
Divesh Aggarwal, Eldon Chung
2021 J jnl
Extractors: Low Entropy Requirements Colliding With Non-Malleability.
CoRR
Eldon Chung, Maciej Obremski, Divesh Aggarwal
2021 J jnl
Extractors: Low Entropy Requirements Colliding With Non-Malleability.
Electron. Colloquium Comput. Complex.
Eldon Chung, Maciej Obremski, Divesh Aggarwal
2021 J jnl
Extractors: Low Entropy Requirements Colliding With Non-Malleability.
IACR Cryptol. ePrint Arch.
Eldon Chung, Maciej Obremski, Divesh Aggarwal
2021 J jnl
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing.
Electron. Colloquium Comput. Complex.
Divesh Aggarwal, Eldon Chung, Maciej Obremski, João Ribeiro
2021 J jnl
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing.
IACR Cryptol. ePrint Arch.
Divesh Aggarwal, Eldon Chung, Maciej Obremski, João Ribeiro
2020 J jnl
A Note on the Concrete Hardness of the Shortest Independent Vectors Problem in Lattices.
CoRR
Divesh Aggarwal, Eldon Chung