default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmos Beimel
Person information
- affiliation: Ben-Gurion University, Beersheba, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[i49]Amos Beimel, Oriol Farràs, Adriana Moya:
Polynomial Secret Sharing Schemes and Algebraic Matroids. IACR Cryptol. ePrint Arch. 2025: 368 (2025)- [i48]Amos Beimel:
Secret-Sharing Schemes for General Access Structures: An Introduction. IACR Cryptol. ePrint Arch. 2025: 518 (2025) - 2024
- [j41]Gilad Asharov
, Amos Beimel, Nikolaos Makriyannis, Eran Omri:
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. SIAM J. Comput. 53(5): 1381-1408 (2024) - [c76]Amos Beimel, Tal Malkin, Noam Mazor:
Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions. CRYPTO (5) 2024: 459-488 - [c75]Bar Alon, Amos Beimel, Tamar Ben David, Eran Omri, Anat Paskin-Cherniavsky:
New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs. TCC (4) 2024: 548-580 - [c74]Amos Beimel, Oriol Farràs, Or Lasri, Oded Nir:
Secret-Sharing Schemes for High Slices. TCC (4) 2024: 581-613 - [i47]Bar Alon, Amos Beimel, Tamar Ben David, Eran Omri, Anat Paskin-Cherniavsky:
New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs. IACR Cryptol. ePrint Arch. 2024: 419 (2024) - [i46]Amos Beimel, Oriol Farràs, Oded Nir:
Secret-Sharing Schemes for High Slices. IACR Cryptol. ePrint Arch. 2024: 602 (2024) - [i45]Amos Beimel, Tal Malkin, Noam Mazor:
Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions. IACR Cryptol. ePrint Arch. 2024: 1104 (2024) - [i44]Bar Alon, Amos Beimel, Or Lasri:
Simplified PIR and CDS Protocols and Improved Linear Secret-Sharing Schemes. IACR Cryptol. ePrint Arch. 2024: 1599 (2024) - 2023
- [j40]Amos Beimel, Hussien Othman, Naty Peter:
Quadratic Secret Sharing and Conditional Disclosure of Secrets. IEEE Trans. Inf. Theory 69(11): 7295-7316 (2023) - [c73]Amos Beimel:
Lower Bounds for Secret-Sharing Schemes for k-Hypergraphs. ITC 2023: 16:1-16:13 - [c72]Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan:
Succinct Computational Secret Sharing. STOC 2023: 1553-1566 - [c71]Bar Alon, Amos Beimel, Eran Omri:
Three Party Secure Computation with Friends and Foes. TCC (2) 2023: 156-185 - [c70]Damiano Abram, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan:
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages. TCC (1) 2023: 286-315 - [c69]Amos Beimel, Oriol Farràs, Or Lasri:
Improved Polynomial Secret-Sharing Schemes. TCC (2) 2023: 374-405 - [i43]Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan:
Succinct Computational Secret Sharing. Electron. Colloquium Comput. Complex. TR23 (2023) - [i42]Amos Beimel:
Lower-Bounds for Secret-Sharing Schemes for k-Hypergraphs. IACR Cryptol. ePrint Arch. 2023: 289 (2023) - [i41]Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan:
Succinct Computational Secret Sharing. IACR Cryptol. ePrint Arch. 2023: 955 (2023) - [i40]Amos Beimel, Oriol Farràs, Or Lasri:
Improved Polynomial Secret-Sharing Schemes. IACR Cryptol. ePrint Arch. 2023: 1158 (2023) - [i39]Bar Alon, Amos Beimel, Eran Omri:
Three Party Secure Computation with Friends and Foes. IACR Cryptol. ePrint Arch. 2023: 1605 (2023) - [i38]Damiano Abram, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan:
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages. IACR Cryptol. ePrint Arch. 2023: 1929 (2023) - 2022
- [j39]Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. SIAM J. Comput. 51(4): 1126-1171 (2022) - [j38]Amos Beimel, Oriol Farràs, Yuval Mintz, Naty Peter:
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. IEEE Trans. Inf. Theory 68(3): 2083-2100 (2022) - [c68]Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi:
Secret Sharing, Slice Formulas, and Monotone Real Circuits. ITCS 2022: 8:1-8:23 - [c67]Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer:
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds. STOC 2022: 1671-1684 - [i37]Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi:
Secret Sharing, Slice Formulas, and Monotone Real Circuits. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j37]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Learning Privately with Labeled and Unlabeled Examples. Algorithmica 83(1): 177-215 (2021) - [c66]Amos Beimel, Hussien Othman, Naty Peter:
Quadratic Secret Sharing and Conditional Disclosure of Secrets. CRYPTO (3) 2021: 748-778 - [i36]Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. CoRR abs/2105.00743 (2021) - [i35]Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer:
Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds. CoRR abs/2111.03980 (2021) - [i34]Amos Beimel, Hussien Othman, Naty Peter:
Degree-2 Secret Sharing and Conditional Disclosure of Secrets. IACR Cryptol. ePrint Arch. 2021: 285 (2021) - 2020
- [j36]Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov:
1/p-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds. J. Cryptol. 33(4): 1659-1731 (2020) - [c65]Noga Alon, Amos Beimel, Shay Moran, Uri Stemmer:
Closure Properties for Private Classification and Online Prediction. COLT 2020: 119-152 - [c64]Amos Beimel, Hussien Othman:
Evolving Ramp Secret Sharing with a Small Gap. EUROCRYPT (1) 2020: 529-555 - [c63]Amos Beimel, Aleksandra Korolova, Kobbi Nissim, Or Sheffet, Uri Stemmer:
The Power of Synergy in Differential Privacy: Combining a Small Curator with Local Randomizers. ITC 2020: 14:1-14:25 - [c62]Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter:
Better secret sharing via robust conditional disclosure of secrets. STOC 2020: 280-293 - [c61]Amos Beimel, Oriol Farràs:
The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs. TCC (3) 2020: 499-529 - [c60]Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer:
On the Round Complexity of the Shuffle Model. TCC (2) 2020: 683-712 - [i33]Noga Alon, Amos Beimel, Shay Moran, Uri Stemmer:
Closure Properties for Private Classification and Online Prediction. CoRR abs/2003.04509 (2020) - [i32]Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer:
On the Round Complexity of the Shuffle Model. CoRR abs/2009.13510 (2020) - [i31]Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter:
Better Secret-Sharing via Robust Conditional Disclosure of Secrets. Electron. Colloquium Comput. Complex. TR20 (2020) - [i30]Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter:
Better Secret-Sharing via Robust Conditional Disclosure of Secrets. IACR Cryptol. ePrint Arch. 2020: 80 (2020) - [i29]Amos Beimel, Oriol Farràs:
The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs. IACR Cryptol. ePrint Arch. 2020: 664 (2020) - [i28]Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer:
On the Round Complexity of the Shuffle Model. IACR Cryptol. ePrint Arch. 2020: 1182 (2020)
2010 – 2019
- 2019
- [j35]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Characterizing the Sample Complexity of Pure Private Learners. J. Mach. Learn. Res. 20: 146:1-146:33 (2019) - [c59]Amos Beimel, Kobbi Nissim, Mohammad Zaheri:
Exploring Differential Obliviousness. APPROX-RANDOM 2019: 65:1-65:20 - [c58]Amos Beimel, Shay Moran, Kobbi Nissim, Uri Stemmer:
Private Center Points and Learning of Halfspaces. COLT 2019: 269-282 - [c57]Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter:
Secret-Sharing Schemes for General and Uniform Access Structures. EUROCRYPT (3) 2019: 441-471 - [i27]Amos Beimel, Shay Moran, Kobbi Nissim, Uri Stemmer:
Private Center Points and Learning of Halfspaces. CoRR abs/1902.10731 (2019) - [i26]Amos Beimel, Kobbi Nissim, Mohammad Zaheri:
Exploring Differential Obliviousness. CoRR abs/1905.01373 (2019) - [i25]Amos Beimel, Aleksandra Korolova, Kobbi Nissim, Or Sheffet, Uri Stemmer:
The power of synergy in differential privacy: Combining a small curator with local randomizers. CoRR abs/1912.08951 (2019) - [i24]Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter:
Secret-Sharing Schemes for General and Uniform Access Structures. IACR Cryptol. ePrint Arch. 2019: 231 (2019) - [i23]Amos Beimel, Naty Peter:
Secret-Sharing from Robust Conditional Disclosure of Secrets. IACR Cryptol. ePrint Arch. 2019: 522 (2019) - [i22]Amos Beimel, Hussien Othman:
Evolving Ramp Secret Sharing with a Small Gap. IACR Cryptol. ePrint Arch. 2019: 1124 (2019) - 2018
- [c56]Amos Beimel, Naty Peter:
Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols. ASIACRYPT (3) 2018: 332-362 - [c55]Amos Beimel, Eyal Kushilevitz, Pnina Nissim:
The Complexity of Multiparty PSM Protocols and Related Models. EUROCRYPT (2) 2018: 287-318 - [c54]Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. FOCS 2018: 838-849 - [c53]Amos Beimel, Hussien Othman:
Evolving Ramp Secret-Sharing Schemes. SCN 2018: 313-332 - [e2]Amos Beimel, Stefan Dziembowski:
Theory of Cryptography - 16th International Conference, TCC 2018, Panaji, India, November 11-14, 2018, Proceedings, Part I. Lecture Notes in Computer Science 11239, Springer 2018, ISBN 978-3-030-03806-9 [contents] - [e1]Amos Beimel, Stefan Dziembowski:
Theory of Cryptography - 16th International Conference, TCC 2018, Panaji, India, November 11-14, 2018, Proceedings, Part II. Lecture Notes in Computer Science 11240, Springer 2018, ISBN 978-3-030-03809-0 [contents] - [i21]Amos Beimel, Ronen I. Brafman:
Privacy Preserving Multi-Agent Planning with Provable Guarantees. CoRR abs/1810.13354 (2018) - [i20]Amos Beimel, Eyal Kushilevitz, Pnina Nissim:
The Complexity of Multiparty PSM Protocols and Related Models. IACR Cryptol. ePrint Arch. 2018: 148 (2018) - [i19]Amos Beimel, Naty Peter:
Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols. IACR Cryptol. ePrint Arch. 2018: 441 (2018) - 2017
- [c52]Amos Beimel, Yuval Ishai, Eyal Kushilevitz:
Ad Hoc PSM Protocols: Secure Computation Without Coordination. EUROCRYPT (3) 2017: 580-608 - [c51]Amos Beimel, Oriol Farràs, Yuval Mintz, Naty Peter:
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. TCC (2) 2017: 394-423 - [i18]Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling. Electron. Colloquium Comput. Complex. TR17 (2017) - [i17]Amos Beimel, Yuval Ishai, Eyal Kushilevitz:
Ad Hoc PSM Protocols: Secure Computation Without Coordination. IACR Cryptol. ePrint Arch. 2017: 147 (2017) - [i16]Amos Beimel, Oriol Farràs, Yuval Mintz, Naty Peter:
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. IACR Cryptol. ePrint Arch. 2017: 940 (2017) - 2016
- [j34]Amos Beimel, Oriol Farràs, Yuval Mintz:
Secret-Sharing Schemes for Very Dense Graphs. J. Cryptol. 29(2): 336-362 (2016) - [j33]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy. Theory Comput. 12(1): 1-61 (2016) - [c50]Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz:
Distribution Design. ITCS 2016: 81-92 - [c49]Amos Beimel, Oriol Farràs, Naty Peter:
Secret Sharing Schemes for Dense Forbidden Graphs. SCN 2016: 509-528 - 2015
- [j32]Amos Beimel, Eran Omri, Ilan Orlov:
Protocols for Multiparty Coin Toss with a Dishonest Majority. J. Cryptol. 28(3): 551-600 (2015) - [c48]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Learning Privately with Labeled and Unlabeled Examples. SODA 2015: 461-477 - [c47]Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri:
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. TCC (1) 2015: 199-228 - 2014
- [j31]Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb:
Choosing, Agreeing, and Eliminating in Communication Complexity. Comput. Complex. 23(1): 1-42 (2014) - [j30]Amos Beimel, Hai Brenner, Shiva Prasad Kasiviswanathan, Kobbi Nissim:
Bounds on the sample complexity for private learning and private data release. Mach. Learn. 94(3): 401-437 (2014) - [c46]Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Anat Paskin-Cherniavsky:
Non-Interactive Secure Multiparty Computation. CRYPTO (2) 2014: 387-404 - [c45]Amos Beimel, Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz:
On the Cryptographic Complexity of the Worst Functions. TCC 2014: 317-342 - [c44]Amos Beimel, Aner Ben-Efraim, Carles Padró, Ilya Tyomkin:
Multi-linear Secret-Sharing Schemes. TCC 2014: 394-418 - [i15]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Characterizing the Sample Complexity of Private Learners. CoRR abs/1402.2224 (2014) - [i14]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Learning Privately with Labeled and Unlabeled Examples. CoRR abs/1407.2662 (2014) - [i13]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy. CoRR abs/1407.2674 (2014) - [i12]Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Anat Paskin-Cherniavsky:
Non-Interactive Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2014: 960 (2014) - [i11]Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri:
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. IACR Cryptol. ePrint Arch. 2014: 1000 (2014) - 2013
- [c43]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy. APPROX-RANDOM 2013: 363-378 - [c42]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Characterizing the sample complexity of private learners. ITCS 2013: 97-110 - 2012
- [j29]Amos Beimel, Yeow Meng Chee, Huaxiong Wang, Liang Feng Zhang:
Communication-efficient distributed oblivious transfer. J. Comput. Syst. Sci. 78(4): 1142-1157 (2012) - [c41]Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Ilan Orlov:
Share Conversion and Private Information Retrieval. CCC 2012: 258-268 - [c40]Amos Beimel, Oriol Farràs, Yuval Mintz:
Secret Sharing Schemes for Very Dense Graphs. CRYPTO 2012: 144-161 - [i10]Amos Beimel, Oriol Farràs, Yuval Mintz:
Secret Sharing Schemes for Very Dense Graphs. IACR Cryptol. ePrint Arch. 2012: 404 (2012) - [i9]Amos Beimel, Eran Omri, Ilan Orlov:
Protocols for Multiparty Coin Toss With Dishonest Majority. IACR Cryptol. ePrint Arch. 2012: 643 (2012) - 2011
- [j28]Amos Beimel, Ilan Orlov:
Secret Sharing and Non-Shannon Information Inequalities. IEEE Trans. Inf. Theory 57(9): 5634-5649 (2011) - [c39]Amos Beimel:
Secret-Sharing Schemes: A Survey. IWCC 2011: 11-46 - [c38]Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov:
1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds. CRYPTO 2011: 277-296 - [i8]Amos Beimel, Kobbi Nissim, Eran Omri:
Distributed Private Data Analysis: On Simultaneously Solving How and What. CoRR abs/1103.2626 (2011) - 2010
- [j27]Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb:
How Should We Solve Search Problems Privately? J. Cryptol. 23(2): 344-371 (2010) - [c37]Amos Beimel, Eran Omri, Ilan Orlov:
Protocols for Multiparty Coin Toss with Dishonest Majority. CRYPTO 2010: 538-557 - [c36]Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb:
Choosing, Agreeing, and Eliminating in Communication Complexity. ICALP (1) 2010: 451-462 - [c35]Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi Nissim:
Bounds on the Sample Complexity for Private Learning and Private Data Release. TCC 2010: 437-454 - [i7]Amos Beimel, Eran Omri, Ilan Orlov:
Secure Multiparty Computation with Partial Fairness. CoRR abs/1011.5567 (2010) - [i6]Amos Beimel, Eran Omri, Ilan Orlov:
Secure Multiparty Computation with Partial Fairness. IACR Cryptol. ePrint Arch. 2010: 599 (2010)
2000 – 2009
- 2009
- [j26]Erez Karpas, Solomon Eyal Shimony, Amos Beimel:
Approximate belief updating in max-2-connected Bayes networks is NP-hard. Artif. Intell. 173(12-13): 1150-1153 (2009) - [j25]Amos Beimel, Renen Hallak, Kobbi Nissim:
Private Approximation of Clustering and Vertex Cover. Comput. Complex. 18(3): 435-494 (2009) - [j24]Amos Beimel, Boaz Ben-Moshe, Yehuda Ben-Shimol, Paz Carmi, Eldad Chai, Itzik Kitroser, Eran Omri:
Matrix columns allocation problems. Theor. Comput. Sci. 410(21-23): 2174-2183 (2009) - [c34]Amos Beimel, Ilan Orlov:
Secret Sharing and Non-Shannon Information Inequalities. TCC 2009: 539-557 - 2008
- [j23]Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb:
Private Approximation of Search Problems. SIAM J. Comput. 38(5): 1728-1760 (2008) - [j22]Amos Beimel, Tamir Tassa, Enav Weinreb:
Characterizing Ideal Weighted Threshold Secret Sharing. SIAM J. Discret. Math. 22(1): 360-397 (2008) - [j21]Amos Beimel, Noam Livne:
On Matroids and Nonideal Secret Sharing. IEEE Trans. Inf. Theory 54(6): 2626-2643 (2008) - [c33]Amos Beimel, Kobbi Nissim, Eran Omri:
Distributed Private Data Analysis: Simultaneously Solving How and What. CRYPTO 2008: 451-468 - [c32]Amos Beimel, Anat Paskin:
On Linear Secret Sharing for Connectivity in Directed Graphs. SCN 2008: 172-184 - [c31]Amos Beimel, Noam Livne, Carles Padró:
Matroids Can Be Far from Ideal Secret Sharing. TCC 2008: 194-212 - [r1]Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio:
Learning Automata. Encyclopedia of Algorithms 2008 - 2007
- [j20]Amos Beimel:
On private computation in incomplete networks. Distributed Comput. 19(3): 237-252 (2007) - [j19]Amos Beimel, Yoav Stahl:
Robust Information-Theoretic Private Information Retrieval. J. Cryptol. 20(3): 295-321 (2007) - [j18]Amos Beimel, Shlomi Dolev, Noam Singer:
RT oblivious erasure correcting. IEEE/ACM Trans. Netw. 15(6): 1321-1332 (2007) - [c30]Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb:
How Should We Solve Search Problems Privately? CRYPTO 2007: 31-49 - [c29]Amos Beimel, Matthew K. Franklin:
Weakly-Private Secret Sharing Schemes. TCC 2007: 253-272 - [c28]Amos Beimel, Renen Hallak, Kobbi Nissim:
Private Approximation of Clustering and Vertex Cover. TCC 2007: 383-403 - 2006
- [j17]Amos Beimel, Enav Weinreb:
Monotone circuits for monotone weighted threshold functions. Inf. Process. Lett. 97(1): 12-18 (2006) - [c27]Amos Beimel, Matthew K. Franklin:
Edge Eavesdropping Games. SCN 2006: 1-17 - [c26]Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb:
Private approximation of search problems. STOC 2006: 119-128 - [c25]Amos Beimel, Noam Livne:
On Matroids and Non-ideal Secret Sharing. TCC 2006: 482-501 - 2005
- [j16]Amos Beimel, Lior Malka:
Efficient reliable communication over partially authenticated networks. Distributed Comput. 18(1): 1-19 (2005) - [j15]Amos Beimel, Yuval Ishai, Eyal Kushilevitz:
General constructions for information-theoretic private information retrieval. J. Comput. Syst. Sci. 71(2): 213-247 (2005) - [j14]Amos Beimel, Enav Weinreb:
Separating the Power of Monotone Span Programs over Different Fields. SIAM J. Comput. 34(5): 1196-1215 (2005) - [c24]Amos Beimel, Enav Weinreb:
Monotone Circuits for Weighted Threshold Functions. CCC 2005: 67-75 - [c23]Amos Beimel:
On Private Computation in Incomplete Networks. SIROCCO 2005: 18-33 - [c22]Amos Beimel, Tamir Tassa, Enav Weinreb:
Characterizing Ideal Weighted Threshold Secret Sharing. TCC 2005: 600-619 - [i5]Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb:
Private Approximation of Search Problems. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j13]Amos Beimel, Yuval Ishai, Tal Malkin:
Reducing the Servers' Computation in Private Information Retrieval: PIR with Preprocessing. J. Cryptol. 17(2): 125-151 (2004) - [c21]Amos Beimel, Shlomi Dolev, Noam Singer:
RT oblivious erasure correcting. ITW 2004: 236-241 - [c20]Amos Beimel, Shlomi Dolev, Noam Singer:
Brief announcement: RT oblivious erasure correcting. PODC 2004: 393 - [c19]Amos Beimel, Tal Malkin:
A Quantitative Approach to Reductions in Secure Computation. TCC 2004: 238-257 - 2003
- [j12]Amos Beimel, Shlomi Dolev:
Buses for Anonymous Message Delivery. J. Cryptol. 16(1): 25-39 (2003) - [c18]Amos Beimel, Enav Weinreb:
Separating the Power of Monotone Span Programs over Different Fields. FOCS 2003: 428-437 - [c17]Amos Beimel, Lior Malka:
Efficient reliable communication over partially authenticated networks. PODC 2003: 233-242 - [i4]Amos Beimel, Tal Malkin:
A Quantitative Approach to Reductions in Secure Computation. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [c16]Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Jean-François Raymond:
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval. FOCS 2002: 261-270 - [c15]Amos Beimel, Yoav Stahl:
Robust Information-Theoretic Private Information Retrieval. SCN 2002: 326-341 - 2001
- [j11]Amos Beimel, Felix Geller, Eyal Kushilevitz:
The Query Complexity of Finding Local Minima in the Lattice. Inf. Comput. 171(1): 69-83 (2001) - [c14]Amos Beimel, Yuval Ishai:
On the Power of Nonlinear Secrect-Sharing. CCC 2001: 188-202 - [c13]Amos Beimel, Yuval Ishai:
Information-Theoretic Private Information Retrieval: A Unified Construction. ICALP 2001: 912-926 - [i3]Amos Beimel, Yuval Ishai:
Information-Theoretic Private Information Retrieval: A Unified Construction. Electron. Colloquium Comput. Complex. TR01 (2001) - [i2]Amos Beimel, Yuval Ishai:
On the Power of Nonlinear Secret-Sharing. IACR Cryptol. ePrint Arch. 2001: 30 (2001) - 2000
- [j10]Amos Beimel, Eyal Kushilevitz:
Learning unions of high-dimensional boxes over the reals. Inf. Process. Lett. 73(5-6): 213-220 (2000) - [j9]Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio:
Learning functions represented as multiplicity automata. J. ACM 47(3): 506-530 (2000) - [j8]Amos Beimel, Mike Burmester, Yvo Desmedt, Eyal Kushilevitz:
Computing Functions of a Shared Secret. SIAM J. Discret. Math. 13(3): 324-345 (2000) - [c12]Amos Beimel, Yuval Ishai, Tal Malkin:
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing. CRYPTO 2000: 55-73
1990 – 1999
- 1999
- [j7]Amos Beimel, Anna Gál:
On Arithmetic Branching Programs. J. Comput. Syst. Sci. 59(2): 195-220 (1999) - [j6]Amos Beimel, Matthew K. Franklin:
Reliable Communication over Partially Authenticated Networks. Theor. Comput. Sci. 220(1): 185-210 (1999) - [c11]Amos Beimel, Tal Malkin, Silvio Micali:
The All-or-Nothing Nature of Two-Party Secure Computation. CRYPTO 1999: 80-97 - [c10]Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tal Malkin:
One-Way Functions Are Essential for Single-Server Private Information Retrieval. STOC 1999: 89-98 - 1998
- [j5]Amos Beimel, Eyal Kushilevitz:
Learning Boxes in High Dimension. Algorithmica 22(1/2): 76-90 (1998) - [j4]Amos Beimel, Benny Chor:
Secret Sharing with Public Reconstruction. IEEE Trans. Inf. Theory 44(5): 1887-1896 (1998) - [c9]Amos Beimel, Anna Gál:
On Arithmetic Branching Programs. CCC 1998: 68-80 - [c8]Amos Beimel, Felix Geller, Eyal Kushilevitz:
The Query Complexity of Finding Local Minima in the Lattice. COLT 1998: 294-302 - 1997
- [j3]Amos Beimel, Anna Gál, Mike Paterson:
Lower Bounds for Monotone Span Programs. Comput. Complex. 6(1): 29-45 (1997) - [c7]Amos Beimel, Eyal Kushilevitz:
Learning Boxes in High Dimension. EuroCOLT 1997: 3-15 - [c6]Amos Beimel, Matthew K. Franklin:
Reliable Communication over Partially Authenticated Networks. WDAG 1997: 245-259 - 1996
- [b1]Amos Beimel:
Secure schemes for secret sharing and key distribution. Technion - Israel Institute of Technology, Israel, 1996 - [j2]Amos Beimel, Benny Chor:
Communication in key distribution schemes. IEEE Trans. Inf. Theory 42(1): 19-28 (1996) - [c5]Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio:
On the Applications of Multiplicity Automata in Learning. FOCS 1996: 349-358 - 1995
- [c4]Amos Beimel, Benny Chor:
Secret Sharing with Public Reconstruction (Extended Abstract). CRYPTO 1995: 353-366 - [c3]Amos Beimel, Anna Gál, Mike Paterson:
Lower Bounds for Monotone Span Programs. FOCS 1995: 674-681 - [i1]Amos Beimel, Anna Gál, Mike Paterson:
Lower Bounds for Monotone Span Programs. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j1]Amos Beimel, Benny Chor:
Universally ideal secret-sharing schemes. IEEE Trans. Inf. Theory 40(3): 786-794 (1994) - 1993
- [c2]Amos Beimel, Benny Chor:
Interaction in Key Distribution Schemes (Extended Abstract). CRYPTO 1993: 444-455 - 1992
- [c1]Amos Beimel, Benny Chor:
Universally Ideal Secret Sharing Schemes (Preliminary Version). CRYPTO 1992: 183-195
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-28 21:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
