Goldwasser has twice won the Gödel Prize in theoretical computer science: first in 1993 (for "The knowledge complexity of interactive proof systems"), and again in 2001 (for "Interactive Proofs and the Hardness of Approximating Cliques").
Goldwasser har vunnit Gödel Pris i teoretisk datalogi vid två tillfällen: först 1993 (för "The knowledge complexity of interactive proof systems"), och 2001 (för "Interactive Proofs and the Hardness of Approximating Cliques").