Daniel Masny
Staff Research Scientist
System Security
Research Areas: Cryptography, Theoretical Computer Science
Daniel Masny is a research scientist in the cryptography team. He joined Visa Research in 2018 after a post doctoral position at UC Berkeley. He received his PhD in Computer Science in 2016 from Ruhr University Bochum. He completed his diploma in computer science at Karlsruhe Institute of Technology in 2012.
His research is focused on constructing cryptographic primitives and protocols as well as analyzing efficiency limitations of cryptography. He made significant contributions in post quantum cryptography and oblivious transfer, which is a basic building block for secure multi party computation. His works has been published at top tier conferences in cryptography and security and he is actively contributing in conference program committees.
- D. Friolo, D. Masny and D. Venturi. A black box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement. Theory of Cryptography Conference 2019.
- D. Masny and P. Rindal. Endemic Oblivious Transfer. Conference on Computer and Communications Security 2019.
- S. Garg, M. Mahmoody, D. Masny and I. Meckler. On the round complexity of OT extension. Crypto 2018.
- N. Döttling, S. Garg, M. Hajiabadi and D. Masny. New Constructions of identity-based and key dependent message secure encryption schemes. Practice and Theory of Public-Key Cryptography 2018.
- S. Biagioni, D. Masny and D.Venturi. Naor-Yung paradigm with shared randomness and applications. SCN 2016.
- S. Dziembowski, S. Faust, G. Herold, A. Journault, D. Masny and F.X. Standaert. Towards sound fresh re-keying with hard (physical) learning problems. Crypto 2016.
- E. Kiltz, D. Masny and J. Pan. Optimal security proofs for signatures from identification schemes. Crypto 2016.
- A. Bogdanov, S. Guo, D. Masny, S. Richelson and A. Rosen. On the hardness of learning with rounding over small modulus. Theory of Cryptography Conference 2016.
- S. Faust, D. Masny and D. Venturi. Chosen-ciphertext security from subset sum. Practice and Theory of Public-Key Cryptography 2016.
- M. Andrychowicz, D. Masny and E. Persichetti. Leakage-resilient cryptography over large finite fields: theory and practice. International Conference on Applied Cryptography and Network Security 2015.
- E. Kiltz, D. Masny and K. Pietrzak. Simple chosen-ciphertext security from low-noise LPN. Practice and Theory of Public-Key Cryptography 2014.
- V. Lyubashevsky and D. Masny. Man-in-the-middle secure authentication schemes from LPN and weak prfs. Crypto 2013.