Follow
Mark Simkin
Mark Simkin
Researcher at Ethereum Foundation
Verified email at ethereum.org - Homepage
Title
Cited by
Cited by
Year
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, 301-330, 2016
552016
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, ...
Annual International Cryptology Conference, 510-539, 2019
542019
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
402018
VeriStream–a framework for verifiable data streaming
D Schöder, M Simkin
International conference on financial cryptography and data security, 548-566, 2015
302015
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
282019
Nearly optimal verifiable data streaming
J Krupp, D Schröder, M Simkin, D Fiore, G Ateniese, S Nürnberger
Public-Key Cryptography–PKC 2016, 417-445, 2016
262016
The communication complexity of threshold private set intersection
S Ghosh, M Simkin
Annual International Cryptology Conference, 3-29, 2019
252019
Lower bounds for leakage-resilient secret sharing
JB Nielsen, M Simkin
Annual International Conference on the Theory and Applications of …, 2020
242020
Continuously non-malleable codes with split-state refresh
A Faonio, JB Nielsen, M Simkin, D Venturi
Theoretical Computer Science 759, 98-132, 2019
182019
Lower bounds for multi-server oblivious rams
KG Larsen, M Simkin, K Yeo
Theory of Cryptography Conference, 486-503, 2020
142020
Optimal Oblivious Priority Queues and Offline Oblivious RAM.
Z Jafargholi, KG Larsen, M Simkin
IACR Cryptol. ePrint Arch. 2019, 237, 2019
12*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
112020
Compact zero-knowledge proofs of small hamming weight
I Damgård, J Luo, S Oechsner, P Scholl, M Simkin
IACR International Workshop on Public Key Cryptography, 530-560, 2018
112018
Webtrust–a comprehensive authenticity and integrity framework for HTTP
M Backes, RW Gerling, S Gerling, S Nürnberger, D Schröder, M Simkin
International Conference on Applied Cryptography and Network Security, 401-418, 2014
112014
Black-box transformations from passive to covert security with public verifiability
I Damgård, C Orlandi, M Simkin
Annual International Cryptology Conference, 647-676, 2020
102020
Ubic: Bridging the gap between digital cryptography and the physical world
M Simkin, D Schröder, A Bulling, M Fritz
European Symposium on Research in Computer Security, 56-75, 2014
102014
Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead
M Raskin, M Simkin
International Conference on the Theory and Application of Cryptology and …, 2019
9*2019
Multiparty computation with covert security and public verifiability
P Scholl, M Simkin, L Siniscalchi
Cryptology ePrint Archive, 2021
72021
Robust property-preserving hash functions for hamming distance and more
N Fleischhacker, M Simkin
Annual International Conference on the Theory and Applications of …, 2021
52021
Secret sharing lower bound: Either reconstruction is hard or shares are long
KG Larsen, M Simkin
International conference on security and cryptography for networks, 566-578, 2020
4*2020
The system can't perform the operation now. Try again later.
Articles 1–20