Charles Rackoff
University of Toronto(CA)
Publications by Year
Research Areas
Cryptography and Data Security, Complexity and Algorithms in Graphs, Computability, Logic, AI Algorithms, Cryptographic Implementations and Security, Chaos-based Image/Signal Encryption
Most-Cited Works
- → The Knowledge Complexity of Interactive Proof Systems(1989)3,211 cited
- → The knowledge complexity of interactive proof-systems(1985)1,230 cited
- → Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack(2007)1,041 cited
- → How to Construct Pseudorandom Permutations from Pseudorandom Functions(1988)921 cited
- → Random walks, universal traversal sequences, and the complexity of maze problems(1979)703 cited
- → The covering and boundedness problems for vector addition systems(1978)375 cited
- → Fast Parallel Computation of Polynomials Using Few Processors(1983)279 cited