Charles Rackoff | Academic Influence

Charles Rackoff's AcademicInfluence.com Rankings

Charles Rackoff

Computer Science

#799

World Rank

#826

Historical Rank

#433

USA Rank

Database

#7814

World Rank

#8127

Historical Rank

#986

USA Rank

computer-science Degrees

Download Badge

Computer Science

Charles Rackoff's Degrees

PhD Computer Science University of California, Berkeley
Bachelors Mathematics Princeton University

Similar Degrees You Can Earn

Why Is Charles Rackoff Influential?

(Suggest an Edit or Addition)

According to 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 earned a Ph.D. degree in Computer Science in 1974. He spent a year as a postdoctoral scholar at INRIA in France.

(See a Problem?)

Charles Rackoff's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The knowledge complexity of interactive proof-systems (1985) (3994)
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack (1991) (1106)
How to Construct Pseudorandom Permutations from Pseudorandom Functions (1988) (974)
Random walks, universal traversal sequences, and the complexity of maze problems (1979) (688)
The Covering and Boundedness Problems for Vector Addition Systems (1978) (369)
Fast Parallel Computation of Polynomials Using Few Processors (1983) (310)
The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) (1985) (284)
A Decision Procedure for the First Order Theory of Real Addition with Order (1975) (211)
The computational complexity of logical theories (1979) (204)
The Notion of Security for Probabilistic Cryptosystems (1986) (185)
Cryptographic defense against traffic analysis (1993) (138)
Space Lower Bounds for Maze Threadability on Restricted Machines (1980) (113)
How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) (1985) (110)
(Incremental) Priority Algorithms (2002) (95)
Lower bounds for zero knowledge on the Internet (1998) (94)
How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin (1983) (90)
Relativized Questions Involving Probabilistic Algorithms (1982) (86)
Pseudo-random permutation generators and cryptographic composition (1986) (75)
On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations (2008) (60)
Efficient Consistency Proofs for Generalized Queries on a Committed Database (2004) (53)
The Emptiness Problem for Automata on Infinite Trees (1972) (48)
CBC MAC for Real-Time Data Sources (2015) (47)
Secret Bit Transmission Using a Random Deal of Cards (1990) (32)
A secure protocol for the oblivious transfer (extended abstract) (1996) (26)
On Seed-Incompressible Functions (2008) (26)
Simple permutations mix well (2005) (26)
A study of password security (1987) (25)
Limitations on Separating Nondeterministic Complexity Classes (1981) (24)
Key Exchange Using Passwords and Long Keys (2006) (22)
Efficiently Approximable Real-Valued Functions (2000) (17)
Password Mistyping in Two-Factor-Authenticated Key Exchange (2008) (16)
How powerful are the DDH hard groups? (2012) (15)
A history of the PCP Theorem (2005) (13)
The Black-Box Query Complexity of Polynomial Summation (2009) (10)
Efficient Consistency Proofs on a Committed Database (2003) (10)
THE COMPUTATIONAL COMPLEXITY OF SOME LOGICAL THEORIES (1975) (10)
A Basic Theory of Public and Private Cryptosystems (1988) (6)
Relativized questions involving probabilistic algorithms (1978) (6)
On the complexity of the theories of weak direct products (Preliminary Report) (1974) (5)
The Emptiness and Complementation Problems for Automata on Infinite Trees (1973) (4)
On the complexity of the theories of weak direct powers (1976) (3)
Lower Bounds For Concurrent Zero Knowledge* (2005) (3)
Rethinking Definitions of Security for Session Key Agreement (2013) (2)
Secure Key Exchange and Sessions without Credentials (2014) (2)
Some definitions, protocols and proofs about secure authentication (1992) (2)
On "identities", "names", "NAMES", "ROLES" and Security: A Manifesto (2011) (2)
On the Security of Cipher Block Chaining Message Authentication Code ? (2010) (1)
A technique for writing short formulas defining complicated properties (1979) (1)
A lower bound on the theories of pairing functions (1979) (1)
Characterizing sets of jobs that admit optimal greedy-like algorithms (2010) (1)
Some additional upper bounds (1979) (0)
Integer addition — An example of an Ehrenfeucht game decision procedure (1979) (0)
REVIEWS-Primality testing in polynomial time (2006) (0)
Direct products of theories (1979) (0)
Review: Anna R. Bruss, Albert R. Meyer, On Time-Space Classes and their Relation to the Theory of Real Addition; Leonard Berman, The Complexity of Logical Theories; Hugo Volger, Turing Machines with Linear Alternation, Theories of Bounded Concatenation (1986) (0)
Some additional lower bounds (1979) (0)
Martin Dietzfelbinger. Primality testing in polynomial time—from randomized algorithms to “PRIMES is in P” . Lecture Notes in Computer Science, vol. 3000. Springer-Verlag, 2004, x + 147 pp. (2006) (0)
Ehrenfeucht games and decision procedures (1979) (0)
Lower bound preliminaries (1979) (0)
Incremental) priority algorithms YYYY No org found YYY (2002) (0)

This paper list is powered by the following services:

Other Resources About Charles Rackoff

en.wikipedia.org

What Schools Are Affiliated With Charles Rackoff?

Charles Rackoff is affiliated with the following schools: