World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
37
Citations
6613
World Ranking
10655
National Ranking
172

Overview

Amos Beimel is affiliated with Ben-Gurion University of the Negev in Israel. Their research activity centers predominantly in the field of Computer Science, with a total of 63 publications. The main subfields of study include Artificial Intelligence, Computational Theory and Mathematics, Information Systems, Computer Networks and Communications, and Computer Vision and Pattern Recognition.

Their work covers a range of topics with significant focus on Cryptography and Data Security, Complexity and Algorithms in Graphs, and Privacy-Preserving Technologies in Data. Other research interests extend to Internet Traffic Analysis and Secure E-voting, Coding theory and cryptography, Machine Learning and Algorithms, as well as Cryptography and Residue Arithmetic.

Amos Beimel's recent scholarly contributions include:

  • Linear Secret-Sharing Schemes for Forbidden Graph Access Structures (2021) published in IEEE Transactions on Information Theory
  • Learning Privately with Labeled and Unlabeled Examples (2020) published in Algorithmica
  • The Power of Synergy in Differential Privacy: Combining a Small Curator with Local Randomizers (2020) published in arXiv (Cornell University)
  • The power of synergy in differential privacy: Combining a small curator with local randomizers (2020) published in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • 1/p-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds (2020) published in Journal of Cryptology

The scholar frequently publishes in venues such as arXiv (Cornell University), IEEE Transactions on Information Theory, SIAM Journal on Computing, Algorithmica, and Leibniz-Zentrum für Informatik (Schloss Dagstuhl).

Amos Beimel has worked collaboratively with several researchers including Uri Stemmer, Kobbi Nissim, Eran Omri, Iftach Haitner, and Oriol Farràs. The number of collaborative works ranges from four to seven with these coauthors, indicating sustained research partnerships.

Best Publications

  • Secure schemes for secret sharing and key distribution

    A. Beimel

  • Secret-sharing schemes: a survey

    Amos Beimel

  • Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval

    A. Beimel;Y. Ishai;E. Kushilevitz;J.-F. Raymond

  • Characterizing Ideal Weighted Threshold Secret Sharing

    Amos Beimel;Tamir Tassa;Enav Weinreb

  • Distributed Private Data Analysis: Simultaneously Solving How and What

    Amos Beimel;Kobbi Nissim;Eran Omri

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

    Amos Beimel;Yuval Ishai;Tal Malkin

  • Robust Information-Theoretic Private Information Retrieval

    Amos Beimel;Yoav Stahl

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

    Amos Beimel;Kobbi Nissim;Uri Stemmer

  • Universally ideal secret-sharing schemes

    A. Beimel;B. Chor

  • Buses for anonymous message delivery

    Amos Beimel;Shlomi Dolev

  • General constructions for information-theoretic private information retrieval

    Amos Beimel;Yuval Ishai;Eyal Kushilevitz

  • Learning functions represented as multiplicity automata

    Amos Beimel;Francesco Bergadano;Nader H. Bshouty;Eyal Kushilevitz

  • Information-Theoretic Private Information Retrieval: A Unified Construction

    Amos Beimel;Yuval Ishai

  • Lower bounds for monotone span programs

    Amos Beimel;Anna Gál;Mike Paterson

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

    Amos Beimel;Shiva Prasad Kasiviswanathan;Kobbi Nissim

  • RT oblivious erasure correcting

    Amos Beimel;Shlomi Dolev;Noam Singer

  • Non-Interactive Secure Multiparty Computation

    Amos Beimel;Ariel Gabizon;Yuval Ishai;Eyal Kushilevitz

  • Reducing the Servers’ Computation in Private Information Retrieval: PIR with Preprocessing

    Amos Beimel;Yuval Ishai;Tal Malkin

  • System for reconstruction of a secret shared by a plurality of participants

    Amos Beimel;Ben-Zion Chor

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

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

Frequent Co-Authors

Kobbi Nissim
Kobbi Nissim Georgetown University
Eyal Kushilevitz
Eyal Kushilevitz Technion – Israel Institute of Technology
Yuval Ishai
Yuval Ishai Technion – Israel Institute of Technology
Tal Malkin
Tal Malkin Columbia University
Benny Chor
Benny Chor Tel Aviv University
Shlomi Dolev
Shlomi Dolev Ben-Gurion University of the Negev
Noga Alon
Noga Alon Tel Aviv University
Mike Paterson
Mike Paterson University of Warwick
Yehuda Lindell
Yehuda Lindell Bar-Ilan University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

As you consider a Computer Science education in the USA, it's also valuable to explore online pathways that can accelerate your career. Many students are now taking advantage of certifications that pay well, which offer quick, targeted skills and can lead to high-paying tech roles even without a traditional four-year degree.

If you're looking for speedy advancement, you might consider the quickest cheapest masters degree programs available online. These offer a fast track to advanced computer science knowledge, often allowing you to graduate in as little as one year while saving on tuition costs.

For long-term prospects, researching which master's degree is most in demand in USA can help ensure your educational investment leads directly to growing career opportunities. Computer Science consistently ranks among the most valuable and in-demand options.

Alternatively, those seeking a shorter commitment can pursue 2 year online degrees in computer science or related fields. These programs provide core technical skills and enable quick entry into the workforce, making them an attractive choice for many aspiring tech professionals.

Best Scientists Citing Amos Beimel

Trending Scientists