| 2026 | CRYPTO | Private Information Retrieval: Share Conversions vs Decoding Polynomials. | Amos Beimel, Or Lasri |
| 2025 | TCC | Simplified PIR and CDS Protocols and Improved Linear Secret-Sharing Schemes. | Bar Alon, Amos Beimel, Or Lasri |
| 2025 | TCC | Polynomial Secret Sharing Schemes and Algebraic Matroids. | Amos Beimel, Oriol Farrs, Adriana Moya |
| 2025 | TCC | Cryptography with Weak Privacy. | Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Hanjun Li |
| 2024 | CRYPTO | Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions. | Amos Beimel, Tal Malkin, Noam Mazor |
| 2024 | TCC | New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs. | Bar Alon, Amos Beimel, Tamar Ben David, Eran Omri, Anat Paskin-Cherniavsky |
| 2024 | TCC | Secret-Sharing Schemes for High Slices. | Amos Beimel, Oriol Farrs, Or Lasri, Oded Nir |
| 2023 | STOC | Succinct Computational Secret Sharing. | Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan |
| 2023 | TCC | Cryptography from Planted Graphs: Security with Logarithmic-Size Messages. | Damiano Abram, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan |
| 2023 | TCC | Three Party Secure Computation with Friends and Foes. | Bar Alon, Amos Beimel, Eran Omri |
| 2023 | TCC | Improved Polynomial Secret-Sharing Schemes. | Amos Beimel, Oriol Farrs, Or Lasri |
| 2022 | STOC | Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds. | Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer |
| 2021 | CRYPTO | Quadratic Secret Sharing and Conditional Disclosure of Secrets. | Amos Beimel, Hussien Othman, Naty Peter |
| 2020 | COLT | Closure Properties for Private Classification and Online Prediction. | Noga Alon, Amos Beimel, Shay Moran, Uri Stemmer |
| 2020 | EuroCrypt | Evolving Ramp Secret Sharing with a Small Gap. | Amos Beimel, Hussien Othman |
| 2020 | STOC | Better secret sharing via robust conditional disclosure of secrets. | Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter |
| 2020 | TCC | The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs. | Amos Beimel, Oriol Farrs |
| 2020 | TCC | On the Round Complexity of the Shuffle Model. | Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer |
| 2019 | COLT | Private Center Points and Learning of Halfspaces. | Amos Beimel, Shay Moran, Kobbi Nissim, Uri Stemmer |
| 2019 | EuroCrypt | Secret-Sharing Schemes for General and Uniform Access Structures. | Benny Applebaum, Amos Beimel, Oriol Farrs, Oded Nir, Naty Peter |
| 2018 | ASIACRYPT | Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols. | Amos Beimel, Naty Peter |
| 2018 | EuroCrypt | The Complexity of Multiparty PSM Protocols and Related Models. | Amos Beimel, Eyal Kushilevitz, Pnina Nissim |
| 2018 | FOCS | Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. | Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri |
| 2018 | SCN | Evolving Ramp Secret-Sharing Schemes. | Amos Beimel, Hussien Othman |
| 2017 | EuroCrypt | Ad Hoc PSM Protocols: Secure Computation Without Coordination. | Amos Beimel, Yuval Ishai, Eyal Kushilevitz |
| 2017 | TCC | Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. | Amos Beimel, Oriol Farrs, Yuval Mintz, Naty Peter |
| 2016 | SCN | Secret Sharing Schemes for Dense Forbidden Graphs. | Amos Beimel, Oriol Farrs, Naty Peter |
| 2015 | SODA | Learning Privately with Labeled and Unlabeled Examples. | Amos Beimel, Kobbi Nissim, Uri Stemmer |
| 2015 | TCC | Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. | Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri |
| 2014 | CRYPTO | Non-Interactive Secure Multiparty Computation. | Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Anat Paskin-Cherniavsky |
| 2014 | TCC | Multi-linear Secret-Sharing Schemes. | Amos Beimel, Aner Ben-Efraim, Carles Padr, Ilya Tyomkin |
| 2014 | TCC | On the Cryptographic Complexity of the Worst Functions. | Amos Beimel, Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz |
| 2012 | CRYPTO | Secret Sharing Schemes for Very Dense Graphs. | Amos Beimel, Oriol Farrs, Yuval Mintz |
| 2011 | CRYPTO | 1/ | Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov |
| 2010 | CRYPTO | Protocols for Multiparty Coin Toss with Dishonest Majority. | Amos Beimel, Eran Omri, Ilan Orlov |
| 2010 | ICALP | Choosing, Agreeing, and Eliminating in Communication Complexity. | Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb |
| 2010 | TCC | Bounds on the Sample Complexity for Private Learning and Private Data Release. | Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi Nissim |
| 2009 | TCC | Secret Sharing and Non-Shannon Information Inequalities. | Amos Beimel, Ilan Orlov |
| 2008 | CRYPTO | Distributed Private Data Analysis: Simultaneously Solving How and What. | Amos Beimel, Kobbi Nissim, Eran Omri |
| 2008 | SCN | On Linear Secret Sharing for Connectivity in Directed Graphs. | Amos Beimel, Anat Paskin |
| 2008 | TCC | Matroids Can Be Far from Ideal Secret Sharing. | Amos Beimel, Noam Livne, Carles Padr |
| 2007 | CRYPTO | How Should We Solve Search Problems Privately? | Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb |
| 2007 | TCC | Weakly-Private Secret Sharing Schemes. | Amos Beimel, Matthew K. Franklin |
| 2007 | TCC | Private Approximation of Clustering and Vertex Cover. | Amos Beimel, Renen Hallak, Kobbi Nissim |
| 2006 | STOC | Private approximation of search problems. | Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb |
| 2006 | SCN | Edge Eavesdropping Games. | Amos Beimel, Matthew K. Franklin |
| 2006 | TCC | On Matroids and Non-ideal Secret Sharing. | Amos Beimel, Noam Livne |
| 2005 | SIROCCO | On Private Computation in Incomplete Networks. | Amos Beimel |
| 2005 | TCC | Characterizing Ideal Weighted Threshold Secret Sharing. | Amos Beimel, Tamir Tassa, Enav Weinreb |
| 2004 | ITW | RT oblivious erasure correcting. | Amos Beimel, Shlomi Dolev, Noam Singer |
| 2004 | PODC | Brief announcement: RT oblivious erasure correcting. | Amos Beimel, Shlomi Dolev, Noam Singer |
| 2004 | TCC | A Quantitative Approach to Reductions in Secure Computation. | Amos Beimel, Tal Malkin |
| 2003 | FOCS | Separating the Power of Monotone Span Programs over Different Fields. | Amos Beimel, Enav Weinreb |
| 2003 | PODC | Efficient reliable communication over partially authenticated networks. | Amos Beimel, Lior Malka |
| 2002 | FOCS | Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval. | Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Jean-Franois Raymond |
| 2002 | SCN | Robust Information-Theoretic Private Information Retrieval. | Amos Beimel, Yoav Stahl |
| 2001 | ICALP | Information-Theoretic Private Information Retrieval: A Unified Construction. | Amos Beimel, Yuval Ishai |
| 2000 | CRYPTO | Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing. | Amos Beimel, Yuval Ishai, Tal Malkin |
| 1999 | CRYPTO | The All-or-Nothing Nature of Two-Party Secure Computation. | Amos Beimel, Tal Malkin, Silvio Micali |
| 1999 | STOC | One-Way Functions Are Essential for Single-Server Private Information Retrieval. | Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tal Malkin |
| 1998 | COLT | The Query Complexity of Finding Local Minima in the Lattice. | Amos Beimel, Felix Geller, Eyal Kushilevitz |
| 1996 | FOCS | On the Applications of Multiplicity Automata in Learning. | Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio |
| 1995 | CRYPTO | Secret Sharing with Public Reconstruction (Extended Abstract). | Amos Beimel, Benny Chor |
| 1995 | FOCS | Lower Bounds for Monotone Span Programs. | Amos Beimel, Anna Gl, Mike Paterson |
| 1993 | CRYPTO | Interaction in Key Distribution Schemes (Extended Abstract). | Amos Beimel, Benny Chor |
| 1992 | CRYPTO | Universally Ideal Secret Sharing Schemes (Preliminary Version). | Amos Beimel, Benny Chor |