| Publication | Date of Publication | Type |
|---|
| Malicious security for SCALES. Outsourced computation with ephemeral servers | 2024-12-13 | Paper |
| R3PO: reach-restricted reactive program obfuscation and its applications | 2024-11-12 | Paper |
| CASE: a new frontier in public-key authenticated encryption | 2024-08-02 | Paper |
| A map of witness maps: new definitions and connections | 2023-11-16 | Paper |
| Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions | 2023-08-14 | Paper |
| Secure non-interactive reducibility is decidable | 2023-08-14 | Paper |
| SCALES. MPC with small clients and larger ephemeral servers | 2023-08-14 | Paper |
| Group Structure in Correlations and Its Applications in Cryptography. | 2023-07-03 | Paper |
| On communication models and best-achievable security in two-round MPC | 2023-04-13 | Paper |
| Cryptography from one-way communication: on completeness of finite channels | 2023-03-29 | Paper |
| Witness Maps and Applications | 2022-10-13 | Paper |
| COA-secure obfuscation and applications | 2022-08-30 | Paper |
| Secure non-interactive reduction and spectral analysis of correlations | 2022-08-30 | Paper |
| Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration | 2022-04-22 | Paper |
| Zero-communication reductions | 2022-03-23 | Paper |
| Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002694 | 2021-07-28 | Paper |
| Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation | 2020-05-12 | Paper |
| Uncovering algebraic structures in the MPC landscape | 2020-02-06 | Paper |
| Towards characterizing securely computable two-party randomized functions | 2018-05-16 | Paper |
| R\'enyi Information Complexity and an Information Theoretic Characterization of the Partition Bound | 2017-12-19 | Paper |
| Reconciling non-malleability with homomorphic encryption | 2017-10-12 | Paper |
| Limits of random oracles in secure computation | 2017-05-19 | Paper |
| Assisted Common Information With an Application to Secure Two-Party Sampling | 2017-05-16 | Paper |
| Communication and Randomness Lower Bounds for Secure Computation | 2017-04-28 | Paper |
| Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents | 2016-12-22 | Paper |
| Secure Protocol Transformations | 2016-10-27 | Paper |
| All Complete Functionalities are Reversible | 2016-07-15 | Paper |
| Optimal Computational Split-state Non-malleable Codes | 2016-04-08 | Paper |
| Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations | 2015-12-10 | Paper |
| Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted Data | 2015-09-30 | Paper |
| On the Practical Security of Inner Product Functional Encryption | 2015-08-27 | Paper |
| A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations | 2015-07-06 | Paper |
| Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP | 2015-07-06 | Paper |
| Circuits resilient to additive attacks with applications to secure computation | 2015-06-26 | Paper |
| A Unified Characterization of Completeness and Triviality for Secure Function Evaluation | 2014-08-20 | Paper |
| On the Communication Complexity of Secure Computation | 2014-08-07 | Paper |
| Secure Computation Using Leaky Tokens | 2014-07-01 | Paper |
| A Full Characterization of Completeness for Two-Party Randomized Function Evaluation | 2014-05-27 | Paper |
| On the Power of Public-Key Encryption in Secure Computation | 2014-02-18 | Paper |
| Lower Bounds in the Hardware Token Model | 2014-02-18 | Paper |
| On Fair Exchange, Fair Coins and Fair Sampling | 2013-09-02 | Paper |
| Robust Pseudorandom Generators | 2013-08-06 | Paper |
| New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation | 2012-09-25 | Paper |
| Resource fairness and composability of cryptographic protocols | 2012-01-13 | Paper |
| The Limits of Common Coins: Further Results | 2011-12-16 | Paper |
| Constant-Rate Oblivious Transfer from Noisy Channels | 2011-08-12 | Paper |
| Efficient Non-interactive Secure Computation | 2011-05-27 | Paper |
| Exploring the Limits of Common Coins Using Frontier Analysis of Protocols | 2011-05-19 | Paper |
| Attribute-Based Signatures | 2011-02-11 | Paper |
| A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security | 2010-08-24 | Paper |
| Concurrent general composition of secure protocols in the timing model | 2010-08-16 | Paper |
| New notions of security | 2010-08-15 | Paper |
| Approximating the smallest grammar | 2010-08-05 | Paper |
| Statistically Hiding Sets | 2009-04-29 | Paper |
| Rerandomizable RCCA Encryption | 2009-03-10 | Paper |
| Secure Arithmetic Computation with No Honest Majority | 2009-03-03 | Paper |
| Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation | 2009-03-03 | Paper |
| Founding Cryptography on Oblivious Transfer – Efficiently | 2009-02-10 | Paper |
| Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations | 2009-02-10 | Paper |
| Towards Robust Computation on Encrypted Data | 2009-02-10 | Paper |
| The Smallest Grammar Problem | 2008-12-21 | Paper |
| Homomorphic Encryption with CCA Security | 2008-08-19 | Paper |
| Concurrent composition of secure protocols in the timing model | 2007-12-06 | Paper |
| Advances in Cryptology - EUROCRYPT 2004 | 2007-09-25 | Paper |
| Private Circuits II: Keeping Secrets in Tamperable Circuits | 2007-09-24 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808654 | 2004-08-12 | Paper |
