Secret-Sharing Schemes for General and Uniform Access Structures. - Benny Applebaum; Amos Beimel; Oriol Farràs; Oded Nir; Naty Peter (IACR Cryptol. ePrint Arch., 2019)

Better Secret-Sharing via Robust Conditional Disclosure of Secrets. - Benny Applebaum; Amos Beimel; Oded Nir; Naty Peter (Electron. Colloquium Comput. Complex., 2020)

Upslices, Downslices, and Secret-Sharing with Complexity of $1.5^n$. - Benny Applebaum; Oded Nir (Electron. Colloquium Comput. Complex., 2021)

Upslices, Downslices, and Secret-Sharing with Complexity of 1.5n. - Benny Applebaum; Oded Nir (IACR Cryptol. ePrint Arch., 2021)

Secret Sharing, Slice Formulas, and Monotone Real Circuits. - Benny Applebaum; Amos Beimel; Oded Nir; Naty Peter; Toniann Pitassi (Electron. Colloquium Comput. Complex., 2022)

Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography. - Benny Applebaum; Oded Nir (Electron. Colloquium Comput. Complex., 2023)

How to Recover a Secret with $O(n)$ Additions. - Benny Applebaum; Oded Nir; Benny Pinkas (Electron. Colloquium Comput. Complex., 2023)

Secret-Sharing Schemes for High Slices. - Amos Beimel; Oriol Farràs; Or Lasri; Oded Nir (TCC (4), 2024)

Secret-Sharing Schemes for High Slices. - Amos Beimel; Oriol Farràs; Oded Nir (IACR Cryptol. ePrint Arch., 2024)

The Meta-Complexity of Secret Sharing. - Benny Applebaum; Oded Nir (Electron. Colloquium Comput. Complex., 2025)