World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
31
Citations
4002
World Ranking
13685
National Ranking
206

Overview

Elette Boyle is affiliated with Reichman University in Israel and specializes primarily in the field of Computer Science. Their research publications focus extensively on cryptography, computational theory, and networking within computer science.

Their scholarly output includes papers published in venues such as the Journal of Cryptology, Leibniz-Zentrum für Informatik (Schloss Dagstuhl), Lecture Notes in Computer Science, and arXiv (Cornell University). Recent publications authored by Elette Boyle are:

  • Breaking the $$O(\sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party, 2023, Journal of Cryptology
  • Must the Communication Graph of MPC Protocols be an Expander?, 2023, Journal of Cryptology

While some works in related areas list other authors, Elette Boyle holds primary authorship in the above publications.

Frequent coauthors collaborating with Elette Boyle include:

  • Niv Gilboa
  • Yuval Ishai
  • Ran Cohen
  • Lisa Kohl
  • Geoffroy Couteau

Most publications by Elette Boyle fall within the main field of Computer Science, with special attention to subfields such as Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Information Systems, and Computer Vision and Pattern Recognition.

The researcher's work prominently addresses topics including:

  • Cryptography and Data Security
  • Complexity and Algorithms in Graphs
  • Privacy-Preserving Technologies in Data
  • Internet Traffic Analysis and Secure E-voting
  • Cooperative Communication and Network Coding
  • Cryptographic Implementations and Security
  • Distributed systems and fault tolerance

Best Publications

  • Functional Signatures and Pseudorandom Functions

    Elette Boyle;Shafi Goldwasser;Ioana Ivan

  • Function Secret Sharing

    Elette Boyle;Niv Gilboa;Yuval Ishai

  • Function Secret Sharing: Improvements and Extensions.

    Elette Boyle;Niv Gilboa;Yuval Ishai

  • Efficient Pseudorandom Correlation Generators: Silent OT Extension and More

    Elette Boyle;Geoffroy Couteau;Niv Gilboa;Yuval Ishai

  • On Extractability Obfuscation

    Elette Boyle;Kai-Min Chung;Rafael Pass

  • Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation.

    Elette Boyle;Geoffroy Couteau;Niv Gilboa;Yuval Ishai

  • Compressing Vector OLE.

    Elette Boyle;Geoffroy Couteau;Niv Gilboa;Yuval Ishai

  • Breaking the Circuit Size Barrier for Secure Computation Under DDH.

    Elette Boyle;Niv Gilboa;Yuval Ishai

  • Oblivious Parallel RAM and Applications

    Elette Boyle;Kai-Min Chung;Rafael Pass

  • Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation

    Elette Boyle;Nishanth Chandran;Niv Gilboa;Divya Gupta

  • Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs

    Dan Boneh;Elette Boyle;Henry Corrigan-Gibbs;Niv Gilboa

  • Efficient Pseudorandom Correlation Generators from Ring-LPN

    Elette Boyle;Geoffroy Couteau;Niv Gilboa;Yuval Ishai

  • Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation.

    Elette Boyle;Niv Gilboa;Yuval Ishai

  • Fully leakage-resilient signatures

    Elette Boyle;Gil Segev;Daniel Wichs

  • Homomorphic Secret Sharing: Optimizations and Applications.

    Elette Boyle;Geoffroy Couteau;Niv Gilboa;Yuval Ishai

  • Limits of Extractability Assumptions with Distributional Auxiliary Input

    Elette Boyle;Rafael Pass

  • Communication locality in secure multi-party computation: how to run sublinear algorithms in a distributed setting

    Elette Boyle;Shafi Goldwasser;Stefano Tessaro

  • Secure Computation with Preprocessing via Function Secret Sharing.

    Elette Boyle;Niv Gilboa;Yuval Ishai

  • Homomorphic Secret Sharing from Lattices Without FHE

    Elette Boyle;Lisa Kohl;Peter Scholl

  • Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs

    Elette Boyle;Kai-Min Chung;Rafael Pass

Frequent Co-Authors

Yuval Ishai
Yuval Ishai Technion – Israel Institute of Technology
Rafael Pass
Rafael Pass Cornell University
Shafi Goldwasser
Shafi Goldwasser University of California, Berkeley
Dan Boneh
Dan Boneh Stanford University
Gil Segev
Gil Segev Hebrew University of Jerusalem
Alon Rosen
Alon Rosen Bocconi University
Tal Malkin
Tal Malkin Columbia University
Abhishek Jain
Abhishek Jain Johns Hopkins 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

Exploring Computer Science in the USA opens the door to a wide variety of educational and career pathways. If you’re considering flexible study options, many prestigious institutions now offer fully accredited online degrees that can be tailored to your interests and schedule.

For those in a hurry to enter the workforce, a fast track computer science degree is a great option. These programs allow you to complete your studies at an accelerated pace, helping you earn your credentials faster.

Career options are not limited to computer science alone. You may want to explore related fields such as environmental science or engineering. If you’ve ever wondered what jobs can you get with an environmental science degree, you’ll discover opportunities in research, conservation, and policy analysis.

Aspiring engineers can pursue the environmental engineering online degree or an online degree in mechanical engineering. These affordable options help you gain specialized skills from anywhere, supporting career advancement in dynamic STEM industries.

Best Scientists Citing Elette Boyle

Trending Scientists

Recently Published Articles