Mark Simkin

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 81

Top Topics

Top Venues

IACR Cryptol. ePrint Arch.

Publications

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