I am currently a postdoc at UC Berkeley in the group of Sanjam Garg. I am working on the design of cryptographic primitives based on problems from coding theory or lattices. I am also interested in generic transformations and black box separations.
I received my PhD in 2016 from Ruhr-Universität Bochum under the supervision of Eike Kiltz on "Cryptography from Hard Learning Problems". I received a Diploma in computer science in 2012 from Karlsruhe Institute of Technology.
In my free time I enjoy outdoor activities such as hiking, climbing, but I also like cooking and I am active in my church community.
- "Towards sound fresh re-keying with hard (physical) learning problems"; S. Dziembowski, S. Faust, G. Herold, A Journault, D. Masny, F.X. Standaert; appeared at Crypto 2016 (pdf)
- "Optimal security proofs for signatures from identification schemes"; E. Kiltz, D. Masny, J. Pan; appeared at Crypto 2016 (pdf)
- "On the hardness of learning with rounding over small modulus"; A. Bogdanov, S. Guo, D. Masny, S. Richelson, A. Rosen; appeared at TCC 2016A (pdf)
- "Simple chosen-ciphertext security from low-noise LPN"; E. Kiltz, D. Masny, K. Pietrzak; appeared at PKC 2014 (pdf)
- "Man-in-the-middle secure authentication schemes from LPN and weak PRFs"; V. Lyubashevsky, D. Masny; appeared at Crypto 2013 (pdf)
Service in the Cryptographic Community
I have served as reviewer at Eurocrypt 2018, Asiacrypt 2017, TCC 2017, FOCS 2017, Crypto 2017, Eurocrypt 2017, PKC 2017, Mycrypt 2016, TCC 2016-B, ACNS 2016, Crypto 2016, Eurocrypt 2016, CCS 2015, Crypto 2015, PKC 2015, TCC 2014.
You can contact me by mail via daniel dot masny at berkeley dot edu or daniel dot masny at rub dot de.