| Publication | Date of Publication | Type |
|---|
| Software with certified deletion | 2024-11-13 | Paper |
| Weakening assumptions for publicly-verifiable deletion | 2024-08-15 | Paper |
| On black-box verifiable outsourcing | 2024-08-01 | Paper |
| Weak zero-knowledge via the Goldreich-Levin theorem | 2024-06-26 | Paper |
| Refuting the dream XOR lemma via ideal obfuscation and resettable MPC | 2024-06-25 | Paper |
| Publicly-verifiable deletion via target-collapsing functions | 2024-02-06 | Paper |
| Cryptography with certified deletion | 2024-02-06 | Paper |
| Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge) | 2024-02-06 | Paper |
| Round-optimal black-box MPC in the plain model | 2024-02-02 | Paper |
| On non-uniform security for black-box non-interactive CCA commitments | 2024-01-16 | Paper |
| A new framework for quantum oblivious transfer | 2024-01-16 | Paper |
| Black-box reusable NISC with random oracles | 2023-12-08 | Paper |
| SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE | 2023-11-14 | Paper |
| Round-optimal black-box secure computation from two-round malicious OT | 2023-08-14 | Paper |
| Two-round maliciously secure computation with super-polynomial simulation | 2023-03-31 | Paper |
| Round-optimal black-box protocol compilers | 2022-08-30 | Paper |
| COA-secure obfuscation and applications | 2022-08-30 | Paper |
| SNARGs for P from sub-exponential DDH and QR | 2022-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5079334 | 2022-05-25 | Paper |
| On the round complexity of black-box secure MPC | 2022-04-22 | Paper |
| Improved computational extractors and their applications | 2022-04-22 | Paper |
| Compact ring signatures from learning with errors | 2022-03-31 | Paper |
| One-way functions imply secure computation in a quantum world | 2022-03-31 | Paper |
| On the round complexity of secure quantum computation | 2022-03-31 | Paper |
| On statistical security in two-party computation | 2022-03-23 | Paper |
| Weak Zero-Knowledge beyond the Black-Box Barrier | 2022-02-08 | Paper |
| On the CCA compatibility of public-key infrastructure | 2021-12-21 | Paper |
| Post-quantum multi-party computation | 2021-12-08 | Paper |
| Black-box non-interactive non-malleable commitments | 2021-12-08 | Paper |
| Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments | 2021-12-08 | Paper |
| Low error efficient computational extractors in the CRS model | 2021-12-01 | Paper |
| Statistical ZAP arguments | 2021-12-01 | Paper |
| Non-interactive non-malleability from quantum supremacy | 2020-03-09 | Paper |
| Weak zero-knowledge beyond the black-box barrier | 2020-01-30 | Paper |
| Succinct delegation for low-space non-deterministic computation | 2019-08-22 | Paper |
| Round optimal black-box ``commit-and-prove | 2018-12-11 | Paper |
| Upgrading to functional encryption | 2018-12-11 | Paper |
| Promise zero knowledge and its applications to round optimal MPC | 2018-09-26 | Paper |
| Statistical witness indistinguishability (and more) in two messages | 2018-07-17 | Paper |
| Round optimal concurrent MPC via strong simulation | 2018-01-19 | Paper |
| Round optimal concurrent non-malleability from polynomial hardness | 2018-01-19 | Paper |
| Do Distributed Differentially-Private Protocols Require Oblivious Transfer? | 2017-12-19 | Paper |
| Distinguisher-dependent simulation in two rounds and its applications | 2017-11-15 | Paper |
| Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs | 2017-06-13 | Paper |
| How to Generate and Use Universal Samplers | 2017-01-06 | Paper |
| Secure Computation from Elastic Noisy Channels | 2016-07-15 | Paper |
| All Complete Functionalities are Reversible | 2016-07-15 | Paper |
| Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation | 2016-06-10 | Paper |
| Statistical Randomized Encodings: A Complexity Theoretic View | 2015-10-27 | Paper |
| Black-Box Separations for Differentially Private Protocols | 2015-01-06 | Paper |
