Mark Simkin
Mark Simkin
Verified email at - Homepage
Cited by
Cited by
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
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
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
VeriStream–a framework for verifiable data streaming
D Schöder, M Simkin
International conference on financial cryptography and data security, 548-566, 2015
Nearly optimal verifiable data streaming
J Krupp, D Schröder, M Simkin, D Fiore, G Ateniese, S Nuernberger
Public-Key Cryptography–PKC 2016, 417-445, 2016
Use your brain! arithmetic 3pc for any modulus with active security
H Eerikson, M Keller, C Orlandi, P Pullonen, J Puura, M Simkin
1st Conference on Information-Theoretic Cryptography (ITC 2020), 2020
Continuously non-malleable codes with split-state refresh
A Faonio, JB Nielsen, M Simkin, D Venturi
Theoretical Computer Science 759, 98-132, 2019
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
Lower bounds for leakage-resilient secret sharing
JB Nielsen, M Simkin
Annual International Conference on the Theory and Applications of …, 2020
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
The communication complexity of threshold private set intersection
S Ghosh, M Simkin
Annual International Cryptology Conference, 3-29, 2019
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
Optimal Oblivious Priority Queues and Offline Oblivious RAM.
Z Jafargholi, KG Larsen, M Simkin
IACR Cryptol. ePrint Arch. 2019, 237, 2019
Lower bounds for multi-server oblivious rams
KG Larsen, M Simkin, K Yeo
Theory of Cryptography Conference, 486-503, 2020
Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead
M Raskin, M Simkin
International Conference on the Theory and Application of Cryptology and …, 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
Nearly Optimal Verifiable Data Streaming (Full Version).
J Krupp, D Schröder, M Simkin, D Fiore, G Ateniese, S Nürnberger
IACR Cryptol. ePrint Arch. 2015, 333, 2015
Functional credentials
D Deuber, M Maffei, G Malavolta, M Rabkin, D Schröder, M Simkin
Proceedings on Privacy Enhancing Technologies 2018 (2), 64-84, 2018
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
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
The system can't perform the operation now. Try again later.
Articles 1–20