Charles Rackoff

According to our database1, Charles Rackoff authored at least 45 papers between 1972 and 2014.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2014
Secure Key Exchange and Sessions without Credentials.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

2013
Rethinking Definitions of Security for Session Key Agreement.
IACR Cryptology ePrint Archive, 2013

2012
How powerful are the DDH hard groups?
IACR Cryptology ePrint Archive, 2012

How powerful are the DDH hard groups?
Electronic Colloquium on Computational Complexity (ECCC), 2012

2011
On "identities", "names", "NAMES", "ROLES" and Security: A Manifesto.
IACR Cryptology ePrint Archive, 2011

2010
Characterizing sets of jobs that admit optimal greedy-like algorithms.
J. Scheduling, 2010

2009
The Black-Box Query Complexity of Polynomial Summation.
Computational Complexity, 2009

2008
On Seed-Incompressible Functions.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Password Mistyping in Two-Factor-Authenticated Key Exchange.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
The black-box query complexity of polynomial summation.
Electronic Colloquium on Computational Complexity (ECCC), 2007

2006
Key Exchange Using Passwords and Long Keys.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

2005
Lower Bounds For Concurrent Zero Knowledge*.
Combinatorica, 2005

2004
Efficient Consistency Proofs for Generalized Queries on a Committed Database.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Simple Permutations Mix Well.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2002
(Incremental) priority algorithms.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2000
CBC MAC for Real-Time Data Sources.
J. Cryptology, 2000

Efficiently Approximable Real-Valued Functions
Electronic Colloquium on Computational Complexity (ECCC), 2000

1998
Lower Bounds for Zero Knowledge on the Internet.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
CBC MAC for Real-Time Data Sources.
IACR Cryptology ePrint Archive, 1997

1996
A Secure Protocol for the Oblivious Transfer (Extended Abstract).
J. Cryptology, 1996

1993
Cryptographic defense against traffic analysis.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992
Some definitions, protocols and proofs about secure authentication.
Proceedings of the 1992 Conference of the Centre for Advanced Studies on Collaborative Research, 1992

1991
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack.
Proceedings of the Advances in Cryptology, 1991

1989
The Knowledge Complexity of Interactive Proof Systems.
SIAM J. Comput., 1989

Secret Bit Transmission Using a Random Deal of Cards.
Proceedings of the Distributed Computing And Cryptography, 1989

1988
How to Construct Pseudorandom Permutations from Pseudorandom Functions.
SIAM J. Comput., 1988

A Basic Theory of Public and Private Cryptosystems.
Proceedings of the Advances in Cryptology, 1988

1987
A Study of Password Security.
Proceedings of the Advances in Cryptology, 1987

1986
Pseudo-random Permutation Generators and Cryptographic Composition
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

The Notion of Security for Probabilistic Cryptosystems.
Proceedings of the Advances in Cryptology, 1986

1985
The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract)
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract).
Proceedings of the Advances in Cryptology, 1985

1983
Fast Parallel Computation of Polynomials Using Few Processors.
SIAM J. Comput., 1983

How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982
Relativized Questions Involving Probabilistic Algorithms.
J. ACM, 1982

1981
Limitations on Separating Nondeterministic Complexity Classes.
SIAM J. Comput., 1981

1980
Space Lower Bounds for Maze Threadability on Restricted Machines.
SIAM J. Comput., 1980

1979
Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978
The Covering and Boundedness Problems for Vector Addition Systems.
Theor. Comput. Sci., 1978

Relativized Questions Involving Probabilistic Algorithms
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

1976
On the Complexity of the Theories of Weak Direct Powers.
J. Symb. Log., 1976

1975
A Decision Procedure for the First Order Theory of Real Addition with Order.
SIAM J. Comput., 1975

1974
On the Complexity of the Theories of Weak Direct Products: A Preliminary Report
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

1972
The Emptiness Problem for Automata on Infinite Trees
Proceedings of the 13th Annual Symposium on Switching and Automata Theory, 1972


  Loading...