All reports by Author Eldon Chung:

__
TR23-193
| 3rd December 2023
__

Eldon Chung, Alexander Golovnev, Zeyong Li, Maciej Obremski, Sidhant Saraogi, Noah Stephens-Davidowitz#### On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity

__
TR21-150
| 7th November 2021
__

Eldon Chung, Maciej Obremski, Divesh Aggarwal#### Extractors: Low Entropy Requirements Colliding With Non-Malleability

__
TR21-090
| 14th June 2021
__

Divesh Aggarwal, Eldon Chung, Maciej Obremski, Joao Ribeiro#### On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing

Eldon Chung, Alexander Golovnev, Zeyong Li, Maciej Obremski, Sidhant Saraogi, Noah Stephens-Davidowitz

We study the Range Avoidance Problem (Avoid), in which the input is an expanding circuit $C : \{0,1\}^n \to \{0,1\}^{n+1}$, and the goal is to find a $y \in \{0,1\}^{n+1}$ that is not in the image of $C$. We are interested in the randomized complexity of this problem, i.e., in ... more >>>

Eldon Chung, Maciej Obremski, Divesh Aggarwal

The known constructions of negligible error (non-malleable) two-source extractors can be broadly classified in three categories:

(1) Constructions where one source has min-entropy rate about $1/2$, the other source can have small min-entropy rate, but the extractor doesn't guarantee non-malleability.

(2) Constructions where one source is uniform, and the other ...
more >>>

Divesh Aggarwal, Eldon Chung, Maciej Obremski, Joao Ribeiro

Secret-sharing is one of the most basic and oldest primitives in cryptography, introduced by Shamir and Blakely in the 70s. It allows to strike a meaningful balance between availability and confidentiality of secret information. It has a host of applications most notably in threshold cryptography and multi-party computation. All known ... more >>>