The Emptiness Problem for Automata on Infinite Trees - R. Hossley; Charles Rackoff (SWAT, 1972)

On the Complexity of the Theories of Weak Direct Products: A Preliminary Report - Charles Rackoff (STOC, 1974)

A Decision Procedure for the First Order Theory of Real Addition with Order. - Jeanne Ferrante; Charles Rackoff (SIAM J. Comput., 1975)

On the Complexity of the Theories of Weak Direct Powers. - Charles Rackoff (J. Symb. Log., 1976)

The Covering and Boundedness Problems for Vector Addition Systems. - Charles Rackoff (Theor. Comput. Sci., 1978)

Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems - Romas Aleliunas; Richard M. Karp; Richard J. Lipton; László Lovász 001; Charles Rackoff (FOCS, 1979)

Space Lower Bounds for Maze Threadability on Restricted Machines. - Stephen A. Cook; Charles Rackoff (SIAM J. Comput., 1980)

Limitations on Separating Nondeterministic Complexity Classes. - Charles Rackoff; Joel I. Seiferas (SIAM J. Comput., 1981)

Relativized Questions Involving Probabilistic Algorithms. - Charles Rackoff (J. ACM, 1982)

How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin - Michael Luby; Silvio Micali; Charles Rackoff (FOCS, 1983)

Fast Parallel Computation of Polynomials Using Few Processors. - Leslie G. Valiant; Sven Skyum; S. Berkowitz; Charles Rackoff (SIAM J. Comput., 1983)

How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract). - Michael Luby; Charles Rackoff (CRYPTO, 1985)

The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) - Shafi Goldwasser; Silvio Micali; Charles Rackoff (STOC, 1985)

Pseudo-random Permutation Generators and Cryptographic Composition - Michael Luby; Charles Rackoff (STOC, 1986)

A Basic Theory of Public and Private Cryptosystems. - Charles Rackoff (CRYPTO, 1988)

How to Construct Pseudorandom Permutations from Pseudorandom Functions. - Michael Luby; Charles Rackoff (SIAM J. Comput., 1988)

The Notion of Security for Probabilistic Cryptosystems. - Silvio Micali; Charles Rackoff; Bob Sloan (SIAM J. Comput., 1988)

Secret Bit Transmission Using a Random Deal of Cards. - Michael J. Fischer; Michael S. Paterson; Charles Rackoff (Distributed Computing And Cryptography, 1989)

A Study of Password Security. - Michael Luby; Charles Rackoff (J. Cryptol., 1989)

The Knowledge Complexity of Interactive Proof Systems. - Shafi Goldwasser; Silvio Micali; Charles Rackoff (SIAM J. Comput., 1989)

Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. - Charles Rackoff; Daniel R. Simon (CRYPTO, 1991)

Some definitions, protocols and proofs about secure authentication. - Charles Rackoff (CASCON, 1992)

Cryptographic defense against traffic analysis. - Charles Rackoff; Daniel R. Simon (STOC, 1993)

A Secure Protocol for the Oblivious Transfer (Extended Abstract). - Michael J. Fischer; Silvio Micali; Charles Rackoff (J. Cryptol., 1996)

Lower Bounds for Zero Knowledge on the Internet. - Joe Kilian; Erez Petrank; Charles Rackoff (FOCS, 1998)

Efficiently Approximable Real-Valued Functions - Valentine Kabanets; Charles Rackoff; Stephen A. Cook (Electron. Colloquium Comput. Complex., 2000)

CBC MAC for Real-Time Data Sources. - Erez Petrank; Charles Rackoff (J. Cryptol., 2000)

(Incremental) Priority Algorithms. - Allan Borodin; Morten N. Nielsen; Charles Rackoff (Algorithmica, 2003)

Efficient Consistency Proofs for Generalized Queries on a Committed Database. - Rafail Ostrovsky; Charles Rackoff; Adam D. Smith 001 (IACR Cryptol. ePrint Arch., 2004)

Lower Bounds For Concurrent Zero Knowledge*. - Joe Kilian; Charles Rackoff; Erez Petrank (Comb., 2005)

Simple permutations mix well. - Shlomo Hoory; Avner Magen; Steven A. Myers; Charles Rackoff (Theor. Comput. Sci., 2005)

Key Exchange Using Passwords and Long Keys. - Vladimir Kolesnikov; Charles Rackoff (IACR Cryptol. ePrint Arch., 2006)

On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations. - Dan Boneh; Periklis A. Papakonstantinou; Charles Rackoff; Yevgeniy Vahlis; Brent Waters (FOCS, 2008)

On Seed-Incompressible Functions. - Shai Halevi; Steven A. Myers; Charles Rackoff (TCC, 2008)

Password Mistyping in Two-Factor-Authenticated Key Exchange. - Vladimir Kolesnikov; Charles Rackoff (IACR Cryptol. ePrint Arch., 2008)

The Black-Box Query Complexity of Polynomial Summation. - Ali Juma; Valentine Kabanets; Charles Rackoff; Amir Shpilka (Comput. Complex., 2009)

Characterizing sets of jobs that admit optimal greedy-like algorithms. - Periklis A. Papakonstantinou; Charles Rackoff (J. Sched., 2010)

On "identities", "names", "NAMES", "ROLES" and Security: A Manifesto. - Charles Rackoff (IACR Cryptol. ePrint Arch., 2011)

How powerful are the DDH hard groups? - Periklis A. Papakonstantinou; Charles Rackoff; Yevgeniy Vahlis (Electron. Colloquium Comput. Complex., 2012)

Secure Key Exchange and Sessions Without Credentials. - Ran Canetti; Vladimir Kolesnikov; Charles Rackoff; Yevgeniy Vahlis (IACR Cryptol. ePrint Arch., 2013)

Rethinking Definitions of Security for Session Key Agreement. - Wesley George; Charles Rackoff (IACR Cryptol. ePrint Arch., 2013)

The knowledge complexity of interactive proof-systems. - Shafi Goldwasser; Silvio Micali; Charles Rackoff (Providing Sound Foundations for Cryptography, 2019)