Amos Beimel

Google Scholar ORCID: 0000-0002-6572-4195
44 publications in security and cryptology related venues
Year
Venue
Title
2024
conf/crypto
Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions.
Amos Beimel Tal Malkin Noam Mazor
2024
conf/tcc
Secret-Sharing Schemes for High Slices.
Amos Beimel Oriol Farràs Or Lasri Oded Nir
2024
conf/tcc
New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs.
Bar Alon Amos Beimel Tamar Ben David Eran Omri Anat Paskin-Cherniavsky
2023
conf/tcc
Improved Polynomial Secret-Sharing Schemes.
Amos Beimel Oriol Farràs Or Lasri
2023
conf/tcc
Three Party Secure Computation with Friends and Foes.
Bar Alon Amos Beimel Eran Omri
2023
conf/tcc
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages.
Damiano Abram Amos Beimel Yuval Ishai Eyal Kushilevitz Varun Narayanan
2021
conf/crypto
Quadratic Secret Sharing and Conditional Disclosure of Secrets.
Amos Beimel Hussien Othman Naty Peter
2020
journals/joc
1/p-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds.
Amos Beimel Yehuda Lindell Eran Omri Ilan Orlov
2020
conf/eurocrypt
Evolving Ramp Secret Sharing with a Small Gap.
Amos Beimel Hussien Othman
2020
conf/tcc
The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs.
Amos Beimel Oriol Farràs
2020
conf/tcc
On the Round Complexity of the Shuffle Model.
Amos Beimel Iftach Haitner Kobbi Nissim Uri Stemmer
2019
conf/eurocrypt
Secret-Sharing Schemes for General and Uniform Access Structures.
Benny Applebaum Amos Beimel Oriol Farràs Oded Nir Naty Peter
2018
conf/eurocrypt
The Complexity of Multiparty PSM Protocols and Related Models.
Amos Beimel Eyal Kushilevitz Pnina Nissim
2018
conf/asiacrypt
Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols.
Amos Beimel Naty Peter
2017
conf/eurocrypt
Ad Hoc PSM Protocols: Secure Computation Without Coordination.
Amos Beimel Yuval Ishai Eyal Kushilevitz
2017
conf/tcc
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures.
Amos Beimel Oriol Farràs Yuval Mintz Naty Peter
2016
journals/joc
Secret-Sharing Schemes for Very Dense Graphs.
Amos Beimel Oriol Farràs Yuval Mintz
2015
journals/joc
Protocols for Multiparty Coin Toss with a Dishonest Majority.
Amos Beimel Eran Omri Ilan Orlov
2015
conf/tcc
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions.
Gilad Asharov Amos Beimel Nikolaos Makriyannis Eran Omri
2014
conf/crypto
Non-Interactive Secure Multiparty Computation.
Amos Beimel Ariel Gabizon Yuval Ishai Eyal Kushilevitz Sigurd Meldgaard Anat Paskin-Cherniavsky
2014
conf/tcc
On the Cryptographic Complexity of the Worst Functions.
Amos Beimel Yuval Ishai Ranjit Kumaresan Eyal Kushilevitz
2014
conf/tcc
Multi-linear Secret-Sharing Schemes.
Amos Beimel Aner Ben-Efraim Carles Padró Ilya Tyomkin
2012
conf/crypto
Secret Sharing Schemes for Very Dense Graphs.
Amos Beimel Oriol Farràs Yuval Mintz
2011
conf/crypto
-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds.
Amos Beimel Yehuda Lindell Eran Omri Ilan Orlov
2010
journals/joc
How Should We Solve Search Problems Privately?
Amos Beimel Tal Malkin Kobbi Nissim Enav Weinreb
2010
conf/crypto
Protocols for Multiparty Coin Toss with Dishonest Majority.
Amos Beimel Eran Omri Ilan Orlov
2010
conf/tcc
Bounds on the Sample Complexity for Private Learning and Private Data Release.
Amos Beimel Shiva Prasad Kasiviswanathan Kobbi Nissim
2009
conf/tcc
Secret Sharing and Non-Shannon Information Inequalities.
Amos Beimel Ilan Orlov
2008
conf/crypto
Distributed Private Data Analysis: Simultaneously Solving How and What.
Amos Beimel Kobbi Nissim Eran Omri
2008
conf/tcc
Matroids Can Be Far from Ideal Secret Sharing.
Amos Beimel Noam Livne Carles Padró
2007
journals/joc
Robust Information-Theoretic Private Information Retrieval.
Amos Beimel Yoav Stahl
2007
conf/crypto
How Should We Solve Search Problems Privately?
Amos Beimel Tal Malkin Kobbi Nissim Enav Weinreb
2007
conf/tcc
Weakly-Private Secret Sharing Schemes.
Amos Beimel Matthew K. Franklin
2007
conf/tcc
Private Approximation of Clustering and Vertex Cover.
Amos Beimel Renen Hallak Kobbi Nissim
2006
conf/tcc
On Matroids and Non-ideal Secret Sharing.
Amos Beimel Noam Livne
2005
conf/tcc
Characterizing Ideal Weighted Threshold Secret Sharing.
Amos Beimel Tamir Tassa Enav Weinreb
2004
journals/joc
Reducing the Servers' Computation in Private Information Retrieval: PIR with Preprocessing.
Amos Beimel Yuval Ishai Tal Malkin
2004
conf/tcc
A Quantitative Approach to Reductions in Secure Computation.
Amos Beimel Tal Malkin
2003
journals/joc
Buses for Anonymous Message Delivery.
Amos Beimel Shlomi Dolev
2000
conf/crypto
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing.
Amos Beimel Yuval Ishai Tal Malkin
1999
conf/crypto
The All-or-Nothing Nature of Two-Party Secure Computation.
Amos Beimel Tal Malkin Silvio Micali
1995
conf/crypto
Secret Sharing with Public Reconstruction (Extended Abstract).
Amos Beimel Benny Chor
1993
conf/crypto
Interaction in Key Distribution Schemes (Extended Abstract).
Amos Beimel Benny Chor
1992
conf/crypto
Universally Ideal Secret Sharing Schemes (Preliminary Version).
Amos Beimel Benny Chor

Coauthors

Amos Beimel (44)
Anat Paskin-Cherniavsky (2)
Aner Ben-Efraim (1)
Ariel Gabizon (1)
Bar Alon (2)
Benny Applebaum (1)
Benny Chor (3)
Carles Padró (2)
Damiano Abram (1)
Enav Weinreb (3)
Eran Omri (8)
Eyal Kushilevitz (5)
Gilad Asharov (1)
Hussien Othman (2)
Iftach Haitner (1)
Ilan Orlov (5)
Ilya Tyomkin (1)
Kobbi Nissim (6)
Matthew K. Franklin (1)
Naty Peter (4)
Nikolaos Makriyannis (1)
Noam Livne (2)
Noam Mazor (1)
Oded Nir (2)
Or Lasri (2)
Oriol Farràs (7)
Pnina Nissim (1)
Ranjit Kumaresan (1)
Renen Hallak (1)
Shiva Prasad Kasiviswanathan (1)
Shlomi Dolev (1)
Sigurd Meldgaard (1)
Silvio Micali (1)
Tal Malkin (7)
Tamar Ben David (1)
Tamir Tassa (1)
Uri Stemmer (1)
Varun Narayanan (1)
Yehuda Lindell (2)
Yoav Stahl (1)
Yuval Ishai (6)
Yuval Mintz (3)
Filters
Select all Unselect all
Years:  to