WebTrust - A Comprehensive Authenticity and Integrity Framework for HTTP. - Michael Backes 001; Rainer W. Gerling; Sebastian Gerling; Stefan Nürnberger; Dominique Schröder; Mark Simkin 001 (ACNS, 2014)

POSTER: Enhancing Security and Privacy with Google Glass. - Johannes Krupp; Dominique Schröder; Mark Simkin 001 (CCS, 2014)

Ubic: Bridging the Gap between Digital Cryptography and the Physical World. - Mark Simkin 001; Dominique Schröder; Andreas Bulling; Mario Fritz (ESORICS (1), 2014)

VeriStream - A Framework for Verifiable Data Streaming. - Dominique Schröder; Mark Simkin 001 (Financial Cryptography, 2015)

Efficient Unlinkable Sanitizable Signatures from Signatures with Rerandomizable Keys. - Nils Fleischhacker; Johannes Krupp; Giulio Malavolta; Jonas Schneider 001; Dominique Schröder; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2015)

Nearly Optimal Verifiable Data Streaming (Full Version). - Johannes Krupp; Dominique Schröder; Mark Simkin 001; Dario Fiore 001; Giuseppe Ateniese; Stefan Nürnberger (IACR Cryptol. ePrint Arch., 2015)

Nearly Optimal Verifiable Data Streaming. - Johannes Krupp; Dominique Schröder; Mark Simkin 001; Dario Fiore 001; Giuseppe Ateniese; Stefan Nürnberger (Public Key Cryptography (1), 2016)

Compact Zero-Knowledge Proofs of Small Hamming Weight. - Ivan Damgård; Ji Luo 002; Sabine Oechsner; Peter Scholl; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2017)

Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings. - Ivan Damgård; Claudio Orlandi; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2017)

Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures. - Divesh Aggarwal; Ivan Damgård; Jesper Buus Nielsen; Maciej Obremski; Erick Purwanto; João Ribeiro 002; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2018)

Oblivious RAM with Small Storage Overhead. - Michael A. Raskin; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2018)

Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys. - Nils Fleischhacker; Johannes Krupp; Giulio Malavolta; Jonas Schneider 001; Dominique Schröder; Mark Simkin 001 (IET Inf. Secur., 2018)

Functional Credentials. - Dominic Deuber; Matteo Maffei; Giulio Malavolta; Max Rabkin; Dominique Schröder; Mark Simkin 001 (Proc. Priv. Enhancing Technol., 2018)

Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead. - Michael A. Raskin; Mark Simkin 001 (ASIACRYPT (2), 2019)

Use your Brain! Arithmetic 3PC For Any Modulus with Active Security. - Hendrik Eerikson; Claudio Orlandi; Pille Pullonen; Joonas Puura; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2019)

The Communication Complexity of Threshold Private Set Intersection. - Satrajit Ghosh; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2019)

Optimal Oblivious Priority Queues and Offline Oblivious RAM. - Zahra Jafargholi; Kasper Green Larsen; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2019)

Exponential Lower Bounds for Secret Sharing. - Kasper Green Larsen; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2019)

Lower Bounds for Multi-Server Oblivious RAMs. - Kasper Green Larsen; Mark Simkin 001; Kevin Yeo (IACR Cryptol. ePrint Arch., 2019)

Lower Bounds for Leakage-Resilient Secret Sharing. - Jesper Buus Nielsen; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2019)

Continuously non-malleable codes with split-state refresh. - Antonio Faonio; Jesper Buus Nielsen; Mark Simkin 001; Daniele Venturi 001 (Theor. Comput. Sci., 2019)

Use Your Brain! Arithmetic 3PC for Any Modulus with Active Security. - Hendrik Eerikson; Marcel Keller; Claudio Orlandi; Pille Pullonen; Joonas Puura; Mark Simkin 001 (ITC, 2020)

Secret Sharing Lower Bound: Either Reconstruction is Hard or Shares are Long. - Kasper Green Larsen; Mark Simkin 001 (SCN, 2020)

Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors. - Divesh Aggarwal; Maciej Obremski; João Ribeiro 002; Mark Simkin 001; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2020)

Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory. - Divesh Aggarwal; Maciej Obremski; João Ribeiro 002; Mark Simkin 001; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2020)

Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model. - Gianluca Brian; Antonio Faonio; Maciej Obremski; Mark Simkin 001; Daniele Venturi 001 (IACR Cryptol. ePrint Arch., 2020)

Black-Box Transformations from Passive to Covert Security with Public Verifiability. - Ivan Damgård; Claudio Orlandi; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2020)

