| Publication | Date of Publication | Type |
|---|
| Lower bounds for zero knowledge on the Internet | 2025-10-29 | Paper |
Cryptographic defense against traffic analysis
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Secure Key Exchange and Sessions without Credentials
Lecture Notes in Computer Science | 2014-10-14 | Paper |
Relativized questions involving probabilistic algorithms
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 2014-03-14 | Paper |
The black-box query complexity of polynomial summation
Computational Complexity | 2011-02-18 | Paper |
Characterizing sets of jobs that admit optimal greedy-like algorithms
Journal of Scheduling | 2010-04-21 | Paper |
Password Mistyping in Two-Factor-Authenticated Key Exchange
Automata, Languages and Programming | 2008-08-19 | Paper |
On Seed-Incompressible Functions
Theory of Cryptography | 2008-03-05 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Lower bounds for concurrent zero knowledge
Combinatorica | 2006-01-26 | Paper |
Simple permutations mix well
Theoretical Computer Science | 2006-01-09 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
(Incremental) priority algorithms
Algorithmica | 2005-02-11 | Paper |
| scientific article; zbMATH DE number 2119736 (Why is no real title available?) | 2004-11-29 | Paper |
CBC MAC for real-time data sources
Journal of Cryptology | 2000-08-08 | Paper |
The knowledge complexity of interactive proof-systems
Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 | 1997-11-13 | Paper |
A secure protocol for the oblivious transfer. (Extended abstract)
Journal of Cryptology | 1996-11-24 | Paper |
| scientific article; zbMATH DE number 176565 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 4191563 (Why is no real title available?) | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4200134 (Why is no real title available?) | 1990-01-01 | Paper |
The Knowledge Complexity of Interactive Proof Systems
SIAM Journal on Computing | 1989-01-01 | Paper |
A study of password security
Journal of Cryptology | 1989-01-01 | Paper |
How to Construct Pseudorandom Permutations from Pseudorandom Functions
SIAM Journal on Computing | 1988-01-01 | Paper |
The Notion of Security for Probabilistic Cryptosystems
SIAM Journal on Computing | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4033661 (Why is no real title available?) | 1987-01-01 | Paper |
Relativized Questions Involving Probabilistic Algorithms
Journal of the ACM | 1982-01-01 | Paper |
Limitations on Separating Nondeterministic Complexity Classes
SIAM Journal on Computing | 1981-01-01 | Paper |
Space Lower Bounds for Maze Threadability on Restricted Machines
SIAM Journal on Computing | 1980-01-01 | Paper |
The computational complexity of logical theories
Lecture Notes in Mathematics | 1979-01-01 | Paper |
The covering and boundedness problems for vector addition systems
Theoretical Computer Science | 1978-01-01 | Paper |
On the complexity of the theories of weak direct powers
Journal of Symbolic Logic | 1976-01-01 | Paper |
A Decision Procedure for the First Order Theory of Real Addition with Order
SIAM Journal on Computing | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3558983 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3435465 (Why is no real title available?) | 1974-01-01 | Paper |
