Massachusetts Institute of Technology
Computer scientist; Educator
Mathematical and Physical Sciences
Recognized world leader in the fields of cryptography, complexity theory, and computational number theory. She has a rich research record and is particularly noted for her pioneering work on interactive and zero-knowledge proofs and their connection to the hardness of approximation. For her work on interactive proofs, she received the Godel prize in theoretical computer science (1993 and 2001). Recipient of the Grace Murray Hopper Award for Computer Science, the RSA Prize for Mathematics and the Levenson Prize for Mathematics.