Amos Beimel

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 65

Top Venues

IACR Cryptol. ePrint Arch.

CoRR

TCC (2)

Electron. Colloquium Comput. Complex.

Publications

Amos Beimel, Tal Malkin, Noam Mazor
Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions. IACR Cryptol. ePrint Arch. 2024 (2024)
Amos Beimel, Oriol Farràs, Oded Nir
Secret-Sharing Schemes for High Slices. IACR Cryptol. ePrint Arch. 2024 (2024)
Bar Alon, Amos Beimel, Tamar Ben David, Eran Omri, Anat Paskin-Cherniavsky
New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs. IACR Cryptol. ePrint Arch. 2024 (2024)
Amos Beimel, Tal Malkin, Noam Mazor
Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions. CRYPTO (5) (2024)
Amos Beimel
Lower Bounds for Secret-Sharing Schemes for k-Hypergraphs. ITC (2023)
Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan
Succinct Computational Secret Sharing. Electron. Colloquium Comput. Complex. (2023)
Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan
Succinct Computational Secret Sharing. IACR Cryptol. ePrint Arch. 2023 (2023)
Bar Alon, Amos Beimel, Eran Omri
Three Party Secure Computation with Friends and Foes. TCC (2) (2023)
Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan
Succinct Computational Secret Sharing. STOC (2023)
Damiano Abram, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages. TCC (1) (2023)
Amos Beimel
Lower-Bounds for Secret-Sharing Schemes for k-Hypergraphs. IACR Cryptol. ePrint Arch. 2023 (2023)
Amos Beimel, Hussien Othman, Naty Peter
Quadratic Secret Sharing and Conditional Disclosure of Secrets. IEEE Trans. Inf. Theory 69 (11) (2023)
Amos Beimel, Oriol Farràs, Or Lasri
Improved Polynomial Secret-Sharing Schemes. TCC (2) (2023)
Bar Alon, Amos Beimel, Eran Omri
Three Party Secure Computation with Friends and Foes. IACR Cryptol. ePrint Arch. 2023 (2023)
Damiano Abram, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages. IACR Cryptol. ePrint Arch. 2023 (2023)
Amos Beimel, Oriol Farràs, Or Lasri
Improved Polynomial Secret-Sharing Schemes. IACR Cryptol. ePrint Arch. 2023 (2023)
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi
Secret Sharing, Slice Formulas, and Monotone Real Circuits. Electron. Colloquium Comput. Complex. 29 (2022)
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. SIAM J. Comput. 51 (4) (2022)
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi
Secret Sharing, Slice Formulas, and Monotone Real Circuits. ITCS (2022)
Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds. STOC (2022)
Amos Beimel, Oriol Farràs, Yuval Mintz, Naty Peter
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. IEEE Trans. Inf. Theory 68 (3) (2022)
Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer
Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds. CoRR (2021)
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. CoRR (2021)
Amos Beimel, Hussien Othman, Naty Peter
Quadratic Secret Sharing and Conditional Disclosure of Secrets. CRYPTO (3) (2021)
Amos Beimel, Kobbi Nissim, Uri Stemmer
Learning Privately with Labeled and Unlabeled Examples. Algorithmica 83 (1) (2021)
Amos Beimel, Hussien Othman, Naty Peter
Degree-2 Secret Sharing and Conditional Disclosure of Secrets. IACR Cryptol. ePrint Arch. 2021 (2021)
Amos Beimel, Aleksandra Korolova, Kobbi Nissim, Or Sheffet, Uri Stemmer
The Power of Synergy in Differential Privacy: Combining a Small Curator with Local Randomizers. ITC (2020)
Amos Beimel, Hussien Othman
Evolving Ramp Secret Sharing with a Small Gap. EUROCRYPT (1) (2020)
Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer
On the Round Complexity of the Shuffle Model. TCC (2) (2020)
Noga Alon, Amos Beimel, Shay Moran, Uri Stemmer
Closure Properties for Private Classification and Online Prediction. CoRR (2020)
Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov
1/p-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds. J. Cryptol. 33 (4) (2020)
Amos Beimel, Oriol Farràs
The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs. IACR Cryptol. ePrint Arch. 2020 (2020)
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter
Better Secret-Sharing via Robust Conditional Disclosure of Secrets. Electron. Colloquium Comput. Complex. 27 (2020)
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter
Better secret sharing via robust conditional disclosure of secrets. STOC (2020)
Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer
On the Round Complexity of the Shuffle Model. CoRR (2020)
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter
Better Secret-Sharing via Robust Conditional Disclosure of Secrets. IACR Cryptol. ePrint Arch. 2020 (2020)
Noga Alon, Amos Beimel, Shay Moran, Uri Stemmer
Closure Properties for Private Classification and Online Prediction. COLT (2020)
Amos Beimel, Oriol Farràs
The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs. TCC (3) (2020)
Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer
On the Round Complexity of the Shuffle Model. IACR Cryptol. ePrint Arch. 2020 (2020)
Amos Beimel, Kobbi Nissim, Uri Stemmer
Characterizing the Sample Complexity of Pure Private Learners. J. Mach. Learn. Res. 20 (2019)
Amos Beimel, Shay Moran, Kobbi Nissim, Uri Stemmer
Private Center Points and Learning of Halfspaces. CoRR (2019)
Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter
Secret-Sharing Schemes for General and Uniform Access Structures. EUROCRYPT (3) (2019)
Amos Beimel, Naty Peter
Secret-Sharing from Robust Conditional Disclosure of Secrets. IACR Cryptol. ePrint Arch. 2019 (2019)
Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter
Secret-Sharing Schemes for General and Uniform Access Structures. IACR Cryptol. ePrint Arch. 2019 (2019)
Amos Beimel, Kobbi Nissim, Mohammad Zaheri
Exploring Differential Obliviousness. APPROX-RANDOM (2019)
Amos Beimel, Aleksandra Korolova, Kobbi Nissim, Or Sheffet, Uri Stemmer
The power of synergy in differential privacy: Combining a small curator with local randomizers. CoRR (2019)
Amos Beimel, Hussien Othman
Evolving Ramp Secret Sharing with a Small Gap. IACR Cryptol. ePrint Arch. 2019 (2019)
Amos Beimel, Shay Moran, Kobbi Nissim, Uri Stemmer
Private Center Points and Learning of Halfspaces. COLT (2019)
Amos Beimel, Kobbi Nissim, Mohammad Zaheri
Exploring Differential Obliviousness. CoRR (2019)
Amos Beimel, Eyal Kushilevitz, Pnina Nissim
The Complexity of Multiparty PSM Protocols and Related Models. EUROCRYPT (2) (2018)
Amos Beimel, Hussien Othman
Evolving Ramp Secret-Sharing Schemes. SCN (2018)
Amos Beimel, Naty Peter
Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols. IACR Cryptol. ePrint Arch. 2018 (2018)
Amos Beimel, Ronen I. Brafman
Privacy Preserving Multi-Agent Planning with Provable Guarantees. CoRR (2018)
Amos Beimel, Eyal Kushilevitz, Pnina Nissim
The Complexity of Multiparty PSM Protocols and Related Models. IACR Cryptol. ePrint Arch. 2018 (2018)
Amos Beimel, Naty Peter
Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols. ASIACRYPT (3) (2018)
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. FOCS (2018)
Amos Beimel, Oriol Farràs, Yuval Mintz, Naty Peter
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. IACR Cryptol. ePrint Arch. 2017 (2017)
Amos Beimel, Yuval Ishai, Eyal Kushilevitz
Ad Hoc PSM Protocols: Secure Computation Without Coordination. IACR Cryptol. ePrint Arch. 2017 (2017)
Amos Beimel, Yuval Ishai, Eyal Kushilevitz
Ad Hoc PSM Protocols: Secure Computation Without Coordination. EUROCRYPT (3) (2017)
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling. Electron. Colloquium Comput. Complex. 24 (2017)
Amos Beimel, Oriol Farràs, Yuval Mintz, Naty Peter
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. TCC (2) (2017)
Amos Beimel, Kobbi Nissim, Uri Stemmer
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy. Theory Comput. 12 (1) (2016)
Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz
Distribution Design. ITCS (2016)
Amos Beimel, Oriol Farràs, Yuval Mintz
Secret-Sharing Schemes for Very Dense Graphs. J. Cryptol. 29 (2) (2016)
Amos Beimel, Oriol Farràs, Naty Peter
Secret Sharing Schemes for Dense Forbidden Graphs. SCN (2016)
Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. TCC (1) (2015)
Amos Beimel, Kobbi Nissim, Uri Stemmer
Learning Privately with Labeled and Unlabeled Examples. SODA (2015)
Amos Beimel, Eran Omri, Ilan Orlov
Protocols for Multiparty Coin Toss with a Dishonest Majority. J. Cryptol. 28 (3) (2015)
Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb
Choosing, Agreeing, and Eliminating in Communication Complexity. Comput. Complex. 23 (1) (2014)
Amos Beimel, Hai Brenner, Shiva Prasad Kasiviswanathan, Kobbi Nissim
Bounds on the sample complexity for private learning and private data release. Mach. Learn. 94 (3) (2014)
Amos Beimel, Kobbi Nissim, Uri Stemmer
Learning Privately with Labeled and Unlabeled Examples. CoRR (2014)
Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Anat Paskin-Cherniavsky
Non-Interactive Secure Multiparty Computation. CRYPTO (2) (2014)
Amos Beimel, Kobbi Nissim, Uri Stemmer
Characterizing the Sample Complexity of Private Learners. CoRR (2014)
Amos Beimel, Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz
On the Cryptographic Complexity of the Worst Functions. TCC (2014)
Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Anat Paskin-Cherniavsky
Non-Interactive Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2014 (2014)
Amos Beimel, Aner Ben-Efraim, Carles Padró, Ilya Tyomkin
Multi-linear Secret-Sharing Schemes. TCC (2014)
Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. IACR Cryptol. ePrint Arch. 2014 (2014)
Amos Beimel, Kobbi Nissim, Uri Stemmer
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy. CoRR (2014)
Amos Beimel, Kobbi Nissim, Uri Stemmer
Characterizing the sample complexity of private learners. ITCS (2013)
Amos Beimel, Kobbi Nissim, Uri Stemmer
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy. APPROX-RANDOM (2013)
Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Ilan Orlov
Share Conversion and Private Information Retrieval. Computational Complexity Conference (2012)
Amos Beimel, Eran Omri, Ilan Orlov
Protocols for Multiparty Coin Toss With Dishonest Majority. IACR Cryptol. ePrint Arch. 2012 (2012)
Amos Beimel, Yeow Meng Chee, Huaxiong Wang, Liang Feng Zhang
Communication-efficient distributed oblivious transfer. J. Comput. Syst. Sci. 78 (4) (2012)
Amos Beimel, Oriol Farràs, Yuval Mintz
Secret Sharing Schemes for Very Dense Graphs. CRYPTO (2012)
Amos Beimel, Oriol Farràs, Yuval Mintz
Secret Sharing Schemes for Very Dense Graphs. IACR Cryptol. ePrint Arch. 2012 (2012)
Amos Beimel, Ilan Orlov
Secret Sharing and Non-Shannon Information Inequalities. IEEE Trans. Inf. Theory 57 (9) (2011)
Amos Beimel
Secret-Sharing Schemes: A Survey. IWCC (2011)
Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov
-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds. CRYPTO (2011)
Amos Beimel, Kobbi Nissim, Eran Omri
Distributed Private Data Analysis: On Simultaneously Solving How and What CoRR (2011)
Amos Beimel, Eran Omri, Ilan Orlov
Protocols for Multiparty Coin Toss with Dishonest Majority. CRYPTO (2010)
Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb
Choosing, Agreeing, and Eliminating in Communication Complexity. ICALP (1) (2010)
Amos Beimel, Eran Omri, Ilan Orlov
Secure Multiparty Computation with Partial Fairness. IACR Cryptol. ePrint Arch. 2010 (2010)
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi Nissim
Bounds on the Sample Complexity for Private Learning and Private Data Release. TCC (2010)
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb
How Should We Solve Search Problems Privately? J. Cryptol. 23 (2) (2010)
Amos Beimel, Eran Omri, Ilan Orlov
Secure Multiparty Computation with Partial Fairness CoRR (2010)
Amos Beimel, Renen Hallak, Kobbi Nissim
Private Approximation of Clustering and Vertex Cover. Comput. Complex. 18 (3) (2009)
Erez Karpas, Solomon Eyal Shimony, Amos Beimel
Approximate belief updating in max-2-connected Bayes networks is NP-hard. Artif. Intell. 173 (12-13) (2009)
Amos Beimel, Ilan Orlov
Secret Sharing and Non-Shannon Information Inequalities. TCC (2009)
Amos Beimel, Boaz Ben-Moshe, Yehuda Ben-Shimol, Paz Carmi, Eldad Chai, Itzik Kitroser, Eran Omri
Matrix columns allocation problems. Theor. Comput. Sci. 410 (21-23) (2009)
Amos Beimel, Noam Livne, Carles Padró
Matroids Can Be Far from Ideal Secret Sharing. TCC (2008)

Amos Beimel.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Amos Beimel