Amos Beimel

According to our database, Amos Beimel authored at least 99 papers between 1992 and 2024.

Collaborative distances:

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

2024

New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs.

Bar Alon, Amos Beimel, Tamar Ben David, Eran Omri, Anat Paskin-Cherniavsky

IACR Cryptol. ePrint Arch., 2024

2023

Quadratic Secret Sharing and Conditional Disclosure of Secrets.

Amos Beimel, Hussien Othman, Naty Peter

IEEE Trans. Inf. Theory, November, 2023

Improved Polynomial Secret-Sharing Schemes.

Amos Beimel, Oriol Farràs, Or Lasri

IACR Cryptol. ePrint Arch., 2023

Lower-Bounds for Secret-Sharing Schemes for k-Hypergraphs.

Amos Beimel

IACR Cryptol. ePrint Arch., 2023

Three Party Secure Computation with Friends and Foes.

Bar Alon, Amos Beimel, Eran Omri

IACR Cryptol. ePrint Arch., 2023

Cryptography from Planted Graphs: Security with Logarithmic-Size Messages.

Damiano Abram, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan

IACR Cryptol. ePrint Arch., 2023

Succinct Computational Secret Sharing.

Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan

Electron. Colloquium Comput. Complex., 2023

2022

Linear Secret-Sharing Schemes for Forbidden Graph Access Structures.

Amos Beimel, Oriol Farràs, Yuval Mintz, Naty Peter

IEEE Trans. Inf. Theory, 2022

Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.

Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri

SIAM J. Comput., 2022

Secret Sharing, Slice Formulas, and Monotone Real Circuits.

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

Electron. Colloquium Comput. Complex., 2022

Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds.

Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021

Degree-2 Secret Sharing and Conditional Disclosure of Secrets.

Amos Beimel, Hussien Othman, Naty Peter

IACR Cryptol. ePrint Arch., 2021

Learning Privately with Labeled and Unlabeled Examples.

Amos Beimel, Kobbi Nissim, Uri Stemmer

Algorithmica, 2021

2020

1/p-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds.

Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov

J. Cryptol., 2020

On the Round Complexity of the Shuffle Model.

Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer

IACR Cryptol. ePrint Arch., 2020

The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs.

Amos Beimel, Oriol Farràs

IACR Cryptol. ePrint Arch., 2020

Better Secret-Sharing via Robust Conditional Disclosure of Secrets.

Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter

Electron. Colloquium Comput. Complex., 2020

The Power of Synergy in Differential Privacy: Combining a Small Curator with Local Randomizers.

Amos Beimel, Aleksandra Korolova, Kobbi Nissim, Or Sheffet, Uri Stemmer

Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020

Closure Properties for Private Classification and Online Prediction.

Noga Alon, Amos Beimel, Shay Moran, Uri Stemmer

Proceedings of the Conference on Learning Theory, 2020

2019

Characterizing the Sample Complexity of Pure Private Learners.

Amos Beimel, Kobbi Nissim, Uri Stemmer

J. Mach. Learn. Res., 2019

Secret-Sharing from Robust Conditional Disclosure of Secrets.

Amos Beimel, Naty Peter

IACR Cryptol. ePrint Arch., 2019

Evolving Ramp Secret Sharing with a Small Gap.

Amos Beimel, Hussien Othman

IACR Cryptol. ePrint Arch., 2019

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

Private Center Points and Learning of Halfspaces.

Amos Beimel, Shay Moran, Kobbi Nissim, Uri Stemmer

Proceedings of the Conference on Learning Theory, 2019

Exploring Differential Obliviousness.

Amos Beimel, Kobbi Nissim, Mohammad Zaheri

Proceedings of the Approximation, 2019

2018

Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols.

Amos Beimel, Naty Peter

IACR Cryptol. ePrint Arch., 2018

The Complexity of Multiparty PSM Protocols and Related Models.

Amos Beimel, Eyal Kushilevitz, Pnina Nissim

IACR Cryptol. ePrint Arch., 2018

Privacy Preserving Multi-Agent Planning with Provable Guarantees.

Amos Beimel, Ronen I. Brafman

CoRR, 2018

Evolving Ramp Secret-Sharing Schemes.

Amos Beimel, Hussien Othman

Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.

Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Ad Hoc PSM Protocols: Secure Computation Without Coordination.

Amos Beimel, Yuval Ishai, Eyal Kushilevitz

IACR Cryptol. ePrint Arch., 2017

Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling.

Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri

Electron. Colloquium Comput. Complex., 2017

