2026 Shafi Goldwasser: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	88	662	642	352	341	203	51768

Research.com Recognitions

2017 - BBVA Foundation Frontiers of Knowledge Award
2017 - ACM Fellow For transformative work that laid the complexity-theoretic foundations for the science of cryptography
2012 - A. M. Turing Award Along with Silvio Micali, for transformative work that laid the complexity-theoretic foundations for the science of cryptography, and in the process pioneered new methods for efficient verification of mathematical proofs in complexity theory.
2008 - ACM Athena Lecturer Award Dr. Goldwasser's Athena Lecture took place at the ACM Symposium on the Theory of Computing, sponsored by SIGACT, in May 2009.
2001 - Fellow of the American Academy of Arts and Sciences
1996 - ACM Grace Murray Hopper Award For her early work relating computation, randomness, knowledge committee and proofs, which has shaped the foundations of probabilistic computation theory, computational number theory, and cryptography. This work is a continuing influence in design and certification of secure communications protocols, with practical applications to development of secure networks and computer systems.

Overview

Shafi Goldwasser is affiliated with the University of California, Berkeley in the United States. Their research primarily lies in computer science, focused on areas including artificial intelligence, computational theory and mathematics, statistics and probability, ecology, and developmental biology.

Their extensive work covers several main topics such as cryptography and data security, privacy-preserving technologies in data, adversarial robustness in machine learning, machine learning and algorithms, marine animal studies overview, animal vocal communication and behavior, and underwater acoustics research.

Among recent published papers, Goldwasser has contributed to:

"Secure large-scale genome-wide association studies using homomorphic encryption," 2020, Proceedings of the National Academy of Sciences
"Toward understanding the communication in sperm whales," 2022, iScience
"Planting Undetectable Backdoors in Machine Learning Models: [Extended Abstract]," 2022, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
"Verification Dilemmas, Law, and the Promise of Zero-Knowledge Proofs," 2021, SSRN Electronic Journal
"Collaborative privacy-preserving analysis of oncological data using multiparty homomorphic encryption," 2023, Proceedings of the National Academy of Sciences

Frequent co-authors collaborating with Goldwasser include Orr Paradise, Guy N. Rothblum, David F. Gruber, Michael P. Kim, and Vinod Vaikuntanathan.

Their publications are often found in venues such as:

arXiv (Cornell University)
Proceedings of the National Academy of Sciences
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
SSRN Electronic Journal
iScience

Over the course of their career, Goldwasser has received various recognitions including:

ACM Fellow in 2017 for transformative work laying the complexity-theoretic foundations for the science of cryptography
BBVA Foundation Frontiers of Knowledge Award in 2017
A. M. Turing Award in 2012, shared with Silvio Micali, for foundational contributions to cryptography and new methods for efficient verification of mathematical proofs in complexity theory
ACM Athena Lecturer Award in 2008
Fellow of the American Academy of Arts and Sciences in 2001
ACM Grace Murray Hopper Award in 1996 for early influential work on probabilistic computation theory, computational number theory, and cryptography

Best Publications

The knowledge complexity of interactive proof systems

S. Goldwasser;S. Micali;C. Rackoff

6252
Citations
Completeness theorems for non-cryptographic fault-tolerant distributed computation

Michael Ben-Or;Shafi Goldwasser;Avi Wigderson

3832
Citations
A digital signature scheme secure against adaptive chosen-message attacks

Shafi Goldwasser;Silvio Micali;Ronald L. Rivest

3770
Citations
Probabilistic Encryption

Unknown

3464
Citations
Completeness theorems for non-cryptographic fault-tolerant distributed computation

Michael Ben-Or;Shafi Goldwasser;Avi Wigderson

3274
Citations
How to construct random functions

Oded Goldreich;Shafi Goldwasser;Silvio Micali

2847
Citations
Property testing and its connection to learning and approximation

Oded Goldreich;Shari Goldwasser;Dana Ron

1451
Citations
Public-key cryptosystems from lattice reduction problems

O. Goldreich;S. Goldwasser;S. Halevi

1443
Citations
Verifiable secret sharing and achieving simultaneity in the presence of faults

Benny Chor;Shafi Goldwasser;Silvio Micali;Baruch Awerbuch

1326
Citations
Complexity of lattice problems : a cryptographic perspective

Daniele Micciancio;S. Goldwasser

882
Citations
Machine Learning Classification over Encrypted Data

Raphael Bost;Raluca Ada Popa;Stephen Tu;Shafi Goldwasser

850
Citations
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)

Michael Ben-Or;Shafi Goldwasser;Avi Wigderson

832
Citations
Delegating Computation: Interactive Proofs for Muggles

Shafi Goldwasser;Yael Tauman Kalai;Guy N. Rothblum

743
Citations
Private coins versus public coins in interactive proof systems

S Goldwasser;M Sipser

736
Citations
Multi-prover interactive proofs: how to remove intractability assumptions

Michael Ben-Or;Shafi Goldwasser;Joe Kilian;Avi Wigderson

719
Citations
Delegating computation: interactive proofs for muggles

Shafi Goldwasser;Yael Tauman Kalai;Guy N. Rothblum

679
Citations
Simultaneous Hardcore Bits and Cryptography against Memory Attacks

Adi Akavia;Shafi Goldwasser;Vinod Vaikuntanathan

604
Citations
Approximating clique is almost NP-complete

U. Feige;S. Goldwasser;L. Lovasz;S. Safra

597
Citations
Interactive proofs and the hardness of approximating cliques

Uriel Feige;Shafi Goldwasser;Laszlo Lovász;Shmuel Safra

566
Citations
Reusable garbled circuits and succinct functional encryption

Shafi Goldwasser;Yael Kalai;Raluca Ada Popa;Vinod Vaikuntanathan

555
Citations
Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract)

Benny Chor;Shafi Goldwasser;Silvio Micali;Baruch Awerbuch

179
Citations
Delegating Computation: Interactive Proofs for Muggles.

Shafi Goldwasser;Guy N. Rothblum;Yael Tauman Kalai

6
Citations

Frequent Co-Authors

Oded Goldreich Weizmann Institute of Science

Silvio Micali MIT

Yael Tauman Kalai MIT

Guy N. Rothblum Weizmann Institute of Science

Mihir Bellare University of California, San Diego

Shai Halevi Amazon (United States)

Ran Canetti Boston University

Vinod Vaikuntanathan MIT

Elette Boyle Reichman University

Daniele Micciancio University of California, San Diego

External Links

Wikipedia of Shafi Goldwasser Personal website of Shafi Goldwasser

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

Related Online Degrees & Career Pathways

Studying Computer Science in the USA opens doors to a variety of advanced degrees and career options. Many students and professionals are now turning to online education for its flexibility and affordability. For those interested in expanding their skillset, there are numerous affordable master degree programs available online, allowing learners to upskill without breaking the bank.

If you're looking to merge technical expertise with business leadership, pursuing the cheapest executive mba programs online can be a smart choice. This pathway prepares graduates for managerial roles in tech-driven organizations.

For those interested in a more specialized route, a masters in library science offers skills in information management and digital resources—highly valuable in today’s data-rich environments.

Ambitious professionals aiming to lead change and innovation can consider a doctorate organizational leadership online to develop strategic leadership abilities for top-tier positions across industries.