| Publication | Date of Publication | Type |
|---|
| Secure multiparty computation with identifiable abort via vindicating release | 2024-12-13 | Paper |
| Improved straight-line extraction in the random oracle model with applications to signature aggregation | 2023-08-16 | Paper |
| Adaptively secure MPC with sublinear communication complexity | 2023-04-13 | Paper |
| Multiparty generation of an RSA modulus | 2022-12-07 | Paper |
| Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols | 2022-08-30 | Paper |
| Multiparty generation of an RSA modulus | 2022-04-04 | Paper |
| Going beyond dual execution: MPC for functions with efficient verification | 2021-12-01 | Paper |
| Minimizing trust in hardware wallets with two factor signatures | 2021-03-17 | Paper |
| Adaptively secure MPC with sublinear communication complexity | 2020-03-09 | Paper |
| Socially Optimal Mining Pools | 2019-01-30 | Paper |
| Multi-key searchable encryption, revisited | 2018-05-16 | Paper |
| Analysis of the Blockchain Protocol in Asynchronous Networks | 2017-06-13 | Paper |
| Bounded KDM Security from iO and OWF | 2016-10-21 | Paper |
| Secure Computation from Millionaire | 2016-06-10 | Paper |
| Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings | 2016-03-23 | Paper |
| Lower Bounds on Assumptions Behind Indistinguishability Obfuscation | 2016-03-23 | Paper |
| Completely fair SFE and coalition-safe cheap talk | 2015-08-03 | Paper |
| Computing on authenticated data | 2015-05-12 | Paper |
| Bit Encryption Is Complete | 2014-07-25 | Paper |
| Efficient fork-linearizable access to untrusted shared memory | 2014-03-13 | Paper |
| Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead | 2013-03-18 | Paper |
| Blackbox Construction of a More Than Non-Malleable CCA1 Encryption Scheme from Plaintext Awareness | 2012-09-25 | Paper |
| Computing on Authenticated Data | 2012-06-15 | Paper |
| Securely obfuscating re-encryption | 2012-01-13 | Paper |
| Two-output secure computation with malicious adversaries | 2011-05-27 | Paper |
| Optimistic concurrent zero knowledge | 2010-12-07 | Paper |
| Collusion-free protocols | 2010-08-16 | Paper |
| Approximating the smallest grammar | 2010-08-05 | Paper |
| Collusion-Free Multiparty Computation in the Mediated Model | 2009-10-20 | Paper |
| Purely Rational Secret Sharing (Extended Abstract) | 2009-03-03 | Paper |
| Efficient Protocols for Set Membership and Range Proofs | 2009-02-10 | Paper |
| Collusion-Free Protocols in the Mediated Model | 2009-02-10 | Paper |
| The Smallest Grammar Problem | 2008-12-21 | Paper |
| Bounded CCA2-Secure Encryption | 2008-05-15 | Paper |
| Relations Among Notions of Non-malleability for Encryption | 2008-05-15 | Paper |
| Unconditional Characterizations of Non-interactive Zero-Knowledge | 2008-03-17 | Paper |
| Simulatable Adaptive Oblivious Transfer | 2007-11-29 | Paper |
| Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One | 2007-09-04 | Paper |
| Securely Obfuscating Re-encryption | 2007-08-30 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828933 | 2004-11-29 | Paper |