2016

Private Learning and Sanitization: Pure vs. Approximate Differential Privacy.

Amos Beimel, Kobbi Nissim, Uri Stemmer

Theory Comput., 2016

Secret-Sharing Schemes for Very Dense Graphs.

Amos Beimel, Oriol Farràs, Yuval Mintz

J. Cryptol., 2016

Secret Sharing Schemes for Dense Forbidden Graphs.

Amos Beimel, Oriol Farràs, Naty Peter

Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Distribution Design.

Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2015

Protocols for Multiparty Coin Toss with a Dishonest Majority.

Amos Beimel, Eran Omri, Ilan Orlov

J. Cryptol., 2015

2014

Bounds on the sample complexity for private learning and private data release.

Amos Beimel, Hai Brenner, Shiva Prasad Kasiviswanathan, Kobbi Nissim

Mach. Learn., 2014

Non-Interactive Secure Multiparty Computation.

Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Anat Paskin-Cherniavsky

IACR Cryptol. ePrint Arch., 2014

Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions.

Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri

IACR Cryptol. ePrint Arch., 2014

Choosing, Agreeing, and Eliminating in Communication Complexity.

Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb

Comput. Complex., 2014

On the Cryptographic Complexity of the Worst Functions.

Amos Beimel, Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Multi-linear Secret-Sharing Schemes.

Amos Beimel, Aner Ben-Efraim, Carles Padró, Ilya Tyomkin

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

2013

Characterizing the sample complexity of private learners.

Amos Beimel, Kobbi Nissim, Uri Stemmer

Proceedings of the Innovations in Theoretical Computer Science, 2013

2012

Communication-efficient distributed oblivious transfer.

Amos Beimel, Yeow Meng Chee, Huaxiong Wang, Liang Feng Zhang

J. Comput. Syst. Sci., 2012

Share Conversion and Private Information Retrieval.

Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Ilan Orlov

Proceedings of the 27th Conference on Computational Complexity, 2012

2011

Secret Sharing and Non-Shannon Information Inequalities.

Amos Beimel, Ilan Orlov

IEEE Trans. Inf. Theory, 2011

1/<i>p</i>-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds.

Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Secret-Sharing Schemes: A Survey.

Amos Beimel

Proceedings of the Coding and Cryptology - Third International Workshop, 2011

2010

How Should We Solve Search Problems Privately?

Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb

J. Cryptol., 2010

Secure Multiparty Computation with Partial Fairness.

Amos Beimel, Eran Omri, Ilan Orlov

IACR Cryptol. ePrint Arch., 2010

Bounds on the Sample Complexity for Private Learning and Private Data Release.

Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi Nissim

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

2009

Matrix columns allocation problems.

Amos Beimel, Boaz Ben-Moshe, Yehuda Ben-Shimol, Paz Carmi, Eldad Chai, Itzik Kitroser, Eran Omri

Theor. Comput. Sci., 2009

Private Approximation of Clustering and Vertex Cover.

Amos Beimel, Renen Hallak, Kobbi Nissim

Comput. Complex., 2009

Approximate belief updating in max-2-connected Bayes networks is NP-hard.

Erez Karpas, Solomon Eyal Shimony, Amos Beimel

Artif. Intell., 2009

2008

Learning Automata.

Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

On Matroids and Nonideal Secret Sharing.

Amos Beimel, Noam Livne

IEEE Trans. Inf. Theory, 2008

Characterizing Ideal Weighted Threshold Secret Sharing.

Amos Beimel, Tamir Tassa, Enav Weinreb

SIAM J. Discret. Math., 2008

Matroids Can Be Far from Ideal Secret Sharing.

Amos Beimel, Noam Livne, Carles Padró

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

On Linear Secret Sharing for Connectivity in Directed Graphs.

Amos Beimel, Anat Paskin

Proceedings of the Security and Cryptography for Networks, 6th International Conference, 2008

Distributed Private Data Analysis: Simultaneously Solving How and What.

Amos Beimel, Kobbi Nissim, Eran Omri

Proceedings of the Advances in Cryptology, 2008

2007

RT oblivious erasure correcting.

Amos Beimel, Shlomi Dolev, Noam Singer

IEEE/ACM Trans. Netw., 2007

Robust Information-Theoretic Private Information Retrieval.

Amos Beimel, Yoav Stahl

J. Cryptol., 2007

On private computation in incomplete networks.

Amos Beimel

Distributed Comput., 2007

Weakly-Private Secret Sharing Schemes.

Amos Beimel, Matthew K. Franklin

Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

