Search Mailing List Archives

Limit search to: Subject & Body Subject Author
Sort by: Reverse Sort
Limit to: All This Week Last Week This Month Last Month
Select Date Range     through    

[liberationtech] 2012 ACM Turing Award Recipients Announced

Steve Weis steveweis at
Wed Mar 13 10:54:53 PDT 2013

This is great and well deserved. They've made a huge impact on the field of
cryptography, in particular zero-knowledge proofs.

These are some of their seminal papers:
"Probabilistic encryption & How to play mental poker keeping secret all
partial information"
"The knowledge complexity of interactive proof-systems"
"How to construct random functions"
"A digital signature scheme secure against adaptive chosen-message attacks"
"Proofs that yield nothing but their validity or all languages in NP have
zero-knowledge proof systems"

On Wed, Mar 13, 2013 at 10:22 AM, Yosem Companys <companys at>wrote:

> From: DAVID J. FARBER <farber at>
> The Association for Computing Machinery (ACM) has announced Massachusetts
> Institute of Technology (MIT) researchers, Shafi Goldwasser and Silvio
> Micali, are recipients of the 2012 A.M. Turing Award. Their innovations
> became the gold standard for enabling secure internet transactions. The
> Turing award is widely considered the “Nobel Prize in Computing,” and
> carries a $250,000 prize, with financial support provided by Intel
> Corporation and Google Inc.
> According to the ACM press release, “Working together, they pioneered the
> field of provable security, which laid the mathematical foundations that
> made modern cryptography possible. By formalizing the concept that
> cryptographic security had to be computational rather than absolute, they
> created mathematical structures that turned cryptography from an art into a
> science. Their work addresses important practical problems such as the
> protection of data from being viewed or modified, providing a secure means
> of communications and transactions over the Internet. Their advances led to
> the notion of interactive and probabilistic proofs and had a profound
> impact on computational complexity, an area that focuses on classifying
> computational problems according to their inherent difficulty.”
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <>

More information about the liberationtech mailing list