| The knowledge complexity of interactive proof-systems S Goldwasser, S Micali, C Rackoff Providing sound foundations for cryptography: On the work of shafi …, 2019 | 7029 | 2019 |
| Probabilistic encryption & how to play mental poker keeping secret all partial information S Goldwasser, S Micali Providing sound foundations for cryptography: on the work of Shafi …, 2019 | 6710 | 2019 |
| A digital signature scheme secure against adaptive chosen-message attacks S Goldwasser, S Micali, RL Rivest SIAM Journal on computing 17 (2), 281-308, 1988 | 4093 | 1988 |
| Completeness theorems for non-cryptographic fault-tolerant distributed computation M Ben-Or, S Goldwasser, A Wigderson Providing sound foundations for cryptography: on the work of Shafi …, 2019 | 4089 | 2019 |
| How to construct random functions O Goldreich, S Goldwasser, S Micali Journal of the ACM (JACM) 33 (4), 792-807, 1986 | 3296 | 1986 |
| Property testing and its connection to learning and approximation O Goldreich, S Goldwasser, D Ron Journal of the ACM (JACM) 45 (4), 653-750, 1998 | 1472 | 1998 |
| Verifiable secret sharing and achieving simultaneity in the presence of faults B Chor, S Goldwasser, S Micali, B Awerbuch 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 383-395, 1985 | 1458 | 1985 |
| Complexity of lattice problems: a cryptographic perspective D Micciancio, S Goldwasser Springer Science & Business Media, 2002 | 1109 | 2002 |
| Machine learning classification over encrypted data R Bost, RA Popa, S Tu, S Goldwasser Cryptology ePrint Archive, 2014 | 1080 | 2014 |
| Delegating computation: interactive proofs for muggles S Goldwasser, YT Kalai, GN Rothblum Journal of the ACM (JACM) 62 (4), 1-64, 2015 | 1021 | 2015 |
| Public-key cryptosystems from lattice reduction problems O Goldreich, S Goldwasser, S Halevi Annual International Cryptology Conference, 112-131, 1997 | 997 | 1997 |
| Private coins versus public coins in interactive proof systems S Goldwasser, M Sipser Proceedings of the eighteenth annual ACM symposium on Theory of computing, 59-68, 1986 | 749 | 1986 |
| Multi-prover interactive proofs: How to remove intractability assumptions M Ben-Or, S Goldwasser, J Kilian, A Wigderson Providing Sound Foundations for Cryptography: On the Work of Shafi …, 2019 | 724 | 2019 |
| Simultaneous hardcore bits and cryptography against memory attacks A Akavia, S Goldwasser, V Vaikuntanathan Theory of cryptography conference, 474-495, 2009 | 635 | 2009 |
| Approximating clique is almost NP-complete U Feige, S Goldwasser, L Lovász, S Safra, M Szegedy [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science …, 1991 | 613 | 1991 |
| Interactive proofs and the hardness of approximating cliques U Feige, S Goldwasser, L Lovász, S Safra, M Szegedy Journal of the ACM (JACM) 43 (2), 268-292, 1996 | 606 | 1996 |
| Reusable garbled circuits and succinct functional encryption S Goldwasser, Y Kalai, RA Popa, V Vaikuntanathan, N Zeldovich Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 599 | 2013 |
| Functional signatures and pseudorandom functions E Boyle, S Goldwasser, I Ivan International workshop on public key cryptography, 501-519, 2014 | 554 | 2014 |
| On the (in) security of the Fiat-Shamir paradigm S Goldwasser, YT Kalai 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003 | 511 | 2003 |
| Multi-input functional encryption S Goldwasser, SD Gordon, V Goyal, A Jain, J Katz, FH Liu, A Sahai, E Shi, ... Annual International Conference on the Theory and Applications of …, 2014 | 488 | 2014 |
Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceVerified email at weizmann.ac.il
