| Publication | Date of Publication | Type |
|---|
| Two prover protocols | 2016-09-01 | Paper |
| Finding OR in a noisy broadcast network | 2016-06-16 | Paper |
| Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process | 2016-06-10 | Paper |
| How to Protect DES Against Exhaustive Key Search | 2015-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501239 | 2015-08-03 | Paper |
| Concurrent and resettable zero-knowledge in poly-loalgorithm rounds | 2015-02-27 | Paper |
| Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds | 2015-02-27 | Paper |
| More general completeness theorems for secure two-party computation | 2014-09-26 | Paper |
| A sublinear algorithm for weakly approximating edit distance | 2010-08-16 | Paper |
| A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting | 2009-02-10 | Paper |
| Interactive Hashing: An Information Theoretic Tool (Invited Talk) | 2009-01-09 | Paper |
| On Robust Combiners for Oblivious Transfer and Other Primitives | 2008-05-06 | Paper |
| Fast Private Norm Estimation and Heavy Hitters | 2008-03-05 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| Lower bounds for concurrent zero knowledge | 2006-01-26 | Paper |
| Primality testing using elliptic curves | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474189 | 2004-08-04 | Paper |
| An efficient noninteractive zero-knowledge proof system for NP with general assumptions | 2003-09-14 | Paper |
| Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds | 2003-01-05 | Paper |
| Heuristics for semirandom graph problems | 2002-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754171 | 2001-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2757263 | 2001-11-25 | Paper |
| The security of the cipher block chaining message authentication code | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527017 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527018 | 2001-02-28 | Paper |
| How to protect DES against exhaustive key search (an analysis of DESX). | 2001-01-01 | Paper |
| Two-Prover Protocols---Low Error at Affordable Rates | 2000-10-18 | Paper |
| Reducibility and Completeness in Private Computations | 2000-03-19 | Paper |
| On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions | 2000-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250778 | 2000-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940708 | 2000-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940713 | 2000-03-01 | Paper |
| Zero knowledge and the chromatic number | 1999-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259986 | 1999-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318695 | 1999-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234094 | 1999-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249328 | 1999-06-17 | Paper |
| A Note on the Limits of Collusion-Resistant Watermarks | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4343444 | 1997-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4343436 | 1997-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341757 | 1997-07-20 | Paper |
| Locally random reductions: Improvements and applications | 1997-05-28 | Paper |
| The dynamic universality of sigmoidal neural networks | 1997-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279564 | 1994-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035721 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3212276 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750398 | 1990-01-01 | Paper |
| On hiding information from an oracle | 1989-01-01 | Paper |
