Charles Rackoff

Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

2013

Rethinking Definitions of Security for Session Key Agreement.

[BibT_eX]

[DOI]

Wesley George

Periklis A. Papakonstantinou

IACR Cryptol. ePrint Arch., 2013

Secure Key Exchange and Sessions Without Credentials.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

2012

How powerful are the DDH hard groups?

[BibT_eX]

[DOI]

Yevgeniy Vahlis

Electron. Colloquium Comput. Complex., 2012

2011

On "identities", "names", "NAMES", "ROLES" and Security: A Manifesto.

[BibT_eX]

[DOI]

Periklis A. Papakonstantinou

IACR Cryptol. ePrint Arch., 2011

2010

Characterizing sets of jobs that admit optimal greedy-like algorithms.

[BibT_eX]

[DOI]

J. Sched., 2010

2009

The Black-Box Query Complexity of Polynomial Summation.

[BibT_eX]

[DOI]

Comput. Complex., 2009

2008

Password Mistyping in Two-Factor-Authenticated Key Exchange.

[BibT_eX]

[DOI]

Vladimir Kolesnikov

IACR Cryptol. ePrint Arch., 2008

On Seed-Incompressible Functions.

[BibT_eX]

[DOI]

Shai Halevi

Steven A. Myers

Periklis A. Papakonstantinou

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations.

[BibT_eX]

[DOI]

Dan Boneh

Yevgeniy Vahlis

Brent Waters

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2006

Key Exchange Using Passwords and Long Keys.

[BibT_eX]

[DOI]

Vladimir Kolesnikov

IACR Cryptol. ePrint Arch., 2006

2005

Simple permutations mix well.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Lower Bounds For Concurrent Zero Knowledge*.

[BibT_eX]

[DOI]

Joe Kilian

Erez Petrank

Comb., 2005

2004

Efficient Consistency Proofs for Generalized Queries on a Committed Database.

[BibT_eX]

[DOI]

Rafail Ostrovsky

Adam D. Smith

IACR Cryptol. ePrint Arch., 2004

2003

(Incremental) Priority Algorithms.

[BibT_eX]

[DOI]

Allan Borodin

Morten N. Nielsen

Algorithmica, 2003

2000

CBC MAC for Real-Time Data Sources.

[BibT_eX]

[DOI]

Erez Petrank

J. Cryptol., 2000

Efficiently Approximable Real-Valued Functions

[BibT_eX]

[DOI]

Valentine Kabanets

Stephen A. Cook

Electron. Colloquium Comput. Complex., 2000

1998

Lower Bounds for Zero Knowledge on the Internet.

[BibT_eX]

[DOI]

Joe Kilian

Erez Petrank

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1996

A Secure Protocol for the Oblivious Transfer (Extended Abstract).

[BibT_eX]

Michael J. Fischer

J. Cryptol., 1996

1993

Cryptographic defense against traffic analysis.

[BibT_eX]

[DOI]

Daniel R. Simon

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992

Some definitions, protocols and proofs about secure authentication.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Daniel R. Simon

Proceedings of the Advances in Cryptology, 1991

1989

The Knowledge Complexity of Interactive Proof Systems.

[BibT_eX]

[DOI]

Shafi Goldwasser

SIAM J. Comput., 1989

A Study of Password Security.

[BibT_eX]

[DOI]

J. Cryptol., 1989

Secret Bit Transmission Using a Random Deal of Cards.

[BibT_eX]

[DOI]

Michael J. Fischer

Michael S. Paterson

Proceedings of the Distributed Computing And Cryptography, 1989

1988

The Notion of Security for Probabilistic Cryptosystems.

[BibT_eX]

[DOI]

Bob Sloan

SIAM J. Comput., 1988

How to Construct Pseudorandom Permutations from Pseudorandom Functions.

[BibT_eX]

[DOI]

SIAM J. Comput., 1988

A Basic Theory of Public and Private Cryptosystems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1988

1986

Pseudo-random Permutation Generators and Cryptographic Composition

[BibT_eX]

[DOI]

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985

The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract)

[BibT_eX]

[DOI]

Shafi Goldwasser

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1985

1983

Fast Parallel Computation of Polynomials Using Few Processors.

[BibT_eX]

[DOI]

SIAM J. Comput., 1983

How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin

[BibT_eX]

[DOI]

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982

Relativized Questions Involving Probabilistic Algorithms.

[BibT_eX]

[DOI]

J. ACM, 1982

1981

Limitations on Separating Nondeterministic Complexity Classes.

[BibT_eX]

[DOI]

Joel I. Seiferas

SIAM J. Comput., 1981

1980

Space Lower Bounds for Maze Threadability on Restricted Machines.

[BibT_eX]

[DOI]

Stephen A. Cook

SIAM J. Comput., 1980

1979

Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems

[BibT_eX]

[DOI]

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978

The Covering and Boundedness Problems for Vector Addition Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1978

1976

On the Complexity of the Theories of Weak Direct Powers.

[BibT_eX]

[DOI]

J. Symb. Log., 1976

1975

A Decision Procedure for the First Order Theory of Real Addition with Order.

[BibT_eX]

[DOI]

Jeanne Ferrante

SIAM J. Comput., 1975

1974

On the Complexity of the Theories of Weak Direct Products: A Preliminary Report

[BibT_eX]

[DOI]

Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

1972

The Emptiness Problem for Automata on Infinite Trees

[BibT_eX]

[DOI]

R. Hossley