| 2026 | EuroCrypt | Oblivious Ciphertext Compression via Linear Codes. | Pascal Giorgi, Bruno Grenet, Mark Simkin |
| 2025 | FC | Securely Computing One-Sided Matching Markets. | James Hsin-yu Chiang, Ivan Damgrd, Claudio Orlandi, Mahak Pancholi, Mark Simkin |
| 2025 | PKC | OCash: Fully Anonymous Payments Between Blockchain Light Clients. | Adam Blatchley Hansen, Jesper Buus Nielsen, Mark Simkin |
| 2025 | TCC | Time/Space Tradeoffs for Generic Attacks on Delay Functions. | Kasper Green Larsen, Mark Simkin |
| 2024 | ASIACRYPT | Extractable Witness Encryption for KZG Commitments and Efficient Laconic OT. | Nils Fleischhacker, Mathias Hall-Andersen, Mark Simkin |
| 2024 | ASIACRYPT | Jackpot: Non-interactive Aggregatable Lotteries. | Nils Fleischhacker, Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner |
| 2024 | CRYPTO | FRIDA: Data Availability Sampling from FRI. | Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner |
| 2024 | ESA | Invertible Bloom Lookup Tables with Less Memory and Randomness. | Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, Mark Simkin |
| 2024 | TCC | The Power of NAPs: - Compressing OR-Proofs via Collision-Resistant Hashing. | Katharina Boudgoust, Mark Simkin |
| 2023 | CCS | Ramen: Souper Fast Three-Party Computation for RAM Programs. | Lennart Braun, Mahak Pancholi, Rahul Rachuri, Mark Simkin |
| 2023 | CCS | Chipmunk: Better Synchronized Multi-Signatures from Lattices. | Nils Fleischhacker, Gottfried Herold, Mark Simkin, Zhenfei Zhang |
| 2023 | EuroCrypt | How to Compress Encrypted Data. | Nils Fleischhacker, Kasper Green Larsen, Mark Simkin |
| 2023 | PKC | Threshold Private Set Intersection with Better Communication Complexity. | Satrajit Ghosh, Mark Simkin |
| 2022 | CCS | Laconic Private Set-Intersection From Pairings. | Diego F. Aranha, Chuanwei Lin, Claudio Orlandi, Mark Simkin |
| 2022 | CCS | Squirrel: Efficient Synchronized Multi-Signatures from Lattices. | Nils Fleischhacker, Mark Simkin, Zhenfei Zhang |
| 2022 | CCS | Caulk: Lookup Arguments in Sublinear Time. | Arantxa Zapico, Vitalik Buterin, Dmitry Khovratovich, Mary Maller, Anca Nitulescu, Mark Simkin |
| 2022 | EuroCrypt | Property-Preserving Hash Functions for Hamming Distance from Standard Assumptions. | Nils Fleischhacker, Kasper Green Larsen, Mark Simkin |
| 2022 | SCN | On Sufficient Oracles for Secure Computation with Identifiable Abort. | Mark Simkin, Luisa Siniscalchi, Sophia Yakoubov |
| 2021 | EuroCrypt | The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. | Gianluca Brian, Antonio Faonio, Maciej Obremski, Joo Ribeiro, Mark Simkin, Maciej Skrski, Daniele Venturi |
| 2021 | EuroCrypt | Robust Property-Preserving Hash Functions for Hamming Distance and More. | Nils Fleischhacker, Mark Simkin |
| 2021 | PKC | On Publicly-Accountable Zero-Knowledge and Small Shuffle Arguments. | Nils Fleischhacker, Mark Simkin |
| 2021 | SODA | Optimal Oblivious Priority Queues. | Zahra Jafargholi, Kasper Green Larsen, Mark Simkin |
| 2020 | CRYPTO | Non-malleable Secret Sharing Against Bounded Joint-Tampering Attacks in the Plain Model. | Gianluca Brian, Antonio Faonio, Maciej Obremski, Mark Simkin, Daniele Venturi |
| 2020 | CRYPTO | Black-Box Transformations from Passive to Covert Security with Public Verifiability. | Ivan Damgrd, Claudio Orlandi, Mark Simkin |
| 2020 | EuroCrypt | Lower Bounds for Leakage-Resilient Secret Sharing. | Jesper Buus Nielsen, Mark Simkin |
| 2020 | SCN | Secret Sharing Lower Bound: Either Reconstruction is Hard or Shares are Long. | Kasper Green Larsen, Mark Simkin |
| 2020 | TCC | Lower Bounds for Multi-server Oblivious RAMs. | Kasper Green Larsen, Mark Simkin, Kevin Yeo |
| 2019 | ASIACRYPT | Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead. | Michael A. Raskin, Mark Simkin |
| 2019 | CRYPTO | Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures. | Divesh Aggarwal, Ivan Damgrd, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, Joo Ribeiro, Mark Simkin |
| 2019 | CRYPTO | The Communication Complexity of Threshold Private Set Intersection. | Satrajit Ghosh, Mark Simkin |
| 2018 | ACNS | Continuously Non-malleable Codes with Split-State Refresh. | Antonio Faonio, Jesper Buus Nielsen, Mark Simkin, Daniele Venturi |
| 2018 | CRYPTO | Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings. | Ivan Damgrd, Claudio Orlandi, Mark Simkin |
| 2018 | PKC | Compact Zero-Knowledge Proofs of Small Hamming Weight. | Ivan Damgrd, Ji Luo, Sabine Oechsner, Peter Scholl, Mark Simkin |
| 2016 | PKC | Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys. | Nils Fleischhacker, Johannes Krupp, Giulio Malavolta, Jonas Schneider, Dominique Schrder, Mark Simkin |
| 2016 | PKC | Nearly Optimal Verifiable Data Streaming. | Johannes Krupp, Dominique Schrder, Mark Simkin, Dario Fiore, Giuseppe Ateniese, Stefan Nrnberger |
| 2015 | FC | VeriStream - A Framework for Verifiable Data Streaming. | Dominique Schrder, Mark Simkin |
| 2014 | ACNS | WebTrust - A Comprehensive Authenticity and Integrity Framework for HTTP. | Michael Backes, Rainer W. Gerling, Sebastian Gerling, Stefan Nrnberger, Dominique Schrder, Mark Simkin |
| 2014 | CCS | POSTER: Enhancing Security and Privacy with Google Glass. | Johannes Krupp, Dominique Schrder, Mark Simkin |
| 2014 | ESORICS | Ubic: Bridging the Gap between Digital Cryptography and the Physical World. | Mark Simkin, Dominique Schrder, Andreas Bulling, Mario Fritz |