Robust Property-Preserving Hash Functions for Hamming Distance and More. - Nils Fleischhacker; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2020)

Optimal Oblivious Priority Queues. - Zahra Jafargholi; Kasper Green Larsen; Mark Simkin 001 (SODA, 2021)

On Publicly-Accountable Zero-Knowledge and Small Shuffle Arguments. - Nils Fleischhacker; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2021)

Property-Preserving Hash Functions from Standard Assumptions. - Nils Fleischhacker; Kasper Green Larsen; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2021)

Multiparty Computation with Covert Security and Public Verifiability. - Peter Scholl; Mark Simkin 001; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2021)

On Sufficient Oracles for Secure Computation with Identifiable Abort. - Mark Simkin 001; Luisa Siniscalchi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2021)

Property-Preserving Hash Functions for Hamming Distance from Standard Assumptions. - Nils Fleischhacker; Kasper Green Larsen; Mark Simkin 001 (EUROCRYPT (2), 2022)

Laconic Private Set-Intersection From Pairings. - Diego F. Aranha; Chuanwei Lin; Claudio Orlandi; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2022)

Interactive Non-Malleable Codes Against Desynchronizing Attacks in the Multi-Party Setting. - Nils Fleischhacker; Suparno Ghoshal; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2022)

How to Compress Encrypted Data. - Nils Fleischhacker; Kasper Green Larsen; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2022)

Squirrel: Efficient Synchronized Multi-Signatures from Lattices. - Nils Fleischhacker; Mark Simkin 001; Zhenfei Zhang (IACR Cryptol. ePrint Arch., 2022)

Distributed Shuffling in Adversarial Environments. - Kasper Green Larsen; Maciej Obremski; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2022)

Caulk: Lookup Arguments in Sublinear Time. - Arantxa Zapico; Vitalik Buterin; Dmitry Khovratovich; Mary Maller; Anca Nitulescu; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2022)

Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors. - Divesh Aggarwal; Maciej Obremski; João Ribeiro 002; Mark Simkin 001; Luisa Siniscalchi (IEEE Trans. Inf. Theory, 2022)

The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. - Gianluca Brian; Antonio Faonio; Maciej Obremski; João Ribeiro 002; Mark Simkin 001; Maciej Skórski; Daniele Venturi 001 (IEEE Trans. Inf. Theory, 2022)

Ramen: Souper Fast Three-Party Computation for RAM Programs. - Lennart Braun; Mahak Pancholi; Rahul Rachuri; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2023)

Jackpot: Non-Interactive Aggregatable Lotteries. - Nils Fleischhacker; Mathias Hall-Andersen; Mark Simkin 001; Benedikt Wagner (IACR Cryptol. ePrint Arch., 2023)

Chipmunk: Better Synchronized Multi-Signatures from Lattices. - Nils Fleischhacker; Gottfried Herold; Mark Simkin 001; Zhenfei Zhang (IACR Cryptol. ePrint Arch., 2023)

Invertible Bloom Lookup Tables with Less Memory and Randomness. - Nils Fleischhacker; Kasper Green Larsen; Maciej Obremski; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2023)

Compressing Encrypted Data Over Small Fields. - Nils Fleischhacker; Kasper Green Larsen; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2023)

Threshold Private Set Intersection with Better Communication Complexity. - Satrajit Ghosh; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2023)

Stronger Lower Bounds for Leakage-Resilient Secret Sharing. - Charlotte Hoffmann; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2023)

Foundations of Data Availability Sampling. - Mathias Hall-Andersen; Mark Simkin 001; Benedikt Wagner (IACR Commun. Cryptol., 2024)

Time-Based Cryptography From Weaker Assumptions: Randomness Beacons, Delay Functions and More. - Damiano Abram; Lawrence Roy; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2024)

The Power of NAPs: Compressing OR-Proofs via Collision-Resistant Hashing. - Katharina Boudgoust; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2024)

Securely Computing One-Sided Matching Markets. - James Hsin-Yu Chiang; Ivan Damgård; Claudio Orlandi; Mahak Pancholi; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2024)

Extractable Witness Encryption for KZG Commitments and Efficient Laconic OT. - Nils Fleischhacker; Mathias Hall-Andersen; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2024)

FRIDA: Data Availability Sampling from FRI. - Mathias Hall-Andersen; Mark Simkin 001; Benedikt Wagner (IACR Cryptol. ePrint Arch., 2024)

OCash: Fully Anonymous Payments between Blockchain Light Clients. - Adam Blatchley Hansen; Jesper Buus Nielsen; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2024)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling. - Dankrad Feist; Gottfried Herold; Mark Simkin 001; Benedikt Wagner (CoRR, 2025)