| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126225 | 2024-04-09 | Paper |
| Cloning games: a general framework for unclonable primitives | 2024-02-06 | Paper |
| Collusion-resistant functional encryption for RAMs | 2023-08-25 | Paper |
| Pseudorandom (function-Like) quantum state generators: new definitions and applications | 2023-08-14 | Paper |
| On the feasibility of unclonable encryption, and more | 2023-06-28 | Paper |
| Cryptography from pseudorandom quantum states | 2023-06-12 | Paper |
| Unclonable encryption, revisited | 2023-03-31 | Paper |
| Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? | 2023-03-29 | Paper |
| On the concurrent composition of quantum zero-knowledge | 2022-03-31 | Paper |
| Secure quantum extraction protocols | 2022-03-23 | Paper |
| Secure software leasing | 2021-12-08 | Paper |
| Unbounded multi-party computation from learning with errors | 2021-12-08 | Paper |
| Towards accountability in CRS generation | 2021-12-08 | Paper |
| Multi-key fully-homomorphic encryption in the plain model | 2021-12-01 | Paper |
| Private circuits: a modular approach | 2020-06-30 | Paper |
| Towards attribute-based encryption for RAMs from LWE: sub-linear decryption, and more | 2020-05-20 | Paper |
| Optimal bounded-collusion secure functional encryption | 2020-04-30 | Paper |
| From FE combiners to secure MPC and back | 2020-04-30 | Paper |
| Fully homomorphic NIZK and NIWI proofs | 2020-04-30 | Paper |
| Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification | 2020-03-09 | Paper |
| Two round information-theoretic MPC with malicious security | 2020-02-06 | Paper |
| Succinct garbling schemes from functional encryption through a local simulation paradigm | 2018-12-06 | Paper |
| Round-optimal secure multiparty computation with honest majority | 2018-09-26 | Paper |
| On secure two-party computation in three rounds | 2018-01-19 | Paper |
| Indistinguishability obfuscation for Turing machines: constant overhead and amortization | 2017-11-15 | Paper |
| A new approach to round-optimal secure multiparty computation | 2017-11-03 | Paper |
| Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software | 2017-06-23 | Paper |
| Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption | 2017-06-13 | Paper |
| Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps | 2017-06-13 | Paper |
| Cryptography with Updates | 2017-06-13 | Paper |
| Delegating RAM Computations with Adaptive Soundness and Privacy | 2016-12-22 | Paper |
| Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption | 2016-10-27 | Paper |
| Functional Encryption for Turing Machines | 2016-03-23 | Paper |
| From Selective to Adaptive Security in Functional Encryption | 2015-12-10 | Paper |
| Indistinguishability Obfuscation from Compact Functional Encryption | 2015-12-10 | Paper |
| Border basis detection is NP-complete | 2015-06-09 | Paper |
| Interactive Proofs under Continual Memory Leakage | 2014-08-07 | Paper |
| Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing | 2014-03-25 | Paper |
| Lower Bounds in the Hardware Token Model | 2014-02-18 | Paper |
| Non Observability in the Random Oracle Model | 2013-10-23 | Paper |
| On the (In)security of Fischlin’s Paradigm | 2013-03-18 | Paper |
| Complexity of Gröbner basis detection and border basis detection | 2012-11-08 | Paper |
| An Algebraic Characterization of Rainbow Connectivity | 2012-09-21 | Paper |
| New Hardness Results in Rainbow Connectivity | 2012-08-31 | Paper |
