About Contribute GitHub
Menu

Charles Rackoff

Rackoff co-authored foundational work on the knowledge complexity of interactive proof systems. That line of work gave cryptography a more rigorous language for showing knowledge without disclosing a secret.

Charles Rackoff is a computer scientist at the University of Toronto whose research spans cryptography and computational complexity. University material identifies cryptography, security, and security protocols among his areas of work.

Knowledge without disclosure

With Shafi Goldwasser and Silvio Micali, Rackoff helped develop the theoretical study of knowledge complexity in interactive proof systems. This work is central to the idea that a prover can demonstrate knowledge while revealing no useful additional information.

Lasting foundations

Interactive-proof and zero-knowledge ideas became core tools in modern cryptographic protocol design. Rackoff's work belongs to the foundational literature rather than a single deployed product or exploit.

Timeline

  • 1970sBegins publishing in computational complexity and cryptography.
  • 1985Co-authors the foundational paper on knowledge complexity of interactive proof systems.
  • PresentContinues teaching and research in cryptography at the University of Toronto.
Charles Rackoff
Type
Person
Era
1970s-Present
Known for
Interactive proofs; Zero-knowledge proofs; Cryptography
Tags
cryptography, complexity-theory, zero-knowledge, interactive-proofs
Created by Joas A Santos · Something wrong or want it removed? Open an issue.