| Publication | Date of Publication | Type |
|---|
| Algorand: a secure and efficient distributed ledger | 2019-06-18 | Paper |
| Optimal and Efficient Parametric Auctions | 2019-05-15 | Paper |
| Tight Revenue Bounds With Possibilistic Beliefs and Level-k Rationality | 2019-01-30 | Paper |
| Knightian Analysis of the Vickrey Mechanism | 2019-01-30 | Paper |
| Computational principal-agent problems | 2018-09-19 | Paper |
| The order independence of iterated dominance in extensive games | 2018-09-11 | Paper |
| Leveraging possibilistic beliefs in unrestricted combinatorial auctions | 2018-08-01 | Paper |
| Optimal Error Correction for Computationally Bounded Noise | 2017-07-27 | Paper |
| Collusion, efficiency, and dominant strategies | 2017-06-20 | Paper |
| On the Cryptographic Applications of Random Functions (Extended Abstract) | 2017-04-10 | Paper |
| A “Paradoxical” Solution to The Signature Problem | 2017-04-10 | Paper |
| Crowdsourced Bayesian auctions | 2016-10-07 | Paper |
| Mechanism design with approximate valuations | 2016-10-07 | Paper |
| Auction revenue in the general spiteful-utility model | 2016-04-15 | Paper |
| Mechanisms with costly knowledge | 2016-04-15 | Paper |
| Reconstructing Markov processes from independent and anonymous experiments | 2016-01-21 | Paper |
| Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing | 2015-11-11 | Paper |
| Completely fair SFE and coalition-safe cheap talk | 2015-08-03 | Paper |
| Mechanism design with possibilistic beliefs | 2015-02-13 | Paper |
| A new approach to auctions and resilient mechanism design | 2015-02-04 | Paper |
| Local zero knowledge | 2014-11-25 | Paper |
| Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints | 2014-11-19 | Paper |
| Resettable zero-knowledge (extended abstract) | 2014-09-26 | Paper |
| Mechanism Design with Set-Theoretic Beliefs | 2014-07-30 | Paper |
| Rational proofs | 2014-05-13 | Paper |
| Collusive dominant-strategy truthfulness | 2012-05-14 | Paper |
| Perfect implementation | 2011-02-11 | Paper |
| Collusion-free protocols | 2010-08-16 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| Purely Rational Secret Sharing (Extended Abstract) | 2009-03-03 | Paper |
| Verifiably Secure Devices | 2008-03-05 | Paper |
| Online-Untransferable Signatures | 2008-03-05 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| Advances in Cryptology - EUROCRYPT 2004 | 2007-09-25 | Paper |
| Independent Zero-Knowledge Sets | 2007-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374913 | 2006-03-01 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739495 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472077 | 2004-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472072 | 2004-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418545 | 2003-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783744 | 2002-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3149676 | 2002-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536795 | 2002-07-28 | Paper |
| Improving the exact security of digital signature schemes | 2002-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4496063 | 2002-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2778858 | 2002-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2757241 | 2001-11-25 | Paper |
| Computationally Sound Proofs | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941849 | 2000-07-26 | Paper |
| Reducibility and Completeness in Private Computations | 2000-03-19 | Paper |
| Lower Bounds for Oblivious Transfer Reductions | 2000-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318689 | 1999-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250776 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381418 | 1998-12-03 | Paper |
| An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement | 1998-02-10 | Paper |
| The knowledge complexity of interactive proof-systems | 1997-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341772 | 1997-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4343434 | 1997-07-06 | Paper |
| A secure protocol for the oblivious transfer. (Extended abstract) | 1996-11-24 | Paper |
| On-line/off-line digital signatures | 1996-08-20 | Paper |
| Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems | 1994-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279578 | 1994-09-20 | Paper |
| How to sign given any trapdoor permutation | 1994-08-21 | Paper |
| Noninteractive Zero-Knowledge | 1992-06-27 | Paper |
| Efficient, perfect polynomial random number generators | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750398 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5748797 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197310 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3210162 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3202944 | 1990-01-01 | Paper |
| Removing Interaction from Zero-Knowledge Proofs | 1990-01-01 | Paper |
| The Knowledge Complexity of Interactive Proof Systems | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4734747 | 1989-01-01 | Paper |
| A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks | 1988-01-01 | Paper |
| The Notion of Security for Probabilistic Cryptosystems | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789104 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3777937 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3773819 | 1987-01-01 | Paper |
| An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3729902 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4725777 | 1986-01-01 | Paper |
| Probabilistic encryption | 1984-01-01 | Paper |
| How to Generate Cryptographically Strong Sequences of Pseudorandom Bits | 1984-01-01 | Paper |
| Two-way deterministic finite automata are exponentially more succinct than sweeping automata | 1981-01-01 | Paper |
| Minimal forms inλ-cakulus computations | 1980-01-01 | Paper |
