Shafi Goldwasser
Artificial Intelligence · 1982–2020
A researcher in the Science corpus: 23 papers; trusts 55 researchers and is trusted by 152 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 182 citations into it; #4,716 of 36,961 by trust here, #6,030 by citations
- Computational Theory and Mathematics — 97 citations into it; #184 of 12,489 by trust here, #113 by citations
- Privacy & Security — 52 citations into it; #43 of 710 by trust here, #27 by citations
- Computer Networks and Communications — 41 citations into it; #181 of 9,996 by trust here, #117 by citations
- Information Systems — 40 citations into it; #2,662 of 9,233 by trust here, #5,022 by citations
- Computer Vision and Pattern Recognition — 33 citations into it; #12,638 of 21,973 by trust here, #10,964 by citations
- Algorithms & Complexity — 12 citations into it; #31 of 516 by trust here, #16 by citations
- Discrete Mathematics and Combinatorics — 8 citations into it
Whom Shafi Goldwasser trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Silvio Micali
- Mihir Bellare
- Craig Gentry
- Adi Shamir
- Amit Sahai
- Oded Goldreich
- Brent Waters
- Dan Boneh
- Amos Fiat
- Oded Regev
Who trusts Shafi Goldwasser overall
- Mihir Bellare
- Ran Canetti
- Dan Boneh
- Oded Goldreich
- Srinath T. V. Setty
- Yehuda Lindell
- Eli Ben-Sasson
- Birgit Pfitzmann
- Hugo Krawczyk
- Yih-Chun Hu
Papers from Shafi Goldwasser's perspective
Ordered by how strongly the researchers Shafi Goldwasser trusts endorse each paper. Same corpus, a different order for every researcher.
- New Directions in Cryptography
- Random oracles are practical: a paradigm for designing efficient protocols
- Probabilistic Encryption
- A method for obtaining digital signatures and public-key cryptosystems
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Protocols for secure computations
- Conjunctive, Subset, and Range Queries on Encrypted Data (Theory of Cryptography Conference)
- Non-interactive zero-knowledge and its applications
- Public Key Encryption with Keyword Search (International Conference on the Theory and Application of Cryptographic Techniques)
- How to share a secret
Their papers
- Homomorphic Encryption Standard (2019) — 295 citations
- The Knowledge Complexity of Interactive Proof Systems (1989)
- Completeness theorems for non-cryptographic fault-tolerant distributed computation (1988)
- Delegating computation: interactive proofs for muggles (2008) — 749 citations
- Complexity of lattice problems (2002) — 403 citations
- Formalizing Data Deletion in the Context of the Right to Be Forgotten (2020) — 98 citations
- Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (2012) — 79 citations
- SECURITY OF HOMOMORPHIC ENCRYPTION (2017)
- Machine Learning Classification over Encrypted Data (2015) — 773 citations
- Multi-Input Functional Encryption (2014) — 343 citations
- Functional Signatures and Pseudorandom Functions (2014) — 437 citations
- Reusable garbled circuits and succinct functional encryption (2013) — 441 citations
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks (2009) — 498 citations
- On the (In)security of the Fiat-Shamir paradigm (2003) — 381 citations
- Complexity of lattice problems - a cryptographic perspective (2002) — 661 citations
- Lecture Notes on Cryptography (2001) — 327 citations
- Property testing and its connection to learning and approximation (1996)
- Collision-Free Hashing from Lattice Problems (1996)
- Multi-prover interactive proofs: how to remove intractability assumptions (1988)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks (1988)