| No. |
Title |
Author |
Year |
| 1 |
Secret Sharing, Slice Formulas, and Monotone Real Circuits |
Applebaum, Benny et al. |
2022 |
| 2 |
On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs |
Applebaum, Benny et al. |
2021 |
| 3 |
Separating Two-Round Secure Computation From Oblivious Transfer |
Applebaum, Benny et al. |
2020 |
| 4 |
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe |
Applebaum, Benny et al. |
2018 |
| 5 |
Low-Complexity Cryptographic Hash Functions |
Applebaum, Benny et al. |
2017 |
| 6 |
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (Extended Abstract) |
Applebaum, Benny et al. |
2015 |
