Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Charles Rackoff

Also Known As Charles Weill Rackoff
Security And Privacy

Charles Weill Rackoff (born November 26, 1948, in New York City) is an American cryptologist and professor at the University of Toronto specializing in computational complexity theory, cryptography and security protocols. He earned his PhD in computer science from MIT in 1974 and completed a postdoctoral fellowship at INRIA in France. With Shafi Goldwasser and Silvio Micali he helped develop interactive proof systems and formalize zero-knowledge proofs in the 1980s, and with Michael Luby he published a widely cited 1988 analysis showing how to construct pseudorandom permutation generators from pseudorandom function generators. He and four collaborators received the 1993 Godel Prize for the work on interactive proofs, and the RSA Award for Excellence in Mathematics in 2011.

Facts
Birth Year
1948 1
Birth Date
1948-11-26 1
Connections

Invented

Verified en.wikipedia.org/wiki/Zero-knowledge_proof: "Zero-knowledge proofs were first conceived in 1985 by Shafi Goldwasser, Silvio Micali, and Charles Rackoff in their paper The Knowledge Complexity of Interactive Proof-Systems."

Sources
1. Charles Rackoff (Wikidata)
  • Wikidata alias: Charles Weill Rackoff
    Charles Weill Rackoff
  • Wikidata P166: Gödel Prize
    Wikidata P166 (award received): Gödel Prize.
  • Wikidata P166: IACR Fellow
    Wikidata P166 (award received): IACR Fellow.
  • P569 (date of birth): year 1948
    1948
  • P569 (date of birth): 1948-11-26
    1948-11-26
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.