Mark Simkin

I am an independent cryptography researcher. I received my PhD in October 2019 at Aarhus University, where I was advised by Ivan Damgård and co-advised by Claudio Orlandi. After my PhD, I had the pleasure to be a postdoctoral researcher under the supervision of Kasper Green Larsen at Aarhus University. I have been working as a cryptography researcher at the EF.

Publications

Time-Based Cryptography From Weaker Assumptions: Randomness Beacons, Delay Functions and More

Damiano Abram, Lawrence Roy, Mark Simkin
In Submission | [ePrint]

OCash: Fully Anonymous Payments between Blockchain Light Clients

Adam Blatchley Hansen, Jesper Buus Nielsen, Mark Simkin
In Submission | [ePrint]

Foundations of Data Availability Sampling

Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner
In Submission | [ePrint]

The Power of NAPs: Compressing OR-Proofs via Collision-Resistant Hashing

Katharina Boudgoust, Mark Simkin
TCC 2024 | [ePrint]

Extractable Witness Encryption for KZG Commitments and Efficient Laconic OT

Nils Fleischhacker, Mathias Hall-Andersen, Mark Simkin
Asiacrypt 2024 | [ePrint]

Jackpot: Non-Interactive Aggregatable Lotteries

Nils Fleischhacker, Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner
Asiacrypt 2024 | [ePrint]

Invertible Bloom Lookup Tables with Less Memory and Randomness

Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, Mark Simkin
ESA 2024 | [ePrint]

FRIDA: Data Availability Sampling from FRI

Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner
CRYPTO 2024 | [ePrint]

Chipmunk: Better Synchronized Multi-Signatures from Lattices

Nils Fleischhacker, Gottfried Herold, Mark Simkin, Zhenfei Zhang
CCS 2023 | [ePrint]

Ramen: Souper Fast Three-Party Computation for RAM Programs

Lennart Braun, Mahak Pancholi, Rahul Rachuri, Mark Simkin
CCS 2023 | [ePrint]

Stronger Lower Bounds for Leakage-Resilient Secret Sharing

Charlotte Hoffmann, Mark Simkin
Latincrypt 2023 | [ePrint]

Compressing Encrypted Data Over Small Fields

Nils Fleischhacker, Kasper Green Larsen, Mark Simkin
Preprint 2023 | [ePrint]

How to Compress Encrypted Data

Nils Fleischhacker, Kasper Green Larsen, Mark Simkin
Eurocrypt 2023 | [ePrint]

Threshold Private Set Intersection with Better Communication Complexity

Satrajit Ghosh, Mark Simkin
PKC 2023 | [ePrint]

Distributed Shuffling in Adversarial Environments

Kasper Green Larsen, Maciej Obremski, Mark Simkin
ITC 2023 | [ePrint]

Interactive Non-Malleable Codes Against Desynchronizing Attacks in the Multi-Party Setting

Nils Fleischhacker, Suparno Ghoshal, Mark Simkin
ITC 2023 | [ePrint]

Squirrel: Efficient Synchronized Multi-Signatures from Lattices

Nils Fleischhacker, Mark Simkin, Zhenfei Zhang
CCS 2022 | [ePrint]

Laconic Private Set-Intersection From Pairings

Diego Aranha, Chuanwei Lin, Claudio Orlandi, Mark Simkin
CCS 2022 | [ePrint]

Caulk: Lookup Arguments in Sublinear Time

Arantxa Zapico, Vitalik Buterin, Dmitry Khovratovich, Mary Maller, Anca Nitulesc, Mark Simkin
CCS 2022 | [ePrint]

On Sufficient Oracles for Secure Computation with Identifiable Abort

Mark Simkin, Luisa Siniscalchi, Sophia Yakoubov
SCN 2022 | [ePrint]

Multiparty Computation with Covert Security and Public Verifiability

Peter Scholl, Mark Simkin, Luisa Siniscalchi
ITC 2022 | [ePrint]

Privacy Amplification with Tamperable Memory via Non-malleable Two-source Extractors

Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi
IEEE Transactions on Information Theory 2022 | [ePrint]

Property-Preserving Hash Functions from Standard Assumptions

