Expert

Charles Rackoff

Scholar @ University Of Toronto

About

Co-winner of the 1993 Godel Prize

Interests

Google Presence

Charles Rackoff — Wikipédia
Charles Rackoff — Wikipédia
Charles Weill Rackoff est un cryptologue américain. Il naît et grandit à New York City, puis est élève au MIT au niveau licence (undergraduate) et maîtrise ..."
Charles Rackoff - Wikipedia
Charles Rackoff - Wikipedia
Charles Weill Rackoff is an American cryptologist. Born and raised in New York City, he attended MIT as both an undergraduate and graduate student, and ..."
On Zero-Knowledge Proofs in Blockchains – Argon Group – Medium
On Zero-Knowledge Proofs in Blockchains – Argon Group – Medium
23 mars 2018 - The notion of zero-knowledge was first proposed in 1985 by MIT researchers Shafi Goldwasser, Silvio Micali and Charles Rackoff in their paper ..."
zk-PoTx — Defining a New protocol for BlockChain transactions
zk-PoTx — Defining a New protocol for BlockChain transactions
6 août 2018 - zk-PoTx — Defining a New protocol for BlockChain transactions ... Silvio Micali and Charles Rackoff in 1985, wherein it was defined as a ..."
Beyond Bitcoin – Part II: Blockchain-based ... - Cryptology ePrint Archive
Beyond Bitcoin – Part II: Blockchain-based ... - Cryptology ePrint Archive
28 juil. 2016 - for the maintenance of blockchain-based systems. We considered security issues ...... [24] Shafi Goldwasser, Silvio Micali, and Charles Rackoff."
What Are Zero-Knowledge Proofs? Complete Beginner's Guide
What Are Zero-Knowledge Proofs? Complete Beginner's Guide
10 sept. 2018 - ... transactions for public blockchain networks, zero-knowledge proofs are ... was first introduced in 1985 by Shafi Goldwasser, Charles Rackoff, ..."
Zk-SNARKs explained - introduction to privacy protocol | Captain Altcoin
Zk-SNARKs explained - introduction to privacy protocol | Captain Altcoin
6 sept. 2018 - Blockchain world currently struggles with a privacy issue. ... of MIT researchers, namely Goldwasser, Silvio Micali and Charles Rackoff."
UniqueID: Decentralized Proof-of-Unique-Human - ResearchGate
UniqueID: Decentralized Proof-of-Unique-Human - ResearchGate
23 juin 2018 - Bitcoin and Ethereum are novel mechanisms for decentralizing the concept of money and computation. Extending ... Charles Rackoff · View."
Zero Knowledge Proofs and its applications in - Blockchain Workshop
Zero Knowledge Proofs and its applications in - Blockchain Workshop
19 août 2018 - knowledge. First proposed in 1985 by. MIT researchers: Shafi. Goldwasser, Silvio Micali, and Charles Rackoff. Decades of research, but."
Computer Science - Page 484 - Résultats Google Recherche de Livres
Computer Science - Page 484 - Résultats Google Recherche de Livres
Cesare Burali-Forti, 14 Chain of trust, 399 Change-point analysis, 223 ... 2, 118, 156, 180 Charles Coulson, 209, 444 Charles E. Leiserson, 140 Charles Rackoff, ..."

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

Alexander Zaidelson
Alexander Zaidelson Entrepreneur @ BEAM
Rosario Gennaro
Rosario Gennaro Scholar @ CUNY | Center For Algorithms And Interactive Scientific Software (CAISS) | MIT | City College Of New York | IBM T.J.Watson Research Center
Oded Goldreich
Oded Goldreich Scholar @ The Weizmann Institute Of Science
Aviv Zohar
Aviv Zohar Scholar @ Hebrew University
Browse all people