• go to Michael O. Rabin 's profile page
  • go to Amir Pnueli's profile page
  • go to Raj Reddy's profile page
  • go to John L Hennessy's profile page
  • go to Herbert A. Simon's profile page
  • go to Ivan Sutherland's profile page
  • go to Allen Newell 's profile page
  • go to Juris Hartmanis's profile page
  • go to Alan Kay's profile page
  • go to Sir Tim Berners-Lee's profile page
  • go to Edwin Catmull's profile page
  • go to Kenneth E. Iverson 's profile page
  • go to Ole-Johan Dahl 's profile page
  • go to Vinton Cerf's profile page
  • go to Kristen Nygaard 's profile page
  • go to Edsger W. Dijkstra's profile page
  • go to Andrew C Yao's profile page
  • go to John McCarthy's profile page
  • go to Silvio Micali's profile page
  • go to Donald E. Knuth's profile page
  • go to Frederick Brooks's profile page
  • go to Robert W. Floyd's profile page
  • go to J. H. Wilkinson 's profile page
  • go to Yann LeCun's profile page

Shafi Goldwasser DL Author Profile link

United States, Israel – 2012
Additional Materials

Assumptions in Cryptography

There are few algorithms in cryptography that can absolutely be proven secure. The most famous example is a “one-time pad”, where one uses an n-bit key to securely send an n-bit message across a channel that is subject to an eavesdropper.

For most cryptographic tasks, however, we know of no such proof of security. Even if we merely want to use an n-bit key to send an n+1-bit message, we know of no provably secure way of doing this. In fact, if P=NP (a statement we are unable to prove false), then most cryptographic tasks cannot be done securely. Most cryptography security proofs are therefore based on computational complexity assumptions. PNP is not strong enough, and one really needs an average-case version of PNP. One such assumption is that a specific function is “one-way function,” meaning that it can be computed efficiently, but cannot be efficiently inverted on the average. For many tasks, such as public-key encryption, even stronger assumptions are needed. An example of one of these stronger assumptions is that large random integers cannot be efficiently factored.


Proofs Probable

Neil Savage, Communications of the ACM, Volume 56 Issue 6, June 2013, Pages 22-24Shafi Goldwasser and Silvio Micali laid the foundations for modern cryptography, with contributions including interactive and zero-knowledge proofs.


Leah Hoffman, Communications of the ACM, Volume 56 Issue 6, June 2013, Pages 120-ffTuring Award recipients Shafi Goldwasser and Silvio Micali talk about proofs, probability, and poker.


Shafi has done in interesting one-hour interview with Stephen Ibaraki. The transcript text can be found here and you can listen to the audio recording as an MP3 file here.

Watch a brief video about Shafi Goldwasser, Silvio Micali, and the ACM A.M. Turing Award