Expert

Charles Rackoff

Scholar @ University Of Toronto

About

Co-winner of the 1993 Godel Prize

Interests

Google Presence

Projects

Papers

2014
Secure Key Exchange and Sessions without Credentials.
Ran Canetti, Vladimir Kolesnikov, Charles Rackoff, Yevgeniy Vahlis
N/A
2014
2013
Rethinking Definitions of Security for Session Key Agreement.
Wesley George, Charles Rackoff
IACR Cryptology ePrint Archive
N/A
2013
2013
Secure Key Exchange and Sessions Without Credentials.
Ran Canetti, Vladimir Kolesnikov, Charles Rackoff, Yevgeniy Vahlis
IACR Cryptology ePrint Archive
N/A
2013
2012
How powerful are the DDH hard groups?
Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis
Electronic Colloquium on Computational Complexity (ECCC)
N/A
2012
2012
How powerful are the DDH hard groups?
Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis
IACR Cryptology ePrint Archive
N/A
2012
2011
On "identities", "names", "NAMES", "ROLES" and Security: A Manifesto.
Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis
IACR Cryptology ePrint Archive
N/A
2011
2010
Characterizing sets of jobs that admit optimal greedy-like algorithms.
Periklis A. Papakonstantinou, Charles Rackoff
J. Scheduling
N/A
2010
2009
The Black-Box Query Complexity of Polynomial Summation.
Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka
Computational Complexity
N/A
2009
2008
On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations.
Dan Boneh, Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis, Brent Waters
N/A
2008
2008
N/A
2008
2008
On Seed-Incompressible Functions.
Shai Halevi, Steven Myers, Charles Rackoff
N/A
2008
2008
Password Mistyping in Two-Factor-Authenticated Key Exchange.
Vladimir Kolesnikov, Charles Rackoff
IACR Cryptology ePrint Archive
N/A
2008
2007
The black-box query complexity of polynomial summation.
Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka
Electronic Colloquium on Computational Complexity (ECCC)
N/A
2007
2006
Key Exchange Using Passwords and Long Keys.
Vladimir Kolesnikov, Charles Rackoff
N/A
2006
2006
Key Exchange Using Passwords and Long Keys.
Vladimir Kolesnikov, Charles Rackoff
IACR Cryptology ePrint Archive
N/A
2006
2005
Lower Bounds For Concurrent Zero Knowledge*.
Joe Kilian, Charles Rackoff, Erez Petrank
Combinatorica
N/A
2005
2005
Simple permutations mix well.
Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff
Theor. Comput. Sci.
N/A
2005
2004
Simple Permutations Mix Well.
Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff
N/A
2004
2004
N/A
2004
2004
Efficient Consistency Proofs for Generalized Queries on a Committed Database.
Rafail Ostrovsky, Charles Rackoff, Adam D. Smith
IACR Cryptology ePrint Archive
N/A
2004
2003
(Incremental) Priority Algorithms.
Allan Borodin, Morten N. Nielsen, Charles Rackoff
Algorithmica
N/A
2003
2002
(Incremental) priority algorithms.
Allan Borodin, Morten N. Nielsen, Charles Rackoff
N/A
2002
2001
Lower Bounds for Zero-knowledge on the Internet
Joe Kilian, Erez Petrank, Charles Rackoff
CoRR
N/A
2001
2000
CBC MAC for Real-Time Data Sources.
Erez Petrank, Charles Rackoff
J. Cryptology
N/A
2000
2000
Efficiently Approximable Real-Valued Functions
Valentine Kabanets, Charles Rackoff, Stephen A. Cook
Electronic Colloquium on Computational Complexity (ECCC)
N/A
2000
1998
Lower Bounds for Zero Knowledge on the Internet.
Joe Kilian, Erez Petrank, Charles Rackoff
N/A
1998
1997
CBC MAC for Real-Time Data Sources.
Erez Petrank, Charles Rackoff
IACR Cryptology ePrint Archive
N/A
1997
1996
A Secure Protocol for the Oblivious Transfer (Extended Abstract).
Michael J. Fischer, Silvio Micali, Charles Rackoff
J. Cryptology
N/A
1996
1993
Cryptographic defense against traffic analysis.
Charles Rackoff, Daniel R. Simon
N/A
1993
1992
N/A
1992
1991
N/A
1991
1989
A Study of Password Security.
Michael Luby, Charles Rackoff
J. Cryptology
N/A
1989
1989
The Knowledge Complexity of Interactive Proof Systems.
Shafi Goldwasser, Silvio Micali, Charles Rackoff
SIAM J. Comput.
N/A
1989
1989
Secret Bit Transmission Using a Random Deal of Cards.
Michael J. Fischer, Michael S. Paterson, Charles Rackoff
N/A
1989
1988
How to Construct Pseudorandom Permutations from Pseudorandom Functions.
Michael Luby, Charles Rackoff
SIAM J. Comput.
N/A
1988
1988
The Notion of Security for Probabilistic Cryptosystems.
Silvio Micali, Charles Rackoff, Bob Sloan
SIAM J. Comput.
N/A
1988
1988
A Basic Theory of Public and Private Cryptosystems.
Silvio Micali, Charles Rackoff, Bob Sloan
N/A
1988
1987
A Study of Password Security.
Michael Luby, Charles Rackoff
N/A
1987
1986
The Notion of Security for Probabilistic Cryptosystems.
Silvio Micali, Charles Rackoff, Bob Sloan
N/A
1986
1986
N/A
1986
1985
1985
The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract)
Shafi Goldwasser, Silvio Micali, Charles Rackoff
N/A
1985
1983
Fast Parallel Computation of Polynomials Using Few Processors.
Leslie G. Valiant, Sven Skyum, S. Berkowitz, Charles Rackoff
SIAM J. Comput.
N/A
1983
1983
N/A
1983
1982
Relativized Questions Involving Probabilistic Algorithms.
Michael Luby, Silvio Micali, Charles Rackoff
J. ACM
N/A
1982
1981
Limitations on Separating Nondeterministic Complexity Classes.
Charles Rackoff, Joel I. Seiferas
SIAM J. Comput.
N/A
1981
1980
Space Lower Bounds for Maze Threadability on Restricted Machines.
Stephen A. Cook, Charles Rackoff
SIAM J. Comput.
N/A
1980
1979
Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems
Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff
N/A
1979
1978
The Covering and Boundedness Problems for Vector Addition Systems.
Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff
Theor. Comput. Sci.
N/A
1978
1978
Relativized Questions Involving Probabilistic Algorithms
Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff
N/A
1978
1976
On the Complexity of the Theories of Weak Direct Powers.
Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff
J. Symb. Log.
N/A
1976
1975
A Decision Procedure for the First Order Theory of Real Addition with Order.
Jeanne Ferrante, Charles Rackoff
SIAM J. Comput.
N/A
1975
1974
N/A
1974
1972
N/A
1972
Read more

Google Trends (past one year)

0.0
Learn about Google Trends

Academic Achievement

Popular People

Naval Ravikant
Naval Ravikant Entrepreneur | Investor @ AngelList | Bitwise Asset Management
Craig Steven Wright
Craig Steven Wright Programmer | Entrepreneur @ nChain | DeMorgan
Benedikt Bünz
Benedikt Bünz Scholar @ Stanford University | Applied Crypto Group
Meltem Demirors
Meltem Demirors Investor | Entrepreneur @ CoinShares | Shiny Pony Ventures | Digital Currency Group
Browse all people