Amos Beimel

According to our database1, Amos Beimel authored at least 82 papers between 1992 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Better Secret-Sharing via Robust Conditional Disclosure of Secrets.
Electronic Colloquium on Computational Complexity (ECCC), 2020

2019
Secret-Sharing from Robust Conditional Disclosure of Secrets.
IACR Cryptology ePrint Archive, 2019

Evolving Ramp Secret Sharing with a Small Gap.
IACR Cryptology ePrint Archive, 2019

Secret-Sharing Schemes for General and Uniform Access Structures.
IACR Cryptology ePrint Archive, 2019

The power of synergy in differential privacy: Combining a small curator with local randomizers.
CoRR, 2019

Private Center Points and Learning of Halfspaces.
Proceedings of the Conference on Learning Theory, 2019

Exploring Differential Obliviousness.
Proceedings of the Approximation, 2019

2018
Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols.
IACR Cryptology ePrint Archive, 2018

The Complexity of Multiparty PSM Protocols and Related Models.
IACR Cryptology ePrint Archive, 2018

Privacy Preserving Multi-Agent Planning with Provable Guarantees.
CoRR, 2018

Evolving Ramp Secret-Sharing Schemes.
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.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Ad Hoc PSM Protocols: Secure Computation Without Coordination.
IACR Cryptology ePrint Archive, 2017

Linear Secret-Sharing Schemes for Forbidden Graph Access Structures.
IACR Cryptology ePrint Archive, 2017

Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling.
Electronic Colloquium on Computational Complexity (ECCC), 2017

2016
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy.
Theory of Computing, 2016

Secret-Sharing Schemes for Very Dense Graphs.
J. Cryptology, 2016

Secret Sharing Schemes for Dense Forbidden Graphs.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

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

2015
Protocols for Multiparty Coin Toss with a Dishonest Majority.
J. Cryptology, 2015

Learning Privately with Labeled and Unlabeled Examples.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
Bounds on the sample complexity for private learning and private data release.
Machine Learning, 2014

Non-Interactive Secure Multiparty Computation.
IACR Cryptology ePrint Archive, 2014

Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions.
IACR Cryptology ePrint Archive, 2014

Choosing, Agreeing, and Eliminating in Communication Complexity.
Computational Complexity, 2014

On the Cryptographic Complexity of the Worst Functions.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Multi-linear Secret-Sharing Schemes.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

2013
Characterizing the sample complexity of private learners.
Proceedings of the Innovations in Theoretical Computer Science, 2013

2012
Communication-efficient distributed oblivious transfer.
J. Comput. Syst. Sci., 2012

Share Conversion and Private Information Retrieval.
Proceedings of the 27th Conference on Computational Complexity, 2012

2011
Secret Sharing and Non-Shannon Information Inequalities.
IEEE Trans. Information Theory, 2011

1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Secret-Sharing Schemes: A Survey.
Proceedings of the Coding and Cryptology - Third International Workshop, 2011

2010
How Should We Solve Search Problems Privately?
J. Cryptology, 2010

Secure Multiparty Computation with Partial Fairness.
IACR Cryptology ePrint Archive, 2010

Bounds on the Sample Complexity for Private Learning and Private Data Release.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

2009
Matrix columns allocation problems.
Theor. Comput. Sci., 2009

Private Approximation of Clustering and Vertex Cover.
Computational Complexity, 2009

Approximate belief updating in max-2-connected Bayes networks is NP-hard.
Artif. Intell., 2009

2008
Learning Automata.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

On Matroids and Nonideal Secret Sharing.
IEEE Trans. Information Theory, 2008

Characterizing Ideal Weighted Threshold Secret Sharing.
SIAM J. Discrete Math., 2008

Matroids Can Be Far from Ideal Secret Sharing.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

On Linear Secret Sharing for Connectivity in Directed Graphs.
Proceedings of the Security and Cryptography for Networks, 6th International Conference, 2008

Distributed Private Data Analysis: Simultaneously Solving How and What.
Proceedings of the Advances in Cryptology, 2008

2007
RT oblivious erasure correcting.
IEEE/ACM Trans. Netw., 2007

Robust Information-Theoretic Private Information Retrieval.
J. Cryptology, 2007

On private computation in incomplete networks.
Distributed Computing, 2007

Weakly-Private Secret Sharing Schemes.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

2006
Monotone circuits for monotone weighted threshold functions.
Inf. Process. Lett., 2006

On Matroids and Non-ideal Secret Sharing.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Edge Eavesdropping Games.
Proceedings of the Security and Cryptography for Networks, 5th International Conference, 2006

2005
Separating the Power of Monotone Span Programs over Different Fields.
SIAM J. Comput., 2005

General constructions for information-theoretic private information retrieval.
J. Comput. Syst. Sci., 2005

Private Approximation of Search Problems
Electronic Colloquium on Computational Complexity (ECCC), 2005

Efficient reliable communication over partially authenticated networks.
Distributed Computing, 2005

Monotone Circuits for Weighted Threshold Functions.
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.
J. Cryptology, 2004

Brief announcement: RT oblivious erasure correcting.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003
Buses for Anonymous Message Delivery.
J. Cryptology, 2003

A Quantitative Approach to Reductions in Secure Computation
Electronic Colloquium on Computational Complexity (ECCC), 2003

2002
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
The Query Complexity of Finding Local Minima in the Lattice.
Inf. Comput., 2001

On the Power of Nonlinear Secret-Sharing.
IACR Cryptology ePrint Archive, 2001

Information-Theoretic Private Information Retrieval: A Unified Construction
Electronic Colloquium on Computational Complexity (ECCC), 2001

On the Power of Nonlinear Secrect-Sharing.
Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001

2000
Computing Functions of a Shared Secret.
SIAM J. Discrete Math., 2000

Learning functions represented as multiplicity automata.
J. ACM, 2000

Learning unions of high-dimensional boxes over the reals.
Inf. Process. Lett., 2000

1999
Reliable Communication over Partially Authenticated Networks.
Theor. Comput. Sci., 1999

On Arithmetic Branching Programs.
J. Comput. Syst. Sci., 1999

One-Way Functions Are Essential for Single-Server Private Information Retrieval.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

The All-or-Nothing Nature of Two-Party Secure Computation.
Proceedings of the Advances in Cryptology, 1999

1998
Secret Sharing with Public Reconstruction.
IEEE Trans. Information Theory, 1998

Learning Boxes in High Dimension.
Algorithmica, 1998

1997
Lower Bounds for Monotone Span Programs.
Computational Complexity, 1997

1996
Communication in key distribution schemes.
IEEE Trans. Information Theory, 1996

On the Applications of Multiplicity Automata in Learning.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995
Secret Sharing with Public Reconstruction (Extended Abstract).
Proceedings of the Advances in Cryptology, 1995

1994
Universally ideal secret-sharing schemes.
IEEE Trans. Information Theory, 1994

1993
Interaction in Key Distribution Schemes (Extended Abstract).
Proceedings of the Advances in Cryptology, 1993

1992
Universally Ideal Secret Sharing Schemes (Preliminary Version).
Proceedings of the Advances in Cryptology, 1992


  Loading...