2006

Monotone circuits for monotone weighted threshold functions.

Amos Beimel, Enav Weinreb

Inf. Process. Lett., 2006

On Matroids and Non-ideal Secret Sharing.

Amos Beimel, Noam Livne

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Edge Eavesdropping Games.

Amos Beimel, Matthew K. Franklin

Proceedings of the Security and Cryptography for Networks, 5th International Conference, 2006

2005

Separating the Power of Monotone Span Programs over Different Fields.

Amos Beimel, Enav Weinreb

SIAM J. Comput., 2005

General constructions for information-theoretic private information retrieval.

Amos Beimel, Yuval Ishai, Eyal Kushilevitz

J. Comput. Syst. Sci., 2005

Private Approximation of Search Problems

Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb

Electron. Colloquium Comput. Complex., 2005

Efficient reliable communication over partially authenticated networks.

Amos Beimel, Lior Malka

Distributed Comput., 2005

Monotone Circuits for Weighted Threshold Functions.

Amos Beimel, Enav Weinreb

Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004

Reducing the Servers' Computation in Private Information Retrieval: PIR with Preprocessing.

Amos Beimel, Yuval Ishai, Tal Malkin

J. Cryptol., 2004

Brief announcement: RT oblivious erasure correcting.

Amos Beimel, Shlomi Dolev, Noam Singer

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003

Buses for Anonymous Message Delivery.

Amos Beimel, Shlomi Dolev

J. Cryptol., 2003

A Quantitative Approach to Reductions in Secure Computation

Amos Beimel, Tal Malkin

Electron. Colloquium Comput. Complex., 2003

2002

Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval.

Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Jean-François Raymond

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001

The Query Complexity of Finding Local Minima in the Lattice.

Amos Beimel, Felix Geller, Eyal Kushilevitz

Inf. Comput., 2001

On the Power of Nonlinear Secret-Sharing.

Amos Beimel, Yuval Ishai

IACR Cryptol. ePrint Arch., 2001

Information-Theoretic Private Information Retrieval: A Unified Construction

Amos Beimel, Yuval Ishai

Electron. Colloquium Comput. Complex., 2001

On the Power of Nonlinear Secrect-Sharing.

Amos Beimel, Yuval Ishai

Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001

2000

Computing Functions of a Shared Secret.

Amos Beimel, Mike Burmester, Yvo Desmedt, Eyal Kushilevitz

SIAM J. Discret. Math., 2000

Learning functions represented as multiplicity automata.

Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio

J. ACM, 2000

Learning unions of high-dimensional boxes over the reals.

Amos Beimel, Eyal Kushilevitz

Inf. Process. Lett., 2000

1999

Reliable Communication over Partially Authenticated Networks.

Amos Beimel, Matthew K. Franklin

Theor. Comput. Sci., 1999

On Arithmetic Branching Programs.

Amos Beimel, Anna Gál

J. Comput. Syst. Sci., 1999

One-Way Functions Are Essential for Single-Server Private Information Retrieval.

Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tal Malkin

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

The All-or-Nothing Nature of Two-Party Secure Computation.

Amos Beimel, Tal Malkin, Silvio Micali

Proceedings of the Advances in Cryptology, 1999

1998

Secret Sharing with Public Reconstruction.

Amos Beimel, Benny Chor

IEEE Trans. Inf. Theory, 1998

Learning Boxes in High Dimension.

Amos Beimel, Eyal Kushilevitz

Algorithmica, 1998

1997

Lower Bounds for Monotone Span Programs.

Amos Beimel, Anna Gál, Mike Paterson

Comput. Complex., 1997

1996

Secure schemes for secret sharing and key distribution.

Amos Beimel

PhD thesis, 1996

Communication in key distribution schemes.

Amos Beimel, Benny Chor

IEEE Trans. Inf. Theory, 1996

On the Applications of Multiplicity Automata in Learning.

Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995

Secret Sharing with Public Reconstruction (Extended Abstract).

Amos Beimel, Benny Chor

Proceedings of the Advances in Cryptology, 1995

1994

Universally ideal secret-sharing schemes.

Amos Beimel, Benny Chor

IEEE Trans. Inf. Theory, 1994

1993

Interaction in Key Distribution Schemes (Extended Abstract).

Amos Beimel, Benny Chor

Proceedings of the Advances in Cryptology, 1993

1992

Universally Ideal Secret Sharing Schemes (Preliminary Version).

Amos Beimel, Benny Chor

Proceedings of the Advances in Cryptology, 1992