Follow
Shafi Goldwasser
Shafi Goldwasser
professor of computer science at UC Berkeley
Verified email at csail.mit.edu
Title
Cited by
Cited by
Year
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
63212019
The knowledge complexity of interactive proof-systems
S Goldwasser, S Micali, C Rackoff
Providing sound foundations for cryptography: On the work of shafi …, 2019
59792019
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
38451988
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
37162019
How to construct random functions
O Goldreich, S Goldwasser, S Micali
Journal of the ACM (JACM) 33 (4), 792-807, 1986
29401986
VERIFIABLE SECRET SHARING AND ACHIEVING SIMULTANEITY IN THE PRESENCE OF FAULTS.
B Choc, S Goldwasser, S Micali, B Awerbuch
Annual Symposium on Foundations of Computer Science (Proceedings), 383-395, 1985
13641985
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
13451998
Complexity of lattice problems: a cryptographic perspective
D Micciancio, S Goldwasser
Springer Science & Business Media, 2002
9842002
Machine learning classification over encrypted data
R Bost, RA Popa, S Tu, S Goldwasser
Cryptology ePrint Archive, 2014
9552014
Public-key cryptosystems from lattice reduction problems
O Goldreich, S Goldwasser, S Halevi
Advances in Cryptology—CRYPTO'97: 17th Annual International Cryptology …, 1997
9131997
Delegating computation: interactive proofs for muggles
S Goldwasser, YT Kalai, GN Rothblum
Journal of the ACM (JACM) 62 (4), 1-64, 2015
8282015
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
6961986
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
6842019
Simultaneous hardcore bits and cryptography against memory attacks
A Akavia, S Goldwasser, V Vaikuntanathan
Theory of cryptography conference, 474-495, 2009
5982009
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
5881991
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
5501996
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
5172013
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
M Blum, S Goldwasser
Advances in Cryptology: Proceedings of CRYPTO 84 4, 289-299, 1985
4681985
Efficient probabilistically checkable proofs and applications to approximations
M Bellare, S Goldwasser, C Lund, A Russell
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993
4611993
Functional signatures and pseudorandom functions
E Boyle, S Goldwasser, I Ivan
International workshop on public key cryptography, 501-519, 2014
4602014
The system can't perform the operation now. Try again later.
Articles 1–20