Nils Fleischhacker, Kasper Green Larsen, Mark Simkin
Eurocrypt 2022 | [ePrint]

On Publicly-Accountable Zero-Knowledge and Small Shuffle Arguments

Nils Fleischhacker and Mark Simkin
PKC 2021 | [ePrint]

Robust Property-Preserving Hash Functions for Hamming Distance and More

Nils Fleischhacker and Mark Simkin
Eurocrypt 2021 | [ePrint]

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, Mark Simkin, Maciej Skórski, Daniele Venturi
Eurocrypt 2021 | [ePrint]

Optimal Oblivious Priority Queues and Offline Oblivious RAM

Zahra Jafargholi, Kasper Green Larsen, Mark Simkin
SODA 2021 | [ePrint]

Lower Bounds for Multi-Server Oblivious RAMs

Kasper Green Larsen, Mark Simkin, Kevin Yeo
TCC 2020 | [ePrint]

Secret Sharing Lower Bound: Either Reconstruction is Hard or Shares are Long

Kasper Green Larsen and Mark Simkin
SCN 2020 | [ePrint]

Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model

Gianlunca Brian, Antonio Faonio, Maciej Obremski, Mark Simkin, Daniele Venturi
CRYPTO 2020 | [ePrint]

Black-Box Transformations From Passive to Covert Security with Public Verifiability

Ivan Dåmgard, Claudio Orlandi, Mark Simkin
CRYPTO 2020 | [ePrint]

Use your Brain! Arithmetic 3PC For Any Modulus with Active Security

Hendrik Eerikson, Marcel Keller, Claudio Orlandi, Pille Pullonen, Joonas Puura, Mark Simkin
ITC 2020 | [ePrint]

Lower Bounds for Leakage-Resilient Secret Sharing

Jesper Buus Nielsen and Mark Simkin
Eurocrypt 2020 | [ePrint]

Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead

Michael Raskin and Mark Simkin
Asiacrypt 2019 | [ePrint]

Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures

Divesh Aggarwal, Ivan Damgard, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, Joao Ribeiro, Mark Simkin
CRYPTO 2019 | [ePrint]

The Communication Complexity of Threshold Private Set Intersection

Satrajit Ghosh and Mark Simkin
CRYPTO 2019 | [ePrint]

Yet Another Compiler for Active Security or: Effcient MPC Over Arbitrary Rings

Ivan Dåmgard, Claudio Orlandi, Mark Simkin
CRYPTO 2018 | [ePrint]

Compact Zero-Knowledge Proofs of Small Hamming Weight

Ivan Dåmgard, Ji Luo, Sabine Oechsner, Peter Scholl, Mark Simkin
PKC 2018 | [ePrint]

Functional Credentials

Dominic Deuber, Matteo Maffei, Giulio Malavolta, Max Rabkin, Dominique Schröder, Mark Simkin
PETS 2018

Continuously Non-Malleable Codes with Split-State Refresh

Antonio Faonio, Jesper Buus Nielsen, Mark Simkin, Daniele Venturi
ACNS 2018 | [ePrint]

Efficient Unlinkable Sanitizable Signatures from Signatures with Rerandomizable Keys

Nils Fleischhacker, Johannes Krupp, Giulio Malavolta, Jonas Schneider, Dominique Schröder, Mark Simkin
PKC 2016 | [ePrint]

Nearly Optimal Verifiable Data Streaming

Johannes Krupp, Dominique Schröder, Mark Simkin, Dario Fiore, Giuseppe Ateniese, Stefan Nürnberger
PKC 2016 | [ePrint]

VeriStream - A Framework for Verifiable Data Streaming

Dominique Schröder and Mark Simkin
FC 2015

Ubic - Bridging the Gap between Digital Cryptography and the Physical World

Mark Simkin, Dominique Schröder, Andreas Bulling, Mario Fritz
ESORICS 2015

WebTrust - A Comprehensive Authenticity and Integrity Framework for HTTP

Michael Backes, Rainer Gerling, Sebastian Gerling, Stefan Nürnberger, Dominique Schröder, Mark Simkin
ACNS 2014

Contact

Email

firstname at univariate.org