Amos Beimel

176 papers A* 27A 10B 12Misc 5Journal 92Unranked 26
YearRankTypeTitle / Venue / Authors
2025 — conf
Cryptography with Weak Privacy.
TCC (4)
Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Hanjun Li
2025 J jnl
Cryptography with Weak Privacy.
IACR Cryptol. ePrint Arch.
Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Hanjun Li
2025 A conf
On the Definition of Malicious Private Information Retrieval.
ITC
Bar Alon, Amos Beimel
2025 J jnl
On the Definition of Malicious Private Information Retrieval.
IACR Cryptol. ePrint Arch.
Bar Alon, Amos Beimel
2025 — conf
Polynomial Secret Sharing Schemes and Algebraic Matroids.
TCC (2)
Amos Beimel, Oriol Farràs, Adriana Moya
2025 J jnl
Polynomial Secret Sharing Schemes and Algebraic Matroids.
IACR Cryptol. ePrint Arch.
Amos Beimel, Oriol Farràs, Adriana Moya
2025 J jnl
Secret-Sharing Schemes for General Access Structures: An Introduction.
IACR Cryptol. ePrint Arch.
Amos Beimel
2025 — conf
Simplified PIR and CDS Protocols and Improved Linear Secret-Sharing Schemes.
TCC (2)
Bar Alon, Amos Beimel, Or Lasri
2024 J jnl
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions.
SIAM J. Comput.
Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri
2024 — conf
New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs.
TCC (4)
Bar Alon, Amos Beimel, Tamar Ben David, Eran Omri, Anat Paskin-Cherniavsky
2024 J jnl
New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs.
IACR Cryptol. ePrint Arch.
Bar Alon, Amos Beimel, Tamar Ben David, Eran Omri, Anat Paskin-Cherniavsky
2024 — conf
Secret-Sharing Schemes for High Slices.
TCC (4)
Amos Beimel, Oriol Farràs, Or Lasri, Oded Nir
2024 J jnl
Secret-Sharing Schemes for High Slices.
IACR Cryptol. ePrint Arch.
Amos Beimel, Oriol Farràs, Oded Nir
2024 J jnl
Simplified PIR and CDS Protocols and Improved Linear Secret-Sharing Schemes.
IACR Cryptol. ePrint Arch.
Bar Alon, Amos Beimel, Or Lasri
2024 — conf
Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions.
CRYPTO (5)
Amos Beimel, Tal Malkin, Noam Mazor
2024 J jnl
Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions.
IACR Cryptol. ePrint Arch.
Amos Beimel, Tal Malkin, Noam Mazor
2023 — conf
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages.
TCC (1)
Damiano Abram, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan
2023 J jnl
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages.
IACR Cryptol. ePrint Arch.
Damiano Abram, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan
2023 — conf
Improved Polynomial Secret-Sharing Schemes.
TCC (2)
Amos Beimel, Oriol Farràs, Or Lasri
2023 J jnl
Improved Polynomial Secret-Sharing Schemes.
IACR Cryptol. ePrint Arch.
Amos Beimel, Oriol Farràs, Or Lasri
2023 A conf
Lower Bounds for Secret-Sharing Schemes for k-Hypergraphs.
ITC
Amos Beimel
2023 J jnl
Lower-Bounds for Secret-Sharing Schemes for k-Hypergraphs.
IACR Cryptol. ePrint Arch.
Amos Beimel
2023 J jnl
Quadratic Secret Sharing and Conditional Disclosure of Secrets.
IEEE Trans. Inf. Theory
Amos Beimel, Hussien Othman, Naty Peter
2023 A* conf
Succinct Computational Secret Sharing.
STOC
Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan
2023 J jnl
Succinct Computational Secret Sharing.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan
2023 J jnl
Succinct Computational Secret Sharing.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan
2023 — conf
Three Party Secure Computation with Friends and Foes.
TCC (2)
Bar Alon, Amos Beimel, Eran Omri
2023 J jnl
Three Party Secure Computation with Friends and Foes.
IACR Cryptol. ePrint Arch.
Bar Alon, Amos Beimel, Eran Omri
2022 A* conf
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds.
STOC
Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer
2022 J jnl
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures.
IEEE Trans. Inf. Theory
Amos Beimel, Oriol Farràs, Yuval Mintz, Naty Peter
2022 A conf
Secret Sharing, Slice Formulas, and Monotone Real Circuits.
ITCS
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi
2022 J jnl
Secret Sharing, Slice Formulas, and Monotone Real Circuits.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi
2022 J jnl
Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.
SIAM J. Comput.
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2021 J jnl
Degree-2 Secret Sharing and Conditional Disclosure of Secrets.
IACR Cryptol. ePrint Arch.
Amos Beimel, Hussien Othman, Naty Peter
2021 J jnl
Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds.
CoRR
Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer
2021 J jnl
Learning Privately with Labeled and Unlabeled Examples.
Algorithmica
Amos Beimel, Kobbi Nissim, Uri Stemmer
2021 — conf
Quadratic Secret Sharing and Conditional Disclosure of Secrets.
CRYPTO (3)
Amos Beimel, Hussien Othman, Naty Peter
2021 J jnl
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.
CoRR
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2020 J jnl
1/p-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds.
J. Cryptol.
Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov
2020 J jnl
Better Secret-Sharing via Robust Conditional Disclosure of Secrets.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter
2020 J jnl
Better Secret-Sharing via Robust Conditional Disclosure of Secrets.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter
2020 A* conf
Better secret sharing via robust conditional disclosure of secrets.
STOC
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter
2020 A* conf
Closure Properties for Private Classification and Online Prediction.
COLT
Noga Alon, Amos Beimel, Shay Moran, Uri Stemmer
2020 J jnl
Closure Properties for Private Classification and Online Prediction.
CoRR
Noga Alon, Amos Beimel, Shay Moran, Uri Stemmer
2020 — conf
Evolving Ramp Secret Sharing with a Small Gap.
EUROCRYPT (1)
Amos Beimel, Hussien Othman
2020 — conf
On the Round Complexity of the Shuffle Model.
TCC (2)
Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer
2020 J jnl
On the Round Complexity of the Shuffle Model.
CoRR
Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer
2020 J jnl
On the Round Complexity of the Shuffle Model.
IACR Cryptol. ePrint Arch.
Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer
2020 A conf
The Power of Synergy in Differential Privacy: Combining a Small Curator with Local Randomizers.
ITC
Amos Beimel, Aleksandra Korolova, Kobbi Nissim, Or Sheffet, Uri Stemmer
2020 — conf
The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs.
TCC (3)
Amos Beimel, Oriol Farràs
2020 J jnl
The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs.
IACR Cryptol. ePrint Arch.
Amos Beimel, Oriol Farràs
2019 J jnl
Characterizing the Sample Complexity of Pure Private Learners.
J. Mach. Learn. Res.
Amos Beimel, Kobbi Nissim, Uri Stemmer
2019 J jnl
Evolving Ramp Secret Sharing with a Small Gap.
IACR Cryptol. ePrint Arch.
Amos Beimel, Hussien Othman
2019 — conf
Exploring Differential Obliviousness.
APPROX-RANDOM
Amos Beimel, Kobbi Nissim, Mohammad Zaheri
2019 J jnl
Exploring Differential Obliviousness.
CoRR
Amos Beimel, Kobbi Nissim, Mohammad Zaheri
2019 A* conf
Private Center Points and Learning of Halfspaces.
COLT
Amos Beimel, Shay Moran, Kobbi Nissim, Uri Stemmer
2019 J jnl
Private Center Points and Learning of Halfspaces.
CoRR
Amos Beimel, Shay Moran, Kobbi Nissim, Uri Stemmer
2019 — conf
Secret-Sharing Schemes for General and Uniform Access Structures.
EUROCRYPT (3)
Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter
2019 J jnl
Secret-Sharing Schemes for General and Uniform Access Structures.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter
2019 J jnl
Secret-Sharing from Robust Conditional Disclosure of Secrets.
IACR Cryptol. ePrint Arch.
Amos Beimel, Naty Peter
2019 J jnl
The power of synergy in differential privacy: Combining a small curator with local randomizers.
CoRR
Amos Beimel, Aleksandra Korolova, Kobbi Nissim, Or Sheffet, Uri Stemmer
2018 Misc conf
Evolving Ramp Secret-Sharing Schemes.
SCN
Amos Beimel, Hussien Othman
2018 — conf
Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols.
ASIACRYPT (3)
Amos Beimel, Naty Peter
2018 J jnl
Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols.
IACR Cryptol. ePrint Arch.
Amos Beimel, Naty Peter
2018 J jnl
Privacy Preserving Multi-Agent Planning with Provable Guarantees.
CoRR
Amos Beimel, Ronen I. Brafman
2018 — conf
The Complexity of Multiparty PSM Protocols and Related Models.
EUROCRYPT (2)
Amos Beimel, Eyal Kushilevitz, Pnina Nissim
2018 J jnl
The Complexity of Multiparty PSM Protocols and Related Models.
IACR Cryptol. ePrint Arch.
Amos Beimel, Eyal Kushilevitz, Pnina Nissim
2018 — ed.
Theory of Cryptography - 16th International Conference, TCC 2018, Panaji, India, November 11-14, 2018, Proceedings, Part I
TCC (1)
Amos Beimel, Stefan Dziembowski
2018 — ed.
Theory of Cryptography - 16th International Conference, TCC 2018, Panaji, India, November 11-14, 2018, Proceedings, Part II
TCC (2)
Amos Beimel, Stefan Dziembowski
2018 A* conf
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling.
FOCS
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2017 — conf
Ad Hoc PSM Protocols: Secure Computation Without Coordination.
EUROCRYPT (3)
Amos Beimel, Yuval Ishai, Eyal Kushilevitz
2017 J jnl
Ad Hoc PSM Protocols: Secure Computation Without Coordination.
IACR Cryptol. ePrint Arch.
Amos Beimel, Yuval Ishai, Eyal Kushilevitz
2017 — conf
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures.
TCC (2)
Amos Beimel, Oriol Farràs, Yuval Mintz, Naty Peter
2017 J jnl
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures.
IACR Cryptol. ePrint Arch.
Amos Beimel, Oriol Farràs, Yuval Mintz, Naty Peter
2017 J jnl
Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling.
Electron. Colloquium Comput. Complex.
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
2016 A conf
Distribution Design.
ITCS
Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz
2016 J jnl
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy.
Theory Comput.
Amos Beimel, Kobbi Nissim, Uri Stemmer
2016 Misc conf
Secret Sharing Schemes for Dense Forbidden Graphs.
SCN
Amos Beimel, Oriol Farràs, Naty Peter
2016 J jnl
Secret-Sharing Schemes for Very Dense Graphs.
J. Cryptol.
Amos Beimel, Oriol Farràs, Yuval Mintz
2015 — conf
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions.
TCC (1)
Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri
2015 A* conf
Learning Privately with Labeled and Unlabeled Examples.
SODA
Amos Beimel, Kobbi Nissim, Uri Stemmer
2015 J jnl
Protocols for Multiparty Coin Toss with a Dishonest Majority.
J. Cryptol.
Amos Beimel, Eran Omri, Ilan Orlov
2014 J jnl
Bounds on the sample complexity for private learning and private data release.
Mach. Learn.
Amos Beimel, Hai Brenner, Shiva Prasad Kasiviswanathan, Kobbi Nissim
2014 J jnl
Characterizing the Sample Complexity of Private Learners.
CoRR
Amos Beimel, Kobbi Nissim, Uri Stemmer
2014 J jnl
Choosing, Agreeing, and Eliminating in Communication Complexity.
Comput. Complex.
Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb
2014 J jnl
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions.
IACR Cryptol. ePrint Arch.
Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri
2014 J jnl
Learning Privately with Labeled and Unlabeled Examples.
CoRR
Amos Beimel, Kobbi Nissim, Uri Stemmer
2014 B conf
Multi-linear Secret-Sharing Schemes.
TCC
Amos Beimel, Aner Ben-Efraim, Carles Padró, Ilya Tyomkin
2014 — conf
Non-Interactive Secure Multiparty Computation.
CRYPTO (2)
Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Anat Paskin-Cherniavsky
2014 J jnl
Non-Interactive Secure Multiparty Computation.
IACR Cryptol. ePrint Arch.
Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Anat Paskin-Cherniavsky
2014 B conf
On the Cryptographic Complexity of the Worst Functions.
TCC
Amos Beimel, Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz
2014 J jnl
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy.
CoRR
Amos Beimel, Kobbi Nissim, Uri Stemmer
2013 A conf
Characterizing the sample complexity of private learners.
ITCS
Amos Beimel, Kobbi Nissim, Uri Stemmer
2013 — conf
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy.
APPROX-RANDOM
Amos Beimel, Kobbi Nissim, Uri Stemmer
2012 J jnl
Communication-efficient distributed oblivious transfer.
J. Comput. Syst. Sci.
Amos Beimel, Yeow Meng Chee, Huaxiong Wang, Liang Feng Zhang
2012 J jnl
Protocols for Multiparty Coin Toss With Dishonest Majority.
IACR Cryptol. ePrint Arch.
Amos Beimel, Eran Omri, Ilan Orlov
2012 A* conf
Secret Sharing Schemes for Very Dense Graphs.
CRYPTO
Amos Beimel, Oriol Farràs, Yuval Mintz
2012 J jnl
Secret Sharing Schemes for Very Dense Graphs.
IACR Cryptol. ePrint Arch.
Amos Beimel, Oriol Farràs, Yuval Mintz
2012 A conf
Share Conversion and Private Information Retrieval.
CCC
Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Ilan Orlov
2011 A* conf
1/
CRYPTO
Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov
2011 J jnl
Distributed Private Data Analysis: On Simultaneously Solving How and What
CoRR
Amos Beimel, Kobbi Nissim, Eran Omri
2011 J jnl
Secret Sharing and Non-Shannon Information Inequalities.
IEEE Trans. Inf. Theory
Amos Beimel, Ilan Orlov
2011 — conf
Secret-Sharing Schemes: A Survey.
IWCC
Amos Beimel
2010 B conf
Bounds on the Sample Complexity for Private Learning and Private Data Release.
TCC
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi Nissim
2010 — conf
Choosing, Agreeing, and Eliminating in Communication Complexity.
ICALP (1)
Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb
2010 J jnl
How Should We Solve Search Problems Privately?
J. Cryptol.
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb
2010 A* conf
Protocols for Multiparty Coin Toss with Dishonest Majority.
CRYPTO
Amos Beimel, Eran Omri, Ilan Orlov
2010 J jnl
Secure Multiparty Computation with Partial Fairness
CoRR
Amos Beimel, Eran Omri, Ilan Orlov
2010 J jnl
Secure Multiparty Computation with Partial Fairness.
IACR Cryptol. ePrint Arch.
Amos Beimel, Eran Omri, Ilan Orlov
2009 J jnl
Approximate belief updating in max-2-connected Bayes networks is NP-hard.
Artif. Intell.
Erez Karpas, Solomon Eyal Shimony, Amos Beimel
2009 J jnl
Matrix columns allocation problems.
Theor. Comput. Sci.
Amos Beimel, Boaz Ben-Moshe, Yehuda Ben-Shimol, Paz Carmi, Eldad Chai, Itzik Kitroser, Eran Omri
2009 J jnl
Private Approximation of Clustering and Vertex Cover.
Comput. Complex.
Amos Beimel, Renen Hallak, Kobbi Nissim
2009 B conf
Secret Sharing and Non-Shannon Information Inequalities.
TCC
Amos Beimel, Ilan Orlov
2008 J jnl
Characterizing Ideal Weighted Threshold Secret Sharing.
SIAM J. Discret. Math.
Amos Beimel, Tamir Tassa, Enav Weinreb
2008 A* conf
Distributed Private Data Analysis: Simultaneously Solving How and What.
CRYPTO
Amos Beimel, Kobbi Nissim, Eran Omri
2008 — ch.
Learning Automata.
Encyclopedia of Algorithms
Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
2008 B conf
Matroids Can Be Far from Ideal Secret Sharing.
TCC
Amos Beimel, Noam Livne, Carles Padró
2008 Misc conf
On Linear Secret Sharing for Connectivity in Directed Graphs.
SCN
Amos Beimel, Anat Paskin
2008 J jnl
On Matroids and Nonideal Secret Sharing.
IEEE Trans. Inf. Theory
Amos Beimel, Noam Livne
2008 J jnl
Private Approximation of Search Problems.
SIAM J. Comput.
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
2007 A* conf
How Should We Solve Search Problems Privately?
CRYPTO
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb
2007 J jnl
On private computation in incomplete networks.
Distributed Comput.
Amos Beimel
2007 B conf
Private Approximation of Clustering and Vertex Cover.
TCC
Amos Beimel, Renen Hallak, Kobbi Nissim
2007 J jnl
RT oblivious erasure correcting.
IEEE/ACM Trans. Netw.
Amos Beimel, Shlomi Dolev, Noam Singer
2007 J jnl
Robust Information-Theoretic Private Information Retrieval.
J. Cryptol.
Amos Beimel, Yoav Stahl
2007 B conf
Weakly-Private Secret Sharing Schemes.
TCC
Amos Beimel, Matthew K. Franklin
2006 Misc conf
Edge Eavesdropping Games.
SCN
Amos Beimel, Matthew K. Franklin
2006 J jnl
Monotone circuits for monotone weighted threshold functions.
Inf. Process. Lett.
Amos Beimel, Enav Weinreb
2006 B conf
On Matroids and Non-ideal Secret Sharing.
TCC
Amos Beimel, Noam Livne
2006 A* conf
Private approximation of search problems.
STOC
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
2005 B conf
Characterizing Ideal Weighted Threshold Secret Sharing.
TCC
Amos Beimel, Tamir Tassa, Enav Weinreb
2005 J jnl
Efficient reliable communication over partially authenticated networks.
Distributed Comput.
Amos Beimel, Lior Malka
2005 J jnl
General constructions for information-theoretic private information retrieval.
J. Comput. Syst. Sci.
Amos Beimel, Yuval Ishai, Eyal Kushilevitz
2005 A conf
Monotone Circuits for Weighted Threshold Functions.
CCC
Amos Beimel, Enav Weinreb
2005 B conf
On Private Computation in Incomplete Networks.
SIROCCO
Amos Beimel
2005 J jnl
Private Approximation of Search Problems
Electron. Colloquium Comput. Complex.
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
2005 J jnl
Separating the Power of Monotone Span Programs over Different Fields.
SIAM J. Comput.
Amos Beimel, Enav Weinreb
2004 B conf
A Quantitative Approach to Reductions in Secure Computation.
TCC
Amos Beimel, Tal Malkin
2004 A* conf
Brief announcement: RT oblivious erasure correcting.
PODC
Amos Beimel, Shlomi Dolev, Noam Singer
2004 B conf
RT oblivious erasure correcting.
ITW
Amos Beimel, Shlomi Dolev, Noam Singer
2004 J jnl
Reducing the Servers' Computation in Private Information Retrieval: PIR with Preprocessing.
J. Cryptol.
Amos Beimel, Yuval Ishai, Tal Malkin
2003 J jnl
A Quantitative Approach to Reductions in Secure Computation
Electron. Colloquium Comput. Complex.
Amos Beimel, Tal Malkin
2003 J jnl
Buses for Anonymous Message Delivery.
J. Cryptol.
Amos Beimel, Shlomi Dolev
2003 A* conf
Efficient reliable communication over partially authenticated networks.
PODC
Amos Beimel, Lior Malka
2003 A* conf
Separating the Power of Monotone Span Programs over Different Fields.
FOCS
Amos Beimel, Enav Weinreb
2002 A* conf
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval.
FOCS
Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Jean-François Raymond
2002 Misc conf
Robust Information-Theoretic Private Information Retrieval.
SCN
Amos Beimel, Yoav Stahl
2001 J jnl
Information-Theoretic Private Information Retrieval: A Unified Construction
Electron. Colloquium Comput. Complex.
Amos Beimel, Yuval Ishai
2001 A* conf
Information-Theoretic Private Information Retrieval: A Unified Construction.
ICALP
Amos Beimel, Yuval Ishai
2001 A conf
On the Power of Nonlinear Secrect-Sharing.
CCC
Amos Beimel, Yuval Ishai
2001 J jnl
On the Power of Nonlinear Secret-Sharing.
IACR Cryptol. ePrint Arch.
Amos Beimel, Yuval Ishai
2001 J jnl
The Query Complexity of Finding Local Minima in the Lattice.
Inf. Comput.
Amos Beimel, Felix Geller, Eyal Kushilevitz
2000 J jnl
Computing Functions of a Shared Secret.
SIAM J. Discret. Math.
Amos Beimel, Mike Burmester, Yvo Desmedt, Eyal Kushilevitz
2000 J jnl
Learning functions represented as multiplicity automata.
J. ACM
Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
2000 J jnl
Learning unions of high-dimensional boxes over the reals.
Inf. Process. Lett.
Amos Beimel, Eyal Kushilevitz
2000 A* conf
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing.
CRYPTO
Amos Beimel, Yuval Ishai, Tal Malkin
1999 J jnl
On Arithmetic Branching Programs.
J. Comput. Syst. Sci.
Amos Beimel, Anna Gál
1999 A* conf
One-Way Functions Are Essential for Single-Server Private Information Retrieval.
STOC
Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tal Malkin
1999 J jnl
Reliable Communication over Partially Authenticated Networks.
Theor. Comput. Sci.
Amos Beimel, Matthew K. Franklin
1999 A* conf
The All-or-Nothing Nature of Two-Party Secure Computation.
CRYPTO
Amos Beimel, Tal Malkin, Silvio Micali
1998 J jnl
Learning Boxes in High Dimension.
Algorithmica
Amos Beimel, Eyal Kushilevitz
1998 A conf
On Arithmetic Branching Programs.
CCC
Amos Beimel, Anna Gál
1998 J jnl
Secret Sharing with Public Reconstruction.
IEEE Trans. Inf. Theory
Amos Beimel, Benny Chor
1998 A* conf
The Query Complexity of Finding Local Minima in the Lattice.
COLT
Amos Beimel, Felix Geller, Eyal Kushilevitz
1997 — conf
Learning Boxes in High Dimension.
EuroCOLT
Amos Beimel, Eyal Kushilevitz
1997 J jnl
Lower Bounds for Monotone Span Programs.
Comput. Complex.
Amos Beimel, Anna Gál, Mike Paterson
1997 — conf
Reliable Communication over Partially Authenticated Networks.
WDAG
Amos Beimel, Matthew K. Franklin
1996 J jnl
Communication in key distribution schemes.
IEEE Trans. Inf. Theory
Amos Beimel, Benny Chor
1996 A* conf
On the Applications of Multiplicity Automata in Learning.
FOCS
Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
1996 — —
Secure schemes for secret sharing and key distribution.
Amos Beimel
1995 J jnl
Lower Bounds for Monotone Span Programs
Electron. Colloquium Comput. Complex.
Amos Beimel, Anna Gál, Mike Paterson
1995 A* conf
Lower Bounds for Monotone Span Programs.
FOCS
Amos Beimel, Anna Gál, Mike Paterson
1995 A* conf
Secret Sharing with Public Reconstruction (Extended Abstract).
CRYPTO
Amos Beimel, Benny Chor
1994 J jnl
Universally ideal secret-sharing schemes.
IEEE Trans. Inf. Theory
Amos Beimel, Benny Chor
1993 A* conf
Interaction in Key Distribution Schemes (Extended Abstract).
CRYPTO
Amos Beimel, Benny Chor
1992 A* conf
Universally Ideal Secret Sharing Schemes (Preliminary Version).
CRYPTO
Amos Beimel, Benny Chor