| 2014 | SCN | Secure Key Exchange and Sessions without Credentials. | Ran Canetti, Vladimir Kolesnikov, Charles Rackoff, Yevgeniy Vahlis |
| 2008 | FOCS | On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations. | Dan Boneh, Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis, Brent Waters |
| 2008 | ICALP | Password Mistyping in Two-Factor-Authenticated Key Exchange. | Vladimir Kolesnikov, Charles Rackoff |
| 2008 | TCC | On Seed-Incompressible Functions. | Shai Halevi, Steven A. Myers, Charles Rackoff |
| 2006 | TCC | Key Exchange Using Passwords and Long Keys. | Vladimir Kolesnikov, Charles Rackoff |
| 2004 | ICALP | Simple Permutations Mix Well. | Shlomo Hoory, Avner Magen, Steven A. Myers, Charles Rackoff |
| 2004 | ICALP | Efficient Consistency Proofs for Generalized Queries on a Committed Database. | Rafail Ostrovsky, Charles Rackoff, Adam D. Smith |
| 2002 | SODA | (Incremental) priority algorithms. | Allan Borodin, Morten N. Nielsen, Charles Rackoff |
| 1998 | FOCS | Lower Bounds for Zero Knowledge on the Internet. | Joe Kilian, Erez Petrank, Charles Rackoff |
| 1993 | STOC | Cryptographic defense against traffic analysis. | Charles Rackoff, Daniel R. Simon |
| 1991 | CRYPTO | Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. | Charles Rackoff, Daniel R. Simon |
| 1988 | CRYPTO | A Basic Theory of Public and Private Cryptosystems. | Charles Rackoff |
| 1987 | CRYPTO | A Study of Password Security. | Michael Luby, Charles Rackoff |
| 1986 | CRYPTO | The Notion of Security for Probabilistic Cryptosystems. | Silvio Micali, Charles Rackoff, Bob Sloan |
| 1986 | STOC | Pseudo-random Permutation Generators and Cryptographic Composition | Michael Luby, Charles Rackoff |
| 1985 | CRYPTO | How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract). | Michael Luby, Charles Rackoff |
| 1985 | STOC | The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) | Shafi Goldwasser, Silvio Micali, Charles Rackoff |
| 1983 | FOCS | How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin | Michael Luby, Silvio Micali, Charles Rackoff |
| 1979 | FOCS | Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems | Romas Aleliunas, Richard M. Karp, Richard J. Lipton, Lszl Lovsz, Charles Rackoff |
| 1978 | STOC | Relativized Questions Involving Probabilistic Algorithms | Charles Rackoff |
| 1974 | STOC | On the Complexity of the Theories of Weak Direct Products: A Preliminary Report | Charles Rackoff |
| 1972 | FOCS | The Emptiness Problem for Automata on Infinite Trees | R. Hossley, Charles Rackoff |