Charles Rackoff

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