Shafi Goldwasser

Co-founder and Chief Scientist, Duality Technologies

78 h-index · 39.9K citations · 475 papers

Cryptography

Labs

Berkeley Center for Responsible, Decentralized Intelligence (RDI) · UC Berkeley

CLIMB (Center for Theoretical Foundations) · UC Berkeley

Complexity Theory Group · MIT

Computational Cognitive Science Group · MIT

Computation Structures Group · MIT

Cryptography and Information Security Group · MIT

Simons Institute for the Theory of Computing (SITC) · UC Berkeley

Theory of Computation Group · MIT

Collaborators

Career

· Director, Simons Institute for the Theory of Computing2018–2024

· Co-founder and Chief Scientist, Duality Technologies2016–

· Professor of Computer Science and Applied Mathematics, Weizmann Institute of Science1993–

· Professor of Mathematical Sciences, Weizmann Institute of Science1993–

· Professor, UC Berkeley1984–

· PhD in Computer Science, University of California, Berkeley1984–

· Faculty Member, Massachusetts Institute of Technology (MIT)1983–

· Postdoctoral Researcher, Massachusetts Institute of Technology (MIT)1983–

· RSA Professor of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)1983–

· MS in Computer Science, University of California, Berkeley1981–

· BS in Applied Mathematics, Carnegie Mellon University1979–

· B.S. in Mathematics and Science, Carnegie Mellon University1979–

· Professor EECS, University of California, Berkeley

Publications (475)

The Knowledge Complexity of Interactive Proof Systems

SIAM journal on computing (Print) · 1989

4,690

cited

Probabilistic Encryption

Journal of computer and system sciences (Print) · 1984

3,306

cited

A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

SIAM journal on computing (Print) · 1988

3,016

cited

Completeness theorems for non-cryptographic fault-tolerant distributed computation

Symposium on the Theory of Computing · 1988

2,632

cited

How to construct random functions

JACM · 1986

2,301

cited

Property testing and its connection to learning and approximation

Proceedings of 37th Conference on Foundations of Computer Science · 1996

1,209

cited

Probabilistic encryption & how to play mental poker keeping secret all partial information

Symposium on the Theory of Computing · 1982

1,062

cited

Verifiable secret sharing and achieving simultaneity in the presence of faults

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · 1985

975

cited

Machine Learning Classification over Encrypted Data

Network and Distributed System Security Symposium · 2015

753

cited

Delegating computation: interactive proofs for muggles

Symposium on the Theory of Computing · 2008

721

cited

Public-Key Cryptosystems from Lattice Reduction Problems

Annual International Cryptology Conference · 1996

654

cited

Complexity of lattice problems - a cryptographic perspective

The Kluwer International Series in Engineering and Computer Science · 2002

644

cited

Private coins versus public coins in interactive proof systems

Symposium on the Theory of Computing · 1986

573

cited

Multi-prover interactive proofs: how to remove intractability assumptions

Symposium on the Theory of Computing · 2019

544

cited

Interactive proofs and the hardness of approximating cliques

JACM · 1996

520

cited

Simultaneous Hardcore Bits and Cryptography against Memory Attacks

Theory of Cryptography Conference · 2009

495

cited

Approximating clique is almost NP-complete

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science · 1991

466

cited

The knowledge complexity of interactive proof-systems

Symposium on the Theory of Computing · 1985

464

cited

Reusable garbled circuits and succinct functional encryption

Symposium on the Theory of Computing · 2013

440

cited

Functional Signatures and Pseudorandom Functions

International Conference on Theory and Practice of Public Key Cryptography · 2014

431

cited

Sotabase