Mark Simkin

98 papers A* 7A 6B 2Misc 2Journal 55Unranked 26
YearRankTypeTitle / Venue / Authors
2026 J jnl
Oblivious Ciphertext Compression via Linear Codes.
IACR Cryptol. ePrint Arch.
Pascal Giorgi, Bruno Grenet, Mark Simkin
2025 — conf
OCash: Fully Anonymous Payments Between Blockchain Light Clients.
PKC (5)
Adam Blatchley Hansen, Jesper Buus Nielsen, Mark Simkin
2025 J jnl
Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling.
CoRR
Dankrad Feist, Gottfried Herold, Mark Simkin, Benedikt Wagner
2025 A conf
Securely Computing One-Sided Matching Markets.
FC
James Hsin-yu Chiang, Ivan Damgård, Claudio Orlandi, Mahak Pancholi, Mark Simkin
2025 J jnl
Silent Threshold Encryption with One-Shot Adaptive Security.
IACR Cryptol. ePrint Arch.
Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner
2025 — conf
Time/Space Tradeoffs for Generic Attacks on Delay Functions.
TCC (4)
Kasper Green Larsen, Mark Simkin
2024 — conf
Extractable Witness Encryption for KZG Commitments and Efficient Laconic OT.
ASIACRYPT (2)
Nils Fleischhacker, Mathias Hall-Andersen, Mark Simkin
2024 J jnl
Extractable Witness Encryption for KZG Commitments and Efficient Laconic OT.
IACR Cryptol. ePrint Arch.
Nils Fleischhacker, Mathias Hall-Andersen, Mark Simkin
2024 — conf
FRIDA: Data Availability Sampling from FRI.
CRYPTO (6)
Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner
2024 J jnl
FRIDA: Data Availability Sampling from FRI.
IACR Cryptol. ePrint Arch.
Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner
2024 J jnl
Foundations of Data Availability Sampling.
IACR Commun. Cryptol.
Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner
2024 A conf
Invertible Bloom Lookup Tables with Less Memory and Randomness.
ESA
Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, Mark Simkin
2024 — conf
Jackpot: Non-interactive Aggregatable Lotteries.
ASIACRYPT (6)
Nils Fleischhacker, Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner
2024 J jnl
OCash: Fully Anonymous Payments between Blockchain Light Clients.
IACR Cryptol. ePrint Arch.
Adam Blatchley Hansen, Jesper Buus Nielsen, Mark Simkin
2024 J jnl
Securely Computing One-Sided Matching Markets.
IACR Cryptol. ePrint Arch.
James Hsin-yu Chiang, Ivan Damgård, Claudio Orlandi, Mahak Pancholi, Mark Simkin
2024 — conf
The Power of NAPs: - Compressing OR-Proofs via Collision-Resistant Hashing.
TCC (1)
Katharina Boudgoust, Mark Simkin
2024 J jnl
The Power of NAPs: Compressing OR-Proofs via Collision-Resistant Hashing.
IACR Cryptol. ePrint Arch.
Katharina Boudgoust, Mark Simkin
2024 J jnl
Time-Based Cryptography From Weaker Assumptions: Randomness Beacons, Delay Functions and More.
IACR Cryptol. ePrint Arch.
Damiano Abram, Lawrence Roy, Mark Simkin
2023 A* conf
Chipmunk: Better Synchronized Multi-Signatures from Lattices.
CCS
Nils Fleischhacker, Gottfried Herold, Mark Simkin, Zhenfei Zhang
2023 J jnl
Chipmunk: Better Synchronized Multi-Signatures from Lattices.
IACR Cryptol. ePrint Arch.
Nils Fleischhacker, Gottfried Herold, Mark Simkin, Zhenfei Zhang
2023 J jnl
Compressing Encrypted Data Over Small Fields.
IACR Cryptol. ePrint Arch.
Nils Fleischhacker, Kasper Green Larsen, Mark Simkin
2023 A conf
Distributed Shuffling in Adversarial Environments.
ITC
Kasper Green Larsen, Maciej Obremski, Mark Simkin
2023 J jnl
Foundations of Data Availability Sampling.
IACR Cryptol. ePrint Arch.
Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner
2023 — conf
How to Compress Encrypted Data.
EUROCRYPT (1)
Nils Fleischhacker, Kasper Green Larsen, Mark Simkin
2023 A conf
Interactive Non-Malleable Codes Against Desynchronizing Attacks in the Multi-Party Setting.
ITC
Nils Fleischhacker, Suparno Ghoshal, Mark Simkin
2023 J jnl
Invertible Bloom Lookup Tables with Less Memory and Randomness.
CoRR
Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, Mark Simkin
2023 J jnl
Invertible Bloom Lookup Tables with Less Memory and Randomness.
IACR Cryptol. ePrint Arch.
Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, Mark Simkin
2023 J jnl
Jackpot: Non-Interactive Aggregatable Lotteries.
IACR Cryptol. ePrint Arch.
Nils Fleischhacker, Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner
2023 A* conf
Ramen: Souper Fast Three-Party Computation for RAM Programs.
CCS
Lennart Braun, Mahak Pancholi, Rahul Rachuri, Mark Simkin
2023 J jnl
Ramen: Souper Fast Three-Party Computation for RAM Programs.
IACR Cryptol. ePrint Arch.
Lennart Braun, Mahak Pancholi, Rahul Rachuri, Mark Simkin
2023 — conf
Stronger Lower Bounds for Leakage-Resilient Secret Sharing.
LATINCRYPT
Charlotte Hoffmann, Mark Simkin
2023 J jnl
Stronger Lower Bounds for Leakage-Resilient Secret Sharing.
IACR Cryptol. ePrint Arch.
Charlotte Hoffmann, Mark Simkin
2023 — conf
Threshold Private Set Intersection with Better Communication Complexity.
Public Key Cryptography (2)
Satrajit Ghosh, Mark Simkin
2023 J jnl
Threshold Private Set Intersection with Better Communication Complexity.
IACR Cryptol. ePrint Arch.
Satrajit Ghosh, Mark Simkin
2022 A* conf
Caulk: Lookup Arguments in Sublinear Time.
CCS
Arantxa Zapico, Vitalik Buterin, Dmitry Khovratovich, Mary Maller, Anca Nitulescu, Mark Simkin
2022 J jnl
Caulk: Lookup Arguments in Sublinear Time.
IACR Cryptol. ePrint Arch.
Arantxa Zapico, Vitalik Buterin, Dmitry Khovratovich, Mary Maller, Anca Nitulescu, Mark Simkin
2022 J jnl
Distributed Shuffling in Adversarial Environments.
IACR Cryptol. ePrint Arch.
Kasper Green Larsen, Maciej Obremski, Mark Simkin
2022 J jnl
How to Compress Encrypted Data.
IACR Cryptol. ePrint Arch.
Nils Fleischhacker, Kasper Green Larsen, Mark Simkin
2022 J jnl
Interactive Non-Malleable Codes Against Desynchronizing Attacks in the Multi-Party Setting.
IACR Cryptol. ePrint Arch.
Nils Fleischhacker, Suparno Ghoshal, Mark Simkin
2022 A* conf
Laconic Private Set-Intersection From Pairings.
CCS
Diego F. Aranha, Chuanwei Lin, Claudio Orlandi, Mark Simkin
2022 J jnl
Laconic Private Set-Intersection From Pairings.
IACR Cryptol. ePrint Arch.
Diego F. Aranha, Chuanwei Lin, Claudio Orlandi, Mark Simkin
2022 A conf
Multiparty Computation with Covert Security and Public Verifiability.
ITC
Peter Scholl, Mark Simkin, Luisa Siniscalchi
2022 Misc conf
On Sufficient Oracles for Secure Computation with Identifiable Abort.
SCN
Mark Simkin, Luisa Siniscalchi, Sophia Yakoubov
2022 J jnl
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors.
IEEE Trans. Inf. Theory
Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi
2022 — conf
Property-Preserving Hash Functions for Hamming Distance from Standard Assumptions.
EUROCRYPT (2)
Nils Fleischhacker, Kasper Green Larsen, Mark Simkin
2022 A* conf
Squirrel: Efficient Synchronized Multi-Signatures from Lattices.
CCS
Nils Fleischhacker, Mark Simkin, Zhenfei Zhang
2022 J jnl
Squirrel: Efficient Synchronized Multi-Signatures from Lattices.
IACR Cryptol. ePrint Arch.
Nils Fleischhacker, Mark Simkin, Zhenfei Zhang
2022 J jnl
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free.
IEEE Trans. Inf. Theory
Gianluca Brian, Antonio Faonio, Maciej Obremski, João Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi
2021 J jnl
Multiparty Computation with Covert Security and Public Verifiability.
IACR Cryptol. ePrint Arch.
Peter Scholl, Mark Simkin, Luisa Siniscalchi
2021 — conf
On Publicly-Accountable Zero-Knowledge and Small Shuffle Arguments.
Public Key Cryptography (2)
Nils Fleischhacker, Mark Simkin
2021 J jnl
On Publicly-Accountable Zero-Knowledge and Small Shuffle Arguments.
IACR Cryptol. ePrint Arch.
Nils Fleischhacker, Mark Simkin
2021 J jnl
On Sufficient Oracles for Secure Computation with Identifiable Abort.
IACR Cryptol. ePrint Arch.
Mark Simkin, Luisa Siniscalchi, Sophia Yakoubov
2021 A* conf
Optimal Oblivious Priority Queues.
SODA
Zahra Jafargholi, Kasper Green Larsen, Mark Simkin
2021 J jnl
Property-Preserving Hash Functions from Standard Assumptions.
CoRR
Nils Fleischhacker, Kasper Green Larsen, Mark Simkin
2021 J jnl
Property-Preserving Hash Functions from Standard Assumptions.
IACR Cryptol. ePrint Arch.
Nils Fleischhacker, Kasper Green Larsen, Mark Simkin
2021 — conf
Robust Property-Preserving Hash Functions for Hamming Distance and More.
EUROCRYPT (3)
Nils Fleischhacker, Mark Simkin
2021 — conf
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free.
EUROCRYPT (2)
Gianluca Brian, Antonio Faonio, Maciej Obremski, João Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi
2020 — conf
Black-Box Transformations from Passive to Covert Security with Public Verifiability.
CRYPTO (2)
Ivan Damgård, Claudio Orlandi, Mark Simkin
2020 J jnl
Black-Box Transformations from Passive to Covert Security with Public Verifiability.
IACR Cryptol. ePrint Arch.
Ivan Damgård, Claudio Orlandi, Mark Simkin
2020 J jnl
Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors.
IACR Cryptol. ePrint Arch.
Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi
2020 — conf
Lower Bounds for Leakage-Resilient Secret Sharing.
EUROCRYPT (1)
Jesper Buus Nielsen, Mark Simkin
2020 — conf
Lower Bounds for Multi-server Oblivious RAMs.
TCC (1)
Kasper Green Larsen, Mark Simkin, Kevin Yeo
2020 J jnl
Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model.
IACR Cryptol. ePrint Arch.
Gianluca Brian, Antonio Faonio, Maciej Obremski, Mark Simkin, Daniele Venturi
2020 — conf
Non-malleable Secret Sharing Against Bounded Joint-Tampering Attacks in the Plain Model.
CRYPTO (3)
Gianluca Brian, Antonio Faonio, Maciej Obremski, Mark Simkin, Daniele Venturi
2020 J jnl
Robust Property-Preserving Hash Functions for Hamming Distance and More.
IACR Cryptol. ePrint Arch.
Nils Fleischhacker, Mark Simkin
2020 Misc conf
Secret Sharing Lower Bound: Either Reconstruction is Hard or Shares are Long.
SCN
Kasper Green Larsen, Mark Simkin
2020 J jnl
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free.
IACR Cryptol. ePrint Arch.
Gianluca Brian, Antonio Faonio, Maciej Obremski, João Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi
2020 J jnl
Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory.
IACR Cryptol. ePrint Arch.
Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi
2020 A conf
Use Your Brain! Arithmetic 3PC for Any Modulus with Active Security.
ITC
Hendrik Eerikson, Marcel Keller, Claudio Orlandi, Pille Pullonen, Joonas Puura, Mark Simkin
2019 J jnl
Continuously non-malleable codes with split-state refresh.
Theor. Comput. Sci.
Antonio Faonio, Jesper Buus Nielsen, Mark Simkin, Daniele Venturi
2019 J jnl
Exponential Lower Bounds for Secret Sharing.
IACR Cryptol. ePrint Arch.
Kasper Green Larsen, Mark Simkin
2019 J jnl
Lower Bounds for Leakage-Resilient Secret Sharing.
IACR Cryptol. ePrint Arch.
Jesper Buus Nielsen, Mark Simkin
2019 J jnl
Lower Bounds for Multi-Server Oblivious RAMs.
IACR Cryptol. ePrint Arch.
Kasper Green Larsen, Mark Simkin, Kevin Yeo
2019 J jnl
Optimal Oblivious Priority Queues and Offline Oblivious RAM.
IACR Cryptol. ePrint Arch.
Zahra Jafargholi, Kasper Green Larsen, Mark Simkin
2019 — conf
Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead.
ASIACRYPT (2)
Michael A. Raskin, Mark Simkin
2019 — conf
Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures.
CRYPTO (2)
Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, Mark Simkin
2019 — conf
The Communication Complexity of Threshold Private Set Intersection.
CRYPTO (2)
Satrajit Ghosh, Mark Simkin
2019 J jnl
The Communication Complexity of Threshold Private Set Intersection.
IACR Cryptol. ePrint Arch.
Satrajit Ghosh, Mark Simkin
2019 J jnl
Use your Brain! Arithmetic 3PC For Any Modulus with Active Security.
IACR Cryptol. ePrint Arch.
Hendrik Eerikson, Claudio Orlandi, Pille Pullonen, Joonas Puura, Mark Simkin
2018 — conf
Compact Zero-Knowledge Proofs of Small Hamming Weight.
Public Key Cryptography (2)
Ivan Damgård, Ji Luo, Sabine Oechsner, Peter Scholl, Mark Simkin
2018 J jnl
Continuously Non-Malleable Codes with Split-State Refresh.
IACR Cryptol. ePrint Arch.
Antonio Faonio, Jesper Buus Nielsen, Mark Simkin, Daniele Venturi
2018 B conf
Continuously Non-malleable Codes with Split-State Refresh.
ACNS
Antonio Faonio, Jesper Buus Nielsen, Mark Simkin, Daniele Venturi
2018 J jnl
Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys.
IET Inf. Secur.
Nils Fleischhacker, Johannes Krupp, Giulio Malavolta, Jonas Schneider, Dominique Schröder, Mark Simkin
2018 J jnl
Functional Credentials.
Proc. Priv. Enhancing Technol.
Dominic Deuber, Matteo Maffei, Giulio Malavolta, Max Rabkin, Dominique Schröder, Mark Simkin
2018 J jnl
Oblivious RAM with Small Storage Overhead.
IACR Cryptol. ePrint Arch.
Michael A. Raskin, Mark Simkin
2018 J jnl
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures.
IACR Cryptol. ePrint Arch.
Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, Mark Simkin
2018 — conf
Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings.
CRYPTO (2)
Ivan Damgård, Claudio Orlandi, Mark Simkin
2017 J jnl
Compact Zero-Knowledge Proofs of Small Hamming Weight.
IACR Cryptol. ePrint Arch.
Ivan Damgård, Ji Luo, Sabine Oechsner, Peter Scholl, Mark Simkin
2017 J jnl
Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings.
IACR Cryptol. ePrint Arch.
Ivan Damgård, Claudio Orlandi, Mark Simkin
2016 — conf
Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys.
Public Key Cryptography (1)
Nils Fleischhacker, Johannes Krupp, Giulio Malavolta, Jonas Schneider, Dominique Schröder, Mark Simkin
2016 — conf
Nearly Optimal Verifiable Data Streaming.
Public Key Cryptography (1)
Johannes Krupp, Dominique Schröder, Mark Simkin, Dario Fiore, Giuseppe Ateniese, Stefan Nürnberger
2015 J jnl
Efficient Unlinkable Sanitizable Signatures from Signatures with Rerandomizable Keys.
IACR Cryptol. ePrint Arch.
Nils Fleischhacker, Johannes Krupp, Giulio Malavolta, Jonas Schneider, Dominique Schröder, Mark Simkin
2015 J jnl
Nearly Optimal Verifiable Data Streaming (Full Version).
IACR Cryptol. ePrint Arch.
Johannes Krupp, Dominique Schröder, Mark Simkin, Dario Fiore, Giuseppe Ateniese, Stefan Nürnberger
2015 — conf
VeriStream - A Framework for Verifiable Data Streaming.
Financial Cryptography
Dominique Schröder, Mark Simkin
2014 A* conf
POSTER: Enhancing Security and Privacy with Google Glass.
CCS
Johannes Krupp, Dominique Schröder, Mark Simkin
2014 — conf
Ubic: Bridging the Gap between Digital Cryptography and the Physical World.
ESORICS (1)
Mark Simkin, Dominique Schröder, Andreas Bulling, Mario Fritz
2014 J jnl
Ubic: Bridging the gap between digital cryptography and the physical world.
CoRR
Mark Simkin, Andreas Bulling, Mario Fritz, Dominique Schröder
2014 B conf
WebTrust - A Comprehensive Authenticity and Integrity Framework for HTTP.
ACNS
Michael Backes, Rainer W. Gerling, Sebastian Gerling, Stefan Nürnberger, Dominique Schröder, Mark Simkin