Shafi Goldwasser
About
In The Last Decade
Shafi Goldwasser
87 papers receiving 7.5k citations
Hit Papers
Peers
Comparison fields: 5 of 112
- Artificial Intelligence 7.3k
- Computational Theory and Mathematics 2.7k
- Information Systems 2.2k
- Computer Networks and Communications 1.7k
- Computer Vision and Pattern Recognition 1.2k
Countries citing papers authored by Shafi Goldwasser
This map shows the geographic impact of Shafi Goldwasser's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Shafi Goldwasser with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Shafi Goldwasser more than expected).
Fields of papers citing papers by Shafi Goldwasser
This network shows the impact of papers produced by Shafi Goldwasser. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Shafi Goldwasser. The network helps show where Shafi Goldwasser may publish in the future.
Co-authorship network of co-authors of Shafi Goldwasser
This figure shows the co-authorship network connecting the top 25 collaborators of Shafi Goldwasser. A scholar is included among the top collaborators of Shafi Goldwasser based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Shafi Goldwasser. Shafi Goldwasser is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 19 | |
| 3 | 1 | |
| 4 | Practical Accountability of Secret Processes | 10 |
| 5 | On the Fine Grained Complexity of Polynomial Time Problems Given Correlated Instances. | 0 |
| 6 | Splinter: Practical Private Queries on Public Data. | 17 |
| 7 | Perfect Bipartite Matching in Pseudo-Deterministic RNC. | 4 |
| 8 | Aggregate Pseudorandom Functions and Connections to Learning. | 1 |
| 9 | The impossibility of obfuscation with a universal simulator | 1 |
| 10 | On Best-Possible Obfuscation | 2 |
| 11 | Functional Signatures and Pseudorandom Functions | 9 |
| 12 | How to Compute in the Presence of Leakage. | 1 |
| 13 | Probabilistic Search Algorithms with Unique Answers and Their Cryptographic Applications. | 13 |
| 14 | Robustness of the Learning with Errors Assumption | 29 |
| 15 | Circular and Leakage Resilient Public-Key Encryption Under Subgroup Indistinguishability (or: Quadratic Residuosity Strikes Back). | 13 |
| 16 | On the (In) security of the Fiat-Shamir Paradigm | 14 |
| 17 | An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack | 54 |
| 18 | Property Testing and its connection to Learning and Approximation | 3 |
| 19 | Collision-Free Hashing from Lattice Problems | 30 |
| 20 | Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) | 130 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.