Charles Rackoff

Publication Activity (10 Years)

Years Active: 1972-2014
Publications (10 Years): 0

Top Topics

Secure Communication

Security Analysis

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

Publications

Ran Canetti, Vladimir Kolesnikov, Charles Rackoff, Yevgeniy Vahlis
Secure Key Exchange and Sessions without Credentials. SCN (2014)
Ran Canetti, Vladimir Kolesnikov, Charles Rackoff, Yevgeniy Vahlis
Secure Key Exchange and Sessions Without Credentials. IACR Cryptol. ePrint Arch. 2013 (2013)
Wesley George, Charles Rackoff
Rethinking Definitions of Security for Session Key Agreement. IACR Cryptol. ePrint Arch. 2013 (2013)
Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis
How powerful are the DDH hard groups? Electron. Colloquium Comput. Complex. 19 (2012)
Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis
How powerful are the DDH hard groups? IACR Cryptol. ePrint Arch. 2012 (2012)
Charles Rackoff
On "identities", "names", "NAMES", "ROLES" and Security: A Manifesto. IACR Cryptol. ePrint Arch. 2011 (2011)
Periklis A. Papakonstantinou, Charles Rackoff
Characterizing sets of jobs that admit optimal greedy-like algorithms. J. Sched. 13 (2) (2010)
Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka
The Black-Box Query Complexity of Polynomial Summation. Comput. Complex. 18 (1) (2009)
Vladimir Kolesnikov, Charles Rackoff
Password Mistyping in Two-Factor-Authenticated Key Exchange. ICALP (2) (2008)
Dan Boneh, Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis, Brent Waters
On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations. FOCS (2008)
Vladimir Kolesnikov, Charles Rackoff
Password Mistyping in Two-Factor-Authenticated Key Exchange. IACR Cryptol. ePrint Arch. 2008 (2008)
Shai Halevi, Steven A. Myers, Charles Rackoff
On Seed-Incompressible Functions. TCC (2008)
Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka
The black-box query complexity of polynomial summation. Electron. Colloquium Comput. Complex. 14 (125) (2007)
Vladimir Kolesnikov, Charles Rackoff
Key Exchange Using Passwords and Long Keys. IACR Cryptol. ePrint Arch. 2006 (2006)
Vladimir Kolesnikov, Charles Rackoff
Key Exchange Using Passwords and Long Keys. TCC (2006)
Joe Kilian, Charles Rackoff, Erez Petrank
Lower Bounds For Concurrent Zero Knowledge*. Comb. 25 (2) (2005)
Shlomo Hoory, Avner Magen, Steven A. Myers, Charles Rackoff
Simple permutations mix well. Theor. Comput. Sci. 348 (2-3) (2005)
Rafail Ostrovsky, Charles Rackoff, Adam D. Smith
Efficient Consistency Proofs for Generalized Queries on a Committed Database. IACR Cryptol. ePrint Arch. 2004 (2004)
Shlomo Hoory, Avner Magen, Steven A. Myers, Charles Rackoff
Simple Permutations Mix Well. ICALP (2004)
Rafail Ostrovsky, Charles Rackoff, Adam D. Smith
Efficient Consistency Proofs for Generalized Queries on a Committed Database. ICALP (2004)
Allan Borodin, Morten N. Nielsen, Charles Rackoff
(Incremental) Priority Algorithms. Algorithmica 37 (4) (2003)
Allan Borodin, Morten N. Nielsen, Charles Rackoff
(Incremental) priority algorithms. SODA (2002)
Joe Kilian, Erez Petrank, Charles Rackoff
Lower Bounds for Zero-knowledge on the Internet CoRR (2001)
Valentine Kabanets, Charles Rackoff, Stephen A. Cook
Efficiently Approximable Real-Valued Functions Electron. Colloquium Comput. Complex. 7 (34) (2000)
Erez Petrank, Charles Rackoff
CBC MAC for Real-Time Data Sources. J. Cryptol. 13 (3) (2000)
Joe Kilian, Erez Petrank, Charles Rackoff
Lower Bounds for Zero Knowledge on the Internet. FOCS (1998)
Erez Petrank, Charles Rackoff
CBC MAC for Real-Time Data Sources. IACR Cryptol. ePrint Arch. 1997 (1997)
Michael J. Fischer, Silvio Micali, Charles Rackoff
A Secure Protocol for the Oblivious Transfer (Extended Abstract). J. Cryptol. 9 (3) (1996)
Charles Rackoff, Daniel R. Simon
Cryptographic defense against traffic analysis. STOC (1993)
Charles Rackoff
Some definitions, protocols and proofs about secure authentication. CASCON (1992)
Charles Rackoff, Daniel R. Simon
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. CRYPTO (1991)
Michael J. Fischer, Michael S. Paterson, Charles Rackoff
Secret Bit Transmission Using a Random Deal of Cards. Distributed Computing And Cryptography (1989)
Michael Luby, Charles Rackoff
A Study of Password Security. J. Cryptol. 1 (3) (1989)
Shafi Goldwasser, Silvio Micali, Charles Rackoff
The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput. 18 (1) (1989)
Michael Luby, Charles Rackoff
How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM J. Comput. 17 (2) (1988)
Silvio Micali, Charles Rackoff, Bob Sloan
The Notion of Security for Probabilistic Cryptosystems. SIAM J. Comput. 17 (2) (1988)
Charles Rackoff
A Basic Theory of Public and Private Cryptosystems. CRYPTO (1988)
Michael Luby, Charles Rackoff
A Study of Password Security. CRYPTO (1987)
Silvio Micali, Charles Rackoff, Bob Sloan
The Notion of Security for Probabilistic Cryptosystems. CRYPTO (1986)
Michael Luby, Charles Rackoff
Pseudo-random Permutation Generators and Cryptographic Composition STOC (1986)
Shafi Goldwasser, Silvio Micali, Charles Rackoff
The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) STOC (1985)
Michael Luby, Charles Rackoff
How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract). CRYPTO (1985)
Leslie G. Valiant, Sven Skyum, S. Berkowitz, Charles Rackoff
Fast Parallel Computation of Polynomials Using Few Processors. SIAM J. Comput. 12 (4) (1983)
Michael Luby, Silvio Micali, Charles Rackoff
How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin FOCS (1983)
Charles Rackoff
Relativized Questions Involving Probabilistic Algorithms. J. ACM 29 (1) (1982)
Charles Rackoff, Joel I. Seiferas
Limitations on Separating Nondeterministic Complexity Classes. SIAM J. Comput. 10 (4) (1981)
Stephen A. Cook, Charles Rackoff
Space Lower Bounds for Maze Threadability on Restricted Machines. SIAM J. Comput. 9 (3) (1980)
Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff
Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems FOCS (1979)
Charles Rackoff
The Covering and Boundedness Problems for Vector Addition Systems. Theor. Comput. Sci. 6 (1978)
Charles Rackoff
Relativized Questions Involving Probabilistic Algorithms STOC (1978)
Charles Rackoff
On the Complexity of the Theories of Weak Direct Powers. J. Symb. Log. 41 (3) (1976)
Jeanne Ferrante, Charles Rackoff
A Decision Procedure for the First Order Theory of Real Addition with Order. SIAM J. Comput. 4 (1) (1975)
Charles Rackoff
On the Complexity of the Theories of Weak Direct Products: A Preliminary Report STOC (1974)
R. Hossley, Charles Rackoff
The Emptiness Problem for Automata on Infinite Trees SWAT (1972)