Daniel Masny
Daniel Masny
Visa Research
Verified email at visa.com
Title
Cited by
Cited by
Year
On the hardness of learning with rounding over small modulus
A Bogdanov, S Guo, D Masny, S Richelson, A Rosen
Theory of Cryptography Conference, 209-224, 2016
872016
Optimal security proofs for signatures from identification schemes
E Kiltz, D Masny, J Pan
Annual International Cryptology Conference, 33-61, 2016
472016
Man-in-the-middle secure authentication schemes from LPN and weak PRFs
V Lyubashevsky, D Masny
Annual Cryptology Conference, 308-325, 2013
452013
Simple chosen-ciphertext security from low-noise LPN
E Kiltz, D Masny, K Pietrzak
International Workshop on Public Key Cryptography, 1-18, 2014
432014
New constructions of identity-based and key-dependent message secure encryption schemes
N Döttling, S Garg, M Hajiabadi, D Masny
IACR International Workshop on Public Key Cryptography, 3-31, 2018
362018
Towards sound fresh re-keying with hard (physical) learning problems
S Dziembowski, S Faust, G Herold, A Journault, D Masny, FX Standaert
Annual International Cryptology Conference, 272-301, 2016
242016
Block cipher based security for severely resource-constrained implantable medical devices
C Beck, D Masny, W Geiselmann, G Bretthauer
Proceedings of the 4th International Symposium on Applied Sciences in …, 2011
232011
On the round complexity of OT extension
S Garg, M Mahmoody, D Masny, I Meckler
Annual International Cryptology Conference, 545-574, 2018
102018
Two-round oblivious transfer from CDH or LPN
N Döttling, S Garg, M Hajiabadi, D Masny, D Wichs
Annual International Conference on the Theory and Applications of …, 2020
92020
Chosen-ciphertext security from subset sum
S Faust, D Masny, D Venturi
Public-Key Cryptography–PKC 2016, 35-46, 2016
72016
Endemic oblivious transfer
D Mansy, P Rindal
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019
42019
Leakage-resilient cryptography over large finite fields: Theory and practice
M Andrychowicz, D Masny, E Persichetti
International conference on applied cryptography and network security, 655-674, 2015
42015
Schnorr signatures in the multi-user setting
E Kiltz, D Masny, J Pan
Cryptology ePrint Archive Report 2015/1122, 2015
32015
Secure Multi-Party Computation from Strongly Uniform Key Agreement.
D Friolo, D Masny, D Venturi
IACR Cryptol. ePrint Arch. 2018, 473, 2018
22018
Naor–Yung paradigm with shared randomness and applications
S Biagioni, D Masny, D Venturi
Theoretical Computer Science 692, 90-113, 2017
22017
Reusable Two-Round MPC from DDH
J Bartusek, S Garg, D Masny, P Mukherjee
IACR Cryptology ePrint Archive 2020, 2020
12020
Fast oblivious transfers
DSW Masny, PB Rindal
US Patent App. 16/434,338, 2020
2020
A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
D Friolo, D Masny, D Venturi
Theory of Cryptography Conference, 111-130, 2019
2019
Authentication from Weak PRFs with Hidden Auxiliary Input.
D Masny
IACR Cryptol. ePrint Arch. 2017, 834, 2017
2017
Cryptography from hard learning problems
D Masny
2016
The system can't perform the operation now. Try again later.
Articles 1–20