Mark Simkin
Mark Simkin
Researcher at Ethereum Foundation
Verified email at - Homepage
Cited by
Cited by
Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures
D Aggarwal, I Damgård, JB Nielsen, M Obremski, E Purwanto, J Ribeiro, ...
Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology …, 2019
Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys
N Fleischhacker, J Krupp, G Malavolta, J Schneider, D Schröder, ...
Public-Key Cryptography–PKC 2016: 19th IACR International Conference on …, 2016
The communication complexity of threshold private set intersection
S Ghosh, M Simkin
Annual International Cryptology Conference, 3-29, 2019
Yet another compiler for active security or: Efficient MPC over arbitrary rings
I Damgård, C Orlandi, M Simkin
Annual International Cryptology Conference, 799-829, 2018
Nearly optimal verifiable data streaming
J Krupp, D Schröder, M Simkin, D Fiore, G Ateniese, S Nürnberger
Public-Key Cryptography–PKC 2016: 19th IACR International Conference on …, 2016
Use your brain! Arithmetic 3PC for any modulus with active security
H Eerikson, M Keller, C Orlandi, P Pullonen, J Puura, M Simkin
Cryptology ePrint Archive, 2019
VeriStream–a framework for verifiable data streaming
D Schöder, M Simkin
Financial Cryptography and Data Security: 19th International Conference, FC …, 2015
Lower bounds for leakage-resilient secret sharing
JB Nielsen, M Simkin
Annual International Conference on the Theory and Applications of …, 2020
Caulk: Lookup arguments in sublinear time
A Zapico, V Buterin, D Khovratovich, M Maller, A Nitulescu, M Simkin
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications …, 2022
Continuously non-malleable codes with split-state refresh
A Faonio, JB Nielsen, M Simkin, D Venturi
Theoretical Computer Science 759, 98-132, 2019
Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
G Brian, A Faonio, M Obremski, M Simkin, D Venturi
Annual International Cryptology Conference, 127-155, 2020
Lower bounds for multi-server oblivious RAMs
KG Larsen, M Simkin, K Yeo
Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC …, 2020
Multiparty computation with covert security and public verifiability
P Scholl, M Simkin, L Siniscalchi
Cryptology ePrint Archive, 2021
Black-box transformations from passive to covert security with public verifiability
I Damgård, C Orlandi, M Simkin
Advances in Cryptology–CRYPTO 2020: 40th Annual International Cryptology …, 2020
Compact zero-knowledge proofs of small hamming weight
I Damgård, J Luo, S Oechsner, P Scholl, M Simkin
Public-Key Cryptography–PKC 2018: 21st IACR International Conference on …, 2018
Optimal Oblivious Priority Queues and Offline Oblivious RAM.
Z Jafargholi, KG Larsen, M Simkin
IACR Cryptol. ePrint Arch. 2019, 237, 2019
Webtrust–a comprehensive authenticity and integrity framework for HTTP
M Backes, RW Gerling, S Gerling, S Nürnberger, D Schröder, M Simkin
Applied Cryptography and Network Security: 12th International Conference …, 2014
Squirrel: efficient synchronized multi-signatures from lattices
N Fleischhacker, M Simkin, Z Zhang
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications …, 2022
Functional Credentials.
D Deuber, M Maffei, G Malavolta, M Rabkin, D Schröder, M Simkin
Proc. Priv. Enhancing Technol. 2018 (2), 64-84, 2018
Ubic: Bridging the gap between digital cryptography and the physical world
M Simkin, D Schröder, A Bulling, M Fritz
Computer Security-ESORICS 2014: 19th European Symposium on Research in …, 2014
The system can't perform the operation now. Try again later.
Articles 1–20