Oded Nir

According to our database, Oded Nir authored at least 10 papers between 2019 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

The Meta-complexity of Secret Sharing.

Benny Applebaum, Oded Nir

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024

Secret-Sharing Schemes for High Slices.

Amos Beimel, Oriol Farràs, Oded Nir

IACR Cryptol. ePrint Arch., 2024

Secret-Sharing Schemes for High Slices.

Amos Beimel, Oriol Farràs, Or Lasri, Oded Nir

Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

2023

Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography.

Benny Applebaum, Oded Nir

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

How to Recover a Secret with O(n) Additions.

Benny Applebaum, Oded Nir, Benny Pinkas

Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022

Secret Sharing, Slice Formulas, and Monotone Real Circuits.

Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

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.5ⁿ.

Benny Applebaum, Oded Nir

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

Better secret sharing via robust conditional disclosure of secrets.

Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019

Secret-Sharing Schemes for General and Uniform Access Structures.

Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019