| Publication | Date of Publication | Type |
|---|
| Zero-knowledge sets | 2026-05-29 | Paper |
| Heuristics for finding large independent sets, with applications to coloring semi-random graphs | 2025-10-29 | Paper |
| Lower bounds for zero knowledge on the Internet | 2025-10-29 | Paper |
Two prover protocols, low error at affordable rates
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Finding OR in a noisy broadcast network
Information Processing Letters | 2016-06-16 | Paper |
Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process
Random Structures & Algorithms | 2016-06-10 | Paper |
How to Protect DES Against Exhaustive Key Search
Advances in Cryptology — CRYPTO ’96 | 2015-11-11 | Paper |
| scientific article; zbMATH DE number 6469129 (Why is no real title available?) | 2015-08-03 | Paper |
Concurrent and resettable zero-knowledge in poly-logarithmic rounds
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
More general completeness theorems for secure two-party computation
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
A sublinear algorithm for weakly approximating edit distance
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting
Advances in Cryptology - ASIACRYPT 2008 | 2009-02-10 | Paper |
Interactive Hashing: An Information Theoretic Tool (Invited Talk)
Lecture Notes in Computer Science | 2009-01-09 | Paper |
On Robust Combiners for Oblivious Transfer and Other Primitives
Lecture Notes in Computer Science | 2008-05-06 | Paper |
Fast Private Norm Estimation and Heavy Hitters
Theory of Cryptography | 2008-03-05 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Lower bounds for concurrent zero knowledge
Combinatorica | 2006-01-26 | Paper |
Primality testing using elliptic curves
Journal of the ACM | 2005-01-25 | Paper |
| scientific article; zbMATH DE number 2081079 (Why is no real title available?) | 2004-08-04 | Paper |
An efficient noninteractive zero-knowledge proof system for NP with general assumptions
Journal of Cryptology | 2003-09-14 | Paper |
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
SIAM Journal on Computing | 2003-01-05 | Paper |
Heuristics for semirandom graph problems
Journal of Computer and System Sciences | 2002-07-04 | Paper |
| scientific article; zbMATH DE number 1670848 (Why is no real title available?) | 2001-12-09 | Paper |
| scientific article; zbMATH DE number 1676659 (Why is no real title available?) | 2001-11-25 | Paper |
The security of the cipher block chaining message authentication code
Journal of Computer and System Sciences | 2001-04-17 | Paper |
| scientific article; zbMATH DE number 1559565 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1559566 (Why is no real title available?) | 2001-02-28 | Paper |
How to protect DES against exhaustive key search (an analysis of DESX).
Journal of Cryptology | 2001-01-01 | Paper |
Two-Prover Protocols---Low Error at Affordable Rates
SIAM Journal on Computing | 2000-10-18 | Paper |
Reducibility and Completeness in Private Computations
SIAM Journal on Computing | 2000-03-19 | Paper |
On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions
Advances in Cryptology — EUROCRYPT ’99 | 2000-03-13 | Paper |
On the concurrent composition of zero-knowledge proofs
Lecture Notes in Computer Science | 2000-03-13 | Paper |
The security of cipher block chaining
Lecture Notes in Computer Science | 2000-03-01 | Paper |
Secure voting using partially compatible homomorphisms
Lecture Notes in Computer Science | 2000-03-01 | Paper |
Zero knowledge and the chromatic number
Journal of Computer and System Sciences | 1999-10-06 | Paper |
scientific article; zbMATH DE number 1332665 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 1999-09-08 | Paper |
| scientific article; zbMATH DE number 708807 (Why is no real title available?) | 1999-08-30 | Paper |
| scientific article; zbMATH DE number 1263222 (Why is no real title available?) | 1999-06-29 | Paper |
Identity escrow
Lecture Notes in Computer Science | 1999-06-17 | Paper |
A note on the limits of collusion-resistant watermarks
Advances in Cryptology — EUROCRYPT ’99 | 1999-06-17 | Paper |
Improved efficient arguments. (Preliminary version)
Lecture Notes in Computer Science | 1997-12-01 | Paper |
Fair cryptosystems, revisited. A rigorous approach to key-escrow. (Extended abstract)
Lecture Notes in Computer Science | 1997-08-24 | Paper |
Discret solitary games
Lecture Notes in Computer Science | 1997-07-20 | Paper |
Locally random reductions: Improvements and applications
Journal of Cryptology | 1997-05-28 | Paper |
The dynamic universality of sigmoidal neural networks
Information and Computation | 1997-02-17 | Paper |
| scientific article; zbMATH DE number 503242 (Why is no real title available?) | 1994-03-07 | Paper |
Interactive proofs with space bounded provers
Lecture Notes in Computer Science | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 4195163 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4185024 (Why is no real title available?) | 1990-01-01 | Paper |
On hiding information from an oracle
Journal of Computer and System Sciences | 1989-01-01 | Paper |
