| 2026 | CRYPTO | Pairing-Based SNARGs with Two Group Elements. | Gal Arnon, Jesko Dujmovic, Eylon Yogev |
| 2026 | CRYPTO | How to Use Polynomially-Hard iO: Turing Machine Obfuscation and More. | Jesko Dujmovic, Yao-Ching Hsieh, Abhishek Jain, Willy Quach |
| 2026 | EuroCrypt | When Simple Permutations Mix Poorly - Limited Independence does not Imply Pseudorandomness. | Jesko Dujmovic, Angelos Pelecanos, Stefano Tessaro |
| 2025 | CRYPTO | Designated-Verifier SNARGs with One Group Element. | Gal Arnon, Jesko Dujmovic, Yuval Ishai |
| 2025 | PKC | Registration-Based Encryption in the Plain Model. | Jesko Dujmovic, Giulio Malavolta, Wei Qi |
| 2025 | TCC | Space-Deniable Proofs. | Jesko Dujmovic, Christoph U. Gnther, Krzysztof Pietrzak |
| 2024 | EuroCrypt | Time-Lock Puzzles with Efficient Batch Solving. | Jesko Dujmovic, Rachit Garg, Giulio Malavolta |
| 2024 | EuroCrypt | Lower-Bounds on Public-Key Operations in PIR. | Jesko Dujmovic, Mohammad Hajiabadi |
| 2024 | TCC | Space-Lock Puzzles and Verifiable Space-Hard Functions from Root-Finding in Sparse Polynomials. | Nico Dttling, Jesko Dujmovic, Antoine Joux |
| 2022 | TCC | Rate-1 Incompressible Encryption from Standard Assumptions. | Pedro Branco, Nico Dttling, Jesko Dujmovic |