Obserwuj
Mark Simkin
Mark Simkin
Researcher at Ethereum Foundation
Zweryfikowany adres z ethereum.org - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
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
622016
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
582019
Yet another compiler for active security or: Efficient MPC over arbitrary rings
I Damgård, C Orlandi, M Simkin
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
412018
The communication complexity of threshold private set intersection
S Ghosh, M Simkin
Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology …, 2019
322019
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
312016
VeriStream–a framework for verifiable data streaming
D Schöder, M Simkin
Financial Cryptography and Data Security: 19th International Conference, FC …, 2015
312015
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
Lower bounds for leakage-resilient secret sharing
JB Nielsen, M Simkin
Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference …, 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
212019
Lower bounds for multi-server oblivious RAMs
KG Larsen, M Simkin, K Yeo
Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC …, 2020
172020
Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
G Brian, A Faonio, M Obremski, M Simkin, D Venturi
Advances in Cryptology–CRYPTO 2020: 40th Annual International Cryptology …, 2020
152020
Optimal Oblivious Priority Queues and Offline Oblivious RAM.
Z Jafargholi, KG Larsen, M Simkin
IACR Cryptol. ePrint Arch. 2019, 237, 2019
15*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
152014
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
122020
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
112018
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
112014
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
102022
Multiparty computation with covert security and public verifiability
P Scholl, M Simkin, L Siniscalchi
Cryptology ePrint Archive, 2021
102021
Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead
M Raskin, M Simkin
International Conference on the Theory and Application of Cryptology and …, 2019
8*2019
Property-preserving hash functions for hamming distance from standard assumptions
N Fleischhacker, KG Larsen, M Simkin
Advances in Cryptology–EUROCRYPT 2022: 41st Annual International Conference …, 2022
52022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20