Charles Rackoff

from Wikipedia, the free encyclopedia

Charles Weill Rackoff (born November 26, 1948 in New York City ) is an American computer scientist and cryptographer .

Rackoff studied at the Massachusetts Institute of Technology , where he received his doctorate in 1974 with Albert Ronald da Silva Meyer ( The Computational Complexity of Some Logical Theories ). As a post-doc he was at INRIA in Paris. He is a professor at the University of Toronto , where he has been since 1974.

Rackoff dealt with complexity theory . Together with Silvio Micali and Shafi Goldwasser , he introduced interactive proof systems and zero-knowledge proofs in 1982 , for which the three received the first Gödel Prize in 1993 .

Fonts

  • with Shafi Goldwasser, Silvio Micali: The knowledge complexity of interactive proof systems . SIAM Journal on Computing, Volume 18, 1989, pp. 186–208 and STOC (ACM Symposium on the theory of computing) 1985 (preprints of the work are said to have circulated as early as 1982)
  • with D. Simon: Non-interactive zero-knowledge proof of knowledge and the chosen cipertext attack . In Proc. of Crypto 91, pp. 433-444.
  • with D. Simon: Cryptographic defense against traffic analysis . In Proc. of the 25th ACM Symp. on Theory of Computing, May 1993, pages 672-681.

Web links