| No. |
Title |
Author |
Year |
| 1 |
On Low-End Obfuscation and Learning |
Boyle, Elette et al. |
2023 |
| 2 |
Bounded Indistinguishability for Simple Sources |
Bogdanov, Andrej et al. |
2022 |
| 3 |
Information-Theoretic Distributed Point Functions |
Boyle, Elette et al. |
2022 |
| 4 |
Locality-Preserving Hashing for Shifts with Connections to Cryptography |
Boyle, Elette et al. |
2022 |
| 5 |
On the Download Rate of Homomorphic Secret Sharing |
Fosli, Ingerid et al. |
2022 |
| 6 |
Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC |
Badrinarayanan, Saikrishna et al. |
2022 |
| 7 |
Line-Point Zero Knowledge and Its Applications |
Dittmer, Samuel et al. |
2021 |
| 8 |
Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption |
Bartusek, James et al. |
2020 |
| 9 |
Limits of Preprocessing |
Filmus, Yuval et al. |
2020 |
| 10 |
On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be? |
Ball, Marshall et al. |
2020 |
| 11 |
Separating Two-Round Secure Computation From Oblivious Transfer |
Applebaum, Benny et al. |
2020 |
| 12 |
Foundations of Homomorphic Secret Sharing |
Boyle, Elette et al. |
2018 |
| 13 |
Low-Complexity Cryptographic Hash Functions |
Applebaum, Benny et al. |
2017 |
| 14 |
Lossy Chains and Fractional Secret Sharing |
Ishai, Yuval et al. |
2013